2008
DOI: 10.1007/978-3-540-88690-7_52
|View full text |Cite
|
Sign up to set email alerts
|

Kernel Codebooks for Scene Categorization

Abstract: You will be contacted as soon as possible.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
300
1
2

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 447 publications
(307 citation statements)
references
References 22 publications
2
300
1
2
Order By: Relevance
“…Moreover, in K-means clustering the centers are almost exclusively around the denser regions in high dimensional feature space and thus fail to decode other informative regions. For the above mentioned reasons, some other proposed approaches recommend the use of RAdius-Based Clustering (RABC) to generate discrete visual codebook [11,18]. RABC sequentially seeks to detect new clusters by finding local maxima of the density and clustering all data points within a fixed radius r. Thereby, the clusters centroid represents the local maximum density and all clustered points are assigned to the new cluster.…”
Section: Related Work and Backgroundmentioning
confidence: 99%
“…Moreover, in K-means clustering the centers are almost exclusively around the denser regions in high dimensional feature space and thus fail to decode other informative regions. For the above mentioned reasons, some other proposed approaches recommend the use of RAdius-Based Clustering (RABC) to generate discrete visual codebook [11,18]. RABC sequentially seeks to detect new clusters by finding local maxima of the density and clustering all data points within a fixed radius r. Thereby, the clusters centroid represents the local maximum density and all clustered points are assigned to the new cluster.…”
Section: Related Work and Backgroundmentioning
confidence: 99%
“…Spatial pyramids [8] was a major breakthrough in this direction; it incorporates spatial information by computing BoW representations for different image regions at different scales and concatenating these representations and finally uses a pyramid matching kernel [19] for classification. Almost everything in the book -from kernels [4][5][6][7] to sparsity [20] to local codes [6] has been attempted to enhance the power of these low level representations [21].…”
Section: Beyond Bag Of Wordsmentioning
confidence: 99%
“…Over the years, much research has gone into improving the performance of models that employ BoW representations. Non-linear SVMs, specialized kernels of different kinds [4][5][6][7], and spatial pyramids [8] have all contributed to the success of these representations. Most of these approaches tend to increase the overall image representation size.…”
Section: Introductionmentioning
confidence: 99%
“…The descriptors with reduced dimensionality are clustered with k-means to learn codewords [5]. The soft assignment scheme in [10] is then exploited to generate a histogram for each image as its representation. Finally, the two distance functions are applied to the histograms to build kernels.…”
Section: Pascal Voc2007mentioning
confidence: 99%