Weighted and robust learning of subspace representations

Authors:
Danijel Skočaj;Aleš Leonardis;Horst Bischof
Affiliations:
University of Ljubljana, Faculty of Computer and Information Science, Traška 25, SI-1001 Ljubljana, Slovenia;University of Ljubljana, Faculty of Computer and Information Science, Traška 25, SI-1001 Ljubljana, Slovenia;Institute for Computer Graphics and Vision, Graz University of Technology, Austria
Venue:
Pattern Recognition
Year:
2007

Citing 15
Cited 7

Detectability, Uniqueness, and Reliability of Eigen Windows for Stable Verification of Partially Occluded Objects

IEEE Transactions on Pattern Analysis and Machine Intelligence
EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation

International Journal of Computer Vision
Coarse-to-fine adaptive masks for appearance matching of occluded scenes

Machine Vision and Applications
EM algorithms for PCA and SPCA

NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Evidence accumulation in cell populations responsive to faces: an account of generalisation of recognition without mental transformations

Object recognition in man, monkey, and machine
Robust recognition using eigenimages

Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
Factorization with Uncertainty

International Journal of Computer Vision
Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust Factorization

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Framework for Robust Subspace Learning

International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Dynamic Appearance-Based Recognition

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A Framework for Modeling the Appearance of 3D Articulated Figures

FG '00 Proceedings of the Fourth IEEE International Conference on Automatic Face and Gesture Recognition 2000
Weighted and Robust Incremental Method for Subspace Learning

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Efficient Calculation of Primary Images from a Set of Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust principal component analysis by self-organizing rules based on statistical physics approach

IEEE Transactions on Neural Networks

Principal component analysis based on non-parametric maximum entropy

Neurocomputing
Supervised relevance maps for increasing the distinctiveness of facial images

Pattern Recognition
Weighted principal component extraction with genetic algorithms

Applied Soft Computing
Background modeling by subspace learning on spatio-temporal patches

Pattern Recognition Letters
A priori-driven PCA

ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2
A survey of appearance models in visual object tracking

ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
Robust visual tracking via incremental low-rank features learning

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A reliable system for visual learning and recognition should enable a selective treatment of individual parts of input data and should successfully deal with noise and occlusions. These requirements are not satisfactorily met when visual learning is approached by appearance-based modeling of objects and scenes using the traditional PCA approach. In this paper we extend standard PCA approach to overcome these shortcomings. We first present a weighted version of PCA, which, unlike the standard approach, considers individual pixels and images selectively, depending on the corresponding weights. Then we propose a robust PCA method for obtaining a consistent subspace representation in the presence of outlying pixels in the training images. The method is based on the EM algorithm for estimation of principal subspaces in the presence of missing data. We demonstrate the efficiency of the proposed methods in a number of experiments.