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

Infrared target detection based on Gaussian model and hungarian algorithm

ENTERPRISE INFORMATION SYSTEMS 2022年第10-11期16卷 1573-1586页

作者： Zhu, Zhiyu Lou, Kang Ge, Huilin Xu, Qingqing Wu, Xuedong Jiangsu Univ Sci & Technol Sch Elect Informat Zhenjiang 212003 Jiangsu Peoples R China

Based on Gaussian distribution, a method for modelling targets is proposed. The trajectories of infrared targets are predicted by Kalman filtering. The Munkres version of the hungarian algorithm is utilized to find the optimum assignment between the trajectories and the positions of real targets. Finally, based on the open dataset, we prove that the proposed algorithm is able to find and track infrared dim targets more effectively, while satisfying the requirements of real-time detection.

关键词： Gaussian model hungarian algorithm Kalman filter detection tracking infrared weak target

来源：评论

学校读者我要写书评

暂无评论

An Iterative hungarian algorithm Based Coordinated Spectrum Sensing Strategy

引用

IEEE COMMUNICATIONS LETTERS 2011年第1期15卷 49-51页

作者： Wang, Zaili Feng, Zhiyong Zhang, Ping Beijing Univ Posts & Telecommun Wireless Technol Innovat Inst Beijing 100876 Peoples R China Beijing Univ Posts & Telecommun Minist Educ Key Lab Universal Wireless Commun Beijing 100876 Peoples R China

Coordinated spectrum sensing ensures Cognitive Radio systems to get the usability of every channel within the entire spectrum of interest by assigning terminals to detect different channels simultaneously. This letter proposes an optimized channel-assignment strategy for coordinated spectrum sensing based on an Iterative hungarian algorithm. Simulation results show that the proposed strategy performs excellently in improving the overall sensing performance of the system.

关键词： Cognitive radio (CR) spectrum sensing coordinated sensing hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic rolling-horizon strategy for the electric trolley scheduling in frame bridge-based automated container terminals based on hungarian algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY 2014年第3-4期50卷 166-173页

作者： He, Junliang Zhang, Weimin Huang, Youfang Yan, Wei Tongji Univ Sch Mech Engn Shanghai 201804 Peoples R China Shanghai Maritime Univ Minist Educ Engn Res Ctr Container Supply Chain Technol Shanghai 201306 Peoples R China

Automated container terminal (ACT) is attracting more and more attentions. This paper mainly focuses on proposing an efficient approach for the electric trolley scheduling in frame bridge-based automated container terminals (FB-ACTs). An integer programming model is presented for electric trolley (ET) scheduling problem, where the objective function is subject to the minimisation of the makespan of all tasks. Furthermore, owing to computational intractability regarding ET scheduling, a heuristic algorithm based on hungarian algorithm, which can guarantee to find the optimal solution in a short time in most cases, is then developed. Afterwards, dynamic rolling-horizon decision strategy is employed to implement the proposed heuristic algorithm. Finally, computational experiments are applied to verify the effectiveness and robustness of the proposed approach.

关键词： FB-ACT frame bridge-based automated container terminal electric trolley scheduling integer programming hungarian algorithm dynamic rolling-horizon decision strategy

来源：评论

学校读者我要写书评

暂无评论

Combined Internal Trucks Allocation of Multiple Container Terminals with hungarian algorithm

引用

JOURNAL OF COASTAL RESEARCH 2020年第Sup1期103卷 923-927页

作者： Yang, Xiaobin Zhao, Ning Yu, Siqin Shanghai Maritime Univ Econ & Management Coll Shanghai 201306 Peoples R China Shanghai Maritime Univ Logist Engn Coll Shanghai 201306 Peoples R China

With the rising efficiency demand and intelligence trend of the container terminals (CTs), horizontal transportation could be a vital bottle neck of terminal operations. In artificial terminals, Internal trucks (ITs) is the most common and versatile horizontal equipment, the efficiency of ITs affects horizontal transportation efficiency greatly. With sharing ITs among multiple CTs located nearby, the IT resource could be allocated in a wider range to further improve handling efficiency. In this paper, we proposed a multi-objective MIP model for IT allocation, and a hungarian algorithm is introduced to solve the problem in a preferable period of time. Numerical experiment shows that, the proposed model and hungarian algorithm are efficient to achieve the optimal allocation solution.

关键词： Internal truck allocation multiple container terminals hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

Feasiblity of hungarian algorithm based Scheduling

Feasiblity of Hungarian Algorithm based Scheduling

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Tamura, Shinsuke Kodera, Yuki Taniguchi, Shuji Yanase, Tatsuro Univ Fukui Grad Sch Engn Fukui 910 Japan

ISBN: (纸本)9781424465880

An optimal resource allocation algorithm, hungarian algorithm, is not directly applicable to manufacturing scheduling problems, because solutions of resource allocation problems may violate precedence constraints among processes that constitute individual manufacturing jobs. To apply hungarian algorithm to scheduling problems, in this paper, several strategies for assigning prices to time slots of individual machines, which are allocated to processes, are proposed. Preliminary experimentation results showed that these strategies can generate near optimal schedules, i.e. when lengths of scheduling horizons were larger than 3 times of the maximum lengths of jobs, generated schedules could complete given jobs while maintaining the deterioration of the efficiency less than 5% from optimal schedules.

关键词： scheduling hungarian algorithm near-optimal schedules

来源：评论

学校读者我要写书评

暂无评论

Query Time Optimization Using hungarian algorithm 2nd

Query Time Optimization Using Hungarian Algorithm

引用

2nd International Conference on Communications and Cyber-Physical Engineering (ICCCE)

作者： Dias, Steffy Kolhe, Shweta Shinde, Ruchi Chaudhari, Richa Wahul, Revati M. Modern Educ Soc Coll Engn Pune Maharashtra India

ISBN: (纸本)9789811387159;9789811387142

The huge amount of data that is committed to the databases, takes more time, than the time that is estimated which further creates trouble for database transactions. To untighten this process, data needs to be clustered based on common attributes, to commit data faster. Databases like Hadoop have structures like MapReduce, which are incompetent to handle the process alone. As a result, the accumulation of these transactions eventually slows down the process as well as adversely affects the performance of the application that creates havoc at the user end. The proposed system puts forth the idea of decomposing this data to hyper graphs based on correlating features between them. Furthermore, the use of hungarian and Genetic algorithm, achieves optimized transaction time.

关键词： Hadoop MapReduce Hyper graphs hungarian algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

HBP: AN EFFICIENT BLOCK PERMUTATION SOLVER USING hungarian algorithm AND SPECTROGRAM INPAINTING FOR MULTICHANNEL AUDIO SOURCE SEPARATION 47

HBP: AN EFFICIENT BLOCK PERMUTATION SOLVER USING HUNGARIAN A...

引用

47th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Li, Li Kameoka, Hirokazu Seki, Shogo NTT Corp NTT Commun Sci Labs Tokyo Japan Nagoya Univ Informat Technol Ctr Nagoya Aichi Japan

ISBN: (纸本)9781665405409

This paper proposes a method called "hungarian Block Permutation (HBP)" to solve the block permutation problem in frequency-domain multichannel audio source separation. Many methods for frequency-domain multichannel audio source separation are designed to simultaneously solve frequency-wise source separation and permutation alignment in determined cases. However, in practice, separation can fail due to permutation inconsistencies in different frequency blocks for various reasons, such as convergence to a locally optimal solution as a result of bad initialization. To correct permutation inconsistencies, the proposed HBP method first masks, for each separated signal, the frequency bands where the components from other sources are likely to be dominant, and then restores the components in those bands so that the restored spectrogram becomes closer to the original spectrogram of the corresponding source. The hungarian algorithm is then used to perform permutation realignment in those bands in accordance with the restored spectrogram. The experimental results show that the proposed method can solve the permutation realignment and improve the separation performance even in the case of 18 speakers.

关键词： Multichannel source separation block permutation hungarian algorithm audio inpainting

来源：评论

学校读者我要写书评

暂无评论

Automatic Design Method of Dynamic Systems Based on hungarian algorithm and Genetic Programming

Automatic Design Method of Dynamic Systems Based on Hungaria...

引用

4th International Conference on Wireless Communications, Networking and Mobile Computing

作者： Li Shaobo Yang Guanci Xie Qingsheng Guizhou Univ Key Lab Adv Mfg Technol Guiyang Peoples R China

ISBN: (纸本)9781424421077

This paper summarizes the present research status of automated design method for dynamic systems, investigates efficient method of fitness definition for automated design method of dynamic systems based on bond graphs and genetic programming. The automated design method based on hungarian algorithm and genetic programming (HAGP) is proposed, and the statistic results of domain independent - an eigenvalues -placement design problem, which is tested for some sample target sets of eigenvalues, strongly shows the search capability of HAGP is good enough to make feasible automated design and obtain high-quality, well evolutionary solutions with less computational efforts, rapid speed in convergence compared to other state-of art algorithms.

关键词： dynamic systems genetic programming hungarian algorithm bond graphs eigenvalue

来源：评论

学校读者我要写书评

暂无评论

The Research and Analysis of hungarian algorithm in the Structure Index Reduction for DAE

The Research and Analysis of Hungarian Algorithm in the Stru...

引用

11th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES)

作者： Zeng, Yan Wu, Xuesong Cao, Jianwen Chinese Acad Sci Inst Software Lab Parallel Software & Computat Sci Software Beijing 100190 Peoples R China

ISBN: (纸本)9780769548180

Modeling of complex physical systems with Modelica usually leads to the high-index differential algebraic equation system (DAE), index reduction is an important part of solving the high-index DAE. The structure index reduction algorithm is one of the popular methods, but in special cases, it fails. Combinatorial relaxation algorithm can detect and correct the breakdown situation. And the maximum weight matching of bipartite graph is an important part of the combinatorial relaxation algorithm. In order to choose the proper method for the large-scale, dense bipartite graph, this paper provides three implementations of the hungarian algorithm. The experiment results and the theory show that the BFS single-augmented method is better than others.

关键词： Modelica Bipartite Graph DAE hungarian algorithm Augmenting Path

来源：评论

学校读者我要写书评

暂无评论

A hungarian algorithm for Error-Correcting Graph Matching 11th

A Hungarian Algorithm for Error-Correcting Graph Matching

引用

11th IAPR-TC15 International Workshop on Graph-Based Representations in Pattern Recognition (GbRPR)

作者： Bougleux, Sebastien Gauzere, Benoit Brun, Luc Normandie Univ CNRS ENSICAEN UNICAEN Caen France Normandie Univ INSA Rouen Rouen France

ISBN: (纸本)9783319589619;9783319589602

Bipartite graph matching algorithms become more and more popular to solve error-correcting graph matching problems and to approximate the graph edit distance of two graphs. However, the memory requirements and execution times of this method are respectively proportional to (n + m)(2) and (n + m)(3) where n and m are the order of the graphs. Subsequent developments reduced these complexities. However, these improvements are valid only under some constraints on the parameters of the graph edit distance. We propose in this paper a new formulation of the bipartite graph matching algorithm designed to solve efficiently the associated graph edit distance problem. The resulting algorithm requires O(nm) memory space and O(min(n, m)(2) max(n, m)) execution times.

关键词： Graph edit distance Bipartite matching Error-correcting matching hungarian algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：