Access the full text.
Sign up today, get DeepDyve free for 14 days.
RW Irving, MR Jerrum (1994)
Three-dimensional data security problemsSIAM J. Comput., 23
P Balázs (2009)
A benchmark set for the reconstruction of hv-convex discrete setsDiscret. Appl. Math., 157
S Brunetti, A Del Lungo, F Del Ristoro, A Kuba, M Nivat (2001)
Reconstruction of 8- and 4-connected convex discrete sets from row and column projectionsLinear Algebra Appl., 339
T Back (1996)
Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms
P Maragos, RW Schafer (1986)
Morphological skeleton representation and coding of binary imagesIEEE Trans. Acoustics Speech Signal Process., 34
SV Aert, KJ Batenburg, MD Rossell, R Erni, GV Tendeloo (2011)
Three-dimensional atomic imaging of crystalline nanoparticlesNature, 470
S Kirkpatrick, CDJr Gelatt, MP Vecchi (1983)
Optimization by simulated annealingScience, 220
T Schüle, C Schnörr, S Weber, J Hornegger (2005)
Discrete tomography by convex-concave regularization and D.C. programmingDiscret. Appl. Math., 151
E Barcucci, A Del Lungo, M Nivat, R Pinzani (1996)
Reconstructing convex polyominoes from horizontal and vertical projectionsTheor. Comput. Sci., 155
N Hantos, P Balázs (2013)
The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-completeFundamenta Informaticae, 125
KJ Batenburg, S Bals, J Sijbers, C Kuebel, PA Midgley, JC Hernandez, U Kaiser, ER Encina, EA Coronado, GV Tendeloo (2009)
3D imaging of nanomaterials by discrete tomographyUltramicroscopy, 109
A Kuba (1999)
Reconstruction in different classes of 2D discrete setsLect. Notes Comput. Sci., 1568
H Blum (1973)
Biological shape and visual science (Part I)J. Theor. Biol., 38
W Hochstättler, M Loebl, C Moll (1996)
Generating convex polyominoes at randomDiscret. Math., 153
GJ Woeginger (2001)
The reconstruction of polyominoes from their orthogonal projectionsInf. Process. Lett., 77
A Nagy, A Kuba (2006)
Parameter settings for reconstructing binary matrices from fan-beam projectionsJ. Comput. Inf. Technol., 14
J Serra (1982)
Image Analysis and Mathematical Morphology
MR Garey, DS Johnson (1979)
Computers and Intractibility: A Guide to the Theory of NP-Completeness
P Giblin, BB Kimia (2004)
A formal classification of 3D medial axis points and their local geometryIEEE Trans. Pattern Anal. Machine Intell., 26
HJ Ryser (1957)
Combinatorial properties of matrices of zeros and onesCanad. J. Math., 9
In binary tomography, the goal is to reconstruct binary images from a small set of their projections. This task can be underdetermined, meaning that several binary images can have the same projections, especially when only one or two projections are given. On the other hand, it is known that a binary image can be exactly reconstructed from its morphological skeleton when all skeletal labels are known. However, if only the skeletal points are given, different labellings yield different reconstructed images. In this paper, we consider a mixture of the above problems, reconstructing a binary image from few projections and the morphological skeleton. We show that the problem is NP-complete, yet a result with low projection and pixel error usually can be achieved, even if only a single projection is available. Three different variants of a method based on Simulated Annealing are developed and compared with respect to reconstruction time and error using artificial binary images.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Nov 21, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.