phv2312 / graph_matching_idsc

Inner Distance Shape Context (IDSC) & Spectral Matching for Line-art Colorization.

Graph Matching Line-Art Colorization

Features

• Graph matching approach for line-art colorization
• Many-to-one constraint, greedy algorithm instead of hungarian in the original paper.
• We use IDSC instead of deep feature embedding.

Entry point

python main.py 

Some results

We compare against the result of using node only & node + edge (spectral matching).

reference image	target image	node matching	spectral matching

References

• Anime Sketch Colorization by Component-based Matching using Deep Appearance Features and Graph Representation
• Shape Classification Using the Inner-Distance