The dual irregular pyramid
The dual irregular pyramid combines the advantage of adaptivity with a limited computational complexity of neighborhood operations. The levels of the pyramid, dual graphs, are defined only if they are planar. We prove that planarity is conserved during the construction of the pyramid. We also prove that, though only one graph of the pair is decimated, the dual graph being derived from the result of the decimation. both graphs at the next level have at most a non-increasing number of nodes.
KeywordsReceptive Field Dual Graph Related Path Face Reduction Neighborhood Operation
Unable to display preview. Download preview PDF.
- 1.F. Harary. Graph Theory. Addison-Wesley, Reading. Mass., 1972.Google Scholar
- 2.J. M. Jolion and A. Montanvert. The adaptive pyramid. a framework for 2D image analysis. Computer Vision, Graphics, and Image Processing: Image Understanding, 55(3):339–348, May 1992.Google Scholar
- 3.W. G. Kropatsch. Kurvenrepräsentation in Pyramiden. In W. G. Kropatsch and P. Mandl, editors, Mustererkennung'86, OCG-Schriftenreihe, Österr. Arbeitsgruppe für Mustererkennung. pages 16–51. Oldenbourg, 1986. Band 36.Google Scholar
- 4.W. G. Kropatsch and A. Montanvert. Irregular versus regular pyramid structures. In U. Eckhardt, A. Hübler, W. Nagel, and G. Werner, editors, Geometrical Problems of Image Processing, pages 11–22, Georgenthal, Germany, March 1991. Akademie Verlag, Berlin.Google Scholar
- 5.W. G. Kropatsch and D. Willersinn. Representing curves in irregular pyramids. In W. G. Kropatsch and H. Bischof, editors, Pattern Recognition 1992, pages 333–348, Vienna, Austria, May 1992. Oldenbourg.Google Scholar
- 6.P. Meer. Stochastic image pyramids. Computer Vision, Graphics, and Image Processing, Vol. 45(No. 3):pp.269–294, March 1989.Google Scholar
- 7.A. Montanvert and P. Bertolino. Irregular pyramids for parallel image segmentation. In W. G. Kropatsch and H. Bischof, editors, Pattern Recognition 1992, pages 13–34, Vienna, Austria. May 1992. Oldenbourg.Google Scholar