Munan Yuan

Dr. Munan Yuan

Hefei Institute of Physical Science, Chinese Academy of Sciences
+1

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
1 June 2021 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
MYMunan Yuan
Munan Yuan
XLXiaofeng Li
Xiaofeng Li
JXJinlin Xu
Jinlin Xu
CJChaochuan Jia
Chaochuan Jia
XLXiru Li
Xiru Li

14 January 2022 in Electronics
Verified
Journal Article
Open access
PDF file
MYMunan Yuan
Munan Yuan
LXLi Xiru
Li Xiru
LCLongle Cheng
Longle Cheng
XLXiaofeng Li
Xiaofeng Li
HTHaibo Tan
Haibo Tan
Alignment is a critical aspect of point cloud data (PCD) processing, and we propose a coarse-to-fine registration method based on bipartite graph matching in this paper. After data pre-processing, the registration progress can be detailed as follows: Firstly, a top-tail (TT) strategy is designed to normalize and estimate the scale factor of two given PCD sets, which can combine with the coarse alignment process flexibly. Secondly, we utilize the 3D scale-invariant feature transform (3D SIFT) method to extract point features and adopt fast point feature histograms (FPFH) to describe corresponding feature points simultaneously. Thirdly, we construct a similarity weight matrix of the source and target point data sets with bipartite graph structure. Moreover, the similarity weight threshold is used to reject some bipartite graph matching error-point pairs, which determines the dependencies of two data sets and completes the coarse alignment process. Finally, we introduce the trimmed iterative closest point (TrICP) algorithm to perform fine registration. A series of extensive experiments have been conducted to validate that, compared with other algorithms based on ICP and several representative coarse-to-fine alignment methods, the registration accuracy and efficiency of our method are more stable and robust in various scenes and are especially more applicable with scale factors.

25 June 2021 in Electronics
Verified
Journal Article
Open access
PDF file
MYMunan Yuan
Munan Yuan
XLXiaofeng Li
Xiaofeng Li
LXLi Xiru
Li Xiru
HTHaibo Tan
Haibo Tan
JXJinlin Xu
Jinlin Xu
Three-dimensional (3D) data are easily collected in an unconscious way and are sensitive to lead biological characteristics exposure. Privacy and ownership have become important disputed issues for the 3D data application field. In this paper, we design a privacy-preserving computation system (SPPCS) for sensitive data protection, based on distributed storage, trusted execution environment (TEE) and blockchain technology. The SPPCS separates a storage and analysis calculation from consensus to build a hierarchical computation architecture. Based on a similarity computation of graph structures, the SPPCS finds data requirement matching lists to avoid invalid transactions. With TEE technology, the SPPCS implements a dual hybrid isolation model to restrict access to raw data and obscure the connections among transaction parties. To validate confidential performance, we implement a prototype of SPPCS with Ethereum and Intel Software Guard Extensions (SGX). The evaluation results derived from test datasets show that (1) the enhanced security and increased time consumption (490 ms in this paper) of multiple SGX nodes need to be balanced; (2) for a single SGX node to enhance data security and preserve privacy, an increased time consumption of about 260 ms is acceptable; (3) the transaction relationship cannot be inferred from records on-chain. The proposed SPPCS implements data privacy and security protection with high performance.

30 December 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
LCLongle Cheng
Longle Cheng
HTHaibo Tan
Haibo Tan
XLXiru Li
Xiru Li
WPWansu Pan
Wansu Pan
HZHe Zhao
He Zhao
XLXiaofeng Li
Xiaofeng Li
The network layer plays a crucial role in blockchain systems, enabling essential functions such as message broadcasting and data synchronization. Enhancing data transmission structures and methods at this layer is key to improving scalability and addressing performance limitations. Currently, the uneven distribution of neighboring node lists and the lack of awareness of underlying linkages in coverage networks hinder the efficiency and comprehensiveness of information transmission. To tackle these challenges, this study introduces a dual-layer transmission model, FPSblo-EP, which divides the blockchain P2P network into two layers: the regular node layer and the tagged node layer. In the initial stage, network nodes are treated as points in a point cloud, and farthest point sampling is applied to the P2P network nodes. During this process, geographic distances between nodes serve as input parameters, while node degrees are used as point weights. Tagged nodes can then provide efficient and stable inter-group routing for regular nodes, creating a hierarchical transmission architecture. This model improves both transmission performance and scalability in blockchain overlay networks. Experimental results show that FPSblo-EP reduces message coverage latency by 22%, redundancy by 26%, and the network stretch coefficient by 28%, demonstrating superior load-balancing capabilities and enhanced network reliability.

3 June 2025 in Sensors
Verified
Journal Article
Open access
PDF file
MYMunan Yuan
Munan Yuan
LXLi Xiru
Li Xiru
HTHaibao Tan
Haibao Tan
Non-rigid transformation is based on rigid transformation by adding distortions to form a more complex but more consistent common scene. Many advanced non-rigid alignment models are implemented using supervised learning; however, the large number of labels required for the training process makes their application difficult. Here, an elastic fine-tuning dual recurrent computation for unsupervised non-rigid registration is proposed. At first, we transform a non-rigid transformation into a series of combinations of rigid transformations using an outer recurrent computational network. Then, the inner loop layer computes elastic-controlled rigid incremental transformations by controlling the threshold to obtain a finely coherent rigid transformation. Finally, we design and implement loss functions that constrain deformations and keep transformations as rigid as possible. Extensive experiments validate that the proposed method achieves state-of-the-art performance with 0.01219 earth mover’s distances (EMDs) and 0.0153 root mean square error (RMSE) in non-rigid and rigid scenes, respectively.

1 January 2024 in Computers, Materials & Continua
Verified
Journal Article
Open access
PDF file
JXJinlin Xu
Jinlin Xu
WPWansu Pan
Wansu Pan
LCLongle Cheng
Longle Cheng
HTHaibo Tan
Haibo Tan
MYMunan Yuan
Munan Yuan
XLXiaofeng Li
Xiaofeng Li
The existing multipath routing in Software Defined Network (SDN) is relatively blind and inefficient, and there is a lack of cooperation between the terminal and network sides, making it difficult to achieve dynamic adaptation of service requirements and network resources. To address these issues, we propose a multi-constraint path optimization scheme based on information fusion in SDN. The proposed scheme collects network topology and network state information on the network side and computes disjoint paths between end hosts. It uses the Fuzzy Analytic Hierarchy Process (FAHP) to calculate the weight coefficients of multiple constrained parameters and constructs a composite quality evaluation function for the paths to determine the priority of the disjoint paths. The SDN controller extracts the service attributes by analyzing the packet header and selects the optimal path for flow rule forwarding. Furthermore, the service attributes are fed back to the path composite quality evaluation function, and the path priority is dynamically adjusted to achieve dynamic adaptation between service requirements and network status. By continuously monitoring and analyzing the service attributes, the scheme can ensure optimal routing decisions in response to varying network conditions and evolving service demands. The experimental results demonstrated that the proposed scheme can effectively improve average throughput and link utilization while meeting the Quality of Service (QoS) requirements of various applications.