๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Affine Analysis of Image Sequences (Distinguished Dissertations in Computer Science)

โœ Scribed by Larry S. Shapiro


Year
2005
Tongue
English
Leaves
224
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Computer vision is a rapidly growing field which aims to make computers 'see' as effectively as humans. In this book Dr Shapiro presents a new computer vision framework for interpreting time-varying imagery. This is an important task, since movement reveals valuable information about the environment. The fully-automated system operates on long, monocular image sequences containing multiple, independently-moving objects, and demonstrates the practical feasibility of recovering scene structure and motion in a bottom-up fashion. Real and synthetic examples are given throughout, with particular emphasis on image coding applications. Novel theory is derived in the context of the affine camera, a generalisation of the familiar scaled orthographic model. Analysis proceeds by tracking 'corner features' through successive frames and grouping the resulting trajectories into rigid objects using new clustering and outlier rejection techniques. The three-dimensional motion parameters are then computed via 'affine epipolar geometry', and 'affine structure' is used to generate alternative views of the object and fill in partial views. The use of all available features (over multiple frames) and the incorporation of statistical noise properties substantially improves existing algorithms, giving greater reliability and reduced noise sensitivity.


๐Ÿ“œ SIMILAR VOLUMES


Affine analysis of image sequences
โœ Larry S. Shapiro ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Computer vision is a rapidly growing field which aims to make computers "see" as effectively as humans. In this book, Shapiro presents a new framework of computer vision for interpreting time-varying imagery. This is an important task, since movement reveals valuable information about the environme

Functional Programming and Input/Output
โœ Andrew D. Gordon ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Cambridge University Press ๐ŸŒ English

A common attraction to functional programming is the ease with which proofs can be given of program properties. A common disappointment with functional programming is the difficulty of expressing input/output (I/O) while at the same time being able to verify programs. Here, the author shows how a th

Three-Dimensional Integrated Circuit Lay
โœ A. C. Harter ๐Ÿ“‚ Library ๐Ÿ“… 2009 ๐ŸŒ English

The theory and design of integrated circuits has moved forward in leaps and bounds in recent years. This book concentrates on the design of three-dimensional, rather than traditional two-dimensional, circuits. The theory behind such circuits, together with experimental results, are presented in de

A Compositional Approach to Performance
โœ Jane Hillston ๐Ÿ“‚ Library ๐Ÿ“… 1996 ๐Ÿ› Cambridge University Press ๐ŸŒ English

This is the first book presenting a stochastic extension of process algebra, PEPA; this is shown to be suitable for specifying a Markov process, which can then be applied to performance modelling. The method, which is illustrated with case studies taken from the area of communication systems, can re

Efficient Algorithms for Listing Combina
โœ Leslie Ann Goldberg ๐Ÿ“‚ Library ๐Ÿ“… 2009 ๐Ÿ› Cambridge University Press ๐ŸŒ English

This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods a

Logic Programming: Operational Semantics
โœ James H. Andrews ๐Ÿ“‚ Library ๐ŸŒ English

Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in wh