Mixtures of probabilistic principal component analyzers
Neural Computation
Independent component analysis: algorithms and applications
Neural Networks
From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational Framework for Segmentation and Grouping
Computational Framework for Segmentation and Grouping
Journal of Global Optimization
Lambertian Reflectance and Linear Subspaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Evaluation and Selection of Models for Motion Segmentation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
A Tensor Decomposition for Geometric Grouping and Segmentation
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Generalized Principal Component Analysis (GPCA)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
SIAM Journal on Computing
Higher order learning with graphs
ICML '06 Proceedings of the 23rd international conference on Machine learning
On d-dimensional d-semimetrics and simplex-type inequalities for high-dimensional sine functions
Journal of Approximation Theory
Clustering appearances of objects under varying illumination conditions
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Multi-way clustering using super-symmetric non-negative tensor factorization
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV
On d-dimensional d-semimetrics and simplex-type inequalities for high-dimensional sine functions
Journal of Approximation Theory
Enhanced Local Subspace Affinity for feature-based motion segmentation
Pattern Recognition
A polynomial characterization of hypergraphs using the Ihara zeta function
Pattern Recognition
Local and structural consistency for multi-manifold clustering
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Hybrid Linear Modeling via Local Best-Fit Flats
International Journal of Computer Vision
Random walk distances in data clustering and applications
Advances in Data Analysis and Classification
Motion segmentation by velocity clustering with estimation of subspace dimension
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2
Editor's Choice Article: Motion-based segmentation of objects using overlapping temporal windows
Image and Vision Computing
Greedy feature selection for subspace clustering
The Journal of Machine Learning Research
Subspace clustering of high-dimensional data: a predictive approach
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
This paper presents novel techniques for improving the performance of a multi-way spectral clustering framework (Govindu in Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), vol. 1, pp. 1150---1157, 2005; Chen and Lerman, 2007, preprint in the supplementary webpage) for segmenting affine subspaces. Specifically, it suggests an iterative sampling procedure to improve the uniform sampling strategy, an automatic scheme of inferring the tuning parameter from the data, a precise initialization procedure for K-means, as well as a simple strategy for isolating outliers. The resulting algorithm, Spectral Curvature Clustering (SCC), requires only linear storage and takes linear running time in the size of the data. It is supported by theory which both justifies its successful performance and guides our practical choices. We compare it with other existing methods on a few artificial instances of affine subspaces. Application of the algorithm to several real-world problems is also discussed.