Automatic Multi-categorical Objects Recognition Using Shape Statistical Models

Leibe B, Leonardis A, and Schiele B. Robust object detectionwith interleaved categorization and segmentation [J].International Journal of Computer Vision Special Issue onLearning for Recognition and Recognition for Learning, 2008,77(1): 259-289.[2]Felzenszwalb P F and Schwartz J D. Hierarchical matching ofdeformable shapes [C]. Proceedings of IEEE Conference onComputer Vision and Pattern Recognition, Minnesota, USA,2007: 1-8.[3]Zhang X Q, Guo M M, and Tang Y. A new geometric featureshape descriptor [J]. Computer Engineering and Applications,2007, 43(29): 90-92.[4]Fergus R, Perona P, and Zisserman A. Weakly supervisedscale-invariant learning of models for visual recognition [J].International Journal of Computer Vision.2007, 71(3):273-303[5]Opelt A, Pinz A, and Zisserman A. Incremental learning ofobject detectors using a visual shape alphabet [C].Proceedings of IEEE Conference on Computer Vision andPattern Recognition, New York, USA, 2006: 3-10.[6]Shotton J, Blake A, and Cipolla R. Multi-scale categoricalobject recognition using contour fragments [J].IEEETransactions on Pattern Analysis and Machine Intelligence.2008, 30(7):1270-1281[7]Mahamud S, Williams L R, Thornber K, and Xu K.Segmentation of multiple salient closed contours from realimages [J].IEEE Transactions on Pattern Analysis andMachine Intelligence.2003, 25(4):433-444[8]Kumar S. Models for learning spatial interactions in naturalimages for context-based classification [D]. [Ph.D.dissertation], The Robotics Institute, Carnegie MellonUniversity, 2005.[9]Wu Tao, Ding Xiao-qing, and Wang Sheng-jin. Videotracking using improved chamfer matching and particle filter[C]. Proceedings of IEEE Conference on ComputationalIntelligence and Multimedia Applications, Sivakasi, TamilNadu, 2007: 169-173.Maitre H, Kyrgyzov I, and Campedel M. Kernel mdl todetermine the number of clusters [C]. Proceedings of IEEEConference on Machine Learning and Data Mining in PatternRecognition, Leipzig, Germany, 2007: 203-217.[10]Hofmann T. Unsupervised learning by probabilistic latentsemantic analysis [J].Machine Learning.2001, 42(2):177-196[11]Dempster A, Laird N, and Rubin D. Maximum likelihoodform incomplete data via the EM algorithm [J]. Journal of theRoyal Statistical Scotiety, 1977, 39(1): 1-38.[12]Lempitsky V, Rother C, and Blake A. LogCut-efficient graphcut optimization for markov random fields [C]. Proceedings ofIEEE Conference on Computer Vision, Rio de Janeiro, Brazil,2007: 1-8.