Liping Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Liping Zheng has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Gaofeng Zhang
School of Software, Hefei University of Technology, Hefei, China
18 shared publications - Wenming Wu
School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China
15 shared publications - Benzhu Xu
School of Software, Hefei University of Technology, Hefei, China
12 shared publications Gaofeng Zhang
7 shared publications- Mingwei Cao
Anhui Provincial Key Laboratory of Multimodal Cognitive Computation, Anhui University, Hefei 230601, China
7 shared publications - Weijia Jia
Institute of Artificial Intelligence and Future Networks, Beijing Normal University, Zhuhai, China
7 shared publications
Latest Publications
- Open Access
- 28 October 2026
- Published by Elsevier in Visual Informatics
Power diagram-based safety-centric navigation framework for emergency rescue robots in heterogeneous hazardous environments
- 28 October 2026
- Published by Elsevier in Visual Informatics
Open AccessPower diagram-based safety-centric navigation framework for emergency rescue robots in heterogeneous hazardous environments
- 16 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (3) , 2030-2043
Decentralized Load Balancing in Urban Edge Computing With Spatial Modeling
In large-scale urban areas, edge computing, with flexible and low-latency services, enriches various pioneering applications such as the internet of vehicles (IoVs) and smart cities. These location-sensitive applications raise a critical concern, i.e., the mismatch between the spatial distributions of computing requirements and computing capacities. And this mismatch gives a huge challenge for load balancing among edge servers. However, existing approaches do not account for this spatial unevenness, which undermines the high-quality implementations of urban edge computing systems. Regarding this load balancing problem, we propose a novel Power Diagram based Edge Balancing (PDEB) approach, pursuing computing capacities self-adapted with computing requirements via the power diagram. This paper makes three key contributions. First, we propose a distribution modeling framework that formulates spatial mismatch as an optimization problem. Second, we introduce a decentralized power diagram constructed from modeled distributions, serving as the mathematical foundation for decentralized edge coordination. Third, we develop a structured pairing and scheduling strategy based on the power diagram to proactively redistribute load across edge servers. Experimentally, PDEB achieves $42.78\%$ better load balance and $16.69\%$ lower queuing delay than leading baselines, validating its theoretical and practical advantages.
- 16 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 19 (3) , 2030-2043
Decentralized Load Balancing in Urban Edge Computing With Spatial Modeling
In large-scale urban areas, edge computing, with flexible and low-latency services, enriches various pioneering applications such as the internet of vehicles (IoVs) and smart cities. These location-sensitive applications raise a critical concern, i.e., the mismatch between the spatial distributions of computing requirements and computing capacities. And this mismatch gives a huge challenge for load balancing among edge servers. However, existing approaches do not account for this spatial unevenness, which undermines the high-quality implementations of urban edge computing systems. Regarding this load balancing problem, we propose a novel Power Diagram based Edge Balancing (PDEB) approach, pursuing computing capacities self-adapted with computing requirements via the power diagram. This paper makes three key contributions. First, we propose a distribution modeling framework that formulates spatial mismatch as an optimization problem. Second, we introduce a decentralized power diagram constructed from modeled distributions, serving as the mathematical foundation for decentralized edge coordination. Third, we develop a structured pairing and scheduling strategy based on the power diagram to proactively redistribute load across edge servers. Experimentally, PDEB achieves $42.78\%$ better load balance and $16.69\%$ lower queuing delay than leading baselines, validating its theoretical and practical advantages.
- 30 March 2026
- Published by Wiley in Computer Graphics Forum
Floorplan Generation by Alternating Geometry and Semantics Optimization
Creating floorplans lays the foundation for architectural design and scene modeling. We propose a novel framework for generating diverse high‐quality floorplans under predefined constraints. Central to our method is an iterative refinement process for optimizing the bounding boxes of rooms and the floorplan semantics image, which defines a vector floorplan together. Vector floorplans can be generated through a learning‐based refinement process. Our framework supports various constraints, such as floorplan boundaries, topological graphs, and bubble diagrams. Extensive experiments demonstrate that our method is superior to state‐of‐the‐art techniques, particularly in generating a wider variety of solutions that cater to various architectural needs.
- 30 March 2026
- Published by Wiley in Computer Graphics Forum
Floorplan Generation by Alternating Geometry and Semantics Optimization
Creating floorplans lays the foundation for architectural design and scene modeling. We propose a novel framework for generating diverse high‐quality floorplans under predefined constraints. Central to our method is an iterative refinement process for optimizing the bounding boxes of rooms and the floorplan semantics image, which defines a vector floorplan together. Vector floorplans can be generated through a learning‐based refinement process. Our framework supports various constraints, such as floorplan boundaries, topological graphs, and bubble diagrams. Extensive experiments demonstrate that our method is superior to state‐of‐the‐art techniques, particularly in generating a wider variety of solutions that cater to various architectural needs.
- 30 January 2026
- Published by Springer Nature
- p. 31-46
Synthesizing Commercial Floorplans via a Controllable Diffusion Framework
- 30 January 2026
- Published by Springer Nature
- p. 31-46
Synthesizing Commercial Floorplans via a Controllable Diffusion Framework
- Open Access
- 28 November 2025
- Published by Springer Nature in Research Square
Jitter-Awareness User Allocation in Edge-based Intelligent Video Systems via Traffic Simulation
Recently, Edge-based Intelligent Video Systems (EIVSs) have shown great potential to mitigate damages caused by the mobility of traffic participants in urban areas, leveraging the advantage of computing resources close to edge users.In EIVSs, a key challenge is the Edge User Allocation (EUA) problem under limited edge resources.However, existing EUA research overlooks allocation jitter, which can be defined as the consecutive reallocation of users on servers. Consequently, the allocation jitters could undermine server availability, lead to the omission of critical information from edge users, and thereby jeopardize traffic safety.To address this issue, we formulate the Jitter-Awareness Edge User Allocation (JA-EUA) problem, and propose a novel prediction-based method named the Range-variable Jitter Controlled Prediction (RJCP), that incorporates flexible server coverage.Our introduced Urban Traffic Simulation and Prediction Framework (UTSPF) integrates heterogeneous results from RVO and SUMO simulators, validating our approach's capability to mitigate jitter and improve edge camera allocation.
- 28 November 2025
- Published by Springer Nature in Research Square
Open AccessJitter-Awareness User Allocation in Edge-based Intelligent Video Systems via Traffic Simulation
Recently, Edge-based Intelligent Video Systems (EIVSs) have shown great potential to mitigate damages caused by the mobility of traffic participants in urban areas, leveraging the advantage of computing resources close to edge users.In EIVSs, a key challenge is the Edge User Allocation (EUA) problem under limited edge resources.However, existing EUA research overlooks allocation jitter, which can be defined as the consecutive reallocation of users on servers. Consequently, the allocation jitters could undermine server availability, lead to the omission of critical information from edge users, and thereby jeopardize traffic safety.To address this issue, we formulate the Jitter-Awareness Edge User Allocation (JA-EUA) problem, and propose a novel prediction-based method named the Range-variable Jitter Controlled Prediction (RJCP), that incorporates flexible server coverage.Our introduced Urban Traffic Simulation and Prediction Framework (UTSPF) integrates heterogeneous results from RVO and SUMO simulators, validating our approach's capability to mitigate jitter and improve edge camera allocation.
- 7 November 2025
- Published by Elsevier in Computer Aided Geometric Design
- Vol. 123
SceneFlow: Synthesizing indoor scenes via geometry-enhanced flow matching
- 7 November 2025
- Published by Elsevier in Computer Aided Geometric Design
- Vol. 123
SceneFlow: Synthesizing indoor scenes via geometry-enhanced flow matching
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 10778-10786
FloorplanSBS: Synthesizing Vector Floorplans by Patch-Based Floorplan Segmentation
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 10778-10786
Open AccessFloorplanSBS: Synthesizing Vector Floorplans by Patch-Based Floorplan Segmentation
- 24 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (12) , 12844-12851
DSTE-Net: Dual-Scale Spatial-Temporal Excitation Network for Dynamic Gesture Recognition
Dynamic gesture recognition is a crucial technology for achieving natural human-computer interaction and holds broad application prospects in fields such as virtual reality, smart home, and digital entertainment. However, existing methods often lack a unified mechanism to simultaneously capture subtle local motion features and global semantic context, which are both essential for accurate recognition. To address this limitation, we propose a Dual-scale Spatial-Temporal Excitation (DSTE) module that explicitly integrates temporal and spatial features across both local and global scales, enhancing the network to effectively capture fine-grained motion and long-range dependencies. The plug-and-play DSTE module can be seamlessly incorporated into standard 2D architectures such as ResNet-50, forming a more expressive framework referred to as DSTE-Net, while adding only 1.99 GFLOPs. Extensive experiments on the EgoGesture, IPNHand, and LD-ConGR datasets using only RGB videos as input demonstrate that DSTE-Net achieves superior performance compared with state-of-the-art methods.
- 24 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (12) , 12844-12851
DSTE-Net: Dual-Scale Spatial-Temporal Excitation Network for Dynamic Gesture Recognition
Dynamic gesture recognition is a crucial technology for achieving natural human-computer interaction and holds broad application prospects in fields such as virtual reality, smart home, and digital entertainment. However, existing methods often lack a unified mechanism to simultaneously capture subtle local motion features and global semantic context, which are both essential for accurate recognition. To address this limitation, we propose a Dual-scale Spatial-Temporal Excitation (DSTE) module that explicitly integrates temporal and spatial features across both local and global scales, enhancing the network to effectively capture fine-grained motion and long-range dependencies. The plug-and-play DSTE module can be seamlessly incorporated into standard 2D architectures such as ResNet-50, forming a more expressive framework referred to as DSTE-Net, while adding only 1.99 GFLOPs. Extensive experiments on the EgoGesture, IPNHand, and LD-ConGR datasets using only RGB videos as input demonstrate that DSTE-Net achieves superior performance compared with state-of-the-art methods.
- 11 October 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (7)
FAHNet: Accurate and Robust Normal Estimation for Point Clouds via Frequency‐Aware Hierarchical Geometry
Point cloud normal estimation underpins many 3D vision and graphics applications. Precise normal estimation in regions of sharp curvature and high‐frequency variation remains a major bottleneck; existing learning‐based methods still struggle to isolate fine geometry details under noise and uneven sampling. We present FAHNet, a novel frequency‐aware hierarchical network that precisely tackles those challenges. Our Frequency‐Aware Hierarchical Geometry (FAHG) feature extraction module selectively amplifies and merges cross‐scale cues, ensuring that both fine‐grained local features and sharp structures are faithfully represented. Crucially, a dedicated Frequency‐Aware geometry enhancement (FA) branch intensifies sensitivity to abrupt normal transitions and sharp features, preventing the common over‐smoothing limitation. Extensive experiments on synthetic benchmarks (PCPNet, FamousShape) and real‐world scans (SceneNN) demonstrate that FAHNet outperforms state‐of‐the‐art approaches in normal estimation accuracy. Ablation studies further quantify the contribution of each component, and downstream surface reconstruction results validate the practical impact of our design.
- 11 October 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (7)
FAHNet: Accurate and Robust Normal Estimation for Point Clouds via Frequency‐Aware Hierarchical Geometry
Point cloud normal estimation underpins many 3D vision and graphics applications. Precise normal estimation in regions of sharp curvature and high‐frequency variation remains a major bottleneck; existing learning‐based methods still struggle to isolate fine geometry details under noise and uneven sampling. We present FAHNet, a novel frequency‐aware hierarchical network that precisely tackles those challenges. Our Frequency‐Aware Hierarchical Geometry (FAHG) feature extraction module selectively amplifies and merges cross‐scale cues, ensuring that both fine‐grained local features and sharp structures are faithfully represented. Crucially, a dedicated Frequency‐Aware geometry enhancement (FA) branch intensifies sensitivity to abrupt normal transitions and sharp features, preventing the common over‐smoothing limitation. Extensive experiments on synthetic benchmarks (PCPNet, FamousShape) and real‐world scans (SceneNN) demonstrate that FAHNet outperforms state‐of‐the‐art approaches in normal estimation accuracy. Ablation studies further quantify the contribution of each component, and downstream surface reconstruction results validate the practical impact of our design.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (5) , 3235-3248
Stability-Oriented Heterogeneous Application Re-Deployment in Mobile Edge Computing
With the rapid development of Mobile Edge Computing (MEC), various heterogeneous applications have being deployed on edge servers in close proximity to end-users for the low-latency responses. In this circumstance, since the resources on edge servers are limited, it is critical to deploy these applications on suitable edge servers. However, due to the heterogeneity of the applications and the mobility of end-users in real MEC circumstances, the requests each edge server received may undergo temporal fluctuations in both views of quantity and type. In other words, it is crucial to re-deploy these heterogeneous applications to match these dynamic circumstances, instead of permanent deployments without adjustments. Nevertheless, frequent re-deployment causes service interruptions and resource wastage, leading to system instability. Existing approaches struggle to handle redeployment effectively in heterogeneous, dynamic, and stability-critical MEC environments. In this paper, we first formulate the Edge Application Re-Deployment problem on the basis of constrained multi-objective optimization and prove its $\mathcal {NP}$-hardness. Then we propose an optimal re-deployment approach based on the Integer Programming technique for small-scale edge application re-deployment scenarios. And we also propose a Decompose-Solve-Merge approximation approach which balances the effectiveness and efficiency with a configurable parameter for large-scale scenarios. Extensive experiments on a real-world data set evaluate our novel approaches against four existing representative approaches. Additionally, we perform the ablation experiment to validate the effectiveness of our approaches and explore the impact of configurable parameter on the performance. The results show the superior performance of our approaches on re-deployment in terms of heterogeneous, dynamic, and stability.
- 24 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18 (5) , 3235-3248
Stability-Oriented Heterogeneous Application Re-Deployment in Mobile Edge Computing
With the rapid development of Mobile Edge Computing (MEC), various heterogeneous applications have being deployed on edge servers in close proximity to end-users for the low-latency responses. In this circumstance, since the resources on edge servers are limited, it is critical to deploy these applications on suitable edge servers. However, due to the heterogeneity of the applications and the mobility of end-users in real MEC circumstances, the requests each edge server received may undergo temporal fluctuations in both views of quantity and type. In other words, it is crucial to re-deploy these heterogeneous applications to match these dynamic circumstances, instead of permanent deployments without adjustments. Nevertheless, frequent re-deployment causes service interruptions and resource wastage, leading to system instability. Existing approaches struggle to handle redeployment effectively in heterogeneous, dynamic, and stability-critical MEC environments. In this paper, we first formulate the Edge Application Re-Deployment problem on the basis of constrained multi-objective optimization and prove its $\mathcal {NP}$-hardness. Then we propose an optimal re-deployment approach based on the Integer Programming technique for small-scale edge application re-deployment scenarios. And we also propose a Decompose-Solve-Merge approximation approach which balances the effectiveness and efficiency with a configurable parameter for large-scale scenarios. Extensive experiments on a real-world data set evaluate our novel approaches against four existing representative approaches. Additionally, we perform the ablation experiment to validate the effectiveness of our approaches and explore the impact of configurable parameter on the performance. The results show the superior performance of our approaches on re-deployment in terms of heterogeneous, dynamic, and stability.