Discrete Tomographic Reconstruction of Binary Images with Disjoint Components Using Shape Information

@article{Balzs2008DiscreteTR,
  title={Discrete Tomographic Reconstruction of Binary Images with Disjoint Components Using Shape Information},
  author={P{\'e}ter Bal{\'a}zs},
  journal={Int. J. Shape Model.},
  year={2008},
  volume={14},
  pages={189-207}
}
  • P. Balázs
  • Published 1 December 2008
  • Mathematics, Computer Science
  • Int. J. Shape Model.
We present a general framework for reconstructing binary images with disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori knowledge about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we show how to extend the algorithm to obtain a branch-and-bound scheme useful to reconstruct images satisfying… 
View via Publisher
12 Citations
Background Citations
1
Methods Citations
1

12 Citations

Citation Type

Citation Type

Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections
  • P. Balázs
  • Mathematics, Computer Science
    Discret. Appl. Math.
  • 2013
A Measure of Directional Convexity Inspired by Binary Tomography
TLDR
A measure of directional convexity of binary images combining various properties of the configuration of 0s and 1s in the binary image, which can be useful in numerous applications of digital image process and pattern recognition, and especially in binary tomography.
An Empirical Study of Reconstructing hv-Convex Binary Matrices from Horizontal and Vertical Projections
TLDR
It is shown that the reconstruction quality can depend not only on the size of the image, but on the number and location of its components, too and the reconstruction time can also be affected by the number of the so-called switching components present in the image.
Binary image reconstruction based on prescribed numerical information
TLDR
Algorithms are developed for solving binary image reconstruction problems given some numerical information on the image and correctness of the algorithms are discussed.
A Spectral Projected Gradient Optimization for Binary Tomography
TLDR
A deterministic binary tomography reconstruction method based on the Spectral Projected Gradient (SPG) optimization approach which is suitable to solve by SPG method and shows competence regarding to the quality of reconstructions.
Discrete Tomography Reconstruction Based on the Multi-well Potential
TLDR
A new discrete tomography reconstruction algorithm developed for reconstruction of images that consist of a small number of gray levels based on the minimization of the objective function which combines the regularized squared projection error with the multi-well potential function.
Energy-Minimization Based Discrete Tomography Reconstruction Method for Images on Triangular Grid
TLDR
An energy-minimization method based on the simulated annealing algorithm to reconstruct the original images is proposed and shown in four regular hexagon shaped test images of approximately 4000 pixels.
Reconstruction of hv-Convex Binary Images: A Survey and Open Questions
Exactly 30 years ago, Attila Kuba published the first paper about the reconstruction of hv-convex binary images from the horizontal and vertical projections. Since then, various aspects of this…
Blood vessels reconstruction in CT with shape prior approach
TLDR
Prior information concerning the shape of the blood vessels is incorporated into the image reconstruction process to improve the image quality and vessels detectability and results demonstrate that the proposed method is potentially useful in clinical use.
Binary Images, M -Vectors, and Ambiguity
TLDR
This work introduces the notion of M-vector of a binary word which allows us to have a linear notation in the form of a unique vector representation of the Parikh matrix of the binary word and extends this notion to a binary image treating it as a binary array over a two-symbol alphabet.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Reconstruction of Binary Images with Few Disjoint Components from Two Projections
TLDR
A backtracking algorithm is developed that works for binary images having components from an arbitrary class and can be incorporated into the reconstruction process, keeping control over the number of components which can increase the speed and accuracy of the reconstruction.
A framework for generating some discrete sets with disjoint components by using uniform distributions
  • P. Balázs
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2008
A decomposition technique for reconstructing discrete sets from four projections
The reconstruction of two-directionally connected binary patterns from their two orthogonal projections
  • A. Kuba
  • Computer Science, Mathematics
  • 1983
An evolutionary algorithm for discrete tomography
  • K. Batenburg
  • Mathematics, Computer Science
    Discret. Appl. Math.
  • 2005
The reconstruction of polyominoes from their orthogonal projections
Binary Tomography for Triplane Cardiography
TLDR
This hypothesis is experimentally validated for the Specific case of a class of binary images representing cardiac cross-sections, where the probability of the occurrence of a particular image of the class is determined by a Gibbs distribution and reconstruction is to be done from the three noisy projections.
Principles of Computerized Tomographic Imaging
The total attenuation suffered by one beam of x-rays as it travels in a straight line through an object can be represented by a line integral. Combining a set of line integrals forms a projection.…
Reconstructing hv-Convex Polyominoes from Orthogonal Projections
Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
...
...