Notes on Elementary Spectral Graph Theory
by Jean Gallier
Publisher: arXiv 2013
Number of pages: 76
Description:
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary background on graphs and graph Laplacians. The main thrust of this paper is the method of normalized cuts.
Download or read it online for free here:
Download link
(980KB, PDF)
Similar books
Computer Vision: Models, Learning, and Inferenceby Simon J.D. Prince - Cambridge University Press
This modern treatment of computer vision focuses on learning and inference in probabilistic models as a unifying theme. It shows how to use data to learn the relationships between the observed image data and the aspects that we wish to estimate.
(10833 views)
Anisotropic Diffusion in Image Processingby Joachim Weickert - Teubner
Many recent techniques for digital image enhancement and multiscale image representations are based on nonlinear PDEs. This book gives an introduction to the main ideas behind these methods, and it describes in a systematic way their foundations.
(8662 views)
Scene Reconstruction Pose Estimation and Trackingby Rustam Stolkin - InTech
This book reports recent advances in the use of pattern recognition techniques for computer and robot vision. The areas of low level vision such as segmentation, edge detection, and region identification, are the focus of this book.
(5788 views)
Recent Advances in Face Recognitionby Kresimir Delac, Mislav Grgic, Marian Stewart Bartlett - IN-TECH
The main ideas in the area of face recognition are security applications and human-computer interaction. The goal of this book is to provide the reader with the most up to date research performed in automatic face recognition.
(5734 views)