- 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.
python main.py
We compare against the result of using node only & node + edge (spectral matching).
| reference image | target image | node matching | spectral matching |
|---|---|---|---|
 |
 |
 |
 |