检索结果-内蒙古大学图书馆

CliReg: Clique-Based Robust Point Cloud Registration

IEEE TRANSACTIONS ON ROBOTICS 2025年 41卷 1898-1917页

作者： Moratalla, Javier Laserna Carrillo, Pablo San Segundo Sanchez, David Alvarez Univ Politecn Madrid Ctr Automat & Robot CAR ETSIDI UPMCSIC Madrid 28012 Spain

We propose a branch-and-bound algorithm for robust rigid registration of two point clouds in the presence of a large number of outlier correspondences. For this purpose, we consider a maximum consensus formulation of the registration problem and reformulate it as a (large) maximal clique search in a correspondence graph, where a clique represents a complete rigid transformation. Specifically, we use a maximum clique algorithm to enumerate large maximal cliques and a fitness procedure that evaluates each clique by solving a least-squares optimization problem. The main advantages of our approach are 1) it is possible to exploit the cutting-edge optimization techniques employed by current exact maximum clique algorithms, such as partial maximum satisfiability-based bounds, branching by partitioning or the use of bitstrings, etc.;2) the correspondence graphs are expected to be sparse in real problems (confirmed empirically in our tests), and, consequently, the maximum clique problem is expected to be easy;3) it is possible to have a good control of suboptimality with a k-nearest neighbor analysis that determines the size of the correspondence graph as a function of $k$. The new algorithm is called CliReg and has been implemented in C++. To evaluate CliReg, we have carried out extensive tests both on synthetic and real public datasets. The results show that CliReg clearly dominates the state of the art (e.g., RANSAC, FGR, and TEASER++) in terms of robustness, with a running time comparable to TEASER++ and RANSAC. In addition, we have implemented a fast variant called CliRegMutual that performs similarly to the fastest heuristic FGR.

关键词： Point cloud compression Three-dimensional displays Robots Translation Accuracy Solid modeling Feature extraction Cost function Surveys partitioning algorithms Discrete optimization maximum clique mobile robotics point cloud 3-D registration scan matching

来源：评论

学校读者我要写书评

暂无评论

ADPTD: Adaptive Data Partition With Unbiased Task Dispatching for Video Analytics at the Edge

引用

IEEE INTERNET OF THINGS JOURNAL 2025年第6期12卷 7434-7445页

作者： Huang, Zhaowu Dong, Fang Zhu, Haopeng Liu, Mengyang Shen, Dian Zhou, Ruiting Guo, Xiaolin Chen, Baijun Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Peoples R China

Recently, edge-assisted methods have been proposed as a promising technique to deliver fast and accurate on-device video analytics by partitioning frame data and dispatching them to edge servers for parallel execution. However, the data partition (DP) reduces the detection latency but decreases accuracy since objects may cross the boundaries of adjacent blocks. The effect of DP on the accuracy and latency depends on multiple vital parameters (e.g., target size, density, network, and computing resources) in an unknown and time-varying fashion. Moreover, these parameters are determined by the application scenarios and edge environment, which are uncertain and heterogeneous at the edge. Hence, how to partition frames to strike a balance between accuracy and latency is a nontrivial and intractable problem. To this end, we propose an online learning-based device-edge-cloud collaboration framework, ADPTD, to guide DP at the edge. We propose an optimal task dispatching algorithm (OTD) to minimize detection latency. Then, we propose a multiarmed bandit-based algorithm to pick a DP strategy and invoke OTD to dispatch tasks in each time slot. Theoretical analysis reveals that ADPTD achieves sublinear regret. Extensive experimental results show that ADPTD outperforms the state-of-the-art methods, achieving a latency reduction of up to 2.53x and improving accuracy by up to 49.4%.

关键词： Accuracy Dispatching Visual analytics Image edge detection Servers partitioning algorithms Performance evaluation Monitoring Edge computing Low latency communication Data partition (DP) edge computing task dispatching (TD) video analytics

来源：评论

学校读者我要写书评

暂无评论

Optimizing Clustered Cell-Free Networking for Sum Ergodic Capacity Maximization With Joint Processing Constraint

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2025年第1期24卷 571-584页

作者： Xia, Funing Wang, Junyuan Dai, Lin Tongji Univ Coll Elect & Informat Engn Shanghai 201804 Peoples R China Tongji Univ Inst Adv Study Coll Elect & Informat Engn Shanghai 201804 Peoples R China Tongji Univ Shanghai Inst Intelligent Sci & Technol Shanghai 201804 Peoples R China City Univ Hong Kong Dept Elect Engn SAR Hong Kong Peoples R China

Clustered cell-free networking has been considered as an effective scheme to trade off between the low complexity of current cellular networks and the superior performance of fully cooperative networks. With clustered cell-free networking, the wireless network is decomposed into a number of disjoint parallel operating subnetworks with joint processing adopted inside each subnetwork independently for intra-subnetwork interference mitigation. Different from the existing works that aim to maximize the number of subnetworks without considering the limited processing capability of base-stations (BSs), this paper investigates the clustered cell-free networking problem with the objective of maximizing the sum ergodic capacity while imposing a limit on the number of user equipments (UEs) in each subnetwork to constrain the joint processing complexity. By successfully transforming the combinatorial NP-hard clustered cell-free networking problem into an integer convex programming problem, the problem is solved by the branch-and-bound method. To further reduce the computational complexity, a bisection clustered cell-free networking ((BCF)-F-2-Net) algorithm is proposed to decompose the network hierarchically. Simulation results show that compared to the branch-and-bound based scheme, the proposed (BCF)-F-2-Net algorithm significantly reduces the computational complexity yet achieves nearly the same network decomposition result. Moreover, our (BCF)-F-2-Net algorithm achieves near-optimal performance and outperforms the state-of-the-art benchmarks with up to 25% capacity gain.

关键词： Clustering algorithms Wireless networks partitioning algorithms Interference Cellular networks Simulation Signal processing algorithms Uplink Optimization Computer architecture Clustered cell-free networking sum ergodic capacity maximization joint processing constraint bisection algorithm

来源：评论

学校读者我要写书评

暂无评论

Assessment of K-Means Algorithm to Evaluate Nearshore Wave Climate

引用

IEEE JOURNAL OF OCEANIC ENGINEERING 2025年第2期50卷 583-593页

作者： Castro, Elisa Iuppa, Claudio Musumeci, Rosaria Ester Xibilia, Maria Gabriella Patane, Luca Foti, Enrico Cavallaro, Luca Univ Catania Dept Civil Engn & Architecture I-95123 Catania Italy Univ Messina Dept Engn I-98166 Contrada Di Dio Italy

Accidents near ports have increased due to the ongoing expansion of maritime trade. These accidents have various causes, including adverse weather conditions. Accurate wave climate forecasts can help mitigate the risks associated with marine accidents. While numerical models are commonly used for obtaining nearshore wave climate forecasts, their high computational cost makes them impractical for wave climate forecasting and nowcasting. Artificial neural networks (ANNs) offer a potential solution to this limitation. However, existing ANNs have primarily focused on specific single points within the study areas, such as piers and port entrances. Enhancing early-warning strategies requires a broader understanding of the wave climate across larger areas. Thorough examinations of extensive areas with varying physical attributes can result in significant computational time requirements. The main objective of this study is to evaluate a clustering technique able to identify homogeneous areas to improve future applications of ANNs to assess nearshore wave characteristics in actual situations. The area around the port of Augusta (Sicily), one of the most important ports in Italy, serves as a case study in this article. Results show an optimal performance by applying the clustering algorithm K-means, capable of capturing the wave climate characteristics of the study area.

关键词： Meteorology Clustering algorithms Seaports Sea measurements Accidents Numerical models partitioning algorithms K-means maritime accidents SWAN wave climate

来源：评论

学校读者我要写书评

暂无评论

A Robust FPGA Router With Optimization of High-Fanout Nets and Intra-CLB Connections

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2025年第3期44卷 1003-1016页

作者： Jiang, Xun Wang, Jiarui Mai, Jing Di, Zhixiong Lin, Yibo Peking Univ Sch Integrated Circuits Beijing 100871 Peoples R China Peking Univ Sch Comp Sci Beijing 100871 Peoples R China Univ Elect Sci & Technol China Sch Integrated Circuits Sci & Engn Chengdu 610031 Peoples R China Peking Univ Beijing Adv Innovat Ctr Integrated Circuits Beijing 100871 Peoples R China Peking Univ Inst Elect Design Automat Wuxi 214000 Peoples R China

Routing is the most time-consuming step in the implementation flow of field programmable gate array (FPGA) designs. With the advance in transistor scaling and system integration, hardware resources in FPGA devices are growing in a larger quantity and diversity. The routing architecture is designed to be more complicated for mapping RTL designs to FPGA devices correctly, which brings significant challenges for current FPGA routing algorithms. The key challenges for routing algorithms lie in large solution space and heavy congestion, especially for high-fanout nets (HFNets). We propose a partition-based algorithm to accelerate the routing of HFNets, which decomposes the global routing guide to shrink the search space for connecting each sink. Meanwhile, the congestions existing inside configurable logic block (CLB) are hard to handle by traditional sequential negotiation-based algorithms, because the industrial routing architecture is quite complex. We propose a concurrent intra-CLB rerouting algorithm to effectively resolve routing congestion inside a CLB tile induced by connections between intra-CLB logic pins, e.g., logic elements and switch boxes. Experimental results on modified ISPD2016 benchmarks demonstrate that our framework can achieve 100% routability in 9.8% less wirelength and $11\times $ less runtime, while the state-of-the-art VTR 8.0 routing algorithm fails at 7 of 12 benchmarks.

关键词： Routing Field programmable gate arrays Computer architecture Pins Logic Video recording partitioning algorithms integer linear programming routing Steiner trees partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Coarse-Graining Complex Networks for Control Equivalence

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第2期70卷 1169-1175页

作者： Toller, Daniele Tribastone, Mirco Tschaikowski, Max Vandin, Andrea Aalborg Univ DK-9400 Aalborg Denmark IMT I-55100 Lucca Italy St Anna I-56127 Pisa Italy DTU Compute DK-2800 Lyngby Denmark

The ability to control complex networks is of crucial importance across a wide range of applications in natural and engineering sciences. However, issues of both theoretical and numerical nature introduce fundamental limitations to controlling large-scale networks. In this article, we cope with this problem by introducing a coarse-graining algorithm. It leads to an aggregated network which satisfies control equivalence, i.e., such that the optimal control values for the original network can be exactly recovered from those of the aggregated one. The algorithm is based on a partition refinement method originally devised for systems of ordinary differential equations, here extended and applied to linear dynamics on complex networks. Using a number of benchmarks from the literature we show considerable reductions across a variety of networks from biology, ecology, engineering, and social sciences.

关键词： Costs partitioning algorithms Cost function Vectors Trajectory Complex networks Time complexity Control systems costs linear systems mathematical models optimal control reduced order systems

来源：评论

学校读者我要写书评

暂无评论

3D Shape Segmentation With Potential Consistency Mining and Enhancement

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2025年 27卷 133-144页

作者： Shu, Zhenyu Li, Shiyang Xin, Shiqing Liu, Ligang NingboTech Univ Sch Comp & Data Engn Ningbo 315104 Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310018 Peoples R China Shandong Univ Sch Comp Sci & technol Jinan 250355 Peoples R China Univ Sci & Technol China Sch Math Sci Graph & Geometr Comp Lab Hefei 230026 Anhui Peoples R China

3D shape segmentation is a crucial task in the field of multimedia analysis and processing, and recent years have seen a surge in research on this topic. However, many existing methods only consider geometric features of 3D shapes and fail to explore the potential connections between faces, limiting their segmentation performance. In this paper, we propose a novel segmentation approach that mines and enhances the potential consistency of 3D shapes to overcome this limitation. The key idea is to mine the consistency between different partitions of 3D shapes and to use the unique consistency enhancement strategy to continuously optimize the consistency features for the network. Our method also includes a comprehensive set of network structures to mine and enhance consistent features, enabling more effective feature extraction and better utilization of contextual information around each face when processing complex shapes. We evaluate our approach on public benchmarks through extensive experiments and demonstrate its effectiveness in achieving higher accuracy than existing methods.

关键词： Shape Three-dimensional displays Feature extraction Faces Vectors Point cloud compression partitioning algorithms Labeling Data mining Accuracy 3D shape segmentation consistency deep learning shape analysis

来源：评论

学校读者我要写书评

暂无评论

Computing Tasks Saving Schemes Through Early Exit in Edge Intelligence-Assisted Systems

引用

IEEE TRANSACTIONS ON COMPUTERS 2025年第5期74卷 1565-1576页

作者： Niu, Xin Lv, Xianwei Chen, Wang Yu, Chen Jin, Hai Huazhong Univ Sci & Technol Natl Engn Res Ctr Big Data Technol & Syst Sch Comp Sci & Technol Serv Comp Technol & Syst LabCluster & Grid Comp L Wuhan 430074 Peoples R China

Edge intelligence (EI) is a promising paradigm where end devices collaborate with edge servers to provide artificial intelligence services to users. In most realistic scenarios, end devices often move unconsciously, resulting in frequent computing migrations. Moreover, a surge in computing tasks offloaded to edge servers significantly prolongs queuing latency. These two issues obstruct the timely completion of computing tasks in EI-assisted systems. In this paper, we formulate an optimization problem aiming to maximize computing task completion under latency constraints. To address this issue, we first categorize computing tasks into new computing tasks (NCTs) and partially completed computing tasks (PCTs). Subsequently, based on model partitioning, we design a new computing task saving scheme (NSS) to optimize early exit points for NCTs and computing tasks in the queuing queue. Furthermore, we propose a partially completed computing task saving scheme (PSS) to set early exit points for PCTs during computing migrations. Numerous experiments show that computing saving schemes can achieve at least 90% computing task completion rate and up to 61.81% latency reduction compared to other methods.

关键词： Computational modeling Servers Artificial intelligence Heuristic algorithms Performance evaluation partitioning algorithms Mathematical models Deep learning Computers Adaptation models Edge intelligence model early exit computing migration queuing latency

来源：评论

学校读者我要写书评

暂无评论

Generalized Graph-Dependent Isolation of Collusive Attacks for Interconnected Systems

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第4期70卷 2274-2288页

作者： Zhao, Dan Ho, Daniel W. C. Wen, Guanghui Southeast Univ Dept Syst Sci Nanjing 211189 Peoples R China City Univ Hong Kong Dept Math Kowloon Hong Kong Peoples R China

This article addresses the isolation problem of collusive false data injection attacks and covert attacks for interconnected systems, particularly in establishing generalized graph-dependent conditions responsible for attack isolation. Two algorithms involving inclusive neighbor information and neighbor information are introduced to accomplish attack isolation. By exploring the mechanism of attack collusion, it is found that both the number of subsystems' one-hop neighbors and the size of cycles in the graph play significant roles in attack isolation. Besides, it is interesting to note that their impacts on attack isolation can be mutually compensated. Then, the worst attack collusion cases for the proposed algorithms under different cycle sizes are developed, based on which, several equivalent sufficient yet sharp graph conditions for the isolation of false data injection attacks and covert attacks are, respectively, provided with the notion of $(r,s)$-isolability. It is revealed that the inclusive neighbor information-based algorithm is more effective for isolating false data injection attacks. In contrast, the neighbor information-based algorithm is more suitable for isolating covert attacks. Finally, simulations demonstrate the effectiveness of the theoretical results.

关键词： Observers Vectors Interconnected systems Topology Couplings Power system dynamics partitioning algorithms Estimation Data models Urban areas Attack collusion attack isolation covert attacks false data injection attacks graph isolability interconnected systems

来源：评论

学校读者我要写书评

暂无评论

Memristive Clustering: A Novel Sustainable Parameter Selection Based on Memristive Circuit Model

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING

引用

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2025年第1期10卷 18-27页

作者： Qiao, Kaikai Ma, Ben Wang, Lidan Duan, Shukai Southwest Univ Coll Artificial Intelligence Chongqing 400715 Peoples R China Chongqing Key Lab Brain Inspired Comp & Intelligen Chongqing 400715 Peoples R China

In recent years, memristors have attracted much attention in the fields of nonvolatile memory, logic operation and neuromorphic computing. As a new type of two-terminal passive electronic component similar to sandwich structure, its main resistance mechanism is the formation and fracture of metal or oxygen vacancy conductive filaments. Traditional clustering algorithms own strong sensitivity to different parameter selection, including partition clustering algorithm and density clustering algorithm. In view of the non-volatile characteristics of memristor and the In-memory computing characteristics of memristive circuit, this paper designs a new memristive clustering paradigm, and further verifies the feasibility and effectiveness of the proposed analog circuit to improve the performance of clustering parameters by exploring the data mining and image segmentation problems of these two types of clustering algorithms.

关键词： Clustering algorithms partitioning algorithms Ions Resistance Programming Voltage Memristors Bilevel programming clustering method data mining in-memory computing optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：