This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of 2-D Occlusion by Subtracting Out
April 1992 (vol. 14 no. 4)
pp. 485-489

A provably correct polynomial-time algorithm for complete systematic analysis of occlusion in synthetically generated noise-free pictures of 2-D objects is introduced. The algorithm first recognizes occluding objects and then ignores the mismatch with pixels in occluding objects while recognizing occluded objects by template matching.

[1] N. Ayache and O. D. Faugeras, "HYPER: A new approach for the recognition and positioning of two-dimensional objects,"IEEE Trans. Patt. Anal. Machine Intell., vol. 8, no. 1, pp. 44-54, 1986.
[2] B. Bhanu and O.D. Faugeras, "Shape matching of two-dimensional objects,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-6, no. 2, pp. 137-156, Mar. 1984.
[3] R. C. Bolles and R. A. Cain, "Recognising and locating partially visible objects: The local-feature-focus method,"Int. J. Robotics Res., vol. 1, no. 3, pp. 57-82, Fall 1982.
[4] M. C. Cooper, "Efficient sytematic analysis of occlusion,"Patt. Recogn. Lett., vol. 7, no. 4, pp. 259-264, Apr. 1988.
[5] W. E. L. Grimson and T. Lozano-Perez, "Localizing overlapping parts by searching the interpretation tree,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, no. 4, July 1987.
[6] M. W. Koch and R. L. Kashyap, "Using polygons to recognize and locate partially occluded objects,"IEEE Trans. Patt. Anal. Machine Intell., vol. PAMI-9, no. 4, pp. 483-494, July 1987.
[7] J. R. Ullmann, "An investigation of occlusion in one dimension,"Comput. Vision Graphics Image Processing, vol. 22, pp. 194-203, 1983.
[8] J. R. Ullmann, "Aspects of visual automation," inPhysical and Biological Processing of Images(O. J. Braddick and A. C. Sleigh, Eds.). Berlin: Springer-Verlag, 1983, pp. 15-32.
[9] J. R. Ullmann, "A generalised Hough technique for edge-replacement in occlusion analysis," Tech. Rep. 91/105, Dept. Comput., King's College, London, UK.

Index Terms:
computer vision; 2-D occlusion; subtracting out; polynomial-time algorithm; complete systematic analysis; synthetically generated noise-free pictures; 2-D objects; occluded objects; template matching; computational complexity; computer vision
Citation:
J.R. Ullmann, "Analysis of 2-D Occlusion by Subtracting Out," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 14, no. 4, pp. 485-489, April 1992, doi:10.1109/34.126808
Usage of this product signifies your acceptance of the Terms of Use.