Skip to main content
SpringerLink
Log in

Integer Programming Methods in Image Processing and Bayes Estimation

  • Chapter
Book cover Soft Computing in Image Processing

Part of the book series: Studies in Fuzziness and Soft Computing ((STUDFUZZ,volume 210))

Abstract

For the last few decades significant progress in image processing has been achieved. Nowadays various types of images are widely employed in medical and industrial application, sciences and engineering, surveillance systems etc. The progress can be explained not only by rapid development of computers and their hardware but also by advances in computational techniques. Usually, computations to enhance quality of pictures, to segment them or to recognize image objects require enormous calculations. The real use of the image estimators is restricted by opportunity to calculate or to evaluate satisfactory their values. Special methods and techniques have been developed to provide that.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boykov Y., Veksler O., Zabih R. (2001), Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11):1222-1239.

    Article  Google Scholar 

  2. Cherkassky B., Goldberg A. (1997), On implementing push-relabel method for the maximum flow problem, Algorithmica 19:390-410.

    Article  MATH  MathSciNet  Google Scholar 

  3. Dahl G., Flatberg T. (2003), Reconstructing hv-convex (0,1)-matrices by optimization methods, Electonics Notes in Disc. Math. 12.

    Google Scholar 

  4. Darbon J., Sigelle M. (2004), Exact optimization of discrete constrained total variation minimization problems. In: Klette R. and, Zunic J. (eds) Proceedings of the Tenth International Workshop on Combinatorial Image Analysis (IWCIA 2004). Auckland, New Zealand.

    Google Scholar 

  5. Darbon J., Sigelle M. (2005), A fast and exact algorithm for total variation minimization. In: Proceedings of the 2nd Iberian Conference on Pattern Recognition and Image Analysis (IbPRIA 2005). Estoril, Portugal.

    Google Scholar 

  6. Geman S., Geman D. (1984), Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images IEEE Transactions on Pattern Analysis and Machine Intelligence 6(6):721–741.

    Article  MATH  Google Scholar 

  7. Goldberg A., Tarjan R. (1988), A new approach to the maximum flow problem, J ACM 35:921-940.

    Article  MATH  MathSciNet  Google Scholar 

  8. Greig D., Porteous B., Seheult A. (1989), Exact maximum a posteriori estimation for binary images, J R Statist Soc B 58:271–279.

    Google Scholar 

  9. Fleischer L., Iwata S. (2003), A push-relabel framework for submodular function minimization and applications to parametric optimization, Discrete Applied Mathematics 131(2):311–322.

    Article  MATH  MathSciNet  Google Scholar 

  10. Ishikawa H. (2003), Exact optimization for Markov random fields with convex priors, IEEE Transactions on Pattern Analysis and Machine Intelligence 25:1333-1336.

    Article  Google Scholar 

  11. Iwata S., Fleischer L., Fujishige S. (1999), A strongly polynomial-time algorithm for minimizing submodular functions, RIMS Kokyuroku 1120:11–23.

    MATH  MathSciNet  Google Scholar 

  12. Kolmogorov V., Zabih R. (2002), What energy functions can be minimized via graph cuts?, IEEE Transactions on Pattern Analysis and Machine Intelligence 26(2):147-159.

    Article  Google Scholar 

  13. Papadimitriou C., Steiglitz K. (1982), Combinatorial optimization: algorithm and complexity. Prentice-Hall, New Jersey.

    MATH  Google Scholar 

  14. Picard J., Ratliff H. (1975), Minimal cuts and related problems, Networks 5:357-370.

    Article  MATH  MathSciNet  Google Scholar 

  15. Schellewald C., Schnorr C. (2003), Subgraph matching with semidefinite programming. In: Proc. Int. Workshop on Combinatorial Image Analysis (IWCIA’03). Palermo, Italy, May 14-16 2003.

    Google Scholar 

  16. Shokoufandeh A., ven Dickinson S. (2002), Graph-theoretical methods in computer vision. In: Khosrovshahi G et al (eds) Theoretical aspects of computer science. Springer-Verlag, Berlin Heidelberg New York.

    Google Scholar 

  17. Wolsey L. (1998), Integer programming. John Willey & Sons.

    Google Scholar 

  18. Zalesky B. (2002), Network flow optimization for restoration of images, JAM 2(4):199-218.

    MATH  MathSciNet  Google Scholar 

  19. Zalesky B. (2004), Gibbs classifiers, Probab Theory and Math Stat (70):36-46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. United Institute of Informatics Problems National Academy of Sciences, Surganov Street 6, Minsk, 220012, Belarus

    Boris A. Zalesky

Authors
  1. Boris A. Zalesky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 – S9, Gent, 9000, Belgium

    Mike Nachtegael , Dietrich Van der Weken  & Etienne E. Kerre ,  & 

  2. Department of Telecommunications and Information Processing, Ghent University, Sint-Pietersnieuwstraat 41, Gent, 9000, Belgium

    Wilfried Philips

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer

About this chapter

Cite this chapter

Zalesky, B.A. (2007). Integer Programming Methods in Image Processing and Bayes Estimation. In: Nachtegael, M., Van der Weken, D., Kerre, E.E., Philips, W. (eds) Soft Computing in Image Processing. Studies in Fuzziness and Soft Computing, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-38233-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-38233-1_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38232-4

  • Online ISBN: 978-3-540-38233-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation