Robust factorization

Factorization algorithms for recovering structure and motion from an image stream have many advantages, but they usually require a set of well-tracked features. Such a set is in generally not available in practical applications. There is thus a need for making factorization algorithms deal effectively with errors in the tracked features. We propose a new and computationally efficient algorithm for applying an arbitrary errorfunction in the factorization scheme. This algorithm enables the use of robust statistical techniques and arbitrary noise models for the individual features. These techniques and models enable the factorization scheme to deal effectively with mismatched features, missing features, and noise on the individual features. The proposed approach further includes a new method for Euclidean reconstruction that significantly improves convergence of the factorization algorithms. The proposed algorithm has been implemented as a modification of the Christy-Horaud factorization scheme, which yields a perspective reconstruction. Based on this implementation, a considerable increase in error tolerance is demonstrated on real and synthetic data. The proposed scheme can, however, be applied to most other factorization algorithms.

Fisker, R (författare)
Åström, KarlLund University,Lunds universitet,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH(Swepub:lu)math-kas (författare)
Carstensen, JM (författare)
MatematikcentrumInstitutioner vid LTH (creator_code:org_t)

Ingår i:IEEE Transactions on Pattern Analysis and Machine Intelligence24:9, s. 1215-12251939-3539

Av författaren/redakt...: Aanaes, H; Fisker, R; Åström, Karl; Carstensen, JM

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.