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

Lincong Fang

dblp:38/8074 · DBLP profile ↗
← Back
17ranked-venue papers
4as first author
13since 2021 · last 2025
0000-0002-9847-4436ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 12 · 4 first-author · 8 since 2021Artificial intelligence and machine learning · 4 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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
3 papers
Geometric modeling and processing · 57% Multimedia analysis and retrieval · 43%
Theoretical computer science
1 paper
Computational geometry · 100%
Artificial intelligence
1 paper
3D vision · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval
3d shape retrieval
0.812024
Learning Robust Point Representation for 3D Non-Rigid Shape Retrieval · IEEE Trans. Multim. 2024
Multimedia analysis and retrieval › 3d shape retrieval
nonrigid shape retrieval
0.812024
Learning Robust Point Representation for 3D Non-Rigid Shape Retrieval · IEEE Trans. Multim. 2024
Geometric modeling and processing › shape representation
point-based representation
0.812024
Learning Robust Point Representation for 3D Non-Rigid Shape Retrieval · IEEE Trans. Multim. 2024
Geometric modeling and processing
shape representation
0.812024
Learning Robust Point Representation for 3D Non-Rigid Shape Retrieval · IEEE Trans. Multim. 2024
Geometric modeling and processing › computer-aided design › computer-aided geometric design › geometric constraints
variational geometry
0.212016
Variational geometric modeling with black box constraints and DAGs · Comput. Aided Des. 2016
Computational geometry › geometric modeling and processing
geometric constraint solving
0.212016
Re-parameterization reduces irreducible geometric constraint systems · Comput. Aided Des. 2016
Computer vision › 3D vision › 3d shape analysis
3d shape understanding
0.212024
Learning Robust Point Representation for 3D Non-Rigid Shape Retrieval · IEEE Trans. Multim. 2024

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

local point histogram · 1.5fisher vector · 1.5feature fusion · 1.5convolutional neural network · 1.5directed acyclic graph · 0.2black box constraints · 0.2
YearPublicationVenuePosition
2025 ODFM: Orientation-Aware Dual-Branch Functional Maps for Unsupervised Non-rigid Shape Matching
Zefeng Huang, Lincong Fang, Chengzhuan Yang
CGI (3)2
2025 CGReg: Classification-Guided Point Cloud Registration via Equivariant Learning
Qinpeng Wu, Chengzhuan Yang, Lincong Fang, Dawei Zhang 0002, Zhonglong Zheng
PRCV (10)3
2025 FuseNet: a multi-modal feature fusion network for 3D shape classification
Yinhuang Chen, Chengzhuan Yang, Lincong Fang
Vis. Comput.4
2024 Curved Image Triangulation Based on Differentiable Rendering
abstract
Abstract Image triangulation methods, which decompose an image into a series of triangles, are fundamental in artistic creation and image processing. This paper introduces a novel framework that integrates cubic Bézier curves into image triangulation, enabling the precise reconstruction of curved image features. Our developed framework constructs a well‐structured curved triangle mesh, effectively preventing overlaps between curves. A refined energy function, grounded in differentiable rendering, establishes a direct link between mesh geometry and rendering effects and is instrumental in guiding the curved mesh generation. Additionally, we derive an explicit gradient formula with respect to mesh parameters, facilitating the adaptive and efficient optimization of these parameters to fully leverage the capabilities of cubic Bézier curves. Through experimental and comparative analyses with state‐of‐the‐art methods, our approach demonstrates a significant enhancement in both numerical accuracy and visual quality.
Wanyi Wang, Zhonggui Chen, Lincong Fang, Juan Cao 0002
Comput. Graph. Forum3
2024 Composite descriptor based on contour and appearance for plant species identification
Lincong Fang, Chengzhuan Yang
Eng. Appl. Artif. Intell.2
2024 Learning Robust Point Representation for 3D Non-Rigid Shape Retrieval
abstract
Content-based 3D object retrieval is a challenging problem in computer vision and graphics, especially for non-rigid 3D shapes. This article proposes a multiview-based robust point representation approach for 3D non-rigid shape retrieval. First, we propose an efficient local descriptor called the local point histogram, which is robust to non-rigid changes in shape. Second, we encode local point histogram features into high-level point features (HPF) using Fisher vectors. Finally, we present an efficient feature fusion method that can further enhance the performance of 3D non-rigid shape retrieval. We extensively tested our approach on two benchmark 3D non-rigid shape datasets, including the SHREC2015 non-rigid shape and SHREC2015 canonical forms. Our method achieves 98.33% and 90.55% retrieval accuracy on the SHREC2015 non-rigid shape and SHREC2015 canonical forms datasets, surpassing previous state-of-the-art methods by nearly 2% and 7%, respectively. In addition, we further tested our method on the well-known 3D rigid shape dataset ModelNet, and the experimental results demonstrate that our method is also effective for 3D rigid shape retrieval. We also combine the proposed HPF shape features with deep convolutional features for the 3D rigid shape retrieval task, achieving a retrieval performance comparable to the prior state-of-the-art methods, which indicates a strong complementarity between HPF shape features and deep convolutional features.
Hao Wu 0098, Lincong Fang, Qian Yu 0014, Chengzhuan Yang
IEEE Trans. Multim.2
2023 Multi-level contour combination features for shape recognition
Chengzhuan Yang, Lincong Fang, Benjie Fei, Qian Yu 0014, Hui Wei 0001
Comput. Vis. Image Underst.2
2023 Plant leaf identification based on shape and convolutional features
Lincong Fang, Jingrong Yuan, Chengzhuan Yang
Expert Syst. Appl.2
2023 Deep convolutional feature aggregation for fine-grained cultivar recognition
Hao Wu 0098, Lincong Fang, Qian Yu 0014, Chengzhuan Yang
Knowl. Based Syst.2
2023 A Learning Robust and Discriminative Shape Descriptor for Plant Species Identification
abstract
Plant identification based on leaf images is a widely concerned application field in artificial intelligence and botany. The key problem is extracting robust discriminative features from leaf images and assigning a measure of similarity. This study proposes an effective, robust shape descriptor to identify plant species from images of their leaves, which we call the high-level triangle shape descriptor (HTSD). First, we extract a leaf image's external contour and internal salient point information. We then use triangle features to describe the leaf contour, which we call the contour point based on triangle features (CPTFs). The internal information of the leaf image is based on salient point triangle features (SPTFs). The third step is to apply the Fisher vector to encode the two kinds of point-based local triangle features into the HTSD. Finally, we employ the simple euclidean distance to calculate the dissimilarities between the HTSD characteristics of leaf images. We have extensively evaluated the proposed approach on several public leaf datasets successfully. Experimental results show that our method has superior recognition accuracy, outperforming current state-of-the-art shape-based and deep-learning plant identification approaches.
Chengzhuan Yang, Lincong Fang, Qian Yu 0014, Hui Wei 0001
IEEE ACM Trans. Comput. Biol. Bioinform.2
2022 Quasi-interpolating bivariate dual 2-subdivision using 1D stencils
Lincong Fang, Bin Han 0003
Comput. Aided Geom. Des.1
2022 Algebraic and geometric characterizations of a class of Algebraic-Hyperbolic Pythagorean-Hodograph curves
Lincong Fang
Comput. Aided Geom. Des.1
2022 Classification of polynomial minimal surfaces
Lincong Fang, Yingli Peng, Juan Cao 0002
Comput. Aided Geom. Des.1
2016 Re-parameterization reduces irreducible geometric constraint systems
Hichem Barki, Lincong Fang, Dominique Michelucci, Sebti Foufou
Comput. Aided Des.2
2016 An improved star test for implicit polynomial objects
Lincong Fang, Dominique Michelucci, Sebti Foufou
Comput. Aided Des.1
2016 Variational geometric modeling with black box constraints and DAGs
Gilles Gouaty, Lincong Fang, Dominique Michelucci, Marc Daniel, Jean-Philippe Pernot, Romain Raffin, Sandrine Lanquetin, Marc Neveu
Comput. Aided Des.2
2009 On control polygons of quartic Pythagorean-hodograph curves
Guozhao Wang, Lincong Fang
Comput. Aided Geom. Des.2