Robust Subspace Estimation Using Low-Rank Optimization

Theory and Applications

By: Omar Oreifej, Mubarak Shah

Write A Review

eText | 24 March 2014

At a Glance

Format
ePUB

eText

$84.99

or 4 interest-free payments of $21.25 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

Various fundamental applications in computer vision and machine learning require finding the basis of a certain subspace. Examples of such applications include face detection, motion estimation, and activity recognition. An increasing interest has been recently placed on this area as a result of significant advances in the mathematics of matrix rank optimization. Interestingly, robust subspace estimation can be posed as a low-rank optimization problem, which can be solved efficiently using techniques such as the method of Augmented Lagrange Multiplier. In this book, the authors discuss fundamental formulations and extensions for low-rank optimization-based subspace estimation and representation. By minimizing the rank of the matrix containing observations drawn from images, the authors demonstrate how to solve four fundamental computer vision problems, including video denosing, background subtraction, motion estimation, and activity recognition.