NDLI: Minimal Basis Facility Location for Subspace Segmentation

Content Provider	IEEE Xplore Digital Library
Author	Choon-Meng Lee Loong-Fah Cheong
Copyright Year	2013
Description	Author affiliation: ECE Dept., Nat. Univ. of Singapore, Singapore, Singapore (Choon-Meng Lee; Loong-Fah Cheong)
Abstract	In contrast to the current motion segmentation paradigm that assumes independence between the motion subspaces, we approach the motion segmentation problem by seeking the parsimonious basis set that can represent the data. Our formulation explicitly looks for the overlap between subspaces in order to achieve a minimal basis representation. This parsimonious basis set is important for the performance of our model selection scheme because the sharing of basis results in savings of model complexity cost. We propose the use of affinity propagation based method to determine the number of motion. The key lies in the incorporation of a global cost model into the factor graph, serving the role of model complexity. The introduction of this global cost model requires additional message update in the factor graph. We derive an efficient update for the new messages associated with this global cost model. An important step in the use of affinity propagation is the subspace hypotheses generation. We use the row-sparse convex proxy solution as an initialization strategy. We further encourage the selection of subspace hypotheses with shared basis by integrating a discount scheme that lowers the factor graph facility cost based on shared basis. We verified the model selection and classification performance of our proposed method on both the original Hopkins 155 dataset and the more balanced Hopkins 380 dataset.
Sponsorship	IEEE Comput. Soc.
Starting Page	1585
Ending Page	1592
File Size	437974
Page Count	8
File Format	PDF
ISBN	9781479928408
ISSN	15505499
DOI	10.1109/ICCV.2013.200
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-01
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Motion segmentation Computer vision Cost function Message passing Complexity theory Trajectory Sparse matrices joint sparsity model selection motion segmentation subspace segmentation facility location Hopkins 155 minimal basis subspace representation
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation

Robust motion segmentation via refined sparse subspace clustering

Latent Space Sparse Subspace Clustering

Perspective Motion Segmentation via Collaborative Clustering

Structured Sparse Subspace Clustering: A unified optimization framework

Subspace segmentation with a Minimal Squared Frobenius Norm Representation

Robust Subspace Segmentation with Block-Diagonal Prior

Forward Basis Selection for Pursuing Sparse Representations over a Dictionary

Improved subspace clustering via exploitation of spatial constraints

Minimal Basis Facility Location for Subspace Segmentation

Similar Documents

Minimal Basis Subspace Representation: A Unified Framework for Rigid and Non-rigid Motion Segmentation

Robust motion segmentation via refined sparse subspace clustering

Latent Space Sparse Subspace Clustering

Perspective Motion Segmentation via Collaborative Clustering

Structured Sparse Subspace Clustering: A unified optimization framework

Subspace segmentation with a Minimal Squared Frobenius Norm Representation

Robust Subspace Segmentation with Block-Diagonal Prior

Forward Basis Selection for Pursuing Sparse Representations over a Dictionary

Improved subspace clustering via exploitation of spatial constraints

Minimal Basis Facility Location for Subspace Segmentation