Beyond the sum of parts: voting with groups of dependent entities
The high complexity of multi-scale, category-level object detection in cluttered scenes is efficiently handled by Hough voting methods. However, the main shortcoming of the approach is that mutually dependent local observations are independently casting their votes for intrinsically global object pr...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2015
|
| In: |
IEEE transactions on pattern analysis and machine intelligence
Year: 2014, Volume: 37, Issue: 6, Pages: 1134-1147 |
| ISSN: | 1939-3539 |
| DOI: | 10.1109/TPAMI.2014.2363456 |
| Online Access: | Verlag: http://dx.doi.org/10.1109/TPAMI.2014.2363456
|
| Author Notes: | Pradeep Yarlagadda, Björn Ommer |
| Summary: | The high complexity of multi-scale, category-level object detection in cluttered scenes is efficiently handled by Hough voting methods. However, the main shortcoming of the approach is that mutually dependent local observations are independently casting their votes for intrinsically global object properties such as object scale. Object hypotheses are then assumed to be a mere sum of their part votes. Popular representation schemes are, however, based on a dense sampling of semi-local image features, which are consequently mutually dependent. We take advantage of part dependencies and incorporate them into probabilistic Hough voting by deriving an objective function that connects three intimately related problems: i) grouping mutually dependent parts, ii) solving the correspondence problem conjointly for dependent parts, and iii) finding concerted object hypotheses using extended groups rather than based on local observations alone. Early commitments are avoided by not restricting parts to only a single vote for a locally best correspondence and we learn a weighting of parts during training to reflect their differing relevance for an object. Experiments successfully demonstrate the benefit of incorporating part dependencies through grouping into Hough voting. The joint optimization of groupings, correspondences, and votes not only improves the detection accuracy over standard Hough voting and a sliding window baseline, but it also reduces the computational complexity by significantly decreasing the number of candidate hypotheses. |
|---|---|
| Item Description: | Gesehen am 10.07.2020 Date of Publication: 16 October 2014 |
| Physical Description: | Online Resource |
| ISSN: | 1939-3539 |
| DOI: | 10.1109/TPAMI.2014.2363456 |