Discrete Representation of Spatial Objects in Computer VisionSpringer Science & Business Media, 2013 M04 17 - 216 páginas One of the most natural representations for modelling spatial objects in computers is discrete representations in the form of a 2D square raster and a 3D cubic grid, since these are naturally obtained by segmenting sensor images. However, the main difficulty is that discrete representations are only approximations of the original objects, and can only be as accurate as the cell size allows. If digitisation is done by real sensor devices, then there is the additional difficulty of sensor distortion. To overcome this, digital shape features must be used that abstract from the inaccuracies of digital representation. In order to ensure the correspondence of continuous and digital features, it is necessary to relate shape features of the underlying continuous objects and to determine the necessary resolution of the digital representation. This volume gives an overview and a classification of the actual approaches to describe the relation between continuous and discrete shape features that are based on digital geometric concepts of discrete structures. Audience: This book will be of interest to researchers and graduate students whose work involves computer vision, image processing, knowledge representation or representation of spatial objects. |
Dentro del libro
Resultados 1-5 de 45
Página 14
... endpoints ( which are sides of the squares ) , and points ( which are corners of the squares ) , as illustrated in Figure 1.6 . The smallest neighborhood of each cell in this topology is the smallest open set in the standard Euclidean ...
... endpoints ( which are sides of the squares ) , and points ( which are corners of the squares ) , as illustrated in Figure 1.6 . The smallest neighborhood of each cell in this topology is the smallest open set in the standard Euclidean ...
Página 15
... endpoints ( which are sides of the squares ) , and points ( which are corners of the squares ) . 1.3 Embedding Approach In this approach , a discrete structure is embedded into a known continuous structure , usually Euclidean space ...
... endpoints ( which are sides of the squares ) , and points ( which are corners of the squares ) . 1.3 Embedding Approach In this approach , a discrete structure is embedded into a known continuous structure , usually Euclidean space ...
Página 16
... endpoint in common . Hence , there is also only one kind of connectedness for bdCA ( S ) . It can be easily proven that a digital picture ( Z2 , X ) is well - composed iff bdCA ( X ) is a compact 1D manifold ( i.e. , each point in bdCA ...
... endpoint in common . Hence , there is also only one kind of connectedness for bdCA ( S ) . It can be easily proven that a digital picture ( Z2 , X ) is well - composed iff bdCA ( X ) is a compact 1D manifold ( i.e. , each point in bdCA ...
Página 36
Alcanzaste el límite de visualización de este libro.
Alcanzaste el límite de visualización de este libro.
Página 38
Alcanzaste el límite de visualización de este libro.
Alcanzaste el límite de visualización de este libro.
Contenido
5 | |
Graphbased Approach | 45 |
Axiomatic Approach | 73 |
Continuous Representations of Real Objects | 107 |
A co co co | 142 |
Digitization Approach | 147 |
Bibliography | 175 |
37 | 190 |
45 | 202 |
Otras ediciones - Ver todas
Discrete Representation of Spatial Objects in Computer Vision L.J. Latecki Vista previa limitada - 1998 |
Discrete Representation of Spatial Objects in Computer Vision L.J. Latecki Sin vista previa disponible - 2010 |
Discrete Representation of Spatial Objects in Computer Vision L.J. Latecki Sin vista previa disponible - 2014 |
Términos y frases comunes
4-simple 8-adjacency 8-component arc(x bdCA(X binary black points boundary point CA(X camera closed half-plane color computer vision concept connected components connectedness contained continuous analog continuous functions convex set cubes defined definition deformation retract deleted denote Dig(A digital image digital line digital object digital picture digital set digital topology digitization process discrete representations endpoints Euler characteristic example exists geometric graph structure homeomorphic interior point IR² Jordan curve theorem Latecki Lemma line of support line segment metric continuous multicolor N₁(P obtain oob(x osculating ball Par(A par(r)-regular set parallel regular pixel planar plane polygonal arc preserves Proof property CP3 Proposition real objects Rosenfeld rotations s₁ Section semi-proximity spaces shown in Figure simple closed curve simple point simple polygon sp-continuous spatial straight line subarc subset supported arc thinning algorithm topological spaces topology well-composed pictures well-composed sets white points