Issue No. 04 - April (1992 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.126808
<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>
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
J. Ullmann, "Analysis of 2-D Occlusion by Subtracting Out," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 485-489, 1992.