A Novel Locally Linear KNN Model for Visual Recognition
This paper presents a novel locally linear KNN model with the goal of not only developing efficient representation and classification methods, but also establishing a relation between them so as to approximate some classification rules, e.g. the Bayes decision rule. Towards that end, first, the proposed model represents the test sample as a linear combination of all the training samples and derives a new representation by learning the coefficients considering the reconstruction, locality and sparsity constraints. The theoretical analysis shows that the new representation has the grouping effect of the nearest neighbors, which is able to approximate the "ideal representation". And then the locally linear KNN model based classifier (LLKNNC), which shows its connection to the Bayes decision rule for minimum error in the view of kernel density estimation, is proposed for classification. Besides, the locally linear nearest mean classifier (LLNMC), whose relation to the LLKNNC is just like the nearest mean classifier to the KNN classifier, is also derived. Furthermore, to provide reliable kernel density estimation, the shifted power transformation and the coefficients cut-off method are applied to improve the performance of the proposed method. The effectiveness of the proposed model is evaluated on several visual recognition tasks such as face recognition, scene recognition, object recognition and action recognition. The experimental results show that the proposed model is effective and outperforms some other representative popular methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Action RecognitionDensity EstimationFace RecognitionGeneral ClassificationObject RecognitionScene RecognitionTemporal Action LocalizationSimilar Papers 제목 키워드 기반
Generative locally linear embedding: A module for manifold unfolding and visualization
Data often have nonlinear patterns in machine learning. One can unfold the nonlinear manifold of a dataset for low-dimensional visualization and feature extraction. Locally Linear Embedding (LLE) is a nonlinear spectral …
Data VisualizationDimensionality ReductionVariational InferenceSensitivity of sparse codes to image distortions
Sparse coding has been proposed as a theory of visual cortex and as an unsupervised algorithm for learning representations. We show empirically with the MNIST dataset that sparse codes can be very sensitive to image dist…
Object RecognitionSensitivityMore About VLAD: A Leap From Euclidean to Riemannian Manifolds
This paper takes a step forward in image and video coding by extending the well-known Vector of Locally Aggregated Descriptors (VLAD) onto an extensive space of curved Riemannian manifolds. We provide a comprehensive mat…
ClassificationFace RecognitionGeneral ClassificationScene RecognitionRandom Maxout Features
In this paper, we propose and study random maxout features, which are constructed by first projecting the input data onto sets of randomly generated vectors with Gaussian elements, and then outputing the maximum projecti…
Data VisualizationDimensionality ReductionGeneral ClassificationGeneralization BoundsGhost-dil-NetVLAD: A Lightweight Neural Network for Visual Place Recognition
Visual place recognition (VPR) is a challenging task with the unbalance between enormous computational cost and high recognition performance. Thanks to the practical feature extraction ability of the lightweight convolut…
Visual Place Recognition