Procedings of the British Machine Vision Conference 2012 2012
DOI: 10.5244/c.26.45
|View full text |Cite
|
Sign up to set email alerts
|

Prime Shapes in Natural Images

Abstract: This paper provides evidence that about half of all the regions in segmented images can be classified as one a few simple shapes. Using three segmentation algorithms, three different image databases, and two shape descriptors, we empirically show that shapes such as triangles, squares, and circles are observed, up to an affine transform and at a much higher rate than random shapes. This result has potential value in applications such as scene understanding, visual object classification, and matching because qu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
5
2

Relationship

6
1

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 36 publications
0
10
0
Order By: Relevance
“…Shrivista et al [33] show that an exemplar SVM trained on a huge database is capable of classification of both photographs and artwork. A less computationally intensive approach has been proposed [34] using a hierarchical graph model to obtain a coarse-to-fine arrangement of parts with nodes labelled by qualitative shape [35]. Wu et al [36] address the cross-depiction problem using a deformable model; they use a fully connected graph with learned weights on nodes (the importance of nodes to discriminative classification), on edges (by analogy, the stiffness of a spring connecting parts), and multiple node labels (to account to different depictions); a method tested on 50 categories.…”
Section: Related Literaturementioning
confidence: 99%
“…Shrivista et al [33] show that an exemplar SVM trained on a huge database is capable of classification of both photographs and artwork. A less computationally intensive approach has been proposed [34] using a hierarchical graph model to obtain a coarse-to-fine arrangement of parts with nodes labelled by qualitative shape [35]. Wu et al [36] address the cross-depiction problem using a deformable model; they use a fully connected graph with learned weights on nodes (the importance of nodes to discriminative classification), on edges (by analogy, the stiffness of a spring connecting parts), and multiple node labels (to account to different depictions); a method tested on 50 categories.…”
Section: Related Literaturementioning
confidence: 99%
“…However, rather than using complicated shapes for regions (as others do), or just using (a hierarchy of) Gaussian blobs [18], we use a collection of simple shapes (e.g. circle, square, triangle) [25]. The idea is that abstracting region shape into one of a few classes brings greater robustness to non-salient variations.…”
Section: Related Workmentioning
confidence: 99%
“…The shape-class prior, p(S) is taken to be the relative number of shapes classified as shape S. All parameters used are provided by the shape classifier after training on about 40000 regions [25]. Figure 3 illustrates the shape classes we use, and the shape classes used to label nodes at each level of a hierarchy.…”
Section: Learn One Model For Each Visual Object Classmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the particular set of shapes used were presumed to be useful by the algorithm designers, and finding the optimal qualitative shape for any given object part is expensive and not straight forward. Recent work has solved both of these problems [19]. Impressive results have been obtained for matching similar images of different depictions based on learning [14].…”
Section: Introductionmentioning
confidence: 99%