real-time exemplar-based face sketch synthesis

Post on 24-Feb-2016

78 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

DESCRIPTION

Real-Time Exemplar-Based Face Sketch Synthesis. Pipeline illustration. Qingxiong Yang 1. Ming-Hsuan Yang 2. Yibing Song 1. Linchao Bao 1. 1 City University of Hong Kong. 2 University of California at Merced. Note: containing animations. - PowerPoint PPT Presentation

TRANSCRIPT

Real-Time Exemplar-Based Face Sketch Synthesis

Pipeline illustration

Note: containing animations

Yibing Song1 Linchao Bao1 Qingxiong Yang1 Ming-Hsuan Yang2

1City University of Hong Kong2University of California at Merced

Our assumption: a database containing photo-sketch pairs

1. photo database 2. sketch database

Aligned

Coarse Sketch GenerationStep 1: KNN search

p

Test photo patch Test photo

Training photo dataset

𝑻 𝒑𝑻 𝒑

𝑻 𝒑

Matched photo patch

Relative position

Similarly

Matched photo patch

Relative position

βˆ†π’‘π‘²[ ]βˆ†π’‘ =

Test photo patch

Matched photo patch

Matched photo patch

Matched photo patch

π’™π’‘πŸ βˆ™ +𝒙𝒑

𝟐 βˆ™ +𝒙𝒑𝑲 βˆ™ ΒΏ

2. Compute linear mapping function defined by

Coarse Sketch GenerationStep 2: Linear Estimation from Photos

Matched sketch pixel

p

Matched sketch pixel

Test photo

𝑺𝑷 +βˆ†π’‘πŸ

❑

𝑺𝑷 +βˆ†π’‘πŸ

❑

Matched sketch pixel𝑺𝑷 +βˆ†π’‘π‘²

❑

π’™π’‘πŸ βˆ™ +𝒙𝒑

𝟐 βˆ™ +𝒙𝒑𝑲 βˆ™ ΒΏ

Estimation on pixel p

Repeat for every pixel

Coarse sketch

Coarse Sketch GenerationStep 3: Apply Linear Mapping to Sketches

𝑬𝒑

Because: coarse sketch image is not natural. is not a good similarity measurement between p and r.

Denoising: State-of-the-art Image Denoising Algorithms

Coarse sketch

Nonlocal Means (NLM)

p

r

𝑆𝑝𝑁𝐿𝑀=ΒΏ πΈπ‘Ÿ

𝑀(𝑝 ,π‘Ÿ )+β‹―

For all pixels in the neighbor of p:

Little improvement

After NLM

q

πΈπ‘žπ‘€(𝑝 ,π‘ž)+ΒΏ

[NLM] A. Buades, B. Coll and J.-M. Morel, A non-local algorithm for image denoising, CVPR 2005.

Motivation – BM3D

BM3D groups correlated patches in the noisy image to create multiple estimations.

Our idea for sketch denoising: group highly similar sketch estimations.

How BM3D works

[BM3D] K. Dabov, A. Foi, V. Katkovnik, and K. Egiazarian, β€œImage denoising by sparse 3D transform-domain collaborative filtering,” IEEE Trans. Image Process., vol. 16, no. 8, pp. 2080-2095, August 2007.

𝑀(𝑝 ,π‘ž) βˆ™

Proposed Spatial Sketch Denoising Algorithm (SSD)

Test photo

q

𝑺𝒒+βˆ†π’’πŸ

❑

p

Matched sketch

𝑺𝒑+βˆ†π’’πŸ

❑

Similarly ,

𝑺𝒑+βˆ†π’’πŸ

❑

𝑺𝒒+βˆ†π’’πŸ

❑

,

𝑺𝒒+βˆ†π’’π‘²

❑

𝑺𝒑+βˆ†π’’π‘²

β‘π’™π’’πŸ βˆ™ +𝒙𝒒

𝟐 βˆ™ +𝒙𝒒𝑲 βˆ™ ΒΏ

𝑬𝒑𝒒

p

Estimations from pixels in local region

r 𝑬𝒑𝒓

Averaging estimations to generate output sketch value.

Nonlocal Means (NLM):

𝑆𝑝𝑁𝐿𝑀=ΒΏ πΈπ‘ž +β‹―πΈπ‘Ÿπ‘€(𝑝 ,π‘Ÿ )βˆ™+ΒΏ

Proposed SSD:

𝑆𝑝𝑆𝑆𝐷=ΒΏ +β‹―+ΒΏ1 βˆ™π‘¬π’‘

𝒒 1 βˆ™π‘¬π’‘π’“

p

Proposed SSD is robust to

Input 5x5 local region

11x11 local region

17x17 local region

23x23 local region

Note: When is sufficient large (i.e., >100), the proposed SSD can effectivelysuppress noise while preserving facial details like the tiny eye reflections (see close-ups).

Robustness to the region size - the only parameter involved

top related