Normalized Cuts and Image Segmentation

Normalized Cuts and Image Segmentation (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jianbo Shi , Jitendra Malik

Venue:	IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
Citations:	1824 - 37 self

BibTeX

@ARTICLE{Shi97normalizedcuts,
    author = {Jianbo Shi and Jitendra Malik},
    title = {Normalized Cuts and Image Segmentation},
    journal = {IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE},
    year = {1997},
    volume = {22},
    pages = {888--905}
}

Bookmark

OpenURL

Abstract

We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We have applied this approach to segmenting static images and found results very encouraging.

Citations

3012	Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images - Geman, Geman - 1984
1753	Dubes, Algorithms for Clustering Data - Jain, C - 1988
1524	Matrix computations - Golub, Loan - 1996
710	Spectral Graph Theory - Chung - 1997
688	Optimal approximations by piecewise smooth functions and associated variational problems - Mumford, Shah - 1989
621	Visual reconstruction - Blake, Zisserman - 1987
437	Partitioning sparse matrices with eigenvectors of graphs - Pothen, Simon, et al. - 1990
258	Preattentive texture discrimination with early vision mechanisms - Malik, Perona - 1990
216	Approximate counting, uniform generation and rapidly mixing Markov chains - Sinclair, Jerrum - 1989
200	An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation - Wu, Leahy - 1993
195	Constructing simple stable descriptions for image partitioning - Leclerc - 1989
187	A property of eigenvectors of non-negative symmetric matrices and its application to graph theory - Fiedler - 1975
159	lower bound for the smallest eigenvalue of the Laplacian - Cheeger, “A - 1970
127	Lower bounds for partitioning of graphs - Donath, Homan - 1973
71	Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors - Sarkar, Boyer - 1996
42	Ratio regions’: A technique for image segmentation - COX, RAO, et al. - 1996
37	An improved spectral bisection algorithm and its application to dynamic load balancing - Driessche, Roose - 1995
15	Laws of organization in perceptual forms (partial translation - Wertheimer
5	ªNormalized Cuts and Image Segmentation,º - Shi, Malik - 1997
4	ªConstructing Simple Stable Descriptions for Image Partitioning,º Int'l - Leclerc - 1989
3	ªQuantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors,º - Sarkar, Boyer - 1996
2	ªEigenvalues and Graph Bisection: An AverageCase Analysis,º - Boppana - 1987
2	A representation of hypergraphs in the euclidean space - Fukunaga, Stone, et al. - 1984
2	ªMotion Segmentation and Tracking Using Normalized Cuts,º - Shi, Malik - 1998
2	of organization in perceptual forms(partial translation - Laws - 1938
1	ªEigenvalues and Expanders,º - Alon - 1986
1	ªRatio Regions: A Technique for Image Segmentation,º - Cox, Rao, et al. - 1996
1	ªLower Bounds for the Partitioning of Graphs,º - Donath, Hoffman - 1973
1	Disk packings and planar separa;ors - Spielman, Teng - 1996