Book ChapterDOI
A Fast Algorithm for Reconstructing hv-Convex Binary Images from Their Horizontal Projection
Norbert Hantos,Péter Balázs +1 more
- pp 789-798
Reads0
Chats0
TLDR
This paper provides a fast polynomial-time algorithm for reconstructing canonical hv-convex images with given number of 4-connected components and with minimal number of columns satisfying a prescribed horizontal projection and shows that the method gives a solution that is always 8-connected.Abstract:
The reconstruction of certain types of binary images from their projections is a frequently studied problem in combinatorial image processing. hv-convex images with fixed projections play an important role in discrete tomography. In this paper, we provide a fast polynomial-time algorithm for reconstructing canonical hv-convex images with given number of 4-connected components and with minimal number of columns satisfying a prescribed horizontal projection. We show that the method gives a solution that is always 8-connected. We also explain how the algorithm can be modified to obtain solutions with any given number of columns, and also with non-connected components.read more
Citations
More filters
Reconstruction, Enumeration, and Examination of Binary Images with Prior Information
TL;DR: A tomografia celja egy haromdimenzios objektum ketdimenzosios szeleteit abrazolo kepeinek előallitasa a vetuletek ismereteben.
Proceedings ArticleDOI
Dual-stage post-processing for swarm intelligent binary matrix reconstruction solution
Manjot Kaur,Naresh Kumar +1 more
TL;DR: The proposed model, which has been proposed with the genetic programming and robust dual-stage post-processing module, can be considered the clear winner in comparison with the subsisted model based upon the metallurgy temperature flattening algorithm in the subsisting model.
References
More filters
Journal ArticleDOI
Comparison of algorithms for reconstructing hv-convex discrete sets
TL;DR: Three reconstruction algorithms to be used for reconstructing hv-convex discrete sets from their row and column sums are compared and it is shown that the algorithm which was better from the viewpoint of worst time complexity was the worse from the viewpoints of average time complexity and memory requirements.
Journal ArticleDOI
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
TL;DR: It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of O(mn) and in this case the solution is uniquely determined.
Book ChapterDOI
Discrete Tomography Methods for Nondestructive Testing
J. Baumann,Zoltán Kiss,S. Krimmel,Attila Kuba,Antal Nagy,Lajos Rodek,Burkhard Schillinger,J. Stephan +7 more
TL;DR: The chapter describes two DT reconstruction methods used in NDT experiments, shows the results of a DT procedure applied in the reconstruction of oblong objects having projections only from a limited range of angles, and suggests a few further possible NDT applications of DT.
Proceedings Article
Reconstruction in Different Classes of 2D Discrete Sets (Invited Paper)
TL;DR: In this paper, the problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes, including polyominoes and directed h-convex sets.
Book ChapterDOI
Reconstruction in different classes of 2D discrete sets
TL;DR: It is shown that the reconstruction algorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hV- Convex 8- connected sets and the directed h-Convex sets are uniquely reconstructible with respect to the row and column sum vectors.