This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Pyramid-Based Approach to Segmentation Applied to Region Matching
May 1986 (vol. 8 no. 5)
pp. 639-650
William I. Grosky, Department of Computer Science, Wayne State University, Detroit, MI 48202.
Ramesh Jain, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109.
In this paper, we attempt to place segmentation schemes utilizing the pyramid architecture on a firm footing. We show that there are some images which cannot be segmented in principle. An efficient segmentation scheme is also developed using pyramid relinking. This scheme will normally have a time complexity which is a sublinear function of the image diameter, which compares favorably to other schemes. The efficacy of our approach to segmentation using pyramid schemes is demonstrated in the context of region matching. The global features we use are compared to those used in previous approaches and this comparison will indicate that our approach is more robust than the standard moment-based techniques.
Citation:
William I. Grosky, Ramesh Jain, "A Pyramid-Based Approach to Segmentation Applied to Region Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, no. 5, pp. 639-650, May 1986, doi:10.1109/TPAMI.1986.4767837
Usage of this product signifies your acceptance of the Terms of Use.