Large-Scale Integer Programs in Image Analysis

References

  • Barahona F., Jensen D. Plant location with minimum inventory. Math. Programming (1998) 83(1):101–111CrossrefGoogle Scholar
  • Besag J. On the statistical analysis of dirty pictures. J. Royal Statist. Soc., Series B (1986) 48(3):259–302Google Scholar
  • Besag J. Towards Bayesian image analysis. J. Appl. Statist. (1989) 16(3):395–407CrossrefGoogle Scholar
  • Chopra S., Rao M. On the multiway cut polyhedron. Networks (1991) 21:51–89CrossrefGoogle Scholar
  • CPLEX Using the CPLEX callable library. (1997) . Technical Report, CPLEX Optimization, Inc., Incline Village, NVGoogle Scholar
  • Cunningham W. The optimal multiterminal cut problem. DIMACS Series in Discrete Math. and Theoretical Comput. Sci. (1991) 5:105–120CrossrefGoogle Scholar
  • Dahl G. Polytopes related to some polyhedral norms. Oper. Res. Lett. (1998) 226:49–54CrossrefGoogle Scholar
  • Dahl G., Storvik G. Integer programs in image analysis. (2000) . Technical Report 287, University of Oslo, Dept. of Informatics, Oslo, NorwayGoogle Scholar
  • Dahlhaus E., Johnson D., Papadimitriou C., Seymour P., Yannakakis M. The complexity of multiterminal cuts. SIAM J. Comput. (1994) 23:864–894CrossrefGoogle Scholar
  • Geman S., Geman D. Stochastic relaxation, Gibbs distribution, and Bayesian restoration of images. IEEE Trans. on Pattern Analysis and Machine Intelligence (1984) 6(6):721–741CrossrefGoogle Scholar
  • Golumbic M.Algorithmic Graph Theory and Perfect Graphs (1980) (Academic Press, New York) CrossrefGoogle Scholar
  • Greig D., Porteous B., Seheult A. Exact maximum a posterior estimation for binary images. J. Royal Statist. Soc. Series B (1989) 51:271–279Google Scholar
  • Johnson E., Mehrotra A., Nemhauser G. Min-cut clustering. Math. Programming (1993) 62:133–151CrossrefGoogle Scholar
  • Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1988) (Wiley, New York) CrossrefGoogle Scholar
  • Storvik G., Dahl G. Lagrangian based methods for finding MAP solutions for MRF models. IEEE Trans. Image Processing (2000) 9(3):469–479CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.