Optimal small kernels for edge detection

Stephen E. Reichenbach, Stephen K. Park, Rachel Alter-Gartenberg

Research output: Contribution to journalConference articlepeer-review

8 Scopus citations


An algorithm is developed for defining small kernels that are conditioned on the important components of the imaging process: the nature of the scene, the point-spread function of the image-gathering device, sampling effects, noise, and post-filter interpolation. Subject to constraints on the spatial support of the kernel, the algorithm generates the kernal values that minimize the expected mean-square error of the estimate of the scene characteristic. This development is consistent with the derivation of the spatially unconstrained Wiener characteristic filter, but leads to a small, spatially constrained convolution kernel. Simulation experiments demonstrate that the algorithm is more flexible than traditional small-kernel techniques and yields more accurate estimates.

Original languageEnglish (US)
Pages (from-to)57-63
Number of pages7
JournalProceedings - International Conference on Pattern Recognition
StatePublished - 1990
EventProceedings of the 10th International Conference on Pattern Recognition - Atlantic City, NJ, USA
Duration: Jun 16 1990Jun 21 1990

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Optimal small kernels for edge detection'. Together they form a unique fingerprint.

Cite this