Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Dianhui Chu

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 Xin Hu 0010

> Home > Persons > Dianhui Chu

Publications

2022
[c43]
- view
  authority control:
- export record
  dblp key:
  - conf/apit/KangC0TC22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/apit/KangC0TC22
Yuhua Kang, Guoqing Chao, Xin Hu, Zhiying Tu, Dianhui Chu:
Deep Learning for Fine-Grained Image Recognition: A Comprehensive Study. APIT 2022: 31-39
2020
[j23]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/HuCLDCZAHJD20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/HuCLDCZAHJD20
Xin Hu, Dianhui Chu, Zhengzuo Li, Ruixuan Dai, Yang Cui, Zhiyuan Zhou, Boyang An, Yongqing Han, Chunmao Jiang, Deqiong Ding:
Coarse-to-Fine Activity Annotation and Recognition Algorithm for Solitary Older Adults. IEEE Access 8: 4051-4064 (2020)
[j22]
- view
  authority control:
- export record
  dblp key:
  - journals/bspc/HuDLGJLZC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bspc/HuDLGJLZC20
Xin Hu, Deqiong Ding, Zhengzuo Li, Quanxu Ge, Chunmao Jiang, Jing Li, Zhiyuan Zhou, Dianhui Chu:
Axis-guided patch based accurate segmentation for pathological vessels using adaptive weight sparse representation. Biomed. Signal Process. Control. 57 (2020)

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.