Proceedings Ninth IEEE International Conference on Computer Vision 2003
DOI: 10.1109/iccv.2003.1238351
|View full text |Cite
|
Sign up to set email alerts
|

Recognition with local features: the kernel recipe

Abstract: Recent developments in computer vision

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
219
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 265 publications
(223 citation statements)
references
References 22 publications
0
219
0
Order By: Relevance
“…For their simplicity and satisfactory performance, bag-of-features representations have become widely used for image classification and retrieval [18][19][20]. The basic idea is to select a collection of representative patches of the image, compute a visual descriptor for each patch, and use the resulting distribution of descriptors to characterize the whole image.…”
Section: Image Description By Low-level Featuresmentioning
confidence: 99%
“…For their simplicity and satisfactory performance, bag-of-features representations have become widely used for image classification and retrieval [18][19][20]. The basic idea is to select a collection of representative patches of the image, compute a visual descriptor for each patch, and use the resulting distribution of descriptors to characterize the whole image.…”
Section: Image Description By Low-level Featuresmentioning
confidence: 99%
“…Match kernels between sets of local features have long been exploited [27,26]. The kernel function is computed to measure the similarity between two images/video sequences represented by sets of local feature vectors.…”
Section: Match Kernelsmentioning
confidence: 99%
“…Match kernels between sets of local features have long been exploited in visual recognition [26,27]. Without relying on any mid-level feature representations, match kernels are able to compute the similarity between sets of unordered local features and have shown the effectiveness in image and object recognition.…”
Section: Introductionmentioning
confidence: 99%
“…By introducing a Mercer kernel, a non-linear SVM can be constructed replacing the scalar products in the linear SVM via the kernel function. SVMs have demonstrated remarkable performance on object recognition and categorization [13] and biomedical imaging [14]. As probabilistic method we chose Spin GlassMarkov Random Fields (SG-MRF, [2]), a fully connected MRF which integrates results of statistical mechanics with Gibbs probability distributions via non linear kernel mapping [2].…”
Section: Introductionmentioning
confidence: 99%