BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Robust Subspace Estimation Using Low-Rank Optimization: Theory and Applications (The International Series in Video Computing, 12)

Robust Subspace Estimation Using Low-Rank Optimization: Theory and Applications (The International Series in Video Computing, 12)

Robust Subspace Estimation Using Low-Rank Optimization: Theory and Applications
Stock photo: cover may vary

Robust Subspace Estimation Using Low-Rank Optimization: Theory and Applications (The International Series in Video Computing, 12) Hardback - 2014

by Oreifej, Omar

Add to wish list
  • Used
  • Good
  • Hardback
Used - Good

Description

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$121.21
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Robust Subspace Estimation Using Low-Rank Optimization: Theory and Applications (The International Series in Video Computing, 12)

From the publisher

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.

tracking-