CHF 80.00

Handbook of Robust Low-Rank and Sparse Matrix Decomposition
Applications in Image and Video Processing

English · Paperback / Softback

Shipping usually within 1 to 3 weeks

Description

Read more










This handbook provides a complete overview of the concepts, theories, algorithms, and applications related to robust low-rank and sparse matrix decompositions. It offers a framework for computer vision applications, including image processing and video surveillance, and describes many methods and algorithms to tackle different formulation proble


About the author










Thierry Bouwmans is an associate professor at the University of La Rochelle. He is the author of more than 30 papers on background modeling and foreground detection and is the creator and administrator of the Background Subtraction website and DLAM website. He has also served as a reviewer for numerous international conferences and journals. His research interests focus on the detection of moving objects in challenging environments.

Necdet Serhat Aybat is an assistant professor in the Department of Industrial and Manufacturing Engineering at Pennsylvania State University. He received his PhD in operations research from Columbia University. His research focuses on developing fast first-order algorithms for large-scale convex optimization problems from diverse application areas, such as compressed sensing, matrix completion, convex regression, and distributed optimization.

El-hadi Zahzah is an associate professor at the University of La Rochelle. He is the author of more than 60 papers on fuzzy logic, expert systems, image analysis, spatio-temporal modeling, and background modeling and foreground detection. His research interests focus on the spatio-temporal relations and detection of moving objects in challenging environments.


Summary

This handbook provides a complete overview of the concepts, theories, algorithms, and applications related to robust low-rank and sparse matrix decompositions. It offers a framework for computer vision applications, including image processing and video surveillance, and describes many methods and algorithms to tackle different formulation proble

Product details

Assisted by Thierry Bouwmans (Editor), Necdet Serhat Aybat (Editor), El-Hadi Zahzah (Editor), Bouwmans Thierry (Editor), Aybat Necdet Serhat (Editor), Zahzah El-hadi (Editor)
Authors Thierry Aybat Bouwmans
Publisher Taylor & Francis Ltd.
 
Content Book
Product form Paperback / Softback
Publication date 30.04.2021
Subject Natural sciences, medicine, IT, technology > Technology > Heat, energy and power station engineering
Guides
 
EAN 9780367574789
ISBN 978-0-367-57478-9
Pages 552
 
Subjects machine learning, MATHEMATICS / Applied, TECHNOLOGY & ENGINEERING / Automation, TECHNOLOGY & ENGINEERING / Imaging Systems, COMPUTERS / Machine Theory, MATHEMATICS / Combinatorics, COMPUTERS / Optical Data Processing, Computer Vision, DMD, PCP, ADM, Image and Video Processing, VB, Combinatorics & graph theory, Mathematical theory of computation, Applied mathematics, Imaging systems & technology, Image processing, Automatic control engineering, COMPUTERS / Data Science / Machine Learning, Combinatorics and graph theory, Imaging systems and technology, compressive sensing, Data Set, Background Modeling, PPA, Background Subtraction, sparse matrices, Nuclear Norm, Low Rank Component, Recovery Accuracy, Robust Matrix Completion, Robust Subspace learning, Subspace Tracking, Sparse Matrix Decomposition, Proximal Gradient Algorithm, Low Rank Structure, low-rank matrix, Robust principal component analysis, Robust PCA, Foreground Detection, Background/Foreground Separation, Low Rank Representation, Robust Subspace Tracking, Frank Wolfe Method, ADMM Algorithm, Foreground Separation, RPCA, Low Rank Matrix, Sparse Components
 

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.