Xuequan Lu

Dr. Xuequan Lu


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 May 2022 in Pattern Recognition
Verified
Journal Article
Closed access
ZFZhengyang Feng
Zhengyang Feng
QZQianyu Zhou
Qianyu Zhou
QGQiqi Gu
Qiqi Gu
XTXin Tan
Xin Tan
GCGuangliang Cheng
Guangliang Cheng
LMLizhuang Ma
Lizhuang Ma

28 September 2020 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
DZDongbo Zhang
Dongbo Zhang
XLXuequan Lu
Xuequan Lu
HQHong Qin
Hong Qin
YHYing He
Ying He
Point cloud filtering is a fundamental problem in geometry modeling and processing. Despite of significant advancement in recent years, the existing methods still suffer from two issues: 1) they are either designed without preserving sharp features or less robust in feature preservation; and 2) they usually have many parameters and require tedious parameter tuning. In this article, we propose a novel deep learning approach that automatically and robustly filters point clouds by removing noise and preserving their sharp features. Our point-wise learning architecture consists of an encoder and a decoder. The encoder directly takes points (a point and its neighbors) as input, and learns a latent representation vector which goes through the decoder to relate the ground-truth position with a displacement vector. The trained neural network can automatically generate a set of clean points from a noisy input. Extensive experiments show that our approach outperforms the state-of-the-art deep learning techniques in terms of both visual quality and quantitative error metrics. The source code and dataset can be found at https://github.com/dongbo-BUAA-VR/Pointfilter .

14 September 2022 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
QZQianyu Zhou
Qianyu Zhou
ZFZhengyang Feng
Zhengyang Feng
QGQiqi Gu
Qiqi Gu
JPJiangmiao Pang
Jiangmiao Pang
Guangliang ChengGuangliang Cheng
Guangliang Cheng
LMLizhuang Ma
Lizhuang Ma
Unsupervised domain adaptation (UDA) aims to adapt a model of the labeled source domain to an unlabeled target domain. Existing UDA-based semantic segmentation approaches always reduce the domain shifts in pixel level, feature level, and output level. However, almost all of them largely neglect the contextual dependency, which is generally shared across different domains, leading to less-desired performance. In this paper, we propose a novel Context-Aware Mixup (CAMix) framework for domain adaptive semantic segmentation, which exploits this important clue of context-dependency as explicit prior knowledge in a fully end-to-end trainable manner for enhancing the adaptability toward the target domain. Firstly, we present a contextual mask generation strategy by leveraging the accumulated spatial distributions and prior contextual relationships. The generated contextual mask is critical in this work and will guide the context-aware domain mixup on three different levels. Besides, provided the context knowledge, we introduce a significance-reweighted consistency loss to penalize the inconsistency between the mixed student prediction and the mixed teacher prediction, which alleviates the negative transfer of the adaptation, e.g ., early performance degradation. Extensive experiments and analysis demonstrate the effectiveness of our method against the state-of-the-art approaches on widely-used UDA benchmarks.

1 August 2020 in Computer-Aided Design
Verified
Journal Article
Closed access
DLdening lu
dening lu
XLXuequan Lu
Xuequan Lu
YSYangxing Sun
Yangxing Sun
JWJun Wang
Jun Wang

21 May 2022 in Computer Vision and Image Understanding
Verified
Journal Article
Closed access
QZQianyu Zhou
Qianyu Zhou
ZFZhengyang Feng
Zhengyang Feng
QGQiqi Gu
Qiqi Gu
GCGuangliang Cheng
Guangliang Cheng
XLXuequan Lu
Xuequan Lu
LMLizhuang Ma
Lizhuang Ma

1 October 2020 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
XLXuequan Lu
Xuequan Lu
SSScott Schaefer
Scott Schaefer
Jun LuoJun Luo
Jun Luo
LMLizhuang Ma
Lizhuang Ma
YHYing He
Ying He
We propose a robust normal estimation method for both point clouds and meshes using a low rank matrix approximation algorithm. First, we compute a local isotropic structure for each point and find its similar, non-local structures that we organize into a matrix. We then show that a low rank matrix approximation algorithm can robustly estimate normals for both point clouds and meshes. Furthermore, we provide a new filtering method for point cloud data to smooth the position data to fit the estimated normals. We show the applications of our method to point cloud filtering, point set upsampling, surface reconstruction, mesh denoising, and geometric texture removal. Our experiments show that our method generally achieves better results than existing methods.