The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1992 vol.14)
pp: 485-489
ABSTRACT
<p>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.</p>
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 & Machine Intelligence, vol.14, no. 4, pp. 485-489, April 1992, doi:10.1109/34.126808
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool