research-article

Normalized Cuts and Image Segmentation

Authors:

Jitendra MalikAuthors Info & Claims

IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 22, Issue 8

Pages 888 - 905

https://doi.org/10.1109/34.868688

Published: 01 August 2000 Publication History

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, as well as motion sequences, and found the results to be very encouraging.

References

[1]

N. Alon, “Eigenvalues and Expanders,” Combinatorica, vol. 6, no. 2, pp. 83-96, 1986.

Digital Library

[2]

A. Blake and A. Zisserman, Visual Reconstruction. MIT Press, 1987.

Digital Library

[3]

R.B. Boppana, “Eigenvalues and Graph Bisection: An Average-Case Analysis,” Proc. 28th Symp. Foundations of Computer Science, pp. 280-285, 1987.

Digital Library

[4]

J. Cheeger, “A Lower Bound for the Smallest Eigenvalue of the Laplacian,” Problems in Analysis, R.C. Gunning, ed., pp. 195-199, Princeton Univ. Press, 1970.

[5]

F.R.K. Chung, Spectral Graph Theory. Am. Math. Soc., 1997.

[6]

I.J. Cox S.B. Rao and Y. Zhong, “Ratio Regions: A Technique for Image Segmentation,” Proc. 13th Int'l Conf. Pattern Recognition, 1996.

Digital Library

[7]

W.E. Donath and A.J. Hoffman, “Lower Bounds for the Partitioning of Graphs,” IBM J. Research and Development, pp. 420-425, 1973.

Digital Library

[8]

R. Van Driessche and D. Roose, “An Improved Spectral Bisection Algorithm and Its Application to Dynamic Load Balancing,” Parallel Computing, vol. 21, pp. 29-48, 1995.

Digital Library

[9]

M. Fiedler, “A Property of Eigenvectors of Nonnegative Symmetric Matrices and Its Applications to Graph Theory,” Czech. Math. J., vol. 25, no. 100, pp. 619-633, 1975.

[10]

S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, Nov. 1984.

Digital Library

[11]

G.H. Golub and C.F. Van Loan, Matrix Computations. John Hopkins Press, 1989.

[12]

A.K. Jain and R.C. Dubes, Algorithms for Clustering Data. Prentice Hall, 1988.

Digital Library

[13]

K. Fukunaga S. Yamada H.S. Stone and T. Kasai, “A Representation of Hypergraphs in the Euclidean Space,” IEEE Trans. Computers, vol. 33, no. 4, pp. 364-367, Apr. 1984.

[14]

Y.G. Leclerc, “Constructing Simple Stable Descriptions for Image Partitioning,” Int'l J. Computer Vision, vol. 3, pp. 73-102, 1989.

[15]

J. Malik S. Belongie J. Shi and T. Leung, “Textons, Contours and Regions: Cue Integration in Image Segmentation,” Proc. Int'l Conf. Computer Vision, pp. 918-925, 1999.

Digital Library

[16]

J. Malik and P. Perona, “Preattentive Texture Discrimination with Early Vision Mechanisms,” J. Optical Soc. Am., vol. 7, no. 2, pp. 923-932, May 1990.

[17]

D. Mumford and J. Shah, “Optimal Approximations by Piecewise Smooth Functions, and Associated Variational Problems,” Comm. Pure Math., pp. 577-684, 1989.

[18]

A. Pothen H.D. Simon and K.P. Liou, “Partitioning Sparse Matrices with Eigenvectors of Graphs,” SIAM J. Matrix Analytical Applications, vol. 11, pp. 430-452, 1990.

Digital Library

[19]

S. Sarkar and K.L. Boyer, “Quantitative Measures of Change Based on Feature Organization: Eigenvalues and Eigenvectors,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, 1996.

Digital Library

[20]

J. Shi and J. Malik, “Normalized Cuts and Image Segmentation,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 731-737, 1997.

Digital Library

[21]

J. Shi and J. Malik, “Motion Segmentation and Tracking Using Normalized Cuts,” Proc. Int'l Conf. Computer Vision, pp. 1,154-1,160, 1998.

Digital Library

[22]

A.J. Sinclair and M.R. Jerrum, “Approximative Counting, Uniform Generation and Rapidly Mixing Markov Chains,” Information and Computation, vol. 82, pp. 93-133, 1989.

Digital Library

[23]

D.A. Spielman and S.H. Teng, “Disk Packings and Planar Separators,” Proc. 12th ACM Symp. Computational Geometry, May 1996.

Digital Library

[24]

M. Wertheimer, “Laws of Organization in Perceptual Forms (partial translation),” A Sourcebook of Gestalt Psycychology, W.B. Ellis, ed., pp. 71-88, Harcourt, Brace, 1938.

[25]

Z. Wu and R. Leahy, “An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1,101-1,113, Nov. 1993.

Digital Library

Cited By

Deng JHuang DZhang B(2024)Distributed Pseudo-Likelihood Method for Community Detection in Large-Scale NetworksACM Transactions on Knowledge Discovery from Data10.1145/365730018:7(1-25)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3657300
Xuan JCi WGe YTian L(2024)Research on Road Unexpected Obstacle Segmentation Algorithm Based on Improved RFB Deeplabv3+Proceedings of the International Conference on Computer Vision and Deep Learning10.1145/3653781.3653800(1-8)Online publication date: 19-Jan-2024
https://dl.acm.org/doi/10.1145/3653781.3653800
Wei LXi MGurrin CKongkachandra RSchoeffmann KDang-Nguyen DRossetto LSatoh SZhou L(2024)Subspace Clustering with A Hybrid Adaptive Graph FilterProceedings of the 2024 International Conference on Multimedia Retrieval10.1145/3652583.3658042(1070-1078)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3652583.3658042
Show More Cited By

Index Terms

Normalized Cuts and Image Segmentation
1. Computing methodologies
  1. Artificial intelligence
    1. Computer vision
      1. Computer vision problems
      2. Computer vision tasks
        Scene understanding
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory

Recommendations

Normalized Cuts and Image Segmentation
CVPR '97: Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)

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 ...
Read More
Clustering Algorithm in Normalised Cuts Based Image Segmentation
AMS '13: Proceedings of the 2013 7th Asia Modelling Symposium

Normalised cut method has been effectively used for image segmentation by representing an image as weighted graph in global view. It does segmentation via partitioning the graphs into sub-graphs. Clustering algorithm is implemented such that sub-graphs ...
Read More
Graph Partitioning Active Contours (GPAC) for Image Segmentation

In this paper, we introduce new types of variational segmentation cost functions and associated active contour methods that are based on pairwise similarities or dissimilarities of the pixels. As a solution to a minimization problem, we introduce a new ...
Read More

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Pattern Analysis and Machine Intelligence

IEEE Transactions on Pattern Analysis and Machine Intelligence Volume 22, Issue 8

August 2000

177 pages

ISSN:0162-8828

Editor:
Kevin Bowyer
Univ. of South Florida, Tampa

Issue’s Table of Contents

Copyright © Copyright © 2000 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 August 2000

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3,090
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Other Metrics

View Author Metrics

Citations

Cited By

Deng JHuang DZhang B(2024)Distributed Pseudo-Likelihood Method for Community Detection in Large-Scale NetworksACM Transactions on Knowledge Discovery from Data10.1145/365730018:7(1-25)Online publication date: 19-Jun-2024
https://dl.acm.org/doi/10.1145/3657300
Xuan JCi WGe YTian L(2024)Research on Road Unexpected Obstacle Segmentation Algorithm Based on Improved RFB Deeplabv3+Proceedings of the International Conference on Computer Vision and Deep Learning10.1145/3653781.3653800(1-8)Online publication date: 19-Jan-2024
https://dl.acm.org/doi/10.1145/3653781.3653800
Wei LXi MGurrin CKongkachandra RSchoeffmann KDang-Nguyen DRossetto LSatoh SZhou L(2024)Subspace Clustering with A Hybrid Adaptive Graph FilterProceedings of the 2024 International Conference on Multimedia Retrieval10.1145/3652583.3658042(1070-1078)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3652583.3658042
Wei LSong SGurrin CKongkachandra RSchoeffmann KDang-Nguyen DRossetto LSatoh SZhou L(2024)Multi-view Subspace Clustering via An Adaptive Consensus Graph FilterProceedings of the 2024 International Conference on Multimedia Retrieval10.1145/3652583.3658009(776-784)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3652583.3658009
Arnaudon ASchindler DPeach RGosztolai AHodges MSchaub MBarahona M(2024)Algorithm 1044: PyGenStability, a Multiscale Community Detection with Generalized Markov StabilityACM Transactions on Mathematical Software10.1145/365122550:2(1-8)Online publication date: 11-Mar-2024
https://dl.acm.org/doi/10.1145/3651225
Hao XShao LHe XZheng X(2024)ME: Multi-Task Edge-Enhanced for Image Forgery LocalizationProceedings of the 2024 7th International Conference on Image and Graphics Processing10.1145/3647649.3647701(327-333)Online publication date: 19-Jan-2024
https://dl.acm.org/doi/10.1145/3647649.3647701
Fujiwara YKumagai AIda YNakano MNakatsuji MKimura A(2024)Efficient Algorithm for K-Multiple-MeansProceedings of the ACM on Management of Data10.1145/36392732:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639273
Yan YHu YZhou QLiu LZeng ZChen YPan MChen HDas MTong HChua TNgo CKa-Wei Lee RKumar RLauw H(2024)PaCEr: Network Embedding From Positional to StructuralProceedings of the ACM on Web Conference 202410.1145/3589334.3645516(2485-2496)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645516
Chen QChen NShuai WWu GXu ZTong HCao N(2024)Calliope-Net: Automatic Generation of Graph Data Facts via Annotated Node-Link DiagramsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.332692530:1(562-572)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TVCG.2023.3326925
Zhang YTang M(2024)A Theoretical Analysis of DeepWalk and Node2vec for Exact Recovery of Community Structures in Stochastic BlockmodelsIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2023.332763146:2(1065-1078)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1109/TPAMI.2023.3327631
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents