Novel approaches in morphological correlations

David Mendlovic, Amir Shemer, Zeev Zalevsky, Emanuel Marom, Gal Shabtay

Research output: Contribution to journalConference articlepeer-review


Morphological correlation is a novel method for obtaining high discrimination ability in pattern recognition applications. It provides also important abilities for image compression and image analysis. The concept is based on slicing the input image and the reference filter into many binary slices, e.g. 255, and correlating them. The morphological correlation is defined as the summation of these correlations. The morphological correlation is characterized by a sharp correlation peak narrower than that exhibited by matched filter. The disadvantages are the requirements of performing many correlations and its very high sensitivity to noise added to the reference image. In this presentation we suggest two methods to solve both drawbacks. First, instead of 255 correlations we suggest to utilize only 8, by representing the grey level of each pixel by its 8 bit binary representation. Then, 8 binary masks are constructed according to the binary representation. In order to address the problem of severe sensitivity to noise, we suggest to sum the 255 correlations of the morphology slices while each slice is multiplied by a weighting factor which equals the correlation peak of that specific slice with noise divided by its correlation peak value when no noise is added. The solutions suggested here were examined by computer simulations demonstrating considerable improvements in the performance of the morphological correlator.

Original languageEnglish
Pages (from-to)418-424
Number of pages7
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - 1998
Externally publishedYes
EventROMOPTO '97: 5th Conference on Optics - Bucharest, Romania
Duration: 9 Sep 19979 Sep 1997


Dive into the research topics of 'Novel approaches in morphological correlations'. Together they form a unique fingerprint.

Cite this