Efficient algorithms for subwindow search in object detection and localization

2009 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009

Volumn , Issue , 2009, Pages 264-271

  An, Senjian ^a   Peursum, Patrick ^a   Liu, Wanquan ^a   Venkatesh, Svetha ^a  

^a CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER VISION; OBJECT DETECTION; OBJECT RECOGNITION;

APPROXIMATE ALGORITHMS; CONFIDENCE LEVELS; LARGE AMOUNTS; LINEAR TIME; OBJECT DETECTION AND LOCALIZATIONS; OPTIMAL SOLUTIONS; SLIDING WINDOW SEARCHES; WORST-CASE COMPLEXITY;

BRANCH AND BOUND METHOD;

EID: 70450176405     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2009.5206822     Document Type: Conference Paper

References (17)

1. J. Bentley. Programming pearls: algorithm design techniques. Commun. ACM, 27(9):865-873, 1984.
2. J. Bentley. Programming pearls: perspective on performance. Commun. ACM, 27(11):1087-1092, 1984.
3. M. B. Blaschko and C. H. Lampert. Learning to localize objects with structured output regression. In Proceedings of ECCV, 2008.
4. A. Bosch, A. Zisserman, and X. Munoz. Representing shape with a spatial pyramid kernel. In Proceedings of the 6th ACM international Conference on image and video retrieval, pages 401-408, 2007.
5. O. Chum and A. Zisserman. An exemplar model for learning object classes. In Proceedings of CVPR, 2007.
6. N. Dalal and B. Triggs. Histograms of oriented gradients for human detection. In Proceedings of CVPR, 2005.
7. M. Everingham, A. Zisserman, C. K. I. Williams, and L. Van Gool. The PASCAL Visual Object Classes Challenge 2006 (VOC2006) Results. http://www.pascalnetwork.org/challenges/VOC/voc2006/results.pdf.
8. V. Ferrari, L. Fevrier, F. Jurie, and C. Schmid. Groups of adjacent contour segments for object detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, 30(1):36-51, 2008.
9. M. Fritz and B. Schiele. Decomposition, discovery and detection of visual caregories using topic models. In Proceedings of CVPR, 2008.
10. L. D. G. Distinctive image features from scale-invariant keypoints. IJCV, 60(2):91-110, 2004.
11. C. H. Lampert and M. B. Blaschko. Beyond sliding windows: Object localization by efficient subwindow search. In Proceedings of CVPR, 2008.
12. H. Rowley, S. Baluja, and T. Kanade. Human face detection in visual scene. In Advances in Neural Information Processing Systems (NIPS96), pages 875-881, 1996.
13. L. S., C. Schmid, and J. Ponce. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In Proceedings of CVPR, 2006.
14. T. Takaoka. A new upper bound on the complexity of the all pairs shortest paths probelm. Inform. Process. Lett., 43(4):195-199, 1992.
15. T. Takaoka. Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In Proc. CATS 2002, ENTCS, volume 61, pages 191-200, 2002.
16. H. Tamaki and T. Tokuyama. Algorithms for the maximum subarray problem based on matrix multiplication. In Proc. SODA 1998, 1998.
17. P. Viola and M. Jones. Rapid object detection using a boosted cascade of simple features. In Proceedings CVPR, 2001.