Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liqiang Lin

dblp:281/6566 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
9since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
5 papers
Geometric modeling and processing · 56% Rendering · 42% Computer animation and physical simulation · 3%
Artificial intelligence
3 papers
3D vision · 29% Robot navigation and mapping · 19% Speech recognition and synthesis · 16%

Topics — the 17 heaviest of 19, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Geometric modeling and processing
3d reconstruction
1.322024
CRAYM: Neural Field Optimization via Camera RAY Matching · NeurIPS 2024
Capturing, Reconstructing, and Simulating: The UrbanScene3D Dataset · ECCV (8) 2022
Rendering
neural rendering
0.922024
CRAYM: Neural Field Optimization via Camera RAY Matching · NeurIPS 2024
ExtraNet: real-time extrapolated rendering for low-latency temporal supersampling · ACM Trans. Graph. 2021
Rendering
novel view synthesis
0.812024
CRAYM: Neural Field Optimization via Camera RAY Matching · NeurIPS 2024
Computer vision › Image recognition and object detection › visual attention modeling
attention-based feature enhancement
0.712023
On learning the right attention point for feature enhancement · Sci. China Inf. Sci. 2023
Natural language and speech › Speech recognition and synthesis › front-end processing
feature enhancement
0.712023
On learning the right attention point for feature enhancement · Sci. China Inf. Sci. 2023
Computer vision › 3D vision
3d scene reconstruction
0.612022
Learning Reconstructability for Drone Aerial Path Planning · ACM Trans. Graph. 2022
Robotics › Robot navigation and mapping › mobile robot navigation › navigation planning
aerial path planning
0.612022
Learning Reconstructability for Drone Aerial Path Planning · ACM Trans. Graph. 2022
Machine learning › Generative modeling › 3d generative model
conditional 3d generation
0.612022
ShapeFormer: Transformer-based Shape Completion via Sparse Representation · CVPR 2022
Computer vision › 3D vision › 3d shape reconstruction
shape completion
0.612022
ShapeFormer: Transformer-based Shape Completion via Sparse Representation · CVPR 2022
Geometric modeling and processing › 3d reconstruction › urban reconstruction
urban scene reconstruction
0.612022
Capturing, Reconstructing, and Simulating: The UrbanScene3D Dataset · ECCV (8) 2022
Geometric modeling and processing
geometric priors
0.512021
Hausdorff point convolution with geometric priors · Sci. China Inf. Sci. 2021
Geometric modeling and processing › computational geometry
hausdorff distance
0.512021
Hausdorff point convolution with geometric priors · Sci. China Inf. Sci. 2021
Geometric modeling and processing
point cloud processing
0.512021
Hausdorff point convolution with geometric priors · Sci. China Inf. Sci. 2021
Rendering
real-time rendering
0.512021
ExtraNet: real-time extrapolated rendering for low-latency temporal supersampling · ACM Trans. Graph. 2021
Rendering › sampling and reconstruction
temporal upsampling
0.512021
ExtraNet: real-time extrapolated rendering for low-latency temporal supersampling · ACM Trans. Graph. 2021
Machine learning › Deep learning architectures and training
attention mechanism
0.212023
On learning the right attention point for feature enhancement · Sci. China Inf. Sci. 2023
Geometric modeling and processing › shape modeling › implicit modeling
implicit shape representation
0.212022
ShapeFormer: Transformer-based Shape Completion via Sparse Representation · CVPR 2022

Methods — techniques the papers use, named apart from their topics

vector quantized deep implicit function · 1.1transformer · 1.1sparse representation · 1.1neural network · 1.1joint optimization · 0.8feature volume · 0.8camera ray matching · 0.8attention mechanism · 0.7uncertainty estimation · 0.6proxy-based reconstruction simulation · 0.6gated convolution · 0.5convolutional neural network · 0.5
YearPublicationVenuePosition
2025 Robust cross-image adversarial watermark with JPEG resistance for defending against Deepfake models
Hanbin Lin, Liqiang Lin, Shuwu Chen
Comput. Vis. Image Underst.3
2024 CRAYM: Neural Field Optimization via Camera RAY Matching
abstract
We introduce camera ray matching (CRAYM) into the joint optimization of camera poses and neural fields from multi-view images. The optimized field, referred to as a feature volume, can be “probed” by the camera rays for novel view synthesis (NVS) and 3D geometry reconstruction. One key reason for matching camera rays, instead of pixels as in prior works, is that the camera rays can be parameterized by the feature volume to carry both geometric and photometric information. Multi-view consistencies involving the camera rays and scene rendering can be naturally integrated into the joint optimization and network training, to impose physically meaningful constraints to improve the final quality of both the geometric reconstruction and photorealistic rendering. We formulate our per-ray optimization and matched ray coherence by focusing on camera rays passing through keypoints in the input images to elevate both the efficiency and accuracy of scene correspondences. Accumulated ray features along the feature volume provide a means to discount the coherence constraint amid erroneous ray matching. We demonstrate the effectiveness of CRAYM for both NVS and geometry reconstruction, over dense- or sparse-view settings, with qualitative and quantitative comparisons to state-of-the-art alternatives.
Liqiang Lin, Wenpeng Wu, Chi-Wing Fu, Hao (Richard) Zhang, Hui Huang 0004
NeurIPS1
2023 On learning the right attention point for feature enhancement
Liqiang Lin, Pengdi Huang, Chi-Wing Fu, Kai Xu 0004, Hao (Richard) Zhang, Hui Huang 0004
Sci. China Inf. Sci.1
2022 ShapeFormer: Transformer-based Shape Completion via Sparse Representation
abstract
We present ShapeFormer, a transformer-based network that produces a distribution of object completions, conditioned on incomplete, and possibly noisy, point clouds. The resultant distribution can then be sampled to generate likely completions, each exhibiting plausible shape details while being faithful to the input. To facilitate the use of transformers for 3D, we introduce a compact 3D representation, vector quantized deep implicit function (VQDIF), that utilizes spatial sparsity to represent a close approximation of a 3D shape by a short sequence of discrete variables. Experiments demonstrate that ShapeFormer outperforms prior art for shape completion from ambiguous partial inputs in terms of both completion quality and diversity. We also show that our approach effectively handles a variety of shape types, incomplete patterns, and real-world scans.
Xingguang Yan, Liqiang Lin, Niloy J. Mitra, Dani Lischinski, Daniel Cohen-Or, Hui Huang 0004
CVPR2
2022 Capturing, Reconstructing, and Simulating: The UrbanScene3D Dataset
Liqiang Lin, Xingguang Yan, Ke Xie 0001, Hui Huang 0004
ECCV (8)1
2022 Autonomous Outdoor Scanning via Online Topological and Geometric Path Optimization
abstract
Autonomous 3D acquisition of outdoor environments poses special challenges. Different from indoor scenes, where the room space is delineated by clear boundaries and separations (e.g., walls and furniture), an outdoor environment is spacious and unbounded (thinking of a campus). Therefore, unlike for indoor scenes where the scanning effort is mainly devoted to the discovery of boundary surfaces, scanning an open and unbounded area requires actively delimiting the extent of scanning region and dynamically planning a traverse path within that region. Thus, for outdoor scenes, we formulate the planning of an energy-efficient autonomous scanning through a discrete-continuous optimization of robot scanning paths. The discrete optimization computes a topological map, through solving an online traveling sales problem (Online TSP), which determines the scanning goals and paths on-the-fly. The dynamic goals are determined as a collection of visit sites with high reward of visibility-to-unknown. A visit graph is constructed via connecting the visit sites with edges weighted by traversing cost. This topological map evolves as the robot scans via deleting outdated sites that are either visited or become rewardless and inserting newly discovered ones. The continuous part optimizes the traverse paths geometrically between two neighboring visit sites via maximizing the information gain of scanning along the paths. The discrete and continuous processes alternate until the traverse cost of the current graph exceeds the remaining energy capacity of the robot. Our approach is evaluated with both synthetic and field tests, demonstrating its effectiveness and advantages over alternatives.
Pengdi Huang, Liqiang Lin, Kai Xu 0004, Hui Huang 0004
IEEE Trans. Intell. Transp. Syst.2
2022 Learning Reconstructability for Drone Aerial Path Planning
abstract
We introduce the first learning-based reconstructability predictor to improve view and path planning for large-scale 3D urban scene acquisition using unmanned drones. In contrast to previous heuristic approaches, our method learns a model that explicitly predicts how well a 3D urban scene will be reconstructed from a set of viewpoints. To make such a model trainable and simultaneously applicable to drone path planning, we simulate the proxy-based 3D scene reconstruction during training to set up the prediction. Specifically, the neural network we design is trained to predict the scene reconstructability as a function of the proxy geometry , a set of viewpoints, and optionally a series of scene images acquired in flight. To reconstruct a new urban scene, we first build the 3D scene proxy, then rely on the predicted reconstruction quality and uncertainty measures by our network, based off of the proxy geometry, to guide the drone path planning. We demonstrate that our data-driven reconstructability predictions are more closely correlated to the true reconstruction quality than prior heuristic measures. Further, our learned predictor can be easily integrated into existing path planners to yield improvements. Finally, we devise a new iterative view planning framework, based on the learned reconstructability, and show superior performance of the new planner when reconstructing both synthetic and real scenes.
Liqiang Lin, Ke Xie 0001, Chi-Wing Fu, Hao (Richard) Zhang, Hui Huang 0004
ACM Trans. Graph.2
2021 Hausdorff point convolution with geometric priors
Liqiang Lin, Pengdi Huang, Fuyou Xue, Kai Xu 0004, Daniel Cohen-Or, Hui Huang 0004
Sci. China Inf. Sci.1
2021 ExtraNet: real-time extrapolated rendering for low-latency temporal supersampling
abstract
Both the frame rate and the latency are crucial to the performance of realtime rendering applications such as video games. Spatial supersampling methods, such as the Deep Learning SuperSampling (DLSS), have been proven successful at decreasing the rendering time of each frame by rendering at a lower resolution. But temporal supersampling methods that directly aim at producing more frames on the fly are still not practically available. This is mainly due to both its own computational cost and the latency introduced by interpolating frames from the future. In this paper, we present ExtraNet, an efficient neural network that predicts accurate shading results on an extrapolated frame, to minimize both the performance overhead and the latency. With the help of the rendered auxiliary geometry buffers of the extrapolated frame, and the temporally reliable motion vectors, we train our ExtraNet to perform two tasks simultaneously: irradiance in-painting for regions that cannot find historical correspondences, and accurate ghosting-free shading prediction for regions where temporal information is available. We present a robust hole-marking strategy to automate the classification of these tasks, as well as the data generation from a series of high-quality production-ready scenes. Finally, we use lightweight gated convolutions to enable fast inference. As a result, our ExtraNet is able to produce plausibly extrapolated frames without easily noticeable artifacts, delivering a 1.5× to near 2× increase in frame rates with minimized latency in practice.
Jie Guo 0001, Xihao Fu, Liqiang Lin, Hengjun Ma, Yanwen Guo 0001, Shiqiu Liu, Lingqi Yan 0001
ACM Trans. Graph.3