Asset Details
Do you wish to reserve the book?
Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation
Do you wish to request the book?
Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation
2017
Overview
Motion segmentation and non-rigid structure from motion are two challenging computer vision problems that have attracted numerous research interests. While the previous works handle these two problems separately, we present a general motion segmentation framework in this paper for solving these two seemingly different problems in a unified manner. At the heart of our general motion segmentation framework is a model selection mechanism based on finding the minimal basis subspace representation, by seeking the joint sparse representation of the data matrix. However, such formulation is NP-hard and we solve the convex proxy instead. Unlike other compressive sensing related works, this convex proxy solution is insufficient for our problem. The convex relaxation artefacts and noise yield multiple subspace representations, making identification of the exact number of motion subspaces challenging. We solve for the right number of subspaces by transforming this problem into a Facility Location problem with global cost and solve the factor graph formulation using max product belief propagation message passing.
Publisher
Springer US,Springer,Springer Nature B.V
