• 沒有找到結果。

Interactive Foreground Extraction using Iterated Graph Cuts

N/A
N/A
Protected

Academic year: 2022

Share "Interactive Foreground Extraction using Iterated Graph Cuts"

Copied!
16
0
0

加載中.... (立即查看全文)

全文

(1)

GrabCut

Interactive Foreground Extraction using Iterated Graph Cuts

Carsten Rother

Vladimir Kolmogorov Andrew Blake

GrabCut GrabCut

Interactive Foreground Extraction Interactive Foreground Extraction

using Iterated Graph Cuts using Iterated Graph Cuts

Carsten Rother Carsten Rother

Vladimir Kolmogorov Vladimir Kolmogorov

Andrew Blake Andrew Blake

Microsoft Research Cambridge - UK

(2)

Photomontage

Photomontage

Photomontage

(3)
(4)

Problem Problem Problem

Fast &

Accurate ?

(5)

What GrabCut does What GrabCut does What GrabCut does

User Input

Result

Magic Wand

(198?)

Intelligent Scissors

Mortensen and Barrett (1995)

GrabCut

Regions Boundary Regions & Boundary

(6)

Framework Framework Framework

Input: Image

Output: Segmentation

Parameters: Colour ,Coherence Energy:

Optimization:

(7)

Graph Cuts

Boykov and Jolly (2001)

Graph Cuts Graph Cuts

Boykov

Boykov and Jolly (2001) and Jolly (2001)

Image Image

Min Cut Min Cut

Cut: separating source and sink; Energy: collection of edges Min Cut: Global minimal enegry in polynomial time

Foreground Foreground

(source) (source)

Background Background

(sink)

(sink)

(8)

Iterated Graph Cut Iterated Graph Cut Iterated Graph Cut

User Initialisation

K-means for learning colour distributions

Graph cuts to infer the segmentation

?

(9)

1 2 3 4

Iterated Graph Cuts Iterated Graph Cuts Iterated Graph Cuts

Energy after each Iteration Result

Gu ara

nte ed to co nve

rge

(10)

Colour Model Colour Model Colour Model

Gaussian Mixture Model (typically 5-8 components)

Foreground &

Background

Background

Foreground

Background

G R

G Iterated R

graph cut

(11)

Coherence Model Coherence

Coherence Model Model

An object is a coherent set of pixels:

Blake et al. (2004): Learn jointly

(12)

Moderately straightforward examples

Moderately straightforward Moderately straightforward

examples examples

… GrabCut completes automatically

(13)

Difficult Examples Difficult Examples Difficult Examples

Camouflage &

Low Contrast Fine structure No telepathy

Initial Rectangle

Initial

Result

(14)

Evaluation – Labelled Database Evaluation Evaluation Labelled Database Labelled Database

Available online: http://research.microsoft.com/vision/cambridge/segmentation/

(15)

Comparison Comparison Comparison

GrabCut Boykov and Jolly (2001)

User Input

Result

(16)

Summary Summary Summary

Magic Wand (198?)

Intelligent Scissors

Mortensen and GrabCut

Rother et al.

Graph Cuts Boykov and

LazySnapping

Li et al. (2004)

參考文獻

相關文件

• 下面介紹三種使用 greedy algorithm 產生 minimum cost s panning

• vertex

Location Context Interpreter block (LeZi-PDA, etc.).. Foreground

• 下面介紹三種使用greedy algorithm產生minimum cost spanning

It costs >1TB memory to simply save the raw  graph data (without attributes, labels nor content).. This can cause problems for

• 有向圖(directed graph)、無向圖(undirected

Graph Algorithms Euler Circuit Hamilton Circuit.. for Sprout 2014 by Chin

= special contextual bandit + verified instances as rewards.. Good Properties of Greedy. Case 1: positive