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.
Wireless networks, especially 5G and WiFi networks, have made great strides in increasing network bandwidth and coverage over the past decades. However, the mobility and channel conditions inherent to wireless networks have the potential to impair the performance of traditional Transmission Control Protocol (TCP) congestion control algorithms (CCAs). Google proposed a novel TCP CCA based on Bottleneck Bandwidth and Round-Trip propagation time (BBR), which is capable of achieving high transmission rates and low latency through the estimation of the available bottleneck capacity. Nevertheless, some studies have revealed that BBR exhibits deficiencies in fairness among flows with disparate Round-Trip Times (RTTs) and also displays inter-protocol unfairness. In high-speed wireless networks, ensuring fairness is of paramount importance to guarantee equitable bandwidth allocation among diverse traffic types and to enhance overall network utilization. To address this issue, this paper proposes a BBR–Pacing Gain (BBR–PG) algorithm. By deriving the pacing rate control model, the impact of pacing gain on BBR fairness is revealed. Adjusting the pacing gain according to the RTT can improve BBR’s performance. Simulations and real network experiments have shown that the BBR–PG algorithm retains the throughput advantages of the original BBR algorithm while significantly enhancing fairness. In our simulation experiments, RTT fairness and intra-protocol fairness were improved by 50% and 46%, respectively.
1 January 2024 in IEICE Transactions on Communications
Blockchain systems rely on peer-to-peer (P2P) overlay networks to propagate transactions and blocks. The node management of P2P networks affects the overall performance and reliability of the system. The traditional structure is based on random connectivity, which is known to be an inefficient operation. Therefore, we propose MSLT, a multiscale blockchain P2P network node management method to improve transaction performance. This approach involves configuring the network to operate at multiple scales, where blockchain nodes are grouped into different ranges at each scale. To minimize redundancy and manage traffic efficiently, neighboring nodes are selected from each range based on a predetermined set of rules. Additionally, a node updating method is implemented to improve the reliability of the network. Compared with existing transmission models in efficiency, utilization, and maximum transaction throughput, the MSLT node management model improves the data transmission performance.