Ling Wang

Dr. Ling Wang

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
23 December 2020 in IEEE Access
Verified
Journal Article
Open access
LWLing Wang
Ling Wang
HWHongqiao Wang
Hongqiao Wang
GFGuangyuan Fu
Guangyuan Fu
Class imbalance problems, developed due to the sampling bias or measurement error, occur frequently in real-world pattern classification tasks. The traditional classifiers focus on the overall classification accuracy and ignore the minority class, which may degrade the classification performance. However, existing oversampling algorithms generally make specific assumptions to balance the class size and do not sufficiently consider irregularities present in imbalanced data. As a result, these methods can perform well only on certain benchmarks. In this paper, by incorporating minority oversampling and cost-sensitive learning, we propose multiple kernel learning with minority oversampling (MKLMO), for efficiently handling the class imbalance problem with small disjuncts, overlapping, and nonlinear shape. Unlike existing methods where oversampling of the minority class is performed first and then a standard classifier is deployed on the rebalanced data, the proposed MKLMO generates synthetic instances and trains classifier synchronously in the same feature space. Specially, we define a distance metric in the optimal feature space by multiple kernel learning and use kernel trick to expand the original Gram matrix. Moreover, we assign different weights to instances, based on the imbalance ratio, for reducing the bias of the classifier towards the majority class. In order to evaluate the proposed MKLMO method, several experiments are performed with nine artificial and twenty-one real-world datasets. The experimental results show that our algorithm outperforms other baseline algorithms significantly in terms of the assessment metric geometric mean (G-mean), especially in the presence of data irregularities.

20 June 2007
Verified
Book Chapter
Closed access
PDF file
LBLiefeng Bo
Liefeng Bo
LWLing Wang
Ling Wang
LJLicheng Jiao
Licheng Jiao

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
LWLing Wang
Ling Wang
HWHongqiao Wang
Hongqiao Wang
GFGuangyuan Fu
Guangyuan Fu
Extensions of kernel methods for the class imbalance problems have been extensively studied. Although they work well in coping with nonlinear problems, the high computation and memory costs severely limit their application to real‐world imbalanced tasks. The Nyström method is an effective technique to scale kernel methods. However, the standard Nyström method needs to sample a sufficiently large number of landmark points to ensure an accurate approximation, which seriously affects its efficiency. In this study, we propose a multi‐Nyström method based on mixtures of Nyström approximations to avoid the explosion of subkernel matrix, whereas the optimization to mixture weights is embedded into the model training process by multiple kernel learning (MKL) algorithms to yield more accurate low‐rank approximation. Moreover, we select subsets of landmark points according to the imbalance distribution to reduce the model’s sensitivity to skewness. We also provide a kernel stability analysis of our method and show that the model solution error is bounded by weighted approximate errors, which can help us improve the learning process. Extensive experiments on several large scale datasets show that our method can achieve a higher classification accuracy and a dramatical speedup of MKL algorithms.

17 March 2025 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
LWLing Wang
Ling Wang
RCRunfa Chen
Runfa Chen
FSFuchun Sun
Fuchun Sun
XWXinzhou Wang
Xinzhou Wang
KSKai Sun
Kai Sun
YWYikai Wang
Yikai Wang
Unsupervised non-rigid point cloud shape correspondence underpins a multitude of 3D vision tasks, yet itself is non-trivial given the exponential complexity stemming from inter-point degree-of-freedom, i.e., pose transformations. Based on the assumption of local rigidity, one solution for reducing complexity is to decompose the overall shape into independent local regions using Local Reference Frames (LRFs) that are equivariant to SE(3) transformations. However, the focus solely on local structure neglects global geometric contexts, resulting in less distinctive LRFs that lack crucial semantic information necessary for effective matching. Furthermore, such complexity introduces out-of-distribution geometric contexts during inference, thus complicating generalization. To this end, we introduce 1) EquiShape, a novel structure tailored to learn pair-wise LRFs with global structural cues for both spatial and semantic consistency, and 2) LRF-Refine, an optimization strategy generally applicable to LRF-based methods, aimed at addressing the generalization challenges. Specifically, for EquiShape, we employ cross-talk within separate equivariant graph neural networks (Cross-GVP) to build long-range dependencies to compensate for the lack of semantic information in local structure modeling, deducing pair-wise independent SE(3)-equivariant LRF vectors for each point. For LRF-Refine, the optimization adjusts LRFs within specific contexts and knowledge, enhancing the geometric and semantic generalizability of point features. Our overall framework surpasses the state-of-the-art methods by a large margin on three benchmarks. Codes are available at https://github.com/2019EPWL/EquiShape.

27 January 2025 in IEEE Sensors Journal
Verified
Journal Article
Closed access
XWXinzhou Wang
Xinzhou Wang
FSFuchun Sun
Fuchun Sun
LWLing Wang
Ling Wang
KSKai Sun
Kai Sun
XZXudong Zhang
Xudong Zhang
HZHuaidong Zhou
Huaidong Zhou
6D pose estimation from a monocular RGB sensor is essential for robotic assembly. While deep learning approaches leverage priors from synthetic and labeled real-world data to estimate 6D poses, their generalizability is often constrained by the limited scale and realism of training datasets. Moreover, scale ambiguity is an inherent issue when image datasets are captured without calibration or depth sensing. To address these limitations, we propose Phys-Field, a physics-aware neural surface framework for joint 6D pose and scale estimation in robotic assembly without requiring 3D models or depth sensing. We incorporate an isotropic scale factor into the 6D pose estimation process, formulating the task as an iterative optimization problem within the Sim(3) group. The framework integrates multiple differentiable neural surfaces to estimate corresponding Sim(3) transformations by minimizing photometric differences between rendered and observed images through rendering inversion. To achieve conflict-free compositional rendering and efficient collision detection, we introduce deep convex decomposition. Concurrently, Phys-Field leverages dynamic simulations with physics parameters derived from large language models to evaluate the plausibility of the estimated Sim(3) transformations, effectively resolving scale ambiguity and accelerating convergence. We validate our framework’s effectiveness in a real-world assembly task, with experimental results showing notable improvements in reconstruction fidelity, Sim(3) transformations estimation accuracy, and assembly success rate.

11 June 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
SYSong Yan
Song Yan
WZWei Zhai
Wei Zhai
CWChenfeng Wang
Chenfeng Wang
RLRuixuan Li
Ruixuan Li
ZYZhangping Yang
Zhangping Yang
ZZZheng-Jun Zha
Zheng-Jun Zha
Diffusion models are now a standard foundation for visual generation, including image synthesis, editing, video generation, and 3D-aware content creation. As these models are used for more structured creation, visual quality alone is often insufficient. Generated content can omit prompt details, break compositional relations, lose subject identity across instances, drift over time, disagree across viewpoints, or violate preference, safety, and physical-plausibility requirements. These problems are studied in many task-specific literatures, but they are seldom organized by the agreement relation that a method is designed to enforce. We treat consistency as a requirement on generated content and formulate it as a family of agreement relations. We distinguish three primary relations: external consistency, which concerns agreement with user-specified or task-provided conditions; internal consistency, which concerns coherence among generated parts, views, instances, or temporal states; and normative consistency, which concerns agreement with evaluative criteria such as human preference, safety, and world-level plausibility. We review representative methods under this relation-based view, comparing their scope, preserved properties, and enforcement mechanisms. We also summarize evaluation protocols and benchmarks, examine cross-category trade-offs, and discuss open problems in conflict-aware optimization, interpretable metrics, persistent memory, and long-horizon world-consistent generation. The survey links failure modes to mechanism families, evaluation choices, and unresolved trade-offs.