Notes on Elementary Spectral Graph Theory
by Jean Gallier
Publisher: arXiv 2013
Number of pages: 76
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.
Home page url
Download or read it online for free here:
by Asim Bhatti (ed.) - InTech
The topics covered in this book include fundamental theoretical aspects of robust stereo correspondence estimation, novel and robust algorithms, hardware implementation for fast execution, neuromorphic engineering, probabilistic analysis, etc.
by Dilip K. Prasad - arXiv
We propose a new object detection/recognition method, which improves over the existing methods in every stage of the object detection/recognition process. In addition to the usual features, we propose to use geometric shapes as additional features.
by 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.
by Jose R.A. Torreao - InTech
In this small book the authors have attempted to present a limited but relevant sample of the work being carried out in stereo vision, covering significant aspects both from the applied and from the theoretical standpoints.