Improving Recognition through Object Sub-categorization
Al Mansur,Yoshinori Kuno +1 more
- 01 Dec 2008
- pp 851-859
TL;DR: A method to improve the recognition rate of Bayesian classifiers by splitting the training data and using separate classifier to learn each sub-category, using probabilistic Latent Semantic Analysis (pLSA).
read more
Abstract: We propose a method to improve the recognition rate of Bayesian classifiers by splitting the training data and using separate classifier to learn each sub-category We use probabilistic Latent Semantic Analysis (pLSA) to split the training set automatically into sub-categories This sub-categorization is based on the similarity of training images in terms of object's appearance or background content In some cases, clear separation does not exist in the training set, and splitting results in worse performance We compute the average difference between posteriors from the pLSA model, and observing this parameter, we can decide whether splitting is useful or not This approach has been tested on eight object categories Experimental results validate the benefit of splitting the training set
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures

Fig. 3. Distinctive sub-categorization; row 1: CD-subcategory 1, row 2: CDsubcategory 2, row 3: apple-subcategory 1, row 4: apple-subcategory 2, row 5: motorbike-subcategory 1, row 6: motorbike-subcategory 2, row 7: face-subcategory 1, row 8: face-subcategory 2 
Table 1. Comparison of error rates 
Fig. 1. Object sub-categorization process 
Fig. 4. Non-distinctive sub-categorization; row 1: sunflower-subcategory 1, row 2: sunflower-subcategory 2 
Fig. 2. Classifier for two sub-categories
Citations
Discriminative Sub-categorization
Minh Hoai,Andrew Zisserman +1 more
- 23 Jun 2013
TL;DR: A new model for discriminative sub-categorization which determines cluster membership for positive samples whilst simultaneously learning a max-margin classifier to separate each cluster from the negative samples is introduced.
Extracting Multiple Visual Senses for Web Learning
TL;DR: This paper presents a multimodal framework that solves the problem of polysemy by allowing sense-specific diversity in search results and trains one visual classifier for each selected semantic sense and uses the learned sense- specific classifiers to distinguish multiple visual senses.
57
•Proceedings Article
Discovering and Distinguishing Multiple Visual Senses for Polysemous Words
Yazhou Yao,Jian Zhang,Fumin Shen,Wankou Yang,Pu Huang,Zhenmin Tang +5 more
- 01 Jan 2018
TL;DR: This work presents a novel framework that solves the problem of polysemy by allowing sense-specific diversity in search results by discovering a list of possible semantic senses and training a visual classifier for each selected semantic sense.
34
Exploiting textual and visual features for image categorization
TL;DR: This work forms image selection and classifier learning as a multi-instance learning problem and proposes to solve the employed problem by the cutting-plane algorithm to suppress the search error induced noisy images.
15
•Posted Content
Refining Image Categorization by Exploiting Web Images and General Corpus.
TL;DR: This work exploits general corpus information to automatically select and subsequently classify web images into semantic rich (sub-)categories and formulate image selection and classifier learning as a multi-class multi-instance learning problem and proposes to solve the employed problem by the cutting-plane algorithm.
References
Distinctive Image Features from Scale-Invariant Keypoints
TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
•Proceedings Article
Visual categorization with bags of keypoints
Gabriela Csurka
- 01 Jan 2004
TL;DR: This bag of keypoints method is based on vector quantization of affine invariant descriptors of image patches and shows that it is simple, computationally efficient and intrinsically invariant.
Probabilistic latent semantic indexing
Thomas Hofmann
- 01 Aug 1999
TL;DR: Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data.
4.8K
A Bayesian hierarchical model for learning natural scene categories
Li Fei-Fei,Pietro Perona +1 more
- 20 Jun 2005
TL;DR: This work proposes a novel approach to learn and recognize natural scene categories by representing the image of a scene by a collection of local regions, denoted as codewords obtained by unsupervised learning.
Unsupervised Learning by Probabilistic Latent Semantic Analysis
TL;DR: This paper proposes to make use of a temperature controlled version of the Expectation Maximization algorithm for model fitting, which has shown excellent performance in practice, and results in a more principled approach with a solid foundation in statistical inference.
Related Papers (5)
Zhenyu Guo,Z. Jane Wang +1 more
- 14 Nov 2010
[...]
Lukas Tencer,Marta Reznakova,Mohamed Cheriet +2 more
- 01 Jan 2017