@conference {14841,
	title = {3-D to 2-D recognition with regions},
	booktitle = {Computer Vision and Pattern Recognition, 1997. Proceedings., 1997 IEEE Computer Society Conference on},
	year = {1997},
	month = {1997/06//},
	pages = {547 - 553},
	abstract = {This paper presents a novel approach to parts-based object recognition in the presence of occlusion. We focus on the problem of determining the pose of a 3-D object from a single 2-D image when convex parts of the object have been matched to corresponding regions in the image. We consider three types of occlusions: self-occlusion, occlusions whose locus is identified in the image, and completely arbitrary occlusions. We derive efficient algorithms for the first two cases, and characterize their performance. For the last case, we prove that the problem of finding valid poses is computationally hard, but provide an efficient, approximate algorithm. This work generalizes our previous work on region-based object recognition, which focused on the case of planar models},
	keywords = {2-D, algorithms;object, complexity;image, hard;efficient, image;3-D, object;computationally, poses;computational, recognition;, recognition;occlusion;occlusions;performance;regions;valid, segmentation;object},
	doi = {10.1109/CVPR.1997.609379},
	author = {Jacobs, David W. and Basri,R.}
}
@conference {14835,
	title = {Model group indexing for recognition},
	booktitle = {Computer Vision and Pattern Recognition, 1991. Proceedings CVPR {\textquoteright}91., IEEE Computer Society Conference on},
	year = {1991},
	month = {1991/06//},
	pages = {4 - 9},
	abstract = {It is shown that an index space can be a powerful tool for reducing the image-model match search by a factor of <e1>k</e1><sup>G-3 </sup>, but only when accompanied by some mechanism, such as grouping, that prevents the system from having to consider all matches between image groups of size G and model groups of size <e1>G</e1>. It is also shown that if image groups are to index a single point at recognition time, then the index space must contain pointers to each model group over a 2-D sheet, and should therefore be 2<e1>G</e1>-4 dimensional. A simple indexing system has been implemented to demonstrate these concepts, and a series of experiments have been conducted to investigate the tradeoffs between space and time. They indicate that the speedups are achievable, but require a large amount of space},
	keywords = {2-D, dimensional;image, group, groups;image-model, indexing;pattern, lookup;, match, pattern, recognition;data, recognition;pointers;computer, search;index, sheet;2G-4, space;indexing, structures;table, system;model, vision;computerised},
	doi = {10.1109/CVPR.1991.139652},
	author = {Clemens,D. T and Jacobs, David W.}
}
