Discrete tomography. Foundations, algorithms, and applications
From MaRDI portal
Publication:1580609
zbMath0946.00014MaRDI QIDQ1580609
No author found.
Publication date: 26 September 2000
Published in: Applied and Numerical Harmonic Analysis (Search for Journal in Brave)
Biomedical imaging and signal processing (92C55) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to biology (92-06)
Related Items (only showing first 100 items - show all)
Geometric properties of matrices induced by pattern avoidance ⋮ A simulated annealing for reconstructing hv-convex binary matrices ⋮ First-order geometric multilevel optimization for discrete tomography ⋮ New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Weighted microscopic image reconstruction ⋮ Adaptive thresholding of tomograms by projection distance minimization ⋮ The two-dimensional Prouhet-Tarry-Escott problem ⋮ Combinatorial aspects of \(L\)-convex polyominoes ⋮ A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ On the geometric structure of lattice \(U\)-polygons ⋮ A method for reconstructing label images from a few projections, as motivated by electron microscopy ⋮ Binary matrices under the microscope: A tomographical problem ⋮ The Fewest Clues Problem of Picross 3D ⋮ Reconstructing convex matrices by integer programming approaches ⋮ Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections ⋮ Bounds on the quality of reconstructed images in binary tomography ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ Discrete tomography with unknown intensity levels using higher-order statistics ⋮ Characterization of hv-convex sequences ⋮ Sampling, filtering and sparse approximations on combinatorial graphs ⋮ Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses ⋮ Regular switching components ⋮ Multidimensional matrices uniquely recovered by their lines ⋮ Algebraic aspects of emission tomography with absorption. ⋮ On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity ⋮ Early warning on stock market bubbles via methods of optimization, clustering and inverse problems ⋮ On the reconstruction of planar lattice-convex sets from the covariogram ⋮ A formulation of the wide partition conjecture using the atom problem in discrete tomography ⋮ Edge disjoint caterpillar realizations ⋮ Discrete tomography for inscribable lattice sets ⋮ Algebraic aspects of discrete tomography ⋮ A full row-rank system matrix generated along two directions in discrete tomography ⋮ Computational complexity of three-dimensional discrete tomography with missing data ⋮ Planar Configurations Induced by Exact Polyominoes ⋮ Solving the Two Color Problem: An Heuristic Algorithm ⋮ Discrete Tomography Reconstruction Based on the Multi-well Potential ⋮ Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros ⋮ Analysis on the strip-based projection model for discrete tomography ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ On the reconstruction of binary and permutation matrices under (binary) tomographic constraints ⋮ Convex decomposition of \(U\)-polygons ⋮ Scanning integer matrices by means of two rectangular windows ⋮ On image reconstruction algorithms for binary electromagnetic geotomography ⋮ Tile-packing tomography is \(\mathbb{NP}\)-hard ⋮ Quality bounds for binary tomography with arbitrary projection matrices ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Majorization permutahedra and (0,1)-matrices ⋮ A solvable case of image reconstruction in discrete tomography ⋮ Comparison of approaches based on optimization and algebraic iteration for binary tomography ⋮ Complexity results for the horizontal bar packing problem ⋮ Determination of Q-convex sets by X-rays ⋮ Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets ⋮ Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs ⋮ Reconstructing \(hv\)-convex multi-coloured polyominoes ⋮ A full row-rank system matrix generated by the strip-based projection model in discrete tomography ⋮ The projections of convex lattice sets of points in \(\mathbb{E}^2\) ⋮ Reconstructing (0,1)-matrices from projections using integer programming ⋮ Generic iterative subset algorithms for discrete tomography ⋮ On the index of Siegel grids and its application to the tomography of quasicrystals ⋮ Stability of Kronecker coefficients via discrete tomography ⋮ Solving nonograms by combining relaxations ⋮ On some geometric aspects of the class of \(hv\)-convex switching components ⋮ Reconstruction of \(hv\)-convex binary matrices from their absorbed projections ⋮ Uniqueness in discrete tomography of Delone sets with long-range order ⋮ Stability results for uniquely determined sets from two directions in discrete tomography ⋮ On the existence of \(U\)-polygons of class \(c\geq 4\) in planar point sets ⋮ Regularized graph cuts based discrete tomography reconstruction methods ⋮ Further steps on the reconstruction of convex polyominoes from orthogonal projections ⋮ Ambiguous reconstructions of hv-convex polyominoes ⋮ An algorithm for the reconstruction of discrete sets from two projections in presence of absorption ⋮ An evolutionary algorithm for discrete tomography ⋮ Optimization and reconstruction of \(hv\)-convex (0,1)-matrices ⋮ A coordinate ascent approach to tomographic reconstruction of label images from a few projec\-tions ⋮ Discrete tomography by convex--concave regularization and D.C. programming ⋮ An introduction to periodical discrete sets from a tomographical perspective ⋮ Reduction from three-dimensional discrete tomography to multicommodity flow problem ⋮ A sufficient condition for non-uniqueness in binary tomography with absorption ⋮ Reconstruction of convex polyominoes from orthogonal projections of their contours ⋮ Using graphs for some discrete tomography problems ⋮ Optimization and reconstruction of hv-convex (0,1)-matrices ⋮ Reconstruction of discrete sets from two absorbed projections: an algorithm ⋮ A Linear Programming Relaxation for Binary Tomography with Smoothness Priors ⋮ Discrete Point X-Rays of Convex Lattice Sets ⋮ Reconstructing a binary matrix under timetabling constraints ⋮ Discrete Tomography of Mathematcal Quasicrystals: A Primer ⋮ On the X-rays of permutations ⋮ Optimal Ordering of Projections using Permutation Matrices and Angles between Projection Subspaces ⋮ Exact Image Reconstruction from a Single Projection through Real Computation ⋮ A new algorithm for 3D binary tomography ⋮ Detection of the discrete convexity of polyominoes ⋮ \(L\)-rays of permutation matrices and doubly stochastic matrices ⋮ Reconstruction of convex 2D discrete sets in polynomial time ⋮ Reconstructing permutation matrices from diagonal sums ⋮ On the algorithmic inversion of the discrete Radon transform ⋮ A short scientific biography of Maurice Nivat ⋮ Empirical average-case relation between undersampling and sparsity in X-ray CT ⋮ Relaxed and approximate graph realizations ⋮ A study on the existence of null labelling for 3-hypergraphs ⋮ Binary image reconstruction based on prescribed numerical information
This page was built for publication: Discrete tomography. Foundations, algorithms, and applications
