Multiscale Geometric and Spectral Analysis of Plane Arrangements
Abstract
Modeling data by multiple low-dimensional planes is an important problem in many applications such as computer vision and pattern recognition. In the most general setting where only coordinates of the data are given, the problem asks to determine the optimal model parameters (i.e., number of planes and their dimensions), estimate the model planes, and cluster the data accordingly. Though many algorithms have been proposed, most of them need to assume prior knowledge of the model parameters and thus address only the last two components of the problem. In this paper we propose an efficient algorithm based on multiscale SVD analysis and spectral methods to tackle the problem in full generality. We also demonstrate its state-of-the-art performance on both synthetic and real data.
Cite
Text
Chen and Maggioni. "Multiscale Geometric and Spectral Analysis of Plane Arrangements." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011. doi:10.1109/CVPR.2011.5995666Markdown
[Chen and Maggioni. "Multiscale Geometric and Spectral Analysis of Plane Arrangements." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011.](https://mlanthology.org/cvpr/2011/chen2011cvpr-multiscale/) doi:10.1109/CVPR.2011.5995666BibTeX
@inproceedings{chen2011cvpr-multiscale,
title = {{Multiscale Geometric and Spectral Analysis of Plane Arrangements}},
author = {Chen, Guangliang and Maggioni, Mauro},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2011},
pages = {2825-2832},
doi = {10.1109/CVPR.2011.5995666},
url = {https://mlanthology.org/cvpr/2011/chen2011cvpr-multiscale/}
}