Semi-supervised classification by probabilistic relaxation

Authors:
Adolfo Martínez-Usó;Filiberto Pla;José Martínez Sotoca;Henry Anaya-Sánchez
Affiliations:
Dept. of Computer Languages and Systems, Institute of New Imaging Technologies, Castellón, Spain;Dept. of Computer Languages and Systems, Institute of New Imaging Technologies, Castellón, Spain;Dept. of Computer Languages and Systems, Institute of New Imaging Technologies, Castellón, Spain;Dept. of Computer Languages and Systems, Institute of New Imaging Technologies, Castellón, Spain
Venue:
CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Year:
2011

Citing 9
Cited 0

Vector quantization and signal compression

Vector quantization and signal compression
Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Theoretical Framework for Relaxation Processes in Pattern Recognition: Application to Robust Nonparametric Contour Generalization

IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Relaxation using the Heat Equation

ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
Data spectroscopy: learning mixture models using eigenspaces of convolution operators

Proceedings of the 25th international conference on Machine learning
Semisupervised Multitask Learning

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Semi-supervised Gaussian Mixture Model for Image Segmentation

ICPR '10 Proceedings of the 2010 20th International Conference on Pattern Recognition
Decision Making in Context

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Spatially Constrained Generative Model and an EM Algorithm for Image Segmentation

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a semi-supervised approach based on probabilistic relaxation theory is presented. It combines two desirable properties; firstly, a very small number of labelled samples is needed and, secondly, the assignment of labels is consistently performed according to our contextual information constraints. The proposed technique has been successfully applied to pattern recognition problems, obtaining promising preliminary results in database classification and image segmentation. Our methodology has also been evaluated against a recent state-of-the-art algorithm for semi-supervised learning, obtaining generally comparable or better results.