The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1986 vol.8)
pp: 520-524
Lawrence O'Gorman , AT&T Bell Laboratories, Murray Hill, NJ 07974.
Arthur C. Sanderson , The Robotics Institute and the Department of Electrical and Computer Engineering, Carnegie-Mellon University, Pittsburgh, PA 15213.
ABSTRACT
In [1], the converging squares algorithm was introduced as a method designed to effectively and efficiently locate peaks in data of two dimensions or higher. In this correspondence, the performance of the algorithm on a signal in noise is examined, and some extensions of the algorithm-beyond peak-picking-are introduced. The minimum-area enclosing square is one extension, which locates an image region in a uniform background, and finds the smallest square which entirely encloses it. The maximum-difference enclosing square is another extension by which a global feature of the image is found which separates it into a foreground square region and background region, based on the maximum statistical difference between the two. Some applications of these extensions are shown, including object location, tracking of a moving object, and adaptive binarization.
CITATION
Lawrence O'Gorman, Arthur C. Sanderson, "Some Extensions of the Converging Squares Algorithm for Image Feature Analysis", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.8, no. 4, pp. 520-524, April 1986, doi:10.1109/TPAMI.1986.4767816
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool