Cantitate/Preț
Produs

Digital Geometry Algorithms: Theoretical Foundations and Applications to Computational Imaging: Lecture Notes in Computational Vision and Biomechanics, cartea 2

Editat de Valentin E. Brimkov, Reneta P. Barneva
en Limba Engleză Paperback – 11 iun 2014
Digital geometry emerged as an independent discipline in the second half of the last century. It deals with geometric properties of digital objects and is developed with the unambiguous goal to provide rigorous theoretical foundations for devising new advanced approaches and algorithms for various problems of visual computing. Different aspects of digital geometry have been addressed in the literature. This book is the first one that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors. Every chapter contains a section in which interesting open problems are addressed.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 63432 lei  43-57 zile
  SPRINGER NETHERLANDS – 11 iun 2014 63432 lei  43-57 zile
Hardback (1) 63912 lei  43-57 zile
  SPRINGER NETHERLANDS – 21 mai 2012 63912 lei  43-57 zile

Din seria Lecture Notes in Computational Vision and Biomechanics

Preț: 63432 lei

Preț vechi: 74626 lei
-15% Nou

Puncte Express: 951

Preț estimativ în valută:
12140 12610$ 10084£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9789400799585
ISBN-10: 9400799586
Pagini: 440
Ilustrații: X, 430 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2012
Editura: SPRINGER NETHERLANDS
Colecția Springer
Seria Lecture Notes in Computational Vision and Biomechanics

Locul publicării:Dordrecht, Netherlands

Public țintă

Research

Cuprins

Preface.- List of Contributors.- Part I General.- 1 Digital Geometry in Image-Based Metrology; Alfred M. Bruckstein.- 2 Provably Robust Simplification of Component Trees of Multidimensional Images; Gabor T. Herman, T. Yung Kong, and Lucas M. Oliveira.- Part II Topology, Transformations.- 3 Discrete Topological Transformations for Image Processing; Michel Couprie and Gilles Bertrand.- 4 Modeling and Manipulating Cell Complexes in Two, Three and Higher Dimensions; Lidija Čomić and Leila De Floriani.- 5 Binarization of Gray-Level Images Based on Skeleton Region Growing; Xiang Bai, Quannan Li, Tianyang Ma, Wenyu Liu, and Longin Jan Latecki.- 6 Topology Preserving Parallel 3D Thinning Algorithms; Kálmán Palágyi, Gábor Németh, and Péter Kardos.- 7 Separable Distance Transformation and its Applications; David Coeurjolly and Antoine Vacavant.- 8 Separability and Tight Enclosure of Point Sets; Peter Veelaert.- Part III Image and Shape Analysis.- Digital Straightness, Circularity, and their Applications to Image Analysis; Partha Bhowmick and Bhargab B. Bhattacharya.- 10 Shape Analysis with Geometric Primitives; Fabien Feschet.- 11 Shape from Silhouettes in Discrete Space; Atsushi Imiya and Kosuke Sato.- 12 Combinatorial Maps for 2D and 3D Image Segmentation; Guillaume Damiand and Alexandre Dupas.- 13 Multigrid Convergence of Discrete Geometric Estimators; David Coeurjolly, Jacques-Olivier Lachaud, and Tristan Roussillon.- Index.

Textul de pe ultima copertă

Digital geometry emerged as an independent discipline in the second half of the last century. It deals with geometric properties of digital objects and is developed with the unambiguous goal to provide rigorous theoretical foundations for devising new advanced approaches and algorithms for various problems of visual computing. Different aspects of digital geometry have been addressed in the literature. This book is the first one that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors. Every chapter contains a section in which interesting open problems are addressed.

Caracteristici

Contains open problems for research projects Provides compact surveys on the specific topics Can be used by both researchers and practitioners Includes supplementary material: sn.pub/extras