Approximating Bicolored Images from Discrete Projections
From MaRDI portal
Publication:3003545
DOI10.1007/978-3-642-21073-0_28zbMATH Open1330.68304OpenAlexW1856641216MaRDI QIDQ3003545FDOQ3003545
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
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Approximation algorithms (68W25)
Cites Work
- A theorem on flows in networks
- On tiling under tomographic constraints.
- 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.
- Beyond the flow decomposition barrier
- Reconstruction of binary matrices under adjacency constraints
- Combinatorial Properties of Matrices of Zeros and Ones
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- A solvable case of image reconstruction in discrete tomography
- Using graphs for some discrete tomography problems
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- X-rays characterizing some classes of discrete sets
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
- Discrete tomography methods for nondestructive testing
- The network flows approach for matrices with given row and column sums
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- On the computational complexity of determining polyatomic structures by X-rays
- Solving some instances of the 2-color problem
- An evolutionary algorithm for discrete tomography
- Solving problems of discrete tomography application in workforce scheduling
- Network flow algorithms for discrete tomography
- Title not available (Why is that?)
- A Lagrangean approach to reconstruct bicolored images from discrete orthogonal projections
- A model for learning human vascular anatomy
Cited In (6)
- Title not available (Why is that?)
- 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
- Solving the two color problem: an heuristic algorithm
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)
