Reconstructing (0,1)-matrices from projections using integer programming

DOI10.1007/S10589-007-9116-YMaRDI QIDQ1001203zbMATH OpenOpenAlexFDO

Authors Geir Dahl, Truls Flatberg

Publication date 13 February 2009

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-007-9116-y

zbMATH Keywords

Discrete tomographyInteger programmingVariable splitting

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Integer programming (90C10)

Recommendations

• Reconstructing convex matrices by integer programming approaches
• scientific article; zbMATH DE number 2087481
• Reconstruction of binary matrices under adjacency constraints
• Reconstruction of binary matrices under adjacency constraints
• Reconstruction of matrices from submatrices
• Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
• Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
• Reconstruction of binary matrices under fixed size neighborhood constraints
• Optimization and reconstruction of hv-convex (0,1)-matrices
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1551775 (Why is no real title available?)
• Approximating binary images from discrete X-rays
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Discrete tomography. Foundations, algorithms, and applications
• Layering strategies for creating exploitable structure in linear and integer programs
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
• Optimization of Convex Risk Functions
• Speeding up stochastic reconstructions of binary images from limited projection directions

Cited in

(5)

• \(J\)-configurations of (0, 1)-matrices and their invariants
• Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
• Optimization and reconstruction of hv-convex (0,1)-matrices
• A generalized projective reconstruction theorem and depth constraints for projective factorization
• Reconstructing convex matrices by integer programming approaches

Describes a project that uses

Uses Software

• MCF

This page was built for publication: Reconstructing (0,1)-matrices from projections using integer programming

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