nips nips2005 nips2005-11 nips2005-11-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Long Zhu, Alan L. Yuille
Abstract: We describe a hierarchical compositional system for detecting deformable objects in images. Objects are represented by graphical models. The algorithm uses a hierarchical tree where the root of the tree corresponds to the full object and lower-level elements of the tree correspond to simpler features. The algorithm proceeds by passing simple messages up and down the tree. The method works rapidly, in under a second, on 320 × 240 images. We demonstrate the approach on detecting cats, horses, and hands. The method works in the presence of background clutter and occlusions. Our approach is contrasted with more traditional methods such as dynamic programming and belief propagation. 1
[1] Viola, P. and Jones, M. (2001). ”Fast and Robust Classification using Asymmetric AdaBoost and a Detector Cascade”. In Proceedings NIPS01.
[2] Schniederman, H. and Kanade, T. (2000). ”A Statistical method for 3D object detection applied to faces and cars”. In Computer Vision and Pattern Recognition.
[3] Chen, X. and Yuille, A.L. (2004). AdaBoost Learning for Detecting and Reading Text in City Scenes. Proceedings CVPR.
[4] Lowe, D.G. (1999). “Object recognition from local scale-invariant features.” In Proc. International Conference on Computer Vision ICCV. Corfu, pages 1150-1157.
[5] Coughlan, J.M., Snow, D., English, C. and Yuille, A.L. (2000). “Efficient Deformable Template Detection and Localization without User Initialization”. Computer Vision and Image Understanding. 78, pp 303-319.
[6] Felzenswalb, P. (2005). “Representation and Detection of Deformable Shapes”. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, No. 2.
[7] Coughlan, J.M., and Ferreira, S. (2002). “Finding Deformable Shapes using Loopy Belief Propoagation”. In Proceedings European Conference of Computer Vision.. 2002.
[8] Coughlan, J.M., and Shen, H. (2004). “Shape Matching with Belief Propagation: Using Dynamic Quantization to Accomodate Occlusion and Clutter”. In GMBV .
[9] Geman, S. Potter, D. and Chi, Z. (2002). “ Composition systems”. Quarterly of Applied Mathematics, LX, pp 707-736.
[10] Fergus, R., Perona, P. and Zisserman, A. (2003) “Object Class Recognition by Unsupervised Scale-Invariant Learning”. Proceeding CVPR. (2), pp 264-271.
[11] Thayananthan, A. Stenger, B., Torr, P. and Cipolla, R. (2003). ”Shape context and chamfer matching in cluttered scenes,” In Proc. Conf. Comp. Vision Pattern Rec., pp. 127–133.
[12] Berg, A.C., Berg, T.L., and Malik, J. (2005). “Shape Matching and Object Recognition using Low Distortion Correspondence”. Proceedings CVPR.
[13] Tu, Z., Chen, X., Yuille, A.L., and Zhu, S.C. (2003). “Image Parsing: Unifying Segmentation, Detection, and Recognition”. In Proceedings ICCV.
[14] Wainwright, M.J., Jaakkola, T.S., and Willsky., A.S. “Tree-Based Reparamterization Framework for Analysis of Sum-Product and Related Algorithms”. IEEE Transactions on Information Theory. Vol. 49, pp 1120-1146. No. 5. 2003.
[15] Chui,H. and Rangarajan, A., A New Algorithm for Non-Rigid Point Matching. In Proceedings CVPR 2000.