Skoči na glavni sadržaj

Izvorni znanstveni članak

Robust Recovery of Eigenimages in the Presence of Outliers and Occlusions

Aleš Leonardis ; Department for Pattern Recognition and Image Processing, Technical University Vienna, Vienna, Austria and Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, Slovenia
Horst Bischof ; Department for Pattern Recognition and Image Processing, Technical University Vienna, Vienna, Austria


Puni tekst: engleski pdf 5.903 Kb

str. 25-38

preuzimanja: 134

citiraj


Sažetak

The basic limitations of the current appearance-based matching methods using eigenimages are non-robust estimation of coefficients and inability to cope with problems related to occlusions and segmentation. In this paper we present a new approach which successfully solves these problems. The major novelty o f our approach lies in the way how the coefficients of the eigenimages are determined. Instead of computing the coefficients by a projection of the data onto the eigenimages, we extract them by a hypothesize-and-test paradigm using subsets of image points. Compeling hypotheses are then subject to a selection procedure based on the Minimum Description Length principle. The approach enables us not only to reject outliers and to deal with occlusions but also to simultaneously use multiple classes of eigenimages.

Ključne riječi

appearance-based matching; principal component analysis; robust estimation. occlusion; discrete optimization

Hrčak ID:

150304

URI

https://hrcak.srce.hr/150304

Datum izdavanja:

30.3.1996.

Posjeta: 418 *