Pub. Date:
Springer Berlin Heidelberg
Discrete Geometry for Computer Imagery: 16th IAPR International Conference, DGCI 2011, Nancy, France, April 6-8, 2011, Proceedings / Edition 1

Discrete Geometry for Computer Imagery: 16th IAPR International Conference, DGCI 2011, Nancy, France, April 6-8, 2011, Proceedings / Edition 1


Current price is , Original price is $129.0. You

Temporarily Out of Stock Online

Please check back later for updated availability.


This book constitutes the refereed proceedings of the 16th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2011, held in Nancy, France, in April 2011.
The 20 revised full papers and 20 revised poster papers presented together with 3 invited lectures were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on models for discrete geometry, discrete and combinatorial topology, geometric transforms, discrete shape representation, recognition and analysis, discrete tomography, morphological analysis, as well as discrete and combinatorial tools for image segmentation and analysis.

Product Details

ISBN-13: 9783642198663
Publisher: Springer Berlin Heidelberg
Publication date: 05/16/2011
Series: Lecture Notes in Computer Science , #6607
Edition description: 2011
Pages: 526
Product dimensions: 6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

Invited Speakers

A Probabilistic Grouping Principle to Go from Pixels to Visual Structures Agnès Desolneux 1

Ball-Based Shape Processing Jarek Rossignac 13

Hierarchies and Optima Jean Serra 35

Models for Discrete Geometry

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines Valérie Berthé Sébastien Labbé 47

Smooth 2D Coordinate Systems on Discrete Surfaces Colin Cartade Rémy Malgouyres Christian Mercat Chafik Samir 59

An Improved Riemannian Metric Approximation for Graph Cuts Ondrej Danek Pavel Matula 71

Introduction to Digital Level Layers Yan Gérard Laurent Provot Fabien Feschet 83

Another Definition for Digital Tangents Thierry Monteil 95

Associating Cell Complexes to Four Dimensional Digital Objects Ana Pacheco Pedro Real 104

Metric Bases for Polyhedral Gauges Fabien Rebatel Édouard Thiel 116

Discrete and Combinatorial Topology

Completions and Simplicial Complexes Gilles Bertrand 129

Hierarchic Euclidean Skeletons in Cubical Complexes Michel Couprie 141

Well-Composed Cell Complexes Rocio Gonzalez-Diaz Maria-Jose Jimenez Belen Medrano 153

A Unified Topological Framework for Digital Imaging Loïc Mazo Nicolas Passat Michel Couprie Christian Ronse 163

Isthmus-Based 6-Directional Parallel Thinning Algorithms Benjamin Raynal Michel Couprie 175

Geometric Transforms

Quasi-Linear Transformations, Numeration Systems and Fractals Marie-Andrée Jacob-Da Col Pierre Tellier 187

Path-Based Distance with Varying Weights and Neighborhood Sequences Nicolas Normand Robin Strand Pierre Evenou Aurore Arlicot 199

Sparse Object Representations by Digital Distance Functions Robin Strand 211

Discrete Shape Representation, Recognition and Analysis

Efficient Robust Digital Hyperplane Fitting with Bounded Error Dror Aiger Yukiko Kenmochi Hugues Talbot Lilian Buzer 223

Analytical Description of Digital Circles Eric Andres Tristan Roussillon 235

Circular Arc Reconstruction of Digital Contours with Chosen Hausdorff Error Bertrand Kerautret Jacques-Olivier Lachaud Thanh Phuong Nguyen 247

Recursive Calculation of Relative Convex Hulls Gisela Klette 260

An Error Bounded Tangent Estimator for Digitized Elliptic Curves Dilip K. Prasad Raj Kumar Gupta Maylor K.H. Leung 272

Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error Laurent Provot Yan Gérard 284

Properties and Applications of the Simplified Generalized Perpendicular Bisector Aurélie Richard Gaëlle Largeteau-Skapin Marc Rodríguez Eric Andres Laurent Fuchs Jean-Serge Dimitri Ouattara 296

Delaunay Properties of Digital Straight Segments Tristan Roussillon Jacques-Olivier Lachaud 308

Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time Mouhammad Said Jacques-Olivier Lachaud 320

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance Isabelle Sivignon 333

Distance between Separating Circles and Points Peter Veelaert 346

Optimal Consensus Set for Annulus Fitting Rita Zrour Gaëlle Largeteau-Skapin Eric Andres 358

Discrete Tomography

Bounds on the Difference between Reconstructions in Binary Tomography K. Joost Batenburg Wagner Fortes Lajos Hajdu Robert Tijdeman 369

Tiling the Plane with Permutations Alexandre Blondin Massé Andrea Frosini Simone Rinaldi Laurent Vuillon 381

Characterization of {-1,0,+1} Valued Functions in Discrete Tomography under Sets of Four Directions Sara Brunetti Paolo Dulio Carla Peri 394

Growth of Discrete Projection Ghosts Created by Iteration Imants Svalbe Shekhar Chandra 406

Properties of Minimal Ghosts Imants Svalbe Nicolas Normand 417

Morphological Analysis

Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results Isabelle Bloch Alain Bretto 429

Some Morphological Operators on Simplicial Complex Spaces Fábio Dias Jean Cousty Laurent Najman 441

Selection of Relevant Nodes from Component-Trees in Linear Time Nicolas Passat Benoît Naegel 453

Discrete and Combinatorial Tools for Image Segmentation and Analysis

Image Denoising with a Constrained Discrete Total Variation Scale Space Igor Ciril Jérôme Darbon 465

Smale-Like Decomposition and Forman Theory for Discrete Scalar Fields Lidija Comic Mohammed Mostefa Mesmoudi Leila De Floriani 477

ACCORD: With Approximate Covering of Convex Orthogonal Decomposition Mousumi Dutt Arindam Biswas Partha Bhowmick 489

Measures for Surface Comparison on Unstructured Grids with Different Density Natalia Dyshkant 501

Approximate Shortest Paths in Simple Polyhedra Fajie Li Reinhard Klette 513

Author Index 525

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews