Discrete Geometry for Computer Imagery 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Coeurjolly, David (Επιμελητής έκδοσης), Sivignon, Isabelle (Επιμελητής έκδοσης), Tougne, Laure (Επιμελητής έκδοσης), Dupont, Florent (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Lecture Notes in Computer Science, 4992
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05906nam a22005895i 4500
001 978-3-540-79126-3
003 DE-He213
005 20151204165658.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540791263  |9 978-3-540-79126-3 
024 7 |a 10.1007/978-3-540-79126-3  |2 doi 
040 |d GrThAP 
050 4 |a QA76.76.A65 
072 7 |a UB  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
082 0 4 |a 004  |2 23 
245 1 0 |a Discrete Geometry for Computer Imagery  |h [electronic resource] :  |b 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings /  |c edited by David Coeurjolly, Isabelle Sivignon, Laure Tougne, Florent Dupont. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2008. 
300 |a XIII, 558 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4992 
505 0 |a Invited Papers -- Digital Geometry Processing with Topological Guarantees -- What Can We Learn from Discrete Images about the Continuous World? -- Weak Rational Computing for Digital Geometry -- Models for Distance Geometry -- A First Look into a Formal and Constructive Approach for Discrete Geometry Using Nonstandard Analysis -- Generation and Recognition of Digital Planes Using Multi-dimensional Continued Fractions -- About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators -- Combinatorial View of Digital Convexity -- Decomposition and Construction of Neighbourhood Operations Using Linear Algebra -- Digitally Continuous Multivalued Functions -- Continued Fractions and Digital Lines with Irrational Slopes -- Discrete and Combinational Topology -- New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces -- Cancellation of Critical Points in 2D and 3D Morse and Morse-Smale Complexes -- Characterizing and Detecting Toric Loops in n-Dimensional Discrete Toric Spaces -- Insertion and Expansion Operations for n-Dimensional Generalized Maps -- Discrete Complex Structure on Surfel Surfaces -- Minimal Simple Pairs in the Cubic Grid -- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete -- Geometric Transforms -- Medial Axis LUT Computation for Chamfer Norms Using -Polytopes -- Weighted Neighbourhood Sequences in Non-Standard Three-Dimensional Grids – Metricity and Algorithms -- Euclidean Eccentricity Transform by Discrete Arc Paving -- Statistical Template Matching under Geometric Transformations -- Distance Transformation on Two-Dimensional Irregular Isothetic Grids -- Self-similar Discrete Rotation Configurations and Interlaced Sturmian Words -- Segmenting Simplified Surface Skeletons -- Discrete Shape Representation, Recognition and Analysis -- Geometric Feature Estimators for Noisy Discrete Surfaces -- Normals and Curvature Estimation for Digital Surfaces Based on Convolutions -- On Minimal Moment of Inertia Polyominoes -- Gift-Wrapping Based Preimage Computation Algorithm -- Digital Planar Surface Segmentation Using Local Geometric Patterns -- Robust Estimation of Curvature along Digital Contours with Global Optimization -- An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition -- Tangential Cover for Thick Digital Curves -- Binomial Convolutions and Derivatives Estimation from Noisy Discretizations -- Discrete Tomography -- Selection of Local Thresholds for Tomogram Segmentation by Projection Distance Minimization -- Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem -- An Exact, Non-iterative Mojette Inversion Technique Utilising Ghosts -- Approximating hv-Convex Binary Matrices and Images from Discrete Projections -- Morphological Analysis -- Advances in Constrained Connectivity -- On Watershed Cuts and Thinnings -- A New Fuzzy Connectivity Class Application to Structural Recognition in Images -- Directional Structures Detection Based on Morphological Line-Segment and Orientation Functions -- Discrete Modelling and Visualization -- Predicting Corresponding Region in a Third View Using Discrete Epipolar Lines -- A Discrete Modelling of Soil Fragments Transport by Runoff -- Discrete and Combinational Tools for Image Segmentation and Analysis -- Optimal Difference Operator Selection -- First Results for 3D Image Segmentation with Topological Map -- Adaptive Morphological Filtering Using Similarities Based on Geodesic Time -- Book Scanner Dewarping with Weak 3d Measurements and a Simplified Surface Model -- 3D Image Topological Structuring with an Oriented Boundary Graph for Split and Merge Segmentation. 
650 0 |a Computer science. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Computer simulation. 
650 0 |a Computer graphics. 
650 0 |a Image processing. 
650 0 |a Pattern recognition. 
650 0 |a Application software. 
650 1 4 |a Computer Science. 
650 2 4 |a Computer Applications. 
650 2 4 |a Image Processing and Computer Vision. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Pattern Recognition. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Simulation and Modeling. 
700 1 |a Coeurjolly, David.  |e editor. 
700 1 |a Sivignon, Isabelle.  |e editor. 
700 1 |a Tougne, Laure.  |e editor. 
700 1 |a Dupont, Florent.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540791256 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4992 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-79126-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)