Automatically finding clusters in normalized cuts
From MaRDI portal
Publication:716368
DOI10.1016/J.PATCOG.2011.01.003zbMATH Open1210.68095OpenAlexW1999201567MaRDI QIDQ716368FDOQ716368
Authors: Mariano Tepper, Pablo Musé, Andrés Almansa, Marta E. Mejail 
Publication date: 28 April 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://hal-imt.archives-ouvertes.fr/hal-00631620/file/clustering-PR2010.pdf
Recommendations
Cites Work
- From Gestalt theory to image analysis. A probabilistic approach.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consistency of spectral clustering
- Model Selection and Multimodel Inference
- The estimation of the gradient of a density function, with applications in pattern recognition
- The minimum description length principle in coding and modeling
- On clusterings: good, bad and spectral
- Worst-case Analysis of Set Union Algorithms
- Graph Clustering and Minimum Cut Trees
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Efficient graph-based image segmentation
- Edge detection by Helmholtz principle
- A unified framework for detecting groups and application to shape recognition
- Image segmentation by a contrario simulation
- Mean shift spectral clustering
Cited In (6)
- Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks
- A review on spectral clustering and stochastic block models
- Automatic aspect discrimination in data clustering
- Iterative ensemble normalized cuts
- Annealing and the normalized \(N\)-cut
- Enhanced balanced min cut
Uses Software
This page was built for publication: Automatically finding clusters in normalized cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716368)
