As applied in the field of computer vision, graph cuts can be employed to efficiently solve a wide variety of low-level computer vision problemsâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, asâ€¦Â (More)

Is this relevant?

2009

2009

- Frank R. Schmidt, Eno TÃ¶ppe, Daniel Cremers
- 2009 IEEE Conference on Computer Vision andâ€¦
- 2009

We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work and leads to an efficientâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Pushmeet Kohli, Philip H. S. Torr
- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2007

In this paper, we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm canâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Yuri Boykov, Gareth Funka-Lea
- International Journal of Computer Vision
- 2006

Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paperâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Daniel Freedman, Petros Drineas
- 2005 IEEE Computer Society Conference on Computerâ€¦
- 2005

The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions canâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- José M. Bioucas-Dias, GonÃ§alo ValadÃ£o
- IEEE Transactions on Image Processing
- 2005

Phase unwrapping is the inference of absolute phase from modulo-2pi phase. This paper introduces a new energy minimizationâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Pushmeet Kohli, Philip H. S. Torr
- Tenth IEEE International Conference on Computerâ€¦
- 2005

In this paper, we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm canâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Daniel Freedman, Tao Zhang
- 2005 IEEE Computer Society Conference on Computerâ€¦
- 2005

Interactive or semi-automatic segmentation is a useful alternative to pure automatic segmentation in many applications. Whileâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Yuri Boykov, Vladimir Kolmogorov
- ICCV
- 2003

Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation methodâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Vivek Kwatra, Arno SchÃ¶dl, Irfan A. Essa, Greg Turk, Aaron F. Bobick
- ACM Trans. Graph.
- 2003

In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sampleâ€¦Â (More)

Is this relevant?