Graph explorer

Making Laplacians commute

In this paper, we construct multimodal spectral geometry by finding a pair of closest commuting operators (CCO) to a given pair of Laplacians. The CCOs are jointly diagonalizable and hence have the same eigenbasis. Our construction naturally extends classical data analysis tools based on spectral geometry, such as diffusion maps and spectral clustering. We provide several synthetic and real examples of applications in dimensionality reduction, shape analysis, and clustering, demonstrating that our method better captures the inherent structure of multi-modal data.

7 nodes7 linksoverview mapMaking Laplacians commute
7 nodes7 links
Making Laplacians commute7 visible / 7 total nodes / 10 links
Related contextCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalWMaking Laplacians commutepreprint / 2013AMichael M. BronsteinResearcherAKlaus GlashoffResearcherATerry A. LoringResearcherTComputer Vision30606 worksTGraphics1417 worksTmath.SP1235 works
PaperSignal 106 links

Making Laplacians commute

preprint / 2013

Open