000 05837nam a22005895i 4500
001 978-3-642-04397-0
003 DE-He213
005 20160624102135.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642043970
_9978-3-642-04397-0
024 7 _a10.1007/978-3-642-04397-0
_2doi
050 4 _aT385
072 7 _aUML
_2bicssc
072 7 _aCOM012000
_2bisacsh
082 0 4 _a006.6
_223
245 1 0 _aDiscrete Geometry for Computer Imagery
_h[electronic resource] :
_b15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings /
_cedited by Srečko Brlek, Christophe Reutenauer, Xavier Provençal.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _aXII, 540 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5810
505 0 _aInvited Papers -- Arithmetic Discrete Planes Are Quasicrystals -- Affine Connections, and Midpoint Formation -- Mathematics in Atmospheric Sciences: An Overview -- Discrete Shape Representation, Recognition and Analysis -- On Three Constrained Versions of the Digital Circular Arc Recognition Problem -- Efficient Lattice Width Computation in Arbitrary Dimension -- Convergence of Binomial-Based Derivative Estimation for C 2 Noisy Discretized Curves -- Christoffel and Fibonacci Tiles -- Optimal Partial Tiling of Manhattan Polyominoes -- An Improved Coordinate System for Point Correspondences of 2D Articulated Shapes -- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour -- Multiscale Discrete Geometry -- Discrete and Combinatorial Tools for Image Segmentation and Analysis -- Vanishing Point Detection with an Intersection Point Neighborhood -- Ellipse Detection with Elemental Subsets -- Multi-Label Simple Points Definition for 3D Images Digital Deformable Model -- Marching Triangle Polygonization for Efficient Surface Reconstruction from Its Distance Transform -- Multivariate Watershed Segmentation of Compositional Data -- Pixel Approximation Errors in Common Watershed Algorithms -- Digital Deformable Model Simulating Active Contours -- Discrete and Combinatorial Topology -- Topology-Preserving Thinning in 2-D Pseudomanifolds -- Discrete Versions of Stokes’ Theorem Based on Families of Weights on Hypercubes -- Distances on Lozenge Tilings -- Jordan Curve Theorems with Respect to Certain Pretopologies on -- Decomposing Cavities in Digital Volumes into Products of Cycles -- Thinning Algorithms as Multivalued -Retractions -- Characterization of Simple Closed Surfaces in ?3: A New Proposition with a Graph-Theoretical Approach -- Border Operator for Generalized Maps -- Computing Homology: A Global Reduction Approach -- Models for Discrete Geometry -- Surface Sketching with a Voxel-Based Skeleton -- Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD -- Arithmetization of a Circular Arc -- On the Connecting Thickness of Arithmetical Discrete Planes -- Patterns in Discretized Parabolas and Length Estimation -- Universal Spaces for Surfaces -- A Linear Time and Space Algorithm for Detecting Path Intersection -- Geometric Transforms -- The Curvilinear Skeleton -- A Discrete ?-Medial Axis -- Appearance Radii in Medial Axis Test Mask for Small Planar Chamfer Norms -- Exact, Scaled Image Rotation Using the Finite Radon Transform -- Lower and Upper Bounds for Scaling Factors Used for Integer Approximation of 3D Anisotropic Chamfer Distance Operator -- A Novel Algorithm for Distance Transformation on Irregular Isothetic Grids -- Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation -- Quasi-Affine Transformation in Higher Dimension -- Discrete Tomography -- Solving Some Instances of the 2-Color Problem -- Grey Level Estimation for Discrete Tomography -- The 1-Color Problem and the Brylawski Model.
520 _aThis book constitutes the refereed proceedings of the 15th IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2009, held in Montréal, Canada, in September/October 2009. The 42 revised full papers were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on discrete shape, representation, recognition and analysis; discrete and combinatorial tools for image segmentation and analysis; discrete and combinatorial Topology; models for discrete geometry; geometric transforms; and discrete tomography.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer vision.
650 0 _aComputer graphics.
650 0 _aOptical pattern recognition.
650 1 4 _aComputer Science.
650 2 4 _aComputer Graphics.
650 2 4 _aImage Processing and Computer Vision.
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
650 2 4 _aPattern Recognition.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aBrlek, Srečko.
_eeditor.
700 1 _aReutenauer, Christophe.
_eeditor.
700 1 _aProvençal, Xavier.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642043963
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5810
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-04397-0
942 _2EBK8763
_cEBK
999 _c38057
_d38057