Logo

Computer Vision by Dana H. Ballard, Christopher M. Brown

Large book cover: Computer Vision

Computer Vision
by

Publisher: Prentice Hall
ISBN/ASIN: 0131653164
ISBN-13: 9780131653160
Number of pages: 539

Description:
Computer vision is the construction of explicit, meaningful descriptions of physical objects from images. Image understanding is very different from image processing, which studies image-to-image transformations, not explicit description building. Descriptions are a prerequisite for recognizing, manipulating, and thinking about objects. Parts of the book assume some mathematical and computing background (calculus, linear algebra, data structures, numerical methods). However, throughout the book mathematical rigor takes a backseat to concepts. Our intent is to transmit a set of ideas about a new field to the widest possible audience.

Home page url

Download or read it online for free here:
Download link
(280MB, PDF)

Similar books

Book cover: State of the Art in Face RecognitionState of the Art in Face Recognition
by - IN-TECH
Nearest feature classification for face recognition, subspace methods, a multi-stage classifier for face recognition undertaken by coarse-to-fine strategy, PCA-ANN face recognition system based on photometric normalization techniques, etc.
(6671 views)
Book cover: Visual ReconstructionVisual Reconstruction
by - 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.
(6805 views)
Book cover: Machine PerceptionMachine Perception
by - Prentice-Hall
This book is about visual perception. It is based on the author's experience in teaching graduate courses in the field. It assumes no previous knowledge of the field and aims to provide a comprehensive knowledge of its methods.
(10921 views)
Book cover: Notes on Elementary Spectral Graph TheoryNotes on Elementary Spectral Graph Theory
by - arXiv
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a thorough treatment of this deeply original method, including complete proofs. The main thrust of this paper is the method of normalized cuts.
(5044 views)