Zobrazeno 1 - 10
of 412
pro vyhledávání: '"Danny Z. Chen"'
Autor:
Jintai Chen, Shuai Huang, Ying Zhang, Qing Chang, Yixiao Zhang, Dantong Li, Jia Qiu, Lianting Hu, Xiaoting Peng, Yunmei Du, Yunfei Gao, Danny Z. Chen, Abdelouahab Bellou, Jian Wu, Huiying Liang
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-13 (2024)
Abstract Early detection is critical to achieving improved treatment outcomes for child patients with congenital heart diseases (CHDs). Therefore, developing effective CHD detection techniques using low-cost and non-invasive pediatric electrocardiogr
Externí odkaz:
https://doaj.org/article/4c34fb493748466c9c5fca70e5485f5c
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-10 (2023)
Abstract Deep learning (DL) based detection models are powerful tools for large-scale analysis of dynamic biological behaviors in video data. Supervised training of a DL detection model often requires a large amount of manually-labeled training data
Externí odkaz:
https://doaj.org/article/de846acb5b63467cbc31d73e71a723ec
Autor:
M. Kathleen Pitirri, Emily L. Durham, Natalie A. Romano, Jacob I. Santos, Abigail P. Coupe, Hao Zheng, Danny Z. Chen, Kazuhiko Kawasaki, Ethylin Wang Jabs, Joan T. Richtsmeier, Meng Wu, Susan M. Motch Perrine
Publikováno v:
Frontiers in Genetics, Vol 13 (2022)
The Fgfr2cC342Y/+ Crouzon syndrome mouse model carries a cysteine to tyrosine substitution at amino acid position 342 (Cys342Tyr; C342Y) in the fibroblast growth factor receptor 2 (Fgfr2) gene equivalent to a FGFR2 mutation commonly associated with C
Externí odkaz:
https://doaj.org/article/0837681572d84edcb66a1764254c7951
Autor:
Tianxiao Hu, Hao Zheng, Chen Liang, Sirou Zhu, Natalie Imirzian, Yizhe Zhang, Chaoli Wang, David P. Hughes, Danny Z. Chen
Publikováno v:
Visual Informatics, Vol 4, Iss 1, Pp 58-70 (2020)
We present AntVis, a web-based visual analytics tool for exploring ant movement data collected from the video recording of ants moving on tree branches. Our goal is to enable domain experts to visually explore massive ant movement data and gain valua
Externí odkaz:
https://doaj.org/article/8d6062c8f381438c93e40ef86cb30305
Publikováno v:
BME Frontiers, Vol 2022 (2022)
Objective and Impact Statement. Distinguishing tumors from normal tissues is vital in the intraoperative diagnosis and pathological examination. In this work, we propose to utilize Raman spectroscopy as a novel modality in surgery to detect colorecta
Externí odkaz:
https://doaj.org/article/d82db94d9de84a31833c890f666985ba
Publikováno v:
Frontiers in Medicine, Vol 8 (2021)
From diagnosing cardiovascular diseases to analyzing the progression of diabetic retinopathy, accurate retinal artery/vein (A/V) classification is critical. Promising approaches for A/V classification, ranging from conventional graph based methods to
Externí odkaz:
https://doaj.org/article/dcf8bea666134b4785802bcac8619162
Autor:
Wenzhe Wang, Ruiwei Feng, Jintai Chen, Yifei Lu, Tingting Chen, Hongyun Yu, Danny Z. Chen, Jian Wu
Publikováno v:
IEEE Access, Vol 7, Pp 128796-128805 (2019)
Accurate and automatic segmentation of pulmonary nodules in 3D thoracic Computed Tomography (CT) images is of great significance for Computer-Aided medical Diagnosis (CAD) of lung cancer. Currently, this important task remains challenging for lack of
Externí odkaz:
https://doaj.org/article/89d0a9b9988c42dea31da75ca62728d7
Publikováno v:
BMC Genomics, Vol 18, Iss S10, Pp 51-59 (2017)
Abstract Background Although single molecule sequencing is still improving, the lengths of the generated sequences are inevitably an advantage in genome assembly. Prior work that utilizes long reads to conduct genome assembly has mostly focused on co
Externí odkaz:
https://doaj.org/article/10bff465dac54b53b408a124c73eaf85
Publikováno v:
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
Let $P$ be a set of $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices in the plane. We consider the problem of building a data structure that can quickly compute an $L_1$ shortest obstacle-avoiding path between any two query poin
Externí odkaz:
https://doaj.org/article/966ccdffbad243ccabbfb469aef0b109
Autor:
Danny Z. Chen, Haitao Wang
Publikováno v:
Journal of Computational Geometry, Vol 6, Iss 1 (2015)
Given a set of $h$ pairwise disjoint polygonal obstacles with a total of $n$ vertices in the plane, the vertex-vertex visibility graph is an undirected graph whose nodes are vertices of the obstacles and whose edges are pairs of visible vertices. The
Externí odkaz:
https://doaj.org/article/83ae71cdf1754c2d838667b17b0f2432