Combinatorial Image Analysis

Name: Combinatorial Image Analysis | 19th International Workshop, IWCIA 2018, Porto, Portugal, November 22-24, 2018, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

19th International Workshop, IWCIA 2018, Porto, Portugal, November 22-24, 2018, Proceedings

Reneta P. Barneva Valentin E. Brimkov João Manuel R.S. Tavares(Herausgeber*in)

Springer (Verlag)

Erschienen am 21. November 2018

XII, 237 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-030-05288-1 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Theoretical Contributions
On Gaps in Digital Objects
1 Introduction
2 Preliminaries
2.1 The Cubical Grid
2.2 Gaps in Digital Objects
2.3 The Euler Characteristic of 2D Digital Objects
3 Related Work
3.1 0-Gaps in 2D Objects
3.2 1-Gaps in 3D Objects
3.3 (n-2)-Gaps in nD Objects
4 Some New Formulae for the Number of 0-Gaps in 2D
5 Two Alternative Proofs of Formula (2)
6 Conclusion and Future Work
References
Fixpoints of Iterated Reductions with Equivalent Deletion Rules
1 Introduction
2 Basic Notions and Results
3 Characterization of Fixpoints
4 Implementing Equivalent Thinning Algorithms
5 Efficiency of Selecting Fixpoints
6 Conclusions
References
Parallel Contextual Array Insertion Deletion Grammar
1 Introduction
2 The New Grammar
3 Results
4 Conclusion
References
Chain Code P System for Generation of Approximation Patterns of Sierpinski Curve
1 Introduction
2 Basic Notions
2.1 Chain Code Pictures
2.2 Chain Code P Systems
3 Approximating Polygon Patterns in Isosceles Right Triangle for the Sierpinski Curve
4 Approximating Polygon Patterns in a Square for the Sierpinski Curve
5 Conclusion and Future Work
References
Digitized Rotations of Closest Neighborhood on the Triangular Grid
Abstract
1 Introduction
2 Preliminaries
2.1 Basic Notations
2.2 The Triangular Grid
2.3 Digitized Cell on the Triangular Grid
3 Bijectivity of the Neighborhood Motion Maps Corresponding to Rotations
3.1 Rotations Around a Corner of the Triangle
3.2 Rotations Around the Center of the Triangle
3.3 Rotations Around the Midpoint of an Edge of the Triangle
4 Conclusion and Future Work Plans
References
Binary Tomography on Triangular Grid Involving Hexagonal Grid Approach
1 Introduction
2 The Triangular Grid
2.1 The Shifted Projection Approach
3 The Hexagonal Grid
3.1 Reconstruction Method on Hexagonal Grid
4 Proposed Combined Triangular-Hexagonal Grid Method
5 Experimental Results
6 Conclusions
References
Sphere Construction on the FCC Grid Interpreted as Layered Hexagonal Grids in 3D
1 Introduction
1.1 Our Contribution
2 Preliminaries
2.1 FCC Grid-Layered Hexagonal Grids in 3D
2.2 Andres Spheres, Circles and Annuli
3 Sphere Construction Using Layered Hexagonal Grid
3.1 Andres Circle on Hexagonal Grid
3.2 Layered Annulus Characterization
3.3 Symmetries
4 Sphere Layering Algorithm
5 Conclusions
References
Quadrangular Mesh Generation Using Centroidal Voronoi Tessellation on Voxelized Surface
1 Introduction
1.1 State of the Art
1.2 Our Motivation and Contribution
2 Definitions and Terminologies
3 Proposed Work
3.1 Surface Segmentation
3.2 Voronoi Tessellation
3.3 Centroidal Voronoi Tessellation
3.4 Parallel Computing and Time Complexity
3.5 Mesh Construction
4 Experimental Results and Conclusion
References
When Can lp-norm Objective Functions Be Minimized via Graph Cuts?
1 Introduction
2 Related Work
3 Conditions for the Submodularity of p
4 Conclusions
References
From Theory to Practice
Detection of Osteoarthritis by Gap and Shape Analysis of Knee-Bone X-ray
1 Introduction
2 Methodology
2.1 Pre-processing
2.2 Gap Analysis
2.3 Shape Analysis
3 Experimental Results
4 Conclusion
References
Registration of CT with PET: A Comparison of Intensity-Based Approaches
1 Introduction
2 Related Work
3 Intensity-Based Registration
4 Database
5 Results
5.1 Manual Inspection
5.2 Semi-automatic Inspection
5.3 Automatic Evaluation
5.4 Results on Other Datasets
6 Conclusion
References
Iterative High Resolution Tomography from Combined High-Low Resolution Sinogram Pairs
1 Introduction
2 Preliminaries
3 Reconstruction from Hybrid Geometries
3.1 Two-Round Iterative Reconstruction
3.2 Multi-resolution Tomography by Energy Minimization
4 Validation and Results
4.1 Geometric Parameters of the Experiments
4.2 Parameters of the Reconstruction Algorithms
4.3 Results
5 Conclusion and Future Plans
References
A Multi-channel DART Algorithm
1 Introduction
2 Problem Formulation
3 Algorithms
3.1 DART
3.2 Multi-channel DART
4 Experimental Results
5 Conclusions
6 Discussion
References
Evaluation of Chaos Game Representation for Comparison of DNA Sequences
1 Introduction
2 Chaos Game Representation of a DNA Sequence
2.1 Comparison of Sequences in CGR
3 Methodology
3.1 Evaluation Strategy
3.2 Evaluation Indices
4 Results
4.1 Test Dataset
4.2 Simplified Illustrative Case
4.3 Full Dataset Evaluation
5 Conclusions
References
Image-Based Object Spoofing Detection
1 Introduction
2 Related Work
3 Proposed Approach
3.1 L*u*v* Color Space
3.2 YCrCb Color Space
4 Performance Evaluation
4.1 Evaluation Metrics
4.2 Cork-Print-Attack Database
4.3 Replay-Attack Database
4.4 Results
4.5 Discussion
5 Conclusions
References
Improvement of Measurement Accuracy of Optical 3D Scanners by Discrete Systematic Error Estimation
Abstract
1 Introduction
2 State-of-the-Art
3 Approach
3.1 Error Treatment
3.2 Global Error Compensation Approach
3.3 New Methodology
4 Evaluation Method
5 Simulations, Experiments, and Results
5.1 Simulated Measurements
5.2 Experiments on Real Data
6 Summary, Discussion, and Outlook
References
Defect Detection in Textiles with Co-occurrence Matrix as a Texture Model Description
1 Introduction
2 Materials and Methods
2.1 Texture Model
2.2 Scale Incorporation
3 Results and Discussion
3.1 Case 1: Simple Background
3.2 Case 2: Knitwear
3.3 Time Performance
4 Conclusions
References
Multiscale Graph-Cut for 3D Segmentation of Compact Objects
1 Introduction
2 Methods
2.1 Graph-Cut for Computer Vision
2.2 Multiscale Graph-Cut Segmentation
2.3 High Resolution to Low Resolution Algorithm
2.4 Low Resolution to High Resolution Algorithm
3 Results
4 Discussion
5 Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken