Facial Expression Analysis on Semantic Neighborhood Preserving Embedding
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
Annotating photo collections by label propagation according to multiple similarity cues
MM '08 Proceedings of the 16th ACM international conference on Multimedia
Graph-based tools for microscopic cellular image segmentation
Pattern Recognition
Locally non-negative linear structure learning for interactive image retrieval
MM '09 Proceedings of the 17th ACM international conference on Multimedia
A multilevel approach for learning from labeled and unlabeled data on graphs
Pattern Recognition
Kernel-based linear neighborhood propagation for semantic video annotation
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Learning a nonlinear distance metric for supervised region-merging image segmentation
Computer Vision and Image Understanding
An improved spectral clustering algorithm based on random walk
Frontiers of Computer Science in China
Semi-supervised ensemble classification in subspaces
Applied Soft Computing
An evaluation on different graphs for semi-supervised learning
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
A regularization framework in polar coordinates for transductive learning in networked data
Information Sciences: an International Journal
Local image tagging via graph regularized joint group sparsity
Pattern Recognition
Towards efficient sparse coding for scalable image annotation
Proceedings of the 21st ACM international conference on Multimedia
Semi-supervised projected model-based clustering
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
In this paper, we address the general problem of learning from both labeled and unlabeled data. Based on the reasonable assumption that the label of each data can be linearly reconstructed from its neighbors' labels, we develop a novel approach, called Linear Neighborhood Propagation (LNP), to learn the linear construction weights and predict the labels of the unlabeled data from the labeled data. The main procedure is composed of two steps: (1) it computes the local neighborhood geometry according to the image information by solving a constrained least squares problem, (2) the obtained geometry will be used to predict the labels of unlabeled data by solving a linearly constrained quadratic optimization problem. LNP has at least three characteristics. Firstly, it is much practical in that only one free parameter, the size of neighborhood, requires user-tuning. Secondly it can be easily extended to out-of-sample examples. Finally the labels achieved from LNP can be sufficiently smooth with respect to the intrinsic structure collectively revealed by the labeled and unlabeled points. Many promising experimental results, such as object recognition, data ranking and interactive image segmentation, demonstrate the effectiveness and efficiency of the proposed approach.