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

Performance Analysis of ToA-Based Positioning algorithms for Static and Dynamic Targets with Low Ranging Measurements

引用

SENSORS 2017年第8期17卷 1915-1915页

作者： Ferreira, Andre G. Fernandes, Duarte Catarino, Andre P. Monteiro, Joao L. Univ Minho Algoritmi Ctr P-4800058 Guimaraes Portugal Univ Minho Ctr Text Sci & Technol P-4800058 Guimaraes Portugal

Indoor Positioning Systems (IPSs) for emergency responders is a challenging field attracting researchers worldwide. When compared with traditional indoor positioning solutions, the IPSs for emergency responders stand out as they have to operate in harsh and unstructured environments. From the various technologies available for the localization process, ultra-wide band (UWB) is a promising technology for such systems due to its robust signaling in harsh environments, through-wall propagation and high-resolution ranging. However, during emergency responders' missions, the availability of UWB signals is generally low (the nodes have to be deployed as the emergency responders enter a building) and can be affected by the non-line-of-sight (NLOS) conditions. In this paper, the performance of four typical distance-based positioning algorithms (Analytical, Least Squares, Taylor Series, and Extended Kalman Filter methods) with only three ranging measurements is assessed based on a COTS UWB transceiver. These algorithms are compared based on accuracy, precision and root mean square error (RMSE). The algorithms were evaluated under two environments with different propagation conditions (an atrium and a lab), for static and mobile devices, and under the human body's influence. A NLOS identification and error mitigation algorithm was also used to improve the ranging measurements. The results show that the Extended Kalman Filter outperforms the other algorithms in almost every scenario, but it is affected by the low measurement rate of the UWB system.

关键词： algorithms comparison emergency responders indoor positioning system (IPS) NLOS identification and mitigation positioning algorithms unstructured environments UWB

来源：评论

学校读者我要写书评

暂无评论

Ranking and comparing evolutionary algorithms with Hellinger-TOPSIS

引用

APPLIED SOFT COMPUTING 2015年 37卷 217-226页

作者： Krohling, Renato A. Lourenzutti, Rodolfo Campos, Mauro Univ Fed Espirito Santo PPGI UFES Dept Prod Engn BR-29060270 Vitoria ES Brazil Univ Fed Espirito Santo PPGI UFES Grad Program Comp Sci BR-29060270 Vitoria ES Brazil

When multiple algorithms are applied to multiple benchmarks as it is common in evolutionary computation, a typical issue rises, how can we rank the algorithms? It is a common practice in evolutionary computation to execute the algorithms several times and then the mean value and the standard deviation are calculated. In order to compare the algorithms performance it is very common to use statistical hypothesis tests. In this paper, we propose a novel alternative method based on the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to support the performance comparisons. In this case, the alternatives are the algorithms and the criteria are the benchmarks. Since the standard TOPSIS is not able to handle the stochastic nature of evolutionary algorithms, we apply the Hellinger-TOPSIS, which uses the Hellinger distance, for algorithm comparisons. Case studies are used to illustrate the method for evolutionary algorithms but the approach is general. The simulation results show the feasibility of the Hellinger-TOPSIS to find out the ranking of algorithms under evaluation. (C) 2015 Elsevier B.V. All rights reserved.

关键词： algorithms comparison TOPSIS Hellinger-TOPSIS Hellinger distance

来源：评论

学校读者我要写书评

暂无评论

comparison and Assessment of Different Image Registration algorithms Based on ITK

Comparison and Assessment of Different Image Registration Al...

引用

International Conference on Materials Engineering and Mechanical Automation (MEMA 2013)

作者： Zhou, Zhenhuan Shenzhen Polytech Sch Elect & Commun Engn Shenzhen 518055 Guangdong Peoples R China

ISBN: (纸本)9783037859018

A lot of image registration algorithms are proposed in recent year, among these algorithms, which one is better or faster than the other can be only validated by experiments. In this paper, ITK (Insight Segmentation and Registration Toolkit) is used for verifying different algorithms as a framework. ITK framework requires the following components: a fixed image, a moving image, a transform, a metric, an interpolator and an optimizer. Dozens of classical algorithms are tested under the same conditions and their experimental results are demonstrated with different metrics, interpolators or optimizers. By comparison of registration time and accuracy, those practical and useful algorithms are selected for developing software in image analysis. These kinds of experiments are very valuable for software engineering, they can shorten the cycle of software development and greatly reduce the development costs.

关键词： Image registration ITK algorithms comparison Registration framework

来源：评论

学校读者我要写书评

暂无评论

Cross-Frame Ultrasonic Color Doppler Flow Heart Image Unwrapping 8th

Cross-Frame Ultrasonic Color Doppler Flow Heart Image Unwrap...

引用

8th International Conference on Functional Imaging and Modeling of the Heart(FIMH)

作者： Yatchenko, Artem Krylov, Andrey Moscow MV Lomonosov State Univ Fac Computat Math & Cybernet Lab Math Methods Image Proc Moscow Russia

ISBN: (纸本)9783319203096;9783319203089

Ultrasonic color Doppler flow image unwrapping algorithm that uses cross-frame connection is proposed and compared with other unwrapping methods. An original complex phase preliminary filtration is used to suppress a false-aliasing artifact and to improve the results. Flow variances are used as weight coefficients in the minimization energy function. For the comparison a test data series is constructed. It uses an anatomic 3D left ventricle region model for the simulation of the blood flow. Experiments show that cross-frame weights significantly improve the quality of unwrapping.

关键词： Ultrasound color doppler flow mapping Cross-frame Phase unwrapping Heart Blood flow model algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

A-TOPSIS - An approach Based on TOPSIS for Ranking Evolutionary algorithms 3

A-TOPSIS - An approach Based on TOPSIS for Ranking Evolution...

引用

3rd International Conference on Information Technology and Quantitative Management (ITQM)

作者： Krohling, Renato A. Pacheco, Andre G. C. UFES Fed Univ Espirito Santo Prod Engn Dept BR-29060270 Vitoria Brazil UFES Fed Univ Espirito Santo PPGI Grad Program Comp Sci BR-29060270 Vitoria Brazil

In this paper, we propose an alternative novel method based on the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) to solve the problem of ranking and comparing algorithms. In evolutionary computation, algorithms are executed several times and then a statistic in terms of mean values and standard deviations are calculated. In order to compare algorithms performance it is very common to handle such issue by means of statistical tests. Ranking algorithms, e.g., by means of Friedman test may also present limitations since they consider only the mean value and not the standard deviation of the results. Since the TOPSIS is not able to handle directly this kind of data, we develop an approach based on TOPSIS for algorithm ranking named as A-TOPSIS. In this case, the alternatives consist of the algorithms and the criteria are the benchmarks. The rating of the alternatives with respect to the criteria are expressed by means of a decision matrix in terms of mean values and standard deviations. A case study is used to illustrate the method for evolutionary algorithms. The simulation results show the feasibility of the A-TOPSIS to find out the ranking of algorithms under evaluation. (C) 2015 Published by Elsevier B.V.

关键词： algorithms comparison ranking TOPSIS evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Replication and comparison of computational experiments in applied evolutionary computing: Common pitfalls and guidelines to avoid them

引用

APPLIED SOFT COMPUTING 2014年 19卷 161-170页

作者： Crepinsek, Matej Liu, Shih-Hsi Mernik, Marjan Univ Maribor Fac Elect Engn & Comp Sci Maribor 2000 Slovenia Calif State Univ Fresno Dept Comp Sci Fresno CA 93740 USA

Replicating and comparing computational experiments in applied evolutionary computing may sound like a trivial task. Unfortunately, it is not so. Namely, many papers do not document experimental settings in sufficient detail, and hence replication of experiments is almost impossible. Additionally, some work fails to satisfy the thumb rules for Experimentation throughout all disciplines, such that all experiments should be conducted and compared under the same or stricter conditions. Also, because of the stochastic properties inherent in evolutionary algorithms (EAs), experimental results should always be rich enough with respect to Statistics. Moreover, the comparisons conducted should be based on suitable performance measures and show the statistical significance of one approach over others. Otherwise, the derived conclusions may fail to have scientific merits. The primary objective of this paper is to offer some preliminary guidelines and reminders for assisting researchers to conduct any replications and comparisons of computational experiments when solving practical problems, by the use of EAs in the future. The common pitfalls are explained, that solve economic load dispatch problems using EAs from concrete examples found in some papers. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Evolutionary algorithms Experiments replication algorithms comparison Economic load dispatch

来源：评论

学校读者我要写书评

暂无评论

A-TOPSIS – An Approach Based on TOPSIS for Ranking Evolutionary algorithms

引用

Procedia Computer Science 2015年 55卷 308-317页

作者： Renato A. Krohling André G.C. Pacheco Production Engineering Department UFES - Federal University of Espirito Santo Av. Fernando Ferrari 514 Vitória CEP: 29060-270 Brazil Graduate Program in Computer Science PPGI UFES - Federal University of Espirito Santo Av. Fernando Ferrari 514 Vitória CEP: 29060-270 Brazil

关键词： algorithms comparison ranking TOPSIS evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

comparison and Assessment of Different Image Registration algorithms Based on ITK

Comparison and Assessment of Different Image Registration Al...

引用

2013 International Conference on Materials Engineering and Mechanical Automation(MEMA 2013)

作者： Zhenhuan Zhou School of Electronics and Communication Engineering Shenzhen Polytechnic

A lot of image registration algorithms are proposed in recent year,among these algorithms,which one is better or faster than the other can be only validated by *** this paper,ITK(Insight Segmentation and Registration Toolkit)is used for verifying different algorithms as a *** framework requires the following components:a fixed image,a moving image,a transform,a metric,an interpolator and an *** of classical algorithms are tested under the same conditions and their experimental results are demonstrated with different metrics,interpolators or *** comparison of registration time and accuracy,those practical and useful algorithms are selected for developing software in image *** kinds of experiments are very valuable for software engineering,they can shorten the cycle of software development and greatly reduce the development costs.

关键词： Image registration ITK algorithms comparison Registration framework

来源：评论

学校读者我要写书评

暂无评论

Qualitative comparison of Community Detection algorithms

Qualitative Comparison of Community Detection Algorithms

引用

International Conference on Digital Information and Communication Technology and Its Applications

作者： Orman, Gunce Keziban Labatut, Vincent Cherifi, Hocine Galatasaray Univ Dept Comp Sci Istanbul Turkey Univ Burgundy CNRS LE2I UMR F-5158 Dijon France

ISBN: (纸本)9783642220265

Community detection is a very active field in complex networks analysis, consisting in identifying groups of nodes more densely interconnected relatively to the rest of the network. The existing algorithms are usually tested and compared on real-world and artificial networks, their performance being assessed through some partition similarity measure. However, artificial networks realism can be questioned, and the appropriateness of those measures is not obvious. In this study, we take advantage of recent advances concerning the characterization of community structures to tackle these questions. We first generate networks thanks to the most realistic model available to date. Their analysis reveals they display only some of the properties observed in real-world community structures. We then apply five community detection algorithms on these networks and find out the performance assessed quantitatively does not necessarily agree with a qualitative analysis of the identified communities. It therefore seems both approaches should be applied to perform a relevant comparison of the algorithms.

关键词： Complex Networks Community Detection Community Properties algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

A comparison of Community Detection algorithms on Artificial Networks

A Comparison of Community Detection Algorithms on Artificial...

引用

12th International Conference on Discovery Science

作者： Orman, Guence Keziban Labatut, Vincent Galatasaray Univ Dept Comp Sci Ortakoy Istanbul Turkey

ISBN: (纸本)9783642047466

Community detection has become a very important part in complex networks analysis. Authors traditionally test their algorithms on a few real or artificial networks. Testing on real networks is necessary, but also limited: the considered real networks are usually small, the actual underlying communities are generally not defined objectively, and it is not possible to control their properties. Generating artificial networks makes it possible to overcome these limitations. Until recently though, most works used variations of the classic Erdos-Renyi random model and consequently suffered from the same flaws, generating networks not realistic enough. In this work, we use Lancichinetti et al. model, which is able to generate networks with controlled power-law degree and community distributions, to test some community detection algorithms. We analyze the properties of the generated networks and use the normalized mutual information measure to assess the quality of the results and compare the considered algorithms.

关键词： Complex networks Community detection algorithms comparison

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：