Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Combinatorial Image Analysis : 21st International Workshop, IWCIA 2022, Messina, Italy, July 13-15, 2022, Proceedings / / Reneta P. Barneva, Valentin E. Brimkov, and Giorgio Nordo (editors)
| Combinatorial Image Analysis : 21st International Workshop, IWCIA 2022, Messina, Italy, July 13-15, 2022, Proceedings / / Reneta P. Barneva, Valentin E. Brimkov, and Giorgio Nordo (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (338 pages) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science Series |
| Soggetto topico |
Combinatorial analysis
Image analysis |
| ISBN | 3-031-23612-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Invited Paper -- Non-traditional 2D Grids in Combinatorial Imaging - Advances and Challenges -- 1 Introduction - Why (Not) the Traditional Square Grid? -- 2 Regular, Semi-regular Grids and Their Duals -- 3 Coordinate Systems -- 3.1 Discrete Tomography -- 4 Digital Distances -- 5 Transformations -- 5.1 Mathematical Morphology -- 5.2 Thinning and Abstract Cell Complexes -- 6 Final Comment -- References -- Digital Geometry and Topology -- Rectangularization of Digital Objects and Its Relation with Straight Skeletons -- 1 Introduction -- 2 Definitions -- 3 Rules for Partitioning into Rectangles -- 4 Rectangular Partitioning Procedure -- 4.1 Algorithm -- 4.2 Demonstration -- 4.3 Time Complexity Analysis -- 5 Experimental Results -- 6 Conclusion -- References -- On the Number of 0-Tandems in Simple nD Digital 0-Connected Curves -- 1 Introduction -- 2 Preliminaries -- 2.1 The Cubic Grid -- 2.2 Tandems and Gaps in Digital Objects -- 2.3 Digital Curves -- 3 Related Work -- 3.1 2D Objects -- 3.2 Digital Curves -- 4 0-Tandems in nD Digital Curves -- 5 0-Tandems in 3D Digital Curves -- References -- On Density Extrema for Digital Discs -- 1 Introduction -- 1.1 Existing Work -- 1.2 Our Contribution -- 2 Maximum Density -- 2.1 Integer Center and Integer Radius -- 2.2 Integer Center and Real Radius -- 2.3 Unrestricted Center and Radius -- 3 Minimum Density -- 3.1 Integer Center and Integer Radius -- 3.2 Integer Center and Real Radius -- 4 Conclusion and Future Work -- References -- Sufficient Conditions for Topology-Preserving Parallel Reductions on the BCC Grid -- 1 Introduction -- 2 Basic Notions and Results -- 3 Configuration-Based Conditions -- 4 Point-Based Conditions -- 5 Generating Topology-Preserving Parallel Reductions -- 6 Conclusions -- References.
On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 Characterization of an Orthogonal Polyhedron -- 4 Planar Graph Drawing -- 5 Algorithm -- 5.1 Reconstruction -- 5.2 Time Complexity -- 6 Discussion -- 7 Conclusion -- References -- Extractive Text Summarization Using Topological Features -- 1 Introduction -- 2 Background -- 2.1 Simplicial Complex -- 2.2 Persistent Homology -- 2.3 Minimum Dominating Set -- 2.4 Cosine Similarity -- 3 Proposed Methodology -- 3.1 Proposed Method (I) -- 3.2 Proposed Method (II) -- 4 Experimental Results -- 4.1 Proposed Methodology (I) and TextRank -- 4.2 Proposed Methodology (II) and TextRank -- 5 Conclusion -- References -- Largest Area Parallelogram Inside a Digital Object in a Triangular Grid -- 1 Introduction -- 2 Definitions and Preliminaries -- 2.1 Deriving the Inner Triangular Cover (ITC) -- 3 Procedure to Compute LAPT -- 3.1 Finding LAPT Within Sub-polygon -- 3.2 Reduction Rules -- 4 Algorithm -- 4.1 Complexity Analysis -- 5 Experimental Results -- 6 Conclusions -- References -- Picture Languages -- Weighted Three Directions OTA and Weighted Hexapolic Picture Automata -- 1 Introduction -- 2 Pictures and Hexagonal Pictures -- 2.1 Two-Dimensional Hexagonal Pictures and Languages -- 3 Weighted Automata over Hexagonal Pictures -- 3.1 Series on Pictures -- 3.2 Series on Hexagonal Pictures -- 4 W3OTA-Recognizable Series are WHPA-Recognizable -- 5 Conclusions -- References -- A Myhill-Nerode Theorem for Finite State Matrix Automata and Finite Matrix Languages -- 1 Introduction -- 1.1 Learning Aspects -- 1.2 Formal Language Aspects -- 2 Finite Matrix Language (FML) -- 2.1 FML - Examples -- 3 Deterministic Finite State Matrix Automata (DFSMA) -- 3.1 DFSMA - Examples -- 4 Properties of Finite Matrix Languages -- 5 Myhill - Nerode Equivalence. 6 Conclusion and Future Work -- References -- Algebraic Properties of Parikh q-Matrices on Two-Dimensional Words -- 1 Introduction -- 2 Preliminaries -- 2.1 Subwords -- 2.2 Parikh Matrix -- 2.3 Parikh q-Matrix -- 2.4 Two Dimensional Words -- 2.5 Parikh q-Matrices of a Picture Array -- 3 Extending Parikh q-Matrix of Picture Arrays -- 4 Alternate Parikh q-Matrix of Picture Array -- 5 Parikh q-Matrix Commutator of Arrays -- 6 Conclusion -- References -- Adjunct Partial Array Token Petri Net Structure -- 1 Introduction -- 2 Preliminaries -- 3 Adjunct Partial Array Token Petri Net Structure -- 4 Comparative Results -- 5 Conclusion -- References -- 2D Oxide Picture Languages and Their Properties -- 1 Introduction -- 2 Preliminaries -- 3 Two-Dimensional Oxide Pictures and Languages -- 3.1 Coordinates and Size of Oxide Pictures -- 3.2 Types of Oxide Pictures -- 3.3 Triangular Oxide Pictures and Languages -- 4 Results -- 4.1 Boolean Operations -- 4.2 Unary Operations -- 4.3 Binary Operations -- 5 Conclusions -- References -- Lyndon Partial Words and Arrays with Applications -- 1 Introduction -- 2 Basic Notations and Terminology -- 3 Lyndon Partial Words -- 3.1 Tree Representation of a Lyndon Partial Word -- 4 - Morphism -- 5 Two-Dimensional Lyndon Partial Words -- 6 Discussions -- References -- Theory and Applications -- Tomography Reconstruction Based on Null Space Search -- 1 Introduction -- 2 Tomography Reconstruction Problem -- 3 Tomography Reconstruction Method Based on Null Space Search -- 4 Experimental Evaluation -- 5 Conclusions -- References -- Instance Segmentation with BoundaryNet -- 1 Introduction -- 2 BoundaryNet -- 2.1 Labelling -- 2.2 Segments Extraction -- 2.3 Network Architecture -- 3 Methods -- 4 Results -- 5 Conclusion -- References -- Curvature-Based Denoising of Vector-Valued Images -- 1 Introduction. 2 Curvature-Based Denoising of Scalar-Valued Images -- 2.1 Level Line Tree -- 2.2 Level Line Shortening -- 2.3 Reconstruction -- 3 Curvature-Based Denoising of Vector-Valued Images -- 3.1 Pseudo-level Lines -- 3.2 First Step: Construction of the Pseudo-level Line Tree -- 3.3 Second Step: Smoothing -- 3.4 Third Step: Reconstruction -- 4 Experimental Demonstration -- 4.1 Curvature Maps and Visualisation -- 4.2 Image Smoothing Experiments -- 5 Summary and Outlook -- References -- Face Characterization Using Convex Surface Decomposition -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 Face Characterization Method -- 4 Algorithm -- 5 Complexity -- 5.1 Time Complexity -- 5.2 Space Complexity -- 6 Results -- 7 Conclusion -- References -- Characterization and Reconstruction of Hypergraphic Pattern Sequences -- 1 Introduction -- 2 Definitions and Previous Results -- 3 Definition and Properties of the Pattern Sequences -- 4 Two Reconstruction Algorithms for Pattern Sequences -- 5 Conclusion and Open Problems -- References -- The Generalized Microscopic Image Reconstruction Problem for Hypergraphs -- 1 Introduction -- 2 Preliminaries and Previous Results -- 3 The MSP Problem on Classes of Hypergraphs -- 3.1 3-Hypergraphs Whose 2-Intersection Graph is a Line -- 3.2 3-Hypergraphs Whose 2-Intersection Graph is a Tree -- 4 Conclusion and Future Perspectives -- References -- Author Index. |
| Record Nr. | UNINA-9910637703303321 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Image Analysis : 21st International Workshop, IWCIA 2022, Messina, Italy, July 13-15, 2022, Proceedings / / Reneta P. Barneva, Valentin E. Brimkov, and Giorgio Nordo (editors)
| Combinatorial Image Analysis : 21st International Workshop, IWCIA 2022, Messina, Italy, July 13-15, 2022, Proceedings / / Reneta P. Barneva, Valentin E. Brimkov, and Giorgio Nordo (editors) |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (338 pages) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science Series |
| Soggetto topico |
Combinatorial analysis
Image analysis |
| ISBN | 3-031-23612-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Invited Paper -- Non-traditional 2D Grids in Combinatorial Imaging - Advances and Challenges -- 1 Introduction - Why (Not) the Traditional Square Grid? -- 2 Regular, Semi-regular Grids and Their Duals -- 3 Coordinate Systems -- 3.1 Discrete Tomography -- 4 Digital Distances -- 5 Transformations -- 5.1 Mathematical Morphology -- 5.2 Thinning and Abstract Cell Complexes -- 6 Final Comment -- References -- Digital Geometry and Topology -- Rectangularization of Digital Objects and Its Relation with Straight Skeletons -- 1 Introduction -- 2 Definitions -- 3 Rules for Partitioning into Rectangles -- 4 Rectangular Partitioning Procedure -- 4.1 Algorithm -- 4.2 Demonstration -- 4.3 Time Complexity Analysis -- 5 Experimental Results -- 6 Conclusion -- References -- On the Number of 0-Tandems in Simple nD Digital 0-Connected Curves -- 1 Introduction -- 2 Preliminaries -- 2.1 The Cubic Grid -- 2.2 Tandems and Gaps in Digital Objects -- 2.3 Digital Curves -- 3 Related Work -- 3.1 2D Objects -- 3.2 Digital Curves -- 4 0-Tandems in nD Digital Curves -- 5 0-Tandems in 3D Digital Curves -- References -- On Density Extrema for Digital Discs -- 1 Introduction -- 1.1 Existing Work -- 1.2 Our Contribution -- 2 Maximum Density -- 2.1 Integer Center and Integer Radius -- 2.2 Integer Center and Real Radius -- 2.3 Unrestricted Center and Radius -- 3 Minimum Density -- 3.1 Integer Center and Integer Radius -- 3.2 Integer Center and Real Radius -- 4 Conclusion and Future Work -- References -- Sufficient Conditions for Topology-Preserving Parallel Reductions on the BCC Grid -- 1 Introduction -- 2 Basic Notions and Results -- 3 Configuration-Based Conditions -- 4 Point-Based Conditions -- 5 Generating Topology-Preserving Parallel Reductions -- 6 Conclusions -- References.
On the Construction of Planar Embedding for a Class of Orthogonal Polyhedra -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 Characterization of an Orthogonal Polyhedron -- 4 Planar Graph Drawing -- 5 Algorithm -- 5.1 Reconstruction -- 5.2 Time Complexity -- 6 Discussion -- 7 Conclusion -- References -- Extractive Text Summarization Using Topological Features -- 1 Introduction -- 2 Background -- 2.1 Simplicial Complex -- 2.2 Persistent Homology -- 2.3 Minimum Dominating Set -- 2.4 Cosine Similarity -- 3 Proposed Methodology -- 3.1 Proposed Method (I) -- 3.2 Proposed Method (II) -- 4 Experimental Results -- 4.1 Proposed Methodology (I) and TextRank -- 4.2 Proposed Methodology (II) and TextRank -- 5 Conclusion -- References -- Largest Area Parallelogram Inside a Digital Object in a Triangular Grid -- 1 Introduction -- 2 Definitions and Preliminaries -- 2.1 Deriving the Inner Triangular Cover (ITC) -- 3 Procedure to Compute LAPT -- 3.1 Finding LAPT Within Sub-polygon -- 3.2 Reduction Rules -- 4 Algorithm -- 4.1 Complexity Analysis -- 5 Experimental Results -- 6 Conclusions -- References -- Picture Languages -- Weighted Three Directions OTA and Weighted Hexapolic Picture Automata -- 1 Introduction -- 2 Pictures and Hexagonal Pictures -- 2.1 Two-Dimensional Hexagonal Pictures and Languages -- 3 Weighted Automata over Hexagonal Pictures -- 3.1 Series on Pictures -- 3.2 Series on Hexagonal Pictures -- 4 W3OTA-Recognizable Series are WHPA-Recognizable -- 5 Conclusions -- References -- A Myhill-Nerode Theorem for Finite State Matrix Automata and Finite Matrix Languages -- 1 Introduction -- 1.1 Learning Aspects -- 1.2 Formal Language Aspects -- 2 Finite Matrix Language (FML) -- 2.1 FML - Examples -- 3 Deterministic Finite State Matrix Automata (DFSMA) -- 3.1 DFSMA - Examples -- 4 Properties of Finite Matrix Languages -- 5 Myhill - Nerode Equivalence. 6 Conclusion and Future Work -- References -- Algebraic Properties of Parikh q-Matrices on Two-Dimensional Words -- 1 Introduction -- 2 Preliminaries -- 2.1 Subwords -- 2.2 Parikh Matrix -- 2.3 Parikh q-Matrix -- 2.4 Two Dimensional Words -- 2.5 Parikh q-Matrices of a Picture Array -- 3 Extending Parikh q-Matrix of Picture Arrays -- 4 Alternate Parikh q-Matrix of Picture Array -- 5 Parikh q-Matrix Commutator of Arrays -- 6 Conclusion -- References -- Adjunct Partial Array Token Petri Net Structure -- 1 Introduction -- 2 Preliminaries -- 3 Adjunct Partial Array Token Petri Net Structure -- 4 Comparative Results -- 5 Conclusion -- References -- 2D Oxide Picture Languages and Their Properties -- 1 Introduction -- 2 Preliminaries -- 3 Two-Dimensional Oxide Pictures and Languages -- 3.1 Coordinates and Size of Oxide Pictures -- 3.2 Types of Oxide Pictures -- 3.3 Triangular Oxide Pictures and Languages -- 4 Results -- 4.1 Boolean Operations -- 4.2 Unary Operations -- 4.3 Binary Operations -- 5 Conclusions -- References -- Lyndon Partial Words and Arrays with Applications -- 1 Introduction -- 2 Basic Notations and Terminology -- 3 Lyndon Partial Words -- 3.1 Tree Representation of a Lyndon Partial Word -- 4 - Morphism -- 5 Two-Dimensional Lyndon Partial Words -- 6 Discussions -- References -- Theory and Applications -- Tomography Reconstruction Based on Null Space Search -- 1 Introduction -- 2 Tomography Reconstruction Problem -- 3 Tomography Reconstruction Method Based on Null Space Search -- 4 Experimental Evaluation -- 5 Conclusions -- References -- Instance Segmentation with BoundaryNet -- 1 Introduction -- 2 BoundaryNet -- 2.1 Labelling -- 2.2 Segments Extraction -- 2.3 Network Architecture -- 3 Methods -- 4 Results -- 5 Conclusion -- References -- Curvature-Based Denoising of Vector-Valued Images -- 1 Introduction. 2 Curvature-Based Denoising of Scalar-Valued Images -- 2.1 Level Line Tree -- 2.2 Level Line Shortening -- 2.3 Reconstruction -- 3 Curvature-Based Denoising of Vector-Valued Images -- 3.1 Pseudo-level Lines -- 3.2 First Step: Construction of the Pseudo-level Line Tree -- 3.3 Second Step: Smoothing -- 3.4 Third Step: Reconstruction -- 4 Experimental Demonstration -- 4.1 Curvature Maps and Visualisation -- 4.2 Image Smoothing Experiments -- 5 Summary and Outlook -- References -- Face Characterization Using Convex Surface Decomposition -- 1 Introduction -- 2 Definitions and Preliminaries -- 3 Face Characterization Method -- 4 Algorithm -- 5 Complexity -- 5.1 Time Complexity -- 5.2 Space Complexity -- 6 Results -- 7 Conclusion -- References -- Characterization and Reconstruction of Hypergraphic Pattern Sequences -- 1 Introduction -- 2 Definitions and Previous Results -- 3 Definition and Properties of the Pattern Sequences -- 4 Two Reconstruction Algorithms for Pattern Sequences -- 5 Conclusion and Open Problems -- References -- The Generalized Microscopic Image Reconstruction Problem for Hypergraphs -- 1 Introduction -- 2 Preliminaries and Previous Results -- 3 The MSP Problem on Classes of Hypergraphs -- 3.1 3-Hypergraphs Whose 2-Intersection Graph is a Line -- 3.2 3-Hypergraphs Whose 2-Intersection Graph is a Tree -- 4 Conclusion and Future Perspectives -- References -- Author Index. |
| Record Nr. | UNISA-996503467803316 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial image analysis : 12th international workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, proceedings / / Valentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman (editors)
| Combinatorial image analysis : 12th international workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, proceedings / / Valentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman (editors) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XVI, 448 p.) |
| Disciplina | 621.367 |
| Collana | Image Processing, Computer Vision, Pattern Recognition, and Graphics |
| Soggetto topico |
Image analysis
Combinatorial analysis |
| ISBN | 3-540-78275-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Digital Geometry and Topology: Curves and Surfaces -- Connectivity Preserving Voxel Transformation -- Thinning on Quadratic, Triangular, and Hexagonal Cell Complexes -- Experimental Comparison of Continuous and Discrete Tangent Estimators Along Digital Curves -- Polyhedral Surface Approximation of Non-convex Voxel Sets through the Modification of Convex Hulls -- Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids – Parameter Optimization -- Computing Homology Generators for Volumes Using Minimal Generalized Maps -- Digital Segments and Hausdorff Discretization -- Combinatorics in Digital Spaces: Lattice Polygons, Polytopes, Tilings, and Patterns -- Scaling of Plane Figures That Assures Faithful Digitization -- Computing Admissible Rotation Angles from Rotated Digital Images -- On the Number of hv-Convex Discrete Sets -- Finding the Orthogonal Hull of a Digital Object: A Combinatorial Approach -- A Discrete Approach for Supervised Pattern Recognition -- Image Representation, Segmentation, Grouping, and Reconstruction -- Robust Decomposition of Thick Digital Shapes -- Segmentation of Noisy Discrete Surfaces -- MRF Labeling with a Graph-Shifts Algorithm -- Label Space: A Multi-object Shape Representation -- A New Image Segmentation Technique Using Maximum Spanning Tree -- Applications of Computational Geometry, Integer and Linear Programming to Image Analysis -- Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint -- A Branch & Bound Algorithm for Medical Image Registration -- Global Optimization for First Order Markov Random Fields with Submodular Priors -- Transformation Polytopes for Line Correspondences in Digital Images -- Linear Boundary and Corner Detection Using Limited Number of Sensor Rows -- Fuzzy and Stochastic Image Analysis, Parallel Architectures and Algorithms -- A Convergence Proof for the Horn-Schunck Optical-Flow Computation Scheme Using Neighborhood Decomposition -- Topologically Correct 3D Surface Reconstruction and Segmentation from Noisy Samples -- Detecting the Most Unusual Part of a Digital Image -- Labeling Irregular Graphs with Belief Propagation -- Grammars and Models for Image or Scene Analysis -- Image Registration Using Markov Random Coefficient Fields -- A Secret Sharing Scheme for Digital Images Based on Two-Dimensional Linear Cellular Automata -- Pure 2D Picture Grammars (P2DPG) and P2DPG with Regular Control -- A Deterministic Turing Machine for Context Sensitive Translation of Braille Codes to Urdu Text -- Rewriting P Systems Generating Iso-picture Languages -- Discrete Tomography, Medical Imaging, and Biometrics -- Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard -- A Reasoning Framework for Solving Nonograms -- A Memetic Algorithm for Binary Image Reconstruction -- Personal Identification Based on Weighting Key Point Scheme for Hand Image -- A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images -- Comparison of Local and Global Region Merging in the Topological Map -- Novel Edge Detector. |
| Record Nr. | UNINA-9910484233603321 |
| Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial image analysis : 12th international workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, proceedings / / Valentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman (editors)
| Combinatorial image analysis : 12th international workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, proceedings / / Valentin E. Brimkov, Reneta P. Barneva, Herbert A. Hauptman (editors) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2008] |
| Descrizione fisica | 1 online resource (XVI, 448 p.) |
| Disciplina | 621.367 |
| Collana | Image Processing, Computer Vision, Pattern Recognition, and Graphics |
| Soggetto topico |
Image analysis
Combinatorial analysis |
| ISBN | 3-540-78275-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Digital Geometry and Topology: Curves and Surfaces -- Connectivity Preserving Voxel Transformation -- Thinning on Quadratic, Triangular, and Hexagonal Cell Complexes -- Experimental Comparison of Continuous and Discrete Tangent Estimators Along Digital Curves -- Polyhedral Surface Approximation of Non-convex Voxel Sets through the Modification of Convex Hulls -- Weighted Neighborhood Sequences in Non-standard Three-Dimensional Grids – Parameter Optimization -- Computing Homology Generators for Volumes Using Minimal Generalized Maps -- Digital Segments and Hausdorff Discretization -- Combinatorics in Digital Spaces: Lattice Polygons, Polytopes, Tilings, and Patterns -- Scaling of Plane Figures That Assures Faithful Digitization -- Computing Admissible Rotation Angles from Rotated Digital Images -- On the Number of hv-Convex Discrete Sets -- Finding the Orthogonal Hull of a Digital Object: A Combinatorial Approach -- A Discrete Approach for Supervised Pattern Recognition -- Image Representation, Segmentation, Grouping, and Reconstruction -- Robust Decomposition of Thick Digital Shapes -- Segmentation of Noisy Discrete Surfaces -- MRF Labeling with a Graph-Shifts Algorithm -- Label Space: A Multi-object Shape Representation -- A New Image Segmentation Technique Using Maximum Spanning Tree -- Applications of Computational Geometry, Integer and Linear Programming to Image Analysis -- Reducing the Coefficients of a Two-Dimensional Integer Linear Constraint -- A Branch & Bound Algorithm for Medical Image Registration -- Global Optimization for First Order Markov Random Fields with Submodular Priors -- Transformation Polytopes for Line Correspondences in Digital Images -- Linear Boundary and Corner Detection Using Limited Number of Sensor Rows -- Fuzzy and Stochastic Image Analysis, Parallel Architectures and Algorithms -- A Convergence Proof for the Horn-Schunck Optical-Flow Computation Scheme Using Neighborhood Decomposition -- Topologically Correct 3D Surface Reconstruction and Segmentation from Noisy Samples -- Detecting the Most Unusual Part of a Digital Image -- Labeling Irregular Graphs with Belief Propagation -- Grammars and Models for Image or Scene Analysis -- Image Registration Using Markov Random Coefficient Fields -- A Secret Sharing Scheme for Digital Images Based on Two-Dimensional Linear Cellular Automata -- Pure 2D Picture Grammars (P2DPG) and P2DPG with Regular Control -- A Deterministic Turing Machine for Context Sensitive Translation of Braille Codes to Urdu Text -- Rewriting P Systems Generating Iso-picture Languages -- Discrete Tomography, Medical Imaging, and Biometrics -- Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NP-Hard -- A Reasoning Framework for Solving Nonograms -- A Memetic Algorithm for Binary Image Reconstruction -- Personal Identification Based on Weighting Key Point Scheme for Hand Image -- A Min-Cost-Max-Flow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images -- Comparison of Local and Global Region Merging in the Topological Map -- Novel Edge Detector. |
| Record Nr. | UNISA-996465892703316 |
| Berlin ; ; Heidelberg : , : Springer, , [2008] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||