Modeling of front evolution with graph cut optimization

Proceedings - International Conference on Image Processing, ICIP

Volumn 1, Issue , 2006, Pages

  Hang, Chang ^a,b   Qing, Yang ^b   Auer, Manfred ^a   Parvin, Bahram ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b INSTITUTE OF AUTOMATION   (China)

Author keywords

Image color analysis; Image segmentation; Image texture analysis

Indexed keywords

ACTIVE CONTOUR MODELS; ACTIVE CONTOURS; BASIC IDEAS; EDGE WEIGHTS; ENERGY FUNCTIONS; GRADIENT DESCENT OPTIMIZATIONS; GRAPH CUT ALGORITHMS; GRAPH CUTS; IMAGE COLOR ANALYSIS; IMAGE TEXTURE ANALYSIS; LEVEL SET METHODS; SYNTHETIC IMAGES; TEXTURED PATTERNS; TO CURVES;

COMPUTATIONAL EFFICIENCY; CURVE FITTING; DIGITAL IMAGE STORAGE; IMAGE PROCESSING; IMAGE SEGMENTATION; IMAGING SYSTEMS; LEVEL MEASUREMENT; MODAL ANALYSIS; NEURAL NETWORKS; OPTIMIZATION; TEXTURES;

EDGE DETECTION;

EID: 48149107014     PISSN: 15224880     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIP.2007.4378936     Document Type: Conference Paper

References (21)

1. Yuri Boykov and Vladimir Kolmogorov. Computing geodesies and minimal surfaces via graph cuts. In Proc. of IEEE ICCV, 2003.
2. Tony F. Chan and Luminita A. Vese. Active contours without edges. IEEE Transactions on Image Processing, 10:266-277,200.1.
3. William J. Cook, Willian H. Cunningham, William R. Pulleyblank, and Alexander Schrijver. Combinatorial Optimization. John Wiley & Sons, 1998.
4. L Ford, and D Fullkerson. Flows in Network. Princeton University Press, 1962.
5. D Geeig, B Porteous, and A Seheult. Exact maximum, a posteriori estimation for binary images. In Jorunal of the Royal Statistical Society, 51(2):271-279, 1989.
6. Andrew V. Goldberg and Robert E. Tarjan. A new approach to maximum-flow problem.. In Journal of the Association for Computing Machinery, 35(4):921.-940, 1988.
7. Hiroshi Ishikawa. Exact optimization for markov random fields with convex priors. In IEEE Transaction on PAMI, 25(10):1333-1336, 2003.
8. J.Sethian. Level Set methods and Fast Marching Methods. Cambridge University Press, 1999.
9. Vladimir Kolmogorov and Ramin Zabih. What energy functions can be minimized via graph cuts. In IEEE Transaction on PAMI, 26(2):147-159, 2004.
10. Yin Li, Jian Sun, C.K. Tang, and H.Y. Shum. Lazy snapping. In Proc. of ACM SIGGRAPH, pages 303-308, 2004.
11. M.P.D.Carmo. Differential Geometry of Curves and Surfaces. Prentice Hall, 1976.
12. [ 12] S. Osher and R.P. Fedkiw. The Level Set Method and Dynamic Implicit Surfaces. Springer Verlag, 2002.
13. Carsten Rother, Vladimir Kolmogorov, and Andrew Blake. Grabcut-Interactive foreground extraction using iterated graph cuts. In Proc. of ACM SIGGRAPH, pages 309-314, 2004.
14. Mikael Rousson, Thomas Brox, and Rachid Deriche. Active unsupervised texture segmentation on a diffusion based feature space. In Proceedings of the Conference on Computer Vision and Pattern Recognition, 2003.
15. Sebastien Roy. Stereo without epipolar lines: A maximum-flow formulation. In International Journal of Computer Vision, 34:147-162, 1999.
16. S.Geman and D.Geman. Stochastic relaxation, gibbs distribution and the bayesian restoration, of images. In IEEE Transaction on PAMI, 6(6):721-741, 1984.
17. S.Roy and I.Cox. A maximum-flow formulation of the n-camera stereo correspondence problem. In Proc. of IEEE ICCV, pages 492-499, 1998.
18. Marshall F. Tappen and William T. Freeman. Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters. In Proc. of IEEE ICCV, pages 900-907, 2003.
19. V.Caselles, R.Kimmel, and G.Sapiro. Geodesic active contours. International Journal of Computer Vision, 22:61-79, 1997.
20. Y.Boykov and Marie-Pierre Jolly. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In Proc. of IEEE ICCV, pages 105-112, 2001.
21. Y.Boykov, Olga Veksler, and Ramin Zabih. Fast Approximate Energy Minimization via Graph Cuts. In IEEE Transaction on PAMI, 23(11): 1222-1239, 2001.