| Título : |
21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Couprie, Michel, ; Cousty, Jean, ; Kenmochi, Yukiko, ; Mustafa, Nabil, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2019 |
| Número de páginas: |
XIV, 496 p. 692 ilustraciones, 141 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-14085-4 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Gráficos de computadora Visión por computador Sistemas de reconocimiento de patrones Informática Algoritmos Reconocimiento de patrones automatizado Aplicaciones matemáticas en informática |
| Índice Dewey: |
006.6 Gráficos por computador |
| Resumen: |
Este libro constituye las actas minuciosamente arbitradas de la 21.ª Conferencia Internacional de la IAPR sobre Geometría Discreta para Imágenes por Computadora, DGCI 2019, celebrada en Marne-la-Vallée, Francia, en marzo de 2019. Los 38 artículos completos fueron cuidadosamente seleccionados entre 50 presentaciones. Los artículos están organizados en secciones temáticas sobre transformadas y modelos geométricos discretos; topología discreta; modelos, análisis y segmentación basados en gráficos; morfología matemática; representación, reconocimiento y análisis de formas; y cálculo geométrico. |
| Nota de contenido: |
Discrete Geometric Models and Transforms -- Digital Two-dimensional Bijective Reflection and Associated Rotation -- Digital Curvature Evolution Model for Image Segmentation -- Rhombic Dodecahedron Grid { Coordinate System and 3D Digital Object Definitions -- Facet Connectedness of Arithmetic Discrete Hyperplanes with Non Zero Shift -- Local Turn-boundedness: a Curvature Control for a Good Digitization -- Distance Transform based on Weight Sequences -- Stochastic Distance Transform -- Discrete Topology -- Filtration Simplification for Persistent Homology via Edge Contraction -- One More Step towards Well-composedness of Cell Complexes over nD Pictures -- On the Space between Critical Points -- Rigid Motions in the Cubic Grid: A Discussion on Topological Issues -- Graph-based Models, Analysis and Segmentation -- A New Entropy for Hypergraphs -- Graph-based Segmentation with Local Band Constraints -- A Study of Observation Scales based on Felzenswalb-Huttenlocher Dissimilarity Measure for Hierarchical Segmentation -- The Role of Optimum Connectivity in Image Segmentation: Can the algorithm learn object information during the process? -- On the Degree Sequence of 3-uniform Hypergraph: A New Sufficient Condition -- Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision -- Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph -- Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees -- Mathematical Morphology -- Vector-based Mathematical Morphology Operations on Polygons Using Straight Skeletons for Digital Pathology -- Morphological Networks for Image De-raining -- Minimal Component-Hypertrees -- Single Scan Granulometry Estimation from an Asymmetric Distance Map -- Recognizing Hierarchical Watersheds -- Shape Representation, Recognition and Analysis -- Straight Line Reconstruction for Fully Materialized Table Extraction inDegraded Document Images -- A Spatial Convexity Descriptor for Object Enlacement -- The Propagating Skeleton: A Robust Detail-preserving Approach -- Non-Centered Voronoi Skeletons -- Dual Approaches for Elliptic Hough Transform: Eccentricity/Orientation vs Center based -- Digital Plane Recognition with Fewer Probes -- Geometric Computation -- Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid -- Efficient Algorithms to Test Digital Convexity -- Compact Packings of the Plane with Three Sizes of Discs -- Convex Aggregation Problems in ℤ2 -- Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences -- Unfolding Level 1 Menger Polycubes of Arbitrary Size with Help of Outer Faces -- A Discrete Bisector Function Based on Annulus -- Average Curve of n Digital Curves. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings [documento electrónico] / Couprie, Michel, ; Cousty, Jean, ; Kenmochi, Yukiko, ; Mustafa, Nabil, . - 1 ed. . - [s.l.] : Springer, 2019 . - XIV, 496 p. 692 ilustraciones, 141 ilustraciones en color. ISBN : 978-3-030-14085-4 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Gráficos de computadora Visión por computador Sistemas de reconocimiento de patrones Informática Algoritmos Reconocimiento de patrones automatizado Aplicaciones matemáticas en informática |
| Índice Dewey: |
006.6 Gráficos por computador |
| Resumen: |
Este libro constituye las actas minuciosamente arbitradas de la 21.ª Conferencia Internacional de la IAPR sobre Geometría Discreta para Imágenes por Computadora, DGCI 2019, celebrada en Marne-la-Vallée, Francia, en marzo de 2019. Los 38 artículos completos fueron cuidadosamente seleccionados entre 50 presentaciones. Los artículos están organizados en secciones temáticas sobre transformadas y modelos geométricos discretos; topología discreta; modelos, análisis y segmentación basados en gráficos; morfología matemática; representación, reconocimiento y análisis de formas; y cálculo geométrico. |
| Nota de contenido: |
Discrete Geometric Models and Transforms -- Digital Two-dimensional Bijective Reflection and Associated Rotation -- Digital Curvature Evolution Model for Image Segmentation -- Rhombic Dodecahedron Grid { Coordinate System and 3D Digital Object Definitions -- Facet Connectedness of Arithmetic Discrete Hyperplanes with Non Zero Shift -- Local Turn-boundedness: a Curvature Control for a Good Digitization -- Distance Transform based on Weight Sequences -- Stochastic Distance Transform -- Discrete Topology -- Filtration Simplification for Persistent Homology via Edge Contraction -- One More Step towards Well-composedness of Cell Complexes over nD Pictures -- On the Space between Critical Points -- Rigid Motions in the Cubic Grid: A Discussion on Topological Issues -- Graph-based Models, Analysis and Segmentation -- A New Entropy for Hypergraphs -- Graph-based Segmentation with Local Band Constraints -- A Study of Observation Scales based on Felzenswalb-Huttenlocher Dissimilarity Measure for Hierarchical Segmentation -- The Role of Optimum Connectivity in Image Segmentation: Can the algorithm learn object information during the process? -- On the Degree Sequence of 3-uniform Hypergraph: A New Sufficient Condition -- Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision -- Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph -- Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees -- Mathematical Morphology -- Vector-based Mathematical Morphology Operations on Polygons Using Straight Skeletons for Digital Pathology -- Morphological Networks for Image De-raining -- Minimal Component-Hypertrees -- Single Scan Granulometry Estimation from an Asymmetric Distance Map -- Recognizing Hierarchical Watersheds -- Shape Representation, Recognition and Analysis -- Straight Line Reconstruction for Fully Materialized Table Extraction inDegraded Document Images -- A Spatial Convexity Descriptor for Object Enlacement -- The Propagating Skeleton: A Robust Detail-preserving Approach -- Non-Centered Voronoi Skeletons -- Dual Approaches for Elliptic Hough Transform: Eccentricity/Orientation vs Center based -- Digital Plane Recognition with Fewer Probes -- Geometric Computation -- Convex and Concave Vertices on a Simple Closed Curve in the Triangular Grid -- Efficient Algorithms to Test Digital Convexity -- Compact Packings of the Plane with Three Sizes of Discs -- Convex Aggregation Problems in ℤ2 -- Polygon Approximations of the Euclidean Circles on the Square Grid by Broadcasting Sequences -- Unfolding Level 1 Menger Polycubes of Arbitrary Size with Help of Outer Faces -- A Discrete Bisector Function Based on Annulus -- Average Curve of n Digital Curves. |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |