25 February 2014 Fibonacci thresholding: signal representation and morphological filters
Author Affiliations +
A new weighted thresholding concept is presented, which is used for the set-theoretical representation of signals, the producing new signals containing a large number of key features that are in the original signals and the design new morphological filters. Such representation maps many operations of non binary signal and image processing to the union of the simple operations over the binary signals and images. The weighted thresholding is invariant under the morphological transformations, including the basic ones, erosion and dilation. The main idea of using the weighted thresholding is in the choice of the special level of thresholding on which we can concentrate all our attention for the future processing. Together with arithmetical thresholding the so-called Fibonacci levels are chosen because of many interesting properties; one of them is the effective decomposition of the median filter. Experimental results show that the Fibonacci thresholding is much promised and can be used for many applications, including the image enhancement, segmentation, and edge detection.
© (2014) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Artyom M. Grigoryan, Artyom M. Grigoryan, Sos S. Agaian, Sos S. Agaian, "Fibonacci thresholding: signal representation and morphological filters", Proc. SPIE 9019, Image Processing: Algorithms and Systems XII, 90190T (25 February 2014); doi: 10.1117/12.2038278; https://doi.org/10.1117/12.2038278


Method of arithmetical thresholding of images
Proceedings of SPIE (May 27 2004)
Multilayer Boolean and stack filter design
Proceedings of SPIE (April 30 1994)
Rank order filtering on bit-serial mesh-connected computers
Proceedings of SPIE (October 07 1996)
Morphological bounds on order-statistics filters
Proceedings of SPIE (June 22 1993)
Gray-scale morphology for small object detection
Proceedings of SPIE (May 30 1996)

Back to Top