LEADER 08674nam 2200517 450 001 9910637703303321 005 20230501175135.0 010 $a3-031-23612-2 035 $a(MiAaPQ)EBC7166053 035 $a(Au-PeEL)EBL7166053 035 $a(CKB)25913692800041 035 $a(PPN)267813244 035 $a(EXLCZ)9925913692800041 100 $a20230501d2023 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aCombinatorial Image Analysis $e21st International Workshop, IWCIA 2022, Messina, Italy, July 13-15, 2022, Proceedings /$fReneta P. Barneva, Valentin E. Brimkov, and Giorgio Nordo (editors) 210 1$aCham, Switzerland :$cSpringer,$d[2023] 210 4$d©2023 215 $a1 online resource (338 pages) 225 1 $aLecture Notes in Computer Science Series ;$vVolume 13348 311 08$aPrint version: Barneva, Reneta P. Combinatorial Image Analysis Cham : Springer International Publishing AG,c2023 9783031236112 320 $aIncludes bibliographical references and index. 327 $aIntro -- 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. 327 $aOn 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. 327 $a6 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. 327 $a2 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. 410 0$aLecture notes in computer science ;$vVolume 13348. 606 $aCombinatorial analysis$vCongresses 606 $aImage analysis$vCongresses 615 0$aCombinatorial analysis 615 0$aImage analysis 676 $a511.6 702 $aBarneva$b Reneta P. 702 $aBrimkov$b Valentin E. 702 $aNordo$b Giorgio 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910637703303321 996 $aCombinatorial Image Analysis$9771884 997 $aUNINA