Dongquan Liu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Jun Yu 0002

> Home > Persons > Dongquan Liu

Publications

2012
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/tsmc/YuLTS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsmc/YuLTS12
Jun Yu, Dongquan Liu, Dacheng Tao, Hock Soon Seah:
On Combining Multiple Features for Cartoon Character Retrieval and Clip Synthesis. IEEE Trans. Syst. Man Cybern. Part B 42(5): 1413-1427 (2012)
2011
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/cgf/LiuCYGTS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cgf/LiuCYGTS11
Dongquan Liu, Quan Chen, Jun Yu, Huiqin Gu, Dacheng Tao, Hock Soon Seah:
Stroke Correspondence Construction Using Manifold Learning. Comput. Graph. Forum 30(8): 2194-2207 (2011)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/tip/YuLTS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tip/YuLTS11
Jun Yu, Dongquan Liu, Dacheng Tao, Hock Soon Seah:
Complex Object Correspondence Construction in Two-Dimensional Animation. IEEE Trans. Image Process. 20(11): 3257-3269 (2011)
2010
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jvca/YuLS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jvca/YuLS10
Jun Yu, Dongquan Liu, Hock Soon Seah:
Transductive graph based cartoon synthesis. Comput. Animat. Virtual Worlds 21(3-4): 277-288 (2010)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.