Very loopy belief propagation for unwrapping phase images

Advances in Neural Information Processing Systems

Volumn , Issue , 2002, Pages

  Froy, Brondan J ^a   Koetter, Ralf ^b   Petrovic, Nemanja ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; INFERENCE ENGINES; MAGNETIC RESONANCE IMAGING; SYNTHETIC APERTURE RADAR; TELECOMMUNICATION;

BELIEF PROPAGATION; CYCLE LENGTH; DECODING ALGORITHM; ERROR-CORRECTING; GAUSSIAN CHANNELS; LOOPY BELIEF PROPAGATION; PHASE UNWRAPPING PROBLEM; PROBABILISTIC INFERENCE;

GRAPH THEORY;

EID: 84898966500     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Achan, K., Prey, B. J., and Koetter, R. 2001. A factorized variational technique for phase unwrapping in Markov random fields. In Uncertainty in Artificial Intelligence 2001. Seattle, Washington.
2. Chen, C. W. and Zebker, H. A. 2000. Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms. Journal of the Optical Society of America A, 17(3):401-414.
3. Freeman, W. and Pasztor, E. 1999. Learning low-level vision. In Proceedings of the International Conference on Computer Vision, pages 1182-1189.
4. Frey, B. J. 2000. Filling in scenes by propagating probabilities through layers and into appearance models. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.
5. Frey, B. J. and Kschischang, F. R. 1996. Probability propagation and iterative decoding. In Proceedings of the 34th Allerton Conference on Communication, Control and Computing 1996.
6. Ghiglia, D. C. and Pritt, M. D. 1998. Two-Dimensional Phase Unwrapping. Theory, Algorithms and Software. John Wiley & Sons.
7. Koetter, R., Frey, B. J., Petrovic, N., and Munson, Jr. D. C. 2001. Unwrapping phase images by propagating probabilities across graphs. In Proceedings of the International Conference on Acoustics, Speech and Signal Processing. IEEE Press.
8. Kschischang, F. R. and Frey, B. J. 1998. Iterative decoding of compound codes by probability propagation in graphical models. IEEE Journal on Selected Areas in Communications, 16(2):219-230.
9. MacKay, D. J. C. and Neal, R. M. 1995. Good codes based on very sparse matrices. In Boyd, C., editor, Cryptography and Coding. 5th IMA Conference, number 1025 in Lecture Notes in Computer Science, pages 100-111. Springer, Berlin Germany.
10. McEliece, R. J., MacKay, D. J. C., and Cheng, J. F. 1998. Turbo-decoding as an instance of Pearl's 'belief propagation' algorithm. IEEE Journal on Selected Areas in Communications, 16.
11. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo CA.
12. Weiss, Y. and Freeman, W. 2001. On the optimaility of solutions of the max-product belief propagation algorithm in artbitrary graphs. IEEE Transactions on Information Theory, Special Issue on Codes on Graphs and Iterative Algorithms, 47(2):736-744.
13. Wiberg, N., Loeliger, H.-A., and Koetter, R. 1995. Codes and iterative decoding on general graphs. European Transactions on Telecommunications, 6:513-525.
14. Yedidia, J., Freeman, W. T., and Weiss, Y. 2001. Generalized belief propagation. In Advances in Neural Information Processing Systems 13. MIT Press, Cambridge MA.