## Combinatorial Image Analysis: 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, ProceedingsIt is indeed a great pleasure to welcome you to the proceedings of the 12th International Workshop on Combinatorial Image Analysis (IWCIA 2008) held in Bu?alo, NY, April 7–9, 2008. Image analysis is a scienti?c discipline providing theoretical foundations and methods for solving problems that appear in various areas of human practice, as diverseas medicine,robotics,defense,andsecurity.As a rule,the processeddata are discrete; thus, the “discrete,” or “combinatorial”approachto image analysis appears to be a natural one and therefore its importance is increasing. In fact, combinatorial image analysis often provides various advantages (in terms of - ciency and accuracy) over the more traditional approaches based on continuous models requiring numeric computation. The IWCIA workshop series provides a forum for researchers throughout the world to present cutting-edge results in combinatorial image analysis, to discuss recent advances in this research ?eld, and to promote interaction with researchersfromothercountries.Infact,IWCIA2008retainedandevenenriched the international spirit of these workshops, that had successful prior meetings in Paris (France) 1991, Ube (Japan) 1992, Washington DC (USA) 1994, Lyon (France) 1995, Hiroshima (Japan) 1997, Madras (India) 1999, Caen (France) 2000, Philadelphia (USA) 2001, Palermo (Italy) 2003, Auckland (New Zealand) 2004, and Berlin (Germany) 2006. The IWCIA 2008 Program Committee was highly international as its members are renowned experts coming from 23 di?- entcountries,andsubmissionscamefrom24countriesfromAfrica,Asia,Europe, North and South America. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Connectivity Preserving Voxel Transformation | 1 |

Thinning on Quadratic Triangular and Hexagonal Cell Complexes | 13 |

Experimental Comparison of Continuous and Discrete Tangent Estimators Along Digital Curves | 26 |

Polyhedral Surface Approximation of Nonconvex Voxel Sets through the Modiﬁcation of Convex Hulls | 38 |

Weighted Neighborhood Sequences in Nonstandard ThreeDimensional Grids Parameter Optimization | 51 |

Computing Homology Generators for Volumes Using Minimal Generalized Maps | 63 |

Digital Segments and Hausdorff Discretization | 75 |

Scaling of Plane Figures That Assures Faithful Digitization | 87 |

Digital Images | 238 |

Linear Boundary and Corner Detection Using Limited Number of Sensor Rows | 250 |

A Convergence Proof for the HornSchunck OpticalFlow Computation Scheme Using Neighborhood Decomposition | 262 |

Topologically Correct 3D Surface Reconstruction and Segmentation from Noisy Samples | 274 |

Detecting the Most Unusual Part of a Digital Image | 286 |

Labeling Irregular Graphs with Belief Propagation | 295 |

Image Registration Using Markov Random Coefficient Fields | 306 |

A Secret Sharing Scheme for Digital Images Based on TwoDimensional Linear Cellular Automata | 318 |

Computing Admissible Rotation Angles from Rotated Digital Images | 99 |

On the Number of hvConvex Discrete Sets | 112 |

A Combinatorial Approach | 124 |

A Discrete Approach for Supervised Pattern Recognition | 136 |

Robust Decomposition of Thick Digital Shapes | 148 |

Segmentation of Noisy Discrete Surfaces | 160 |

MRF Labeling with a GraphShifts Algorithm | 172 |

A Multiobject Shape Representation | 185 |

A New Image Segmentation Technique Using Maximum Spanning Tree | 197 |

Reducing the Coefficients of a TwoDimensional Integer Linear Constraint | 205 |

A Branch Bound Algorithm for Medical Image Registration | 217 |

Global Optimization for First Order Markov Random Fields with Submodular Priors | 229 |

Pure 2D Picture Grammars P2DPG and P2DPG with Regular Control | 330 |

A Deterministic Turing Machine for Context Sensitive Translation of Braille Codes to Urdu Text | 342 |

Rewriting P Systems Generating Isopicture Languages | 352 |

Reconstructing a Matrix with a Given List of Coefficients and Prescribed Row and Column Sums Is NPHard | 363 |

A Reasoning Framework for Solving Nonograms | 372 |

A Memetic Algorithm for Binary Image Reconstruction | 384 |

Personal Identification Based on Weighting Key Point Scheme for Hand Image | 396 |

A MinCostMaxFlow Based Algorithm for Reconstructing Binary Image from Two Projections Using Similar Images | 408 |

Comparison of Local and Global Region Merging in the Topological Map | 420 |

Novel Edge Detector | 432 |

444 | |

### Other editions - View all

### Common terms and phrases

algorithm analysis applied approach background voxels belief propagation binary images binary matrix boundary Braille cell complex classiﬁer coeﬃcients column combinatorial Computer Vision conﬁguration connected components consider constraint convex hull corresponding darts deﬁned Deﬁnition denote diﬀerent digital curves digital image discrete sets discrete tomography distance edge edge detection eﬃcient error Euclidean ﬁctive faces ﬁeld ﬁnd ﬁnite ﬁrst ﬁxed ﬂow function geometric graph graph-shifts grid Heidelberg hinge angle hv-convex image registration integer points intersection iteration IWCIA label Lemma linear LNCS matrix maximum spanning tree merging method minimal node Nonogram object obtained optimal orthogonal paper parameters picture array pixels plane polygon polyhedron polyominoes polytope problem projections properties proposed reconstruction regions registration rotation sampling secret sharing segmentation solution space Springer surface tangent tangential cover Theorem topological map transformation triangles Urdu vector vertex vertices voxels weighted