Shape quantization and recognition with randomized trees
Neural Computation
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Machine Learning
Learning to Detect Objects in Images via a Sparse, Part-Based Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Contour-Based Learning for Object Detection
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Recovering Human Body Configurations Using Pairwise Constraints between Parts
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Grouping with Asymmetric Affinities: A Game-Theoretic Perspective
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Dominant Sets and Pairwise Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Object Detection with Interleaved Categorization and Segmentation
International Journal of Computer Vision
Voting by grouping dependent parts
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Regression forests for efficient anatomy detection and localization in CT studies
MCV'10 Proceedings of the 2010 international MICCAI conference on Medical computer vision: recognition techniques and applications in medical imaging
Graph-based quadratic optimization: A fast evolutionary approach
Computer Vision and Image Understanding
Hough Forests for Object Detection, Tracking, and Action Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
A boundary-fragment-model for object detection
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Affinity learning on a tensor product graph with applications to shape and image retrieval
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
| Hi-index | 0.00 |
In this paper we propose a novel, game-theoretic approach for finding multiple instances of an object category as sets of mutually coherent votes in a generalized Hough space. Existing Hough-voting based detection systems have to inherently apply parameter-sensitive non-maxima suppression (NMS) or mode detection techniques for finding object center hypotheses. Moreover, the voting origins contributing to a particular maximum are lost and hence mostly bounding boxes are drawn to indicate the object hypotheses. To overcome these problems, we introduce a two-stage method, applicable on top of any Hough-voting based detection framework. First, we define a Hough environment, where the geometric compatibilities of the voting elements are captured in a pairwise fashion. Then we analyze this environment within a game-theoretic setting, where we model the competition between voting elements as a Darwinian process, driven by their mutual geometric compatibilities. In order to find multiple and possibly overlapping objects, we introduce a new enumeration method inspired by tabu search. As a result, we obtain locations and voting element compositions of each object instance while bypassing the task of NMS. We demonstrate the broad applicability of our method on challenging datasets like the extended TUD pedestrian crossing scene.