ROTATING-KERNEL MIN-MAX ALGORITHMS FOR STRAIGHT-LINE FEATURE ENHANCEMENT

Authors
Citation
Yk. Lee et Wt. Rhodes, ROTATING-KERNEL MIN-MAX ALGORITHMS FOR STRAIGHT-LINE FEATURE ENHANCEMENT, Applied optics, 34(2), 1995, pp. 290-298
Citations number
14
Categorie Soggetti
Optics
Journal title
ISSN journal
00036935
Volume
34
Issue
2
Year of publication
1995
Pages
290 - 298
Database
ISI
SICI code
0003-6935(1995)34:2<290:RMAFSF>2.0.ZU;2-V
Abstract
The rotating-kernel min-max transformation is a nonlinear image-proces sing operation that can be applied to the enhancement of directional f eatures in noisy images. Associated with a particular transformation a re (a) a convolution kernel and (b) a function that maps to a final ou tput value the maximum and minimum values measured at point (x, y) in the convolution output as the kernel rotates through 360 degrees. Freq uently used kernels are narrow in one direction and broad in the other , typically with rectangular, triangular, or Gaussian profiles in the long direction. Simple but effective functional mappings include I-out (x, y) = [Max(x, y) - Min(x, y)] and I-out(x, y) = [1 - [Min(x, y)/Max (x ,y)](m)]. Improved results are often obtained if successive rotatin g-kernel min-max transformation operations are performed in cascaded s ystems. Two binarization procedures based on the rotating-kernel min-m ax transformation can be used to extract straight-line features from n oisy gray-scale images. The effects on the processed image of kernel t ype and size, mapping function, and binarization scheme are discussed.