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: Computer Vision Metrics: Survey, Taxonomy, and AnalysisComputer Vision Metrics: Survey, Taxonomy, and Analysis
by - Springer
Provides an extensive survey of over 100 machine vision methods, with a detailed taxonomy for local, regional and global features. It provides background to develop intuition about why interest point detectors and feature descriptors actually work.
(9243 views)
Book cover: Visual ServoingVisual Servoing
by - InTech
This is a book about how to employ the vision theory in the market conditions for students or researchers who want to realize the technique of machine vision. The book consists of 10 chapters on different fields about vision applications.
(12121 views)
Book cover: Machine VisionMachine Vision
by - 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.
(18471 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.
(8789 views)