Discrete Representation of Spatial Objects in Computer Vision (Hardcover, 1998 ed.)

One of the most natural representations for modelling spatial objects in computers is discrete representations in the form of a 2D square raster and a 3D cubic grid, since these are naturally obtained by segmenting sensor images. However, the main difficulty is that discrete representations are only approximations of the original objects, and can only be as accurate as the cell size allows. If digitisation is done by real sensor devices, then there is the additional difficulty of sensor distortion. To overcome this, digital shape features must be used that abstract from the inaccuracies of digital representation. In order to ensure the correspondence of continuous and digital features, it is necessary to relate shape features of the underlying continuous objects and to determine the necessary resolution of the digital representation. This volume gives an overview and a classification of the actual approaches to describe the relation between continuous and discrete shape features that are based on digital geometric concepts of discrete structures. Audience: This book will be of interest to researchers and graduate students whose work involves computer vision, image processing, knowledge representation or representation of spatial objects.

General

Imprint:	Springer
Country of origin:	Netherlands
Series:	Computational Imaging and Vision, 11
Release date:	2001
First published:	1998
Authors:	L. J. Latecki
Dimensions:	234 x 156 x 14mm (L x W x T)
Format:	Hardcover
Pages:	216
Edition:	1998 ed.
ISBN-13:	978-0-7923-4912-9
Categories:	Books > Computing & IT > Applications of computing > Artificial intelligence > Computer vision Promotions
LSN:	0-7923-4912-1
Barcode:	9780792349129

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!