Abstract
A pyramid-based method of dynamic thresholding where the Gaussian pyramid is used to support a “coarse-to-fine” search strategy is presented. At the top level of the pyramid the image is divided into four subimages, and in each subimage, the gray-level variance is analyzed to find whether there is an edge. The hierarchical search is continued until the bottom level of the pyramid, or the original image, is reached. At the bottom level the threshold values of those subimages where an edge is present are estimated, and the value of zero is assigned to those subimages where no edge is present. Finally, by using interpolations of subimage and pixel threshold values, the dynamic threshold values are found.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burt PJ (1984) The pyramid as an efficient computational structure. In: Multiresolution Image Processing and Analysis (Ed. A Rosenfeld). Springer-Verlag, New York
Burt PJ, Adelson EH (1983) The Laplacian pyramid as a compact image code. IEEE Transactions on Communications, 31(4)(April): 532–540
Meer P, Baugher ES, Rosenfeld A (1987) Frequency domain analysis and synthesis of image pyramid generating kernel. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-9(4)(July): 512–522
Song S, Qin J, Liao M (1986) Dynamic thresholding: A new method. Microcomputer, (4): 87–88 (Chinese version)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Song, S., Liao, M. & Qin, J. Multiresolution image dynamic thresholding. Machine Vis. Apps. 3, 13–16 (1990). https://doi.org/10.1007/BF01211448
Issue Date:
DOI: https://doi.org/10.1007/BF01211448