SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:research.chalmers.se:2e492ebb-bcf9-4765-b58a-60afae0248ab"
 

Search: onr:"swepub:oai:research.chalmers.se:2e492ebb-bcf9-4765-b58a-60afae0248ab" > A Simple Method for...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

A Simple Method for Subspace Estimation with Corrupted Columns

Larsson, Viktor (author)
Lund University,Lunds universitet,Matematik LTH,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Mathematics (Faculty of Engineering),Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH
Olsson, Claes (author)
Lunds universitet,Lund University
Kahl, Fredrik, 1972 (author)
Chalmers University of Technology
show more...
Olsson, Carl (author)
Lund University,Lunds universitet,Matematik LTH,Matematikcentrum,Institutioner vid LTH,Lunds Tekniska Högskola,Mathematics (Faculty of Engineering),Centre for Mathematical Sciences,Departments at LTH,Faculty of Engineering, LTH
show less...
 (creator_code:org_t)
ISBN 9781467383905
2016
2016
English.
In: Proceedings of the IEEE International Conference on Computer Vision. - 1550-5499. - 9781467383905 ; 2016-February, s. 841-849
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • This paper presents a simple and effective way of solving the robust subspace estimation problem where the corruptions are column-wise. The method we present can handle a large class of robust loss functions and is simple to implement. It is based on Iteratively Reweighted Least Squares (IRLS) and works in an iterative manner by solving a weighted least-squares rank-constrained problem in every iteration. By considering the special case of column-wise loss functions, we show that each such surrogate problem admits a closed form solution. Unlike many other approaches to subspace estimation, we make no relaxation of the low-rank constraint and our method is guaranteed to produce a subspace estimate with the correct dimension. Subspace estimation is a core problem for several applications in computer vision. We empirically demonstrate the performance of our method and compare it to several other techniques for subspace estimation. Experimental results are given for both synthetic and real image data including the following applications: linear shape basis estimation, plane fitting and non-rigid structure from motion.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Medicinteknik -- Medicinsk bildbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Medical Engineering -- Medical Image Processing (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)

Keyword

Optimization
Estimation
Closed-form solutions
Robustness
Computer vision
Convergence
Shape
Closed-form solutions
Computer vision
Convergence
Estimation
Optimization
Robustness
Shape

Publication and Content Type

kon (subject category)
ref (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

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.

 
pil uppåt Close

Copy and save the link in order to return to this view