Liping Nong

dblp:303/9332 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0002-4584-4448ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 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.

Artificial intelligence
1 paper
3D vision · 50% Graph learning · 50%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › 3d object recognition
3d object classification
0.712023
Adaptive Multi-Hypergraph Convolutional Networks for 3D Object Classification · IEEE Trans. Multim. 2023
Machine learning › Graph learning › hypergraph learning
hypergraph neural network
0.712023
Adaptive Multi-Hypergraph Convolutional Networks for 3D Object Classification · IEEE Trans. Multim. 2023

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

random walk · 0.7multimodal fusion · 0.7hypergraph convolution · 0.7
YearPublicationVenuePosition
2025 Fair and Green Offloading in DVFS-Enabled MEC: A Utility-Driven Pricing and Allocation Approach
abstract
By fully exploring the edge computing “supply-demand” relationship between the mobile edge computing (MEC) servers and the differentiated application requests, the computing pricing (i.e.“, supply”) and allocating (i.e.“, demand”) can be coordinated well for the practical network consisting of heterogeneous users and MEC operator. In this paper, the fair-aware computing pricing, beneficial offloading (i.e., obtaining positive utility) and local computing adjustment are jointly discussed under a pricing-enabled MEC. By considering heterogeneous application requests, fair service demand and limited computing provisioning, a multi-objective composite utility optimization is developed to maximize the user utility and the MEC operator profit simultaneously. Therein, the fair service condition is proposed, under which each user can experience a similar chance to obtain beneficial offloading. In order to solve the goal problem with undetermined objective function and conditions, a fair service enabled pricing and allocating algorithm (FS_PAA) with extremely low complexity is proposed by exploiting classification discussion method and convex optimization. Our FS_PAA reveals the explicit relationship between the optimal offloading decision and computing pricing, and the explicit relationship between the optimal computing pricing and the maximum computing provisioning, which helps to provide an effective reference for practical edge computing deployment. Simulation results show that our FS_PAA can 1) ensure fair offloading services for practical differentiated requests; 2) provide green offloading service for more users; 3) greatly improve the utilization of edge computing resource.
Jie Peng 0006, Junyi Wang 0002, Jun Cai 0001, Liping Nong, Hongbing Qiu, Feng Chen 0030, Xiaolu Lu 0004
IEEE Internet Things J.4
2023 GCN-based proximal unrolling matrix completion for piecewise smooth signal recovery
Jinling Liu, Jiming Lin, Liping Nong, Jie Peng 0006, Junyi Wang 0002
Signal Process.4
2023 Adaptive Multi-Hypergraph Convolutional Networks for 3D Object Classification
abstract
3D object classification is an important task in computer vision. In order to explore the high-order and multi-modal correlations among 3D data, we propose an adaptive multi-hypergraph convolutional networks (AMHCN) framework to enhance 3D object classification performance. The proposed network improves the current hypergraph neural networks in two aspects. Firstly, existing networks rely on hyperedge constrained neighborhoods for feature aggregation, which may introduce noise or ignore positive information outside the hyperedges. To this end, we develop the partially absorbing random walks (PARW) to hypergraph for capturing optimal vertex neighborhoods from hypergraph globally. Then, based on the PARW on hypergraph, we design a new hypergraph convolution operator to learn deep embeddings from the optimized high-order correlation, which enables effective information propagation among the most relevant vertices. Secondly, concerning the multi-modal representations in practice, the current multi-modal hypergraph learning models either treat all modalities equally or introduce abundant parameters to learn weights of different modalities. To overcome these shortcomings, we propose a simple but effective dynamic weighting strategy for combining multi-modal representations, in which the importance of each modality can be adjusted adaptively by the loss function. We apply the proposed model to 3D object classification, and the experimental results on two 3D benchmark datasets demonstrate that our method outperforms the state-of-the-art methods, testifying to the effectiveness of both our convolution method and multi-modality fusion strategy.
Liping Nong, Jie Peng 0006, Jiming Lin, Hongbing Qiu, Junyi Wang 0002
IEEE Trans. Multim.1
2021 Hypergraph wavelet neural networks for 3D object classification
abstract
Recently, hypergraph learning has shown great potential in a variety of classification tasks. However, existing hypergraph neural networks lack flexibility in modeling and extracting high-order relationships among data. To solve this problem, we propose a novel framework called hypergraph wavelet neural networks (HGWNN) to explore the high-order correlation in 3D data. Firstly, considering the non-uniformity of most data sets in the real world, we propose a “data-driven” hypergraph construction scheme, which is more efficient than some commonly used hypergraph construction methods. Secondly, in order to efficiently learn deep embeddings from the constructed hypergraph, we propose a hypergraph wavelet convolution operator. It enables efficient information aggregation by fully exploiting the localization property of wavelets. This convolution operator is suitable for both non-uniform and uniform hypergraphs. Finally, we design a new hypergraph regularizer based on the sparse prior of wavelet coefficients to promote local smoothness and avoid network overfitting. We have conducted experiments on object classification tasks on two 3D benchmark datasets: the National Taiwan University (NTU) 3D model dataset and the ModelNet40 dataset. Experimental results demonstrate the effectiveness of the proposed method compared with the state-of-the-art methods.
Liping Nong, Junyi Wang 0002, Jiming Lin, Hongbing Qiu, Lin Zheng 0001
Neurocomputing1