Approximating Bicolored Images from Discrete Projections

DOI10.1007/978-3-642-21073-0_28MaRDI QIDQ3003545zbMATH OpenOpenAlexFDO

Authors Fethi Jarray, Ghassen Tlig

Publication date 27 May 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21073-0_28

zbMATH Keywords

heuristicsimage reconstructiondiscrete tomography

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Approximation algorithms (68W25)

Recommendations

• A Lagrangean approach to reconstruct bicolored images from discrete orthogonal projections
• Reconstruction of Bicolored Images
• Reconstruction of nearly convex colored images
• Approximating hv-Convex Binary Matrices and Images from Discrete Projections
• scientific article; zbMATH DE number 1418265
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• scientific article; zbMATH DE number 1738339

Cites work

• scientific article; zbMATH DE number 1551786 (Why is no real title available?)
• A Lagrangean approach to reconstruct bicolored images from discrete orthogonal projections
• A model for learning human vascular anatomy
• A solvable case of image reconstruction in discrete tomography
• A theorem on flows in networks
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• An evolutionary algorithm for discrete tomography
• Beyond the flow decomposition barrier
• Combinatorial Properties of Matrices of Zeros and Ones
• Discrete tomography methods for nondestructive testing
• Network flow algorithms for discrete tomography
• On the computational complexity of determining polyatomic structures by X-rays
• On the computational complexity of reconstructing lattice sets from their X-rays
• On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
• On tiling under tomographic constraints.
• Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Reconstruction of binary matrices under adjacency constraints
• Solving problems of discrete tomography application in workforce scheduling
• Solving some instances of the 2-color problem
• The network flows approach for matrices with given row and column sums
• Using graphs for some discrete tomography problems
• X-rays characterizing some classes of discrete sets

Cited in

(7)

• Solving the two color problem: an heuristic algorithm
• scientific article; zbMATH DE number 1418265 (Why is no real title available?)
• Reconstruction of Bicolored Images
• Approximating binary images from discrete X-rays
• A Lagrangean approach to reconstruct bicolored images from discrete orthogonal projections
• A reconstruction algorithm for a subclass of instances of the 2-color problem
• Reconstruction of nearly convex colored images

This page was built for publication: Approximating Bicolored Images from Discrete Projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003545)