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

Study on the hungarian algorithm for the maximum likelihood data association problem

Journal of Systems Engineering and Electronics 2007年第1期18卷 27-32页

作者： Wang Jianguo He Peikun Cao Wei The Second Academy of China Aerospace Science & Industry Corp. Beijing 100854 P. R. China Dept. of Electronic Engineering Beijing Inst. of Technology Beijing 100081 P. R. China

A specialized hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, hungarian forest （HF） algorithm and hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.

关键词： Tracking Data association Linear programming hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast block distributed CUDA implementation of the hungarian algorithm

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2019年 130卷 50-62页

作者： Lopes, Paulo A. C. Yadav, Satyendra Singh Ilic, Aleksandar Patra, Sarat Kumar Univ Lisbon Inst Engn Sistemas & Comp Invest & Desenvolviment Inst Super Tecn INESC ID IST UL Rua Alves Redol 9 P-1000029 Lisbon Portugal Natl Inst Technol Rourkela Dept Elect & Commun Engn Rourkela Odisha India Indian Inst Informat Technol Dept Comp Sci Engn Vadodara India

The hungarian algorithm solves the linear assignment problem in polynomial time. A GPU/CUDA implementation of this algorithm is proposed. GPUs are massive parallel machines. In this implementation, the alternating path search phase of the algorithm is distributed by several blocks in a way to minimize global device synchronization. This phase is very important and has a big contribution to the execution time. Other advanced features also implemented are: parallel graph traversal;the parallel detection of multiple alternating paths in a single iteration;a simplified and fast matrix compression that stores the zeros of the slack matrix, resulting in very fast graph traversal;highly optimized reductions for the initial slack matrix calculation and update. This results in a fast implementation for moderate size problems. (C) 2019 Elsevier Inc. All rights reserved.

关键词： hungarian algorithm Linear assignment problem GPU

来源：评论

学校读者我要写书评

暂无评论

Improved hungarian algorithm-based task scheduling optimization strategy for remote sensing big data processing

引用

地球空间信息科学学报（英文版） 2024年第4期27卷 1141-1154页

作者： Sheng Zhang Yong Xue Heng Zhang Xiran Zhou Kaiyuan Li Runze Liu School of Environment and Spatial Informatics China University of Mining and TechnologyXuzhouChina School of Environment and Spatial Informatics China University of Mining and TechnologyXuzhouChina School of Computing and Engineering University of DerbyDerbyUK Artificial Intelligence Research Institute China University of Mining and TechnologXuzhouChina Shandong Province Institute of Land Surveying and Mapping JinanChina School of Environment and Spatial Informatics China University of Mining and TechnologyXuzhouChina Artificial Intelligence Research Institute China University of Mining and TechnologXuzhouChina

With the development of remote sensing technology and computing science,remote sensing data present typical big data *** rapid development of remote sensing big data has brought a large number of data processing tasks,which bring huge challenges to *** computing is the primary means to process remote sensing big data,and task scheduling plays a key role in this *** study analyzes the characteristics of batch processing of remote sensing big *** paper uses the hungarian algorithm as a basis for proposing a novel strategy for task assignment optimization of remote sensing big data batch workflow,called optimal sequence dynamic assignment algorithm,which is applicable to hetero-geneously distributed computing *** strategy has two core contents:the improved hungarian algorithm model and the multi-level optimal assignment task queue ***,the strategy solves the dependency,mismatch,and computational resource idleness problems in the optimal scheduling of remote sensing batch processing *** proposed strategy likewise effectively improves data processing efficiency without increasing computer hardware resources and without optimizing the computational *** experimented with the aerosol optical depth retrieval algorithm workflow using this *** with the processing before optimization,the makespan of the proposed method was shortened by at least 20％.Compared with popular scheduling algorithm,the proposed method has evident competitiveness in acceleration effect and large-scale task scheduling.

关键词： Workflow hungarian algorithm optimal assignment remote sensing big data large-scale task

来源：评论

学校读者我要写书评

暂无评论

Path Planning for Multiple Unmanned Surface Vehicles Using Glasius Bio-Inspired Neural Network With hungarian algorithm

引用

IEEE SYSTEMS JOURNAL 2023年第3期17卷 3906-3917页

作者： Yao, Peng Wu, Keqiao Lou, Yating Ocean Univ China Coll Engn Qingdao 266100 Peoples R China

In this article, we focus on the cooperative path planning for unmanned surface vehicles (USVs) composed of single-USV path planning and multi-USVs task assignment. First, the Glasius bioinspired neural network (GBNN) is used to calculate the neural activity for the discretized working space of USV, and the ocean current is considered in the definition of neuron connection weight especially. The standard path of single USV for obstacle avoidance between start point and destination can hence be planned. Then, based on the result of neural activity values from GBNN, the cost matrix of the hungarian algorithm is built and modified for the task assignment among multi-USVs, and the unbalanced problem is well resolved. Consequently, the task points are allocated to USVs and prioritized effectively, and each USV just needs to visit the corresponding task points respectively along the standard paths by GBNN to accomplish the task. Finally, the simulation results demonstrate the feasibility and efficiency of the proposed algorithm.

关键词： Task analysis Path planning Neurons Oceans Neural activity Costs Heuristic algorithms Cost matrix Glasius bio-inspired neural network (GBNN) hungarian algorithm ocean current path planning task assignment unmanned surface vehicles (USVS)

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2017年第1期10卷 121-135页

作者： Cao, Bin Wang, Jiaxing Fan, Jing Yin, Jianwei Dong, Tianyang Zhejiang Univ Technol Coll Comp Sci Hangzhou 310023 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci Hangzhou 310014 Zhejiang Peoples R China

The structural similarity between two process models is usually considered as the main measurement for ranking the process models for a given query model. Current process query methods are inefficient since too many expensive computations of the graph edit distance are involved. To address this issue, using Petri-net as the modeling method, this paper presents the hungarian algorithm based similarity query method. Unlike previous work where the non-task nodes (i.e., place nodes in the Petri-net) were lightly studied or even ignored, we think these non-task nodes also play an essential role in measuring the structural similarity between process models. First, we extract the context for each place and define the similarity for a pair of place nodes that are from different process models from two perspectives: commonality and the graph edit distance. Then, the place mapping is transformed to classical assignment problem that can be solved by hungarian algorithm efficiently. Furthermore, we propose a new process similarity measurement on the basis of the place similarity. The extensive experimental evaluation shows that our hungarian based methods outperform the baseline algorithm in both retrieval quality and query response time.

关键词： Process models hungarian algorithm structural similarity query processing petri net

来源：评论

学校读者我要写书评

暂无评论

An efficient Web page change detection system based on an optimized hungarian algorithm

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2007年第5期19卷 599-613页

作者： Khoury, Imad El-Mawas, Rami M. El-Rawas, Oussama Mounayar, Elias F. Artail, Hassan Amer Univ Beirut Dept Elect & Comp Engn Beirut 11072020 Lebanon

This paper describes an efficient Web page change detection system based on three optimizations that were implemented on top of the hungarian algorithm, which we employ to compare trees that correspond to HTML Web pages. The optimizations attempt to stop the comparator algorithm that employs this O(n(3)) algorithm before it completes all its iterations based on criteria having to do with properties of HTML and heuristics. Analysis and experimental results prove the effectiveness of these optimizations and their ability to render O(n(2)) performance, where n denotes the number of nodes in the tree. A complete system was implemented and used to carry out the performance experiments. This system includes functionalities and interfaces for processing user requests, fetching Web pages from the Internet, allowing users to select zones in Web pages to monitor, and highlighting changes on the Web pages being monitored.

关键词： Web page change detection change monitoring hungarian algorithm runtime optimization

来源：评论

学校读者我要写书评

暂无评论

Improved image processing-based crop detection using Kalman filtering and the hungarian algorithm

引用

COMPUTERS AND ELECTRONICS IN AGRICULTURE 2018年 148卷 37-44页

作者： Hamuda, Esmael Mc Ginley, Brian Glavin, Martin Jones, Edward Natl Univ Ireland Univ Rd Galway Ireland

There is increasing interest in the use of image processing techniques for crop detection in intelligent weeding applications. An effective system for crop detection requires a high degree of adaptability to challenging circumstances such as different weather conditions and image capture conditions (vibration, variations in speed, etc.). To achieve the goal of a robust crop detection system, we have extended a previously-developed detection algorithm that is based on a combination of color-space and shape analysis, through the addition of object tracking. While the previous algorithm performed well in general, performance in sunny conditions was not as robust, opening up the possibility of improvement. The tracking algorithm consists of two steps. Firstly, we apply Kalman filtering to predict the new position of an object (a cauliflower plant in this case) in video sequences. Secondly, we use a data association algorithm (the hungarian algorithm) to assign each detected crop that appears in each image to the correct crop trajectory. The recall matrix was used to evaluate the detection and tracking performance. With the help of tracking algorithm, detection failures were reduced, especially in sunny conditions, such that overall detection performance was raised from 97.28 to 99.3404%.

关键词： Image processing Smart weeding Tracking algorithm Kalman filter hungarian algorithm Crop detection

来源：评论

学校读者我要写书评

暂无评论

Pilot Assignment in Cell-Free Massive MIMO Based on the hungarian algorithm

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2021年第1期10卷 34-37页

作者： Buzzi, Stefano D'Andrea, Carmen Fresia, Maria Zhang, Yong-Ping Feng, Shulan Univ Cassino & Southern Lazio Dept Elect & Informat Engn I-03043 Cassino Italy Consorzio Nazl Interuniv Telecomunicazioni CNIT I-43124 Parma Italy Huawei Technol Duesseldorf GmbH Wireless Terminal Chipset Technol Lab D-40547 Munich Germany Hisilicon Technol Co Ltd Balong Stand & Patent Dept Beijing 100077 Peoples R China

This letter focuses on the problem of pilot assignment in cell-free massive MIMO systems. Exploiting the well-known hungarian algorithms, two procedures are proposed, one maximizing the system throughput, and the other one maximizing the fairness across users. The algorithms operate based on the knowledge of large-scale fading coefficients as a proxy for the distances between users in the system, and take into account both the uplink and downlink performance. Numerical results show that the proposed pilot assignment algorithms are effective and outperform the many competing alternatives available in the literature.

关键词： Cell-free massive MIMO pilot assignment hungarian algorithm wireless networks B5G 6G

来源：评论

学校读者我要写书评

暂无评论

JenA Egervary: from the origins of the hungarian algorithm to satellite communication

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2010年第1期18卷 47-58页

作者： Martello, Silvano Univ Bologna DEIS Bologna Italy

We discuss some relevant results obtained by Egervary in the early Thirties, whose importance has been recognized several years later. We start with a quite well-known historical fact: the first modern polynomial-time algorithm for the assignment problem, invented by Harold W. Kuhn half a century ago, was christened the "hungarian method" to highlight that it derives from two older results, by KAnig (Math Ann 77:453-465, 1916) and Egervary (Mat Fiz Lapok 38:16-28, 1931) (A recently discovered posthumous paper by Jacobi (1804-1851) contains however a solution method that appears to be equivalent to the hungarian algorithm). Our second topic concerns a combinatorial optimization problem, independently defined in satellite communication and in scheduling theory, for which the same polynomial-time algorithm was independently published 30 years ago by various authors. It can be shown that such algorithm directly implements another result contained in the same 1931 paper by Egervary. We finally observe that the latter result also implies the famous Birkhoff-von Neumann theorem on doubly stochastic matrices.

关键词： Assignment problem hungarian algorithm Open shop scheduling Satellite switched time division multiple access

来源：评论

学校读者我要写书评

暂无评论

Hierarchical dispatching method based on hungarian algorithm for reducing the battery degradation cost of EVs participating in frequency regulation

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2020年第23期14卷 5617-5625页

作者： Zeng, Long Li, Canbing Li, Zuyi Zhou, Bin Liu, Hui Yang, Hanyu Hunan Univ Coll Elect & Informat Engn Changsha Peoples R China Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai Peoples R China IIT Dept Elect & Comp Engn Chicago IL 60616 USA Guangxi Univ Sch Elect Engn Nanning Peoples R China

Electric vehicles (EVs) as the frequency regulation (FR) resources with fast response speed provide a promising solution to improve FR performance. However, the exorbitant battery degradation cost (BDC) restricts EVs providing FR service. To achieve the FR performance with cost-efficiency, a hierarchical dispatching method based on the hungarian algorithm is proposed for reducing the BDC of EVs in this study. To ensure system security, the required FR power is dispatched to FR units and EV aggregators according to the optimization coordinating strategy for reducing frequency fluctuation. Then, EV aggregators further dispatch the power to each EV for reducing the total BDC of EVs. In the dispatching process, various EVs provide FR service in the light of their actual condition such as BDC characteristics and state-of-charges (SOCs). To calculate the BDC of EVs accurately, the corresponding cost formulas that consider various EVs are fitting for guiding power dispatching. According to the sensitivity analysis, the FR regularity of EVs about FR performance is drawn for promoting the quantity of EVs participating in FR and further improving FR performance. Extensive case studies are presented to validate the effectiveness of the proposed method, where a large number of EVs participate in FR with cost-efficiency.

关键词： sensitivity analysis power generation dispatch optimisation frequency control electric vehicle charging hierarchical dispatching method hungarian algorithm frequency regulation resources FR performance exorbitant battery degradation cost BDC FR service cost-efficiency required FR power FR units EV aggregators system security dispatching process power dispatching state-of-charges sensitivity analysis optimisation coordinating strategy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：