Discrete Geometry for Computer Imagery: 13th International Conference, DGCI 2006, Szeged, Hungary, October 25-27, 2006, Proceedings: Lecture Notes in Computer Science, cartea 4245
Editat de Attila Kuba, László G. Nyúl, Kálmán Palágyien Limba Engleză Paperback – 10 oct 2006
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 640.74 lei
Preț vechi: 800.93 lei
-20% Nou
Puncte Express: 961
Preț estimativ în valută:
122.63€ • 129.37$ • 102.19£
122.63€ • 129.37$ • 102.19£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540476511
ISBN-10: 3540476512
Pagini: 688
Ilustrații: XIII, 688 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.98 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Image Processing, Computer Vision, Pattern Recognition, and Graphics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540476512
Pagini: 688
Ilustrații: XIII, 688 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.98 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Image Processing, Computer Vision, Pattern Recognition, and Graphics
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Discrete Geometry.- Duality and Geometry Straightness, Characterization and Envelope.- On Minimal Perimeter Polyminoes.- A Generic Approach for n-Dimensional Digital Lines.- Two Discrete-Euclidean Operations Based on the Scaling Transform.- Geometry of Neighborhood Sequences in Hexagonal Grid.- Recognition of Blurred Pieces of Discrete Planes.- Discrete Tomography.- The Number of Line-Convex Directed Polyominoes Having the Same Orthogonal Projections.- A Network Flow Algorithm for Binary Image Reconstruction from Few Projections.- Fast Filling Operations Used in the Reconstruction of Convex Lattice Sets.- Reconstruction Algorithm and Switching Graph for Two-Projection Tomography with Prohibited Subregion.- A Geometry Driven Reconstruction Algorithm for the Mojette Transform.- Quantised Angular Momentum Vectors and Projection Angle Distributions for Discrete Radon Transformations.- A Benchmark Evaluation of Large-Scale Optimization Approaches to Binary Tomography.- Construction of Switching Components.- Discrete Topology.- Minimal Non-simple and Minimal Non-cosimple Sets in Binary Images on Cell Complexes.- Combinatorial Relations for Digital Pictures.- Reusing Integer Homology Information of Binary Digital Images.- On the Lattice Structure of Subsets of Octagonal Neighborhood Sequences in ?n.- On the Connectedness of Rational Arithmetic Discrete Hyperplanes.- Homology of Simploidal Set.- Measuring Intrinsic Volumes in Digital 3d Images.- Distance.- An Objective Comparison Between Gray Weighted Distance Transforms and Weighted Distance Transforms on Curved Spaces.- Chordal Axis on Weighted Distance Transforms.- Attention-Based Mesh Simplification Using Distance Transforms.- Generating Distance Maps with Neighbourhood Sequences.- Hierarchical Chamfer Matching Based on Propagation of Gradient Strengths.- Elliptical Distance Transforms and Applications.- Image Analysis.- A Composite and Quasi Linear Time Method for Digital Plane Recognition.- Fusion Graphs, Region Merging and Watersheds.- Revisiting Digital Straight Segment Recognition.- On Discrete Moments of Unbounded Order.- Feature Based Defuzzification in ?2 and ?3 Using a Scale Space Approach.- Improving Difference Operators by Local Feature Detection.- Shape Representation.- An Optimal Algorithm for Detecting Pseudo-squares.- Optimization Schemes for the Reversible Discrete Volume Polyhedrization Using Marching Cubes Simplification.- Arithmetic Discrete Hyperspheres and Separatingness.- The Eccentricity Transform (of a Digital Shape).- Projected Area Based 3D Shape Similarity Evaluation.- Continuous Level of Detail on Graphics Hardware.- Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids.- Fast Polynomial Segmentation of Digitized Curves.- Segmentation.- Fuzzy Segmentation of Color Video Shots.- Application of Surface Topological Segmentation to Seismic Imaging.- Watershed Segmentation with Chamfer Metric.- Generalized Map Pyramid for Multi-level 3D Image Segmentation.- Topologically Correct Image Segmentation Using Alpha Shapes.- Skeletonization.- New Removal Operators for Surface Skeletonization.- Skeleton Pruning by Contour Partitioning.- A New 3D Parallel Thinning Scheme Based on Critical Kernels.- Order Independence in Binary 2D Homotopic Thinning.- Exact Euclidean Medial Axis in Higher Resolution.- Skeletonization and Distance Transforms of 3D Volumes Using Graphics Hardware.- Surfaces and Volumes.- How to Tile by Dominoes the Boundary of a Polycube.- A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition.- Distance Transforms on Anisotropic Surfaces for Surface Roughness Measurement.- A 3D Live-Wire Segmentation Method for Volume Images Using Haptic Interaction.- Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard.- Erratum.- Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids.