Hybrid linear modeling via local best-fit flats

DOI10.1007/s11263-012-0535-6zbMath1259.68207arXiv1010.3460OpenAlexW3100720754MaRDI QIDQ1943402

Teng Zhang, Gilad Lerman, Yi Wang, Arthur D. Szlam

Publication date: 20 March 2013

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.3460

zbMATH Keywords

high-dimensional dataspectral clusteringsubspace clusteringmotion segmentationhybrid linear modelingface clusteringlocal PCA

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45)

Related Items (21)

Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data ⋮ An inexact splitting method for the subspace segmentation from incomplete and noisy observations ⋮ Unnamed Item ⋮ Multiscale geometric methods for data sets. I: Multiscale SVD, noise and curvature. ⋮ A geometric analysis of subspace clustering with outliers ⋮ A new approach to two-view motion segmentation using global dimension minimization ⋮ Dimensionality-reduced subspace clustering ⋮ Curve denoising by multiscale singularity detection and geometric shrinkage ⋮ Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization ⋮ \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers ⋮ Spectral clustering in the dynamic stochastic block model ⋮ The equivalence between principal component analysis and nearest flat in the least square sense ⋮ Side-information-induced reweighted sparse subspace clustering ⋮ Robust subspace clustering ⋮ Subspace clustering by \((k,k)\)-sparse matrix factorization ⋮ Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering ⋮ On the existence of optimal unions of subspaces for data modeling and clustering ⋮ The shape of data and probability measures ⋮ Sparse subspace clustering for data with missing entries and high-rank matrix completion ⋮ Subspace clustering of high-dimensional data: a predictive approach ⋮ Self-regularized fixed-rank representation for subspace segmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
• Foundations of a multi-way spectral clustering framework for hybrid linear modeling
• Rectifiable sets and the traveling salesman problem
• Nearest \(q\)-flat to \(m\) points
• \(k\)-plane clustering
• A geometric analysis of subspace clustering with outliers
• Spectral clustering based on local linear approximations
• Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
• Quantifying curvelike structures of measures by usingL2 Jones quantities
• An Algorithm for Finding Intrinsic Dimensionality of Data
• Computer Vision - ECCV 2004

This page was built for publication: Hybrid linear modeling via local best-fit flats