Logo

Visual Reconstruction by Andrew Blake, Andrew Zisserman

Large book cover: Visual Reconstruction

Visual Reconstruction
by

Publisher: The MIT Press
ISBN/ASIN: 0262524066
ISBN-13: 9780262524063
Number of pages: 232

Description:
Visual Reconstruction presents a unified and highly original approach to the treatment of continuity in vision. It introduces, analyzes, and illustrates two new concepts. The first -- the weak continuity constraint -- is a concise, computational formalization of piecewise continuity. It is a mechanism for expressing the expectation that visual quantities such as intensity, surface color, and surface depth vary continuously almost everywhere, but with occasional abrupt changes. The second concept -- the graduated nonconvexity algorithm -- arises naturally from the first. It is an efficient, deterministic (nonrandom) algorithm for fitting piecewise continuous functions to visual data.

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

Similar books

Book cover: Pattern RecognitionPattern Recognition
by - IN-TECH
The present book is intended to collect representative researches around the globe focusing on low-level vision, filter design, features and image descriptors, data mining and analysis, and biologically inspired algorithms.
(9643 views)
Book cover: Brain, Vision and AIBrain, Vision and AI
by - InTech
The book provides new ideas, original results and practical experiences regarding service robotics. It is only a small example of this research activity, but it covers a great deal of what has been done in the field recently.
(10543 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.
(10709 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.
(4824 views)