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 Dana H. Ballard, Christopher M. Brown - Prentice Hall
The book on computer vision - the construction of explicit, meaningful descriptions of physical objects from images. Parts of the book assume some mathematical and computing background, but mainly mathematical rigor takes a backseat to concepts.
by R. Jain, R. Kasturi, B. G. Schunck - McGraw-Hill
The book is intended to provide a balanced introduction to machine vision. Basic concepts are introduced with only essential mathematical elements. The details to allow implementation and use of vision algorithm in practical application are provided.
by Jan Erik Solem - O'Reilly Media
The idea behind this book is to give an easily accessible entry point to hands-on computer vision with enough understanding of the underlying theory and algorithms to be a foundation for students, researchers and enthusiasts.
by Andrew Blake, Andrew Zisserman - The MIT Press
Visual Reconstruction presents a unified and highly original approach to the treatment of continuity in vision. The book introduces two new concepts: the weak continuity constraint and the graduated nonconvexity algorithm.