Longlong Liao

dblp:211/4183 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
4since 2021 · last 2025
0000-0002-1311-7115ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
YearPublicationVenuePosition
2025 GSSN: A Graph Structural Similarity Network for Complex 2D Geometric Drawing Retrieval
Longlong Liao, Junyong Lu, Yuanlong Yu 0001
ICA3PP (5)2
2025 Fault resilient on-device batched DNN inference for mobile devices with ARM TrustZone
Longlong Liao, Wenbin Zeng, Xinqi Liu, Yuanlong Yu 0001
J. Syst. Archit.1
2024 Fault-tolerant deep learning inference on CPU-GPU integrated edge devices with TEEs
Hongjian Xu, Longlong Liao, Xinqi Liu, Shuguang Chen, Zhixuan Liang, Yuanlong Yu 0001
Future Gener. Comput. Syst.2
2021 Deep Convolutional Neural Network for Compressive Sensing of Magnetic Resonance Images
abstract
Compressive Sensing for Magnetic Resonance Imaging (CS-MRI) aims to reconstruct Magnetic Resonance (MR) images from under-sampled raw data. There are two challenges to improve CS-MRI methods, i.e. designing an under-sampling algorithm to achieve optimal sampling, as well as designing fast and small deep neural networks to obtain reconstructed MR images with superior quality. To improve the reconstruction quality of MR images, we propose a novel deep convolutional neural network architecture for CS-MRI named MRCSNet. The MRCSNet consists of three sub-networks, a compressive sensing sampling sub-network, an initial reconstruction sub-network, and a refined reconstruction sub-network. Experimental results demonstrate that MRCSNet generates high-quality reconstructed MR images at various under-sampling ratios, and also meets the requirements of real-time CS-MRI applications. Compared to state-of-the-art CS-MRI approaches, MRCSNet offers a significant improvement in reconstruction accuracies, such as Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity (SSIM). Besides, it reduces the reconstruction error evaluated by the Normalized Root-Mean-Square Error (NRMSE). The source codes are available at https://github.com/TaihuLight/MRCSNet .
Xiaofei Zou, Longlong Liao, Kenli Li 0001, Jie Liu 0002
Int. J. Pattern Recognit. Artif. Intell.3
2020 A half-precision compressive sensing framework for end-to-end person re-identification
Longlong Liao, Zhibang Yang, Qing Liao 0001, Kenli Li 0001, Keqin Li 0001, Jie Liu 0002, Qi Tian 0001
Neural Comput. Appl.1
2018 UHCL-Darknet: An OpenCL-based Deep Neural Network Framework for Heterogeneous Multi-/Many-core Clusters
abstract
As the majority of popular deep neural network (DNN) frameworks focus on a closed format CUDA implementations based on one or more NVIDIA GPUs, they cannot efficiently leverage other devices in cluster mode to accelerate the training and inference of DNNs except NVIDIA GPUs. To accelerate DNNs using heterogeneous multi-/many-core clusters, we propose an OpenCL-based DNN framework called UHCL-Darknet. First, we design a unified OpenCL platform model for the heterogeneous cluster called UHCL, and an adaptive runtime system with the affinity-based dynamic scheduler for UHCL, enabling transparent utilization of a wide variety of vendor-specific OpenCL devices in the heterogeneous cluster. Then, we extend Darknet to UHCL by introducing the parallel optimization of DNNs, such as paralleling Winogrand-based convolutions and auto-tuning parameterized OpenCL kernels. The training and inference of art-of-data DNN models (e.g., YOLOv2, ResNet-50, and DenseNet-201) are executed on an experimental heterogeneous cluster. Results show that UHCL-Darknet is a scalable and portable DNN framework for heterogeneous clusters, and achieves 1.9x and 2.2x speedups on average respectively for the image throughput of data-parallel training and inference on the experimental heterogeneous cluster.
Longlong Liao, Kenli Li 0001, Keqin Li 0001, Canqun Yang, Qi Tian 0001
ICPP1
2017 Automatic density clustering with multiple kernels for high-dimension bioinformatics data
abstract
Clustering is an effective method for data analysis and can be exploited to unknown features of data samples, its applications range from data mining to bioinformatics analysis. Several clustering approaches have been proposed in order to obtain a better trade-off between accuracy and efficiency of the clustering process. It is well-known that no existing clustering algorithm completely satisfies both accuracy and efficiency requirements, thus we propose a clustering algorithm called ADCMK (for Automatic Density Clustering with Multiple Kernels) exhibiting higher quality than the density ones proposed so far, while allowing users to cluster efficiently without determining parameters manually. The algorithm consists of learning optimal combined kernel, reducing dimensionality with the optimal kernel, automatically detecting cluster centroids with outliers test, assigning clusters and visualizing results. The proposed clustering algorithm is extensively tested on several well-known high-dimensional dataset in biomedical and bioinformatics field. The results show that the new algorithm tends to automatically produce clusters of better quality than other density clustering algorithms.
Longlong Liao, Kenli Li 0001, Keqin Li 0001, Qi Tian 0001, Canqun Yang
BIBM1