Skip to main content
Log in

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

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We study the problem of reconstructing (0,1)-matrices based on projections along a small number of directions. This discrete inverse problem is generally hard to solve for more than 3 projection directions. Building on previous work by the authors, we give a problem formulation with the objective of finding matrices with the maximal number of neighboring ones. A solution approach based on variable splitting and the use of subgradient optimization is given. Further, computational results are given for some structured instances. Optimal solutions are found for instances with up to 10,000 binary variables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Batenburg, K.J.: Reconstructing binary images from discrete X-rays. Technical report, CWI Report PNA-E0418 (2004)

  2. Carvalho, B.M., Herman, G.T., Matej, S., Salzberg, C., Vardi, E.: Binary tomography for triplane cardiography. In: Kuba, A., Samal, M., Todd-Pokropek, A. (eds.) Information Processing in Medical Imaging. Springer, Berlin (1999)

    Google Scholar 

  3. Crainic, T.G., Frangioni, A., Gendron, B.: Bundle-base relaxation methods for multicommodity capacitated fixed charge network design. Discrete Appl. Math. 112, 73–99 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dahl, G., Flatberg, T.: Optimization and reconstruction of hv-convex (0,1)-matrices. Discrete Appl. Math. 151, 93–105 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gardner, R.J., Gritzmann, P.: Uniqueness and complexity in discrete tomography. In: Hermann, G.T., Kuba, A. (eds.) Discrete Tomography: Foundations, Algorithms and Applications, pp. 85–114. Birkhäuser, Basel (1999)

    Google Scholar 

  6. Geman, D., Geman, S., Graffigne, C., Dong, P.: Boundary detection by constrained optimization. IEEE Trans. Pattern Anal. Mach. Intell. 12, 609–628 (1990)

    Article  Google Scholar 

  7. Glover, F., Klingman, D.: Layering strategies for creating exploitable structure in linear and integer programs. Math. Prog. 40, 165–181 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gritzmann, P., de Vries, S., Wiegelmann, M.: Approximating binary images from discrete X-rays. SIAM J. Comput. 11(2), 522–546 (2000)

    MATH  Google Scholar 

  9. Gritzmann, P., Prangenberg, D., de Vries, S., Wiegelmann, M.: Success and failure of certain reconstruction and uniqueness algorithms in discrete tomography. Int. J. Imaging Syst. Technol. 9, 101–109 (1998)

    Article  Google Scholar 

  10. Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Basel (1999)

    MATH  Google Scholar 

  11. Löbel, A.: Mcf—a network simplex implementation. http://www.zib.de/Optimization/Software/Mcf/

  12. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)

    MATH  Google Scholar 

  13. Ruszczynski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  14. Vardi, E., Herman, G., Yung Kong, T.: Speeding up stochastic reconstruction of binary images from limited projection directions. Linear Algebra Appl. 339, 75–89 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Truls Flatberg.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dahl, G., Flatberg, T. Reconstructing (0,1)-matrices from projections using integer programming. Comput Optim Appl 42, 141–154 (2009). https://doi.org/10.1007/s10589-007-9116-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9116-y

Keywords

Navigation