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

Comparing algorithms for automated vessel segmentation in computed tomography scans of the lung: the VESSEL12 study

MEDICAL IMAGE ANALYSIS 2014年第7期18卷 1217-1232页

作者： Rudyanto, Rina D. Kerkstra, Sjoerd van Rilowort, Eva M. Fetita, Catalin Brillet, Pierre-Yves Lefevre, Christophe Xue, Wenzhe Zhu, Xiangjun Liang, Jianming Oksuz, Ilkay Unay, Devrim Kadipasoglu, Kamuran Estepar, Raul San Jose Ross, James C. Washko, George R. Prieto, Juan-Carlos Hernandez Hoyos, Marcela Orkisz, Maciej Meine, Hans Huellebrand, Markus Stoecker, Christina Mir, Fernando Lopez Naranjo, Valery Villanueva, Eliseo Staring, Marius Xiao, Changyan Stoel, Berend C. Fabijanska, Anna Smistad, Erik Elster, Anne C. Lindseth, Frank Foruzan, Amir Hossein Kiros, Ryan Popuri, Karteek Cobzas, Dana Jimenez-Carretero, Daniel Santos, Andres Ledesma-Carbayo, Maria J. Helmberger, Michael Urschler, Martin Pienn, Michael Bosboom, Dennis G. H. Campo, Arantza Prokop, Mathias de Jong, Pim A. Ortiz-de-Solorzano, Carlos Munoz-Barrutia, Arrate van Ginneken, Bram Univ Navarra Ctr Appl Med Res E-31080 Pamplona Spain Radboud Univ Nijmegen Med Ctr Diagnost Image Anal Grp NL-6525 ED Nijmegen Netherlands Inst SudParis Telecom Paris France Arizona State Univ Tempe AZ 85287 USA Bahcesehir Univ Istanbul Turkey Brigham & Womens Hosp Boston MA 02115 USA Univ Lyon CREATIS Lyon France Univ Los Andes Bogota Colombia Fraunhofer MEVIS Bremen Germany Leiden Univ Med Ctr Div Image Proc LKEB NL-2300 RA Leiden Netherlands Hunan Univ Changsha Hunan Peoples R China Lodz Univ Technol Inst Appl Comp Sci Lodz Poland Norwegian Univ Sci & Technol Oslo Norway Shahed Univ Tehran Iran Univ Alberta Edmonton AB T6G 2M7 Canada Univ Politecn Madrid E-28040 Madrid Spain CIBER BBN Zaragoza Spain Graz Univ Technol Inst Comp Vis & Graph A-8010 Graz Austria Ludwig Boltzmann Inst Clin Forens Imaging Graz Austria Ludwig Boltzmann Inst Lung Vasc Res Graz Austria Univ Navarra Univ Navarra Clin Dept Pulm E-31080 Pamplona Spain Univ Med Ctr Dept Radiol Utrecht Netherlands

The VESSEL12 (VESsel SEgmentation in the Lung) challenge objectively compares the performance of different algorithms to identify vessels in thoracic computed tomography (CT) scans. Vessel segmentation is fundamental in computer aided processing of data generated by 3D imaging modalities. As manual vessel segmentation is prohibitively time consuming, any real world application requires some form of automation. Several approaches exist for automated vessel segmentation, but judging their relative merits is difficult due to a lack of standardized evaluation. We present an annotated reference dataset containing 20 CT scans and propose nine categories to perform a comprehensive evaluation of vessel segmentation algorithms from both academia and industry. Twenty algorithms participated in the VESSEL12 challenge, held at International Symposium on Biomedical Imaging (ISBI) 2012. All results have been published at the VESSEL12 website http://***. The challenge remains ongoing and open to new participants. Our three contributions are: (1) an annotated reference dataset available online for evaluation of new algorithms;(2) a quantitative scoring system for objective comparison of algorithms;and (3) performance analysis of the strengths and weaknesses of the various vessel segmentation methods in the presence of various lung diseases. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Thoracic computed tomography Lung vessels algorithm comparison Segmentation Challenge

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of anomaly-detection algorithms for mouse dynamics

引用

COMPUTERS & SECURITY 2014年 45卷 156-171页

作者： Shen, Chao Cai, Zhongmin Guan, Xiaohong Maxion, Roy Xi An Jiao Tong Univ Xian 710049 Peoples R China Carnegie Mellon Univ Pittsburgh PA 15213 USA

Mouse dynamics-the analysis of mouse operating behaviors to identify users has been proposed for detecting impostors. Since many anomaly-detection algorithms have been proposed for this task, it is natural to ask how well these algorithms perform and how they compare with each other (e.g., to identify promising research directions). This paper presents a performance-evaluation study of a range of anomaly-detection algorithms in mouse dynamics on an equal basis. We collected a mouse-dynamics data set consisting of 17,400 samples from 58 subjects, developed a repeatable evaluation methodology, and implemented and evaluated 17 detectors from the mouse-dynamics and pattern-recognition literatures. Performance is measured in terms of detection accuracy, sensitivity to training sample size, usability with respect to sample length, and scalability with respect to the number of users (user space). The six top-performing detectors achieve equal-error rates between 8.81% and 11.63% with a detection time of 6.1 s;detector performance improves as training sample size and sample length increase and becomes saturated gradually;detector performance decreases as user space becomes large, but only small fluctuations with the error range are apparent when the space size exceeds a certain number. Along with the shared data and evaluation methodology, the results constitute a benchmark for comparing detectors and measuring progress. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Anomaly detection Behavioral biometrics Mouse dynamics Performance evaluation Benchmark study algorithm comparison

来源：评论

学校读者我要写书评

暂无评论

Performance of Redirected Walking algorithms in a Constrained Virtual World

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2014年第4期20卷 579-587页

作者： Hodgson, Eric Bachmann, Eric Thrash, Tyler Miami Univ Smale Interact Visualizat Ctr Oxford OH 45056 USA Miami Univ Oxford OH 45056 USA Swiss Fed Inst Technol Zurich Switzerland

Redirected walking algorithms imperceptibly rotate a virtual scene about users of immersive virtual environment systems in order to guide them away from tracking area boundaries. Ideally, these distortions permit users to explore large unbounded virtual worlds while walking naturally within a physically limited space. Many potential virtual worlds are composed of corridors, passageways, or aisles. Assuming users are not expected to walk through walls or other objects within the virtual world, these constrained worlds limit the directions of travel and as well as the number of opportunities to change direction. The resulting differences in user movement characteristics within the physical world have an impact on redirected walking algorithm performance. This work presents a comparison of generalized RDW algorithm performance within a constrained virtual world. In contrast to previous studies involving unconstrained virtual worlds, experimental results indicate that the steer-to-orbit keeps users in a smaller area than the steer-to-center algorithm. Moreover, in comparison to steer-to-center, steer-to-orbit is shown to reduce potential wall contacts by over 29%.

关键词： Virtual environments redirected walking navigation locomotion interface algorithm comparison

来源：评论

学校读者我要写书评

暂无评论

Standardized evaluation methodology and reference database for evaluating IVUS image segmentation

引用

COMPUTERIZED MEDICAL IMAGING AND GRAPHICS 2014年第2期38卷 70-90页

作者： Balocco, Simone Gatta, Carlo Ciompi, Francesco Wahle, Andreas Radeva, Petia Carlier, Stephane Unal, Gozde Sanidas, Elias Mauri, Josepa Carillo, Xavier Kovarnik, Tomas Wang, Ching-Wei Chen, Hsiang-Chou Exarchos, Themis P. Fotiadis, Dimitrios I. Destrempes, Francois Cloutier, Guy Pujol, Oriol Alberti, Marina Mendizabal-Ruiz, E. Gerardo Rivera, Mariano Aksoy, Timur Downe, Richard W. Kakadiaris, Ioannis A. Comp Vis Ctr Bellaterra Spain Univ Barcelona Dept Matemat Aplicada & Anal Barcelona Spain Univ Iowa Dept Elect & Comp Engn Iowa City IA 52242 USA UZ Brussel Dept Cardiol Brussels Belgium Sabanci Univ Fac Engn & Nat Sci Istanbul Turkey Cardiovasc Res Fdn New York NY USA Hosp Badalona Germans Trias & Pujol Badalona Spain Charles Univ Prague Dept Internal Med 2 Prague Czech Republic Natl Taiwan Univ Sci & Technol Taipei Taiwan Univ Ioannina Fdn Res & Technol Hellas Inst Mol Biol & Biotechnol Dept Biomed Res GR-45110 Ioannina Greece Univ Montreal Hosp Res Ctr CRCHUM Lab Biorheol & Med Ultrason Montreal PQ Canada Univ Montreal Inst Biomed Engn Dept Radiol Radiooncol & Nucl Med Montreal PQ Canada Univ Houston Dept Comp Sci Computat Biomed Lab Houston TX 77204 USA Ctr Invest Matemat Guanajuato Mexico

This paper describes an evaluation framework that allows a standardized and quantitative comparison of IVUS lumen and media segmentation algorithms. This framework has been introduced at the MICCAI 2011 Computing and Visualization for (Intra)Vascular Imaging (CVII) workshop, comparing the results of eight teams that participated. We describe the available data-base comprising of multi-center, multi-vendor and multi-frequency IVUS datasets, their acquisition, the creation of the reference standard and the evaluation measures. The approaches address segmentation of the lumen, the media, or both borders;semi- or fully-automatic operation;and 2-D vs. 3-D methodology. Three performance measures for quantitative analysis have been proposed. The results of the evaluation indicate that segmentation of the vessel lumen and media is possible with an accuracy that is comparable to manual annotation when semi-automatic methods are used, as well as encouraging results can be obtained also in case of fully-automatic segmentation. The analysis performed in this paper also highlights the challenges in IVUS segmentation that remains to be solved. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： IVUS (intravascular ultrasound) Evaluation framework algorithm comparison Image segmentation

来源：评论

学校读者我要写书评

暂无评论

User Behavior Analysis in Web Log through Comparative Study of Eclat and Apriori

User Behavior Analysis in Web Log through Comparative Study ...

引用

7th International Conference on Intelligent Systems and Control (ISCO)

作者： Kotiyal, Bina Kumar, Ankit Pant, Bhaskar Goudar, R. H. Chauhan, Shivali Junee, Sonam Graph Era Univ Dept CSE Dehra Dun Uttar Pradesh India

ISBN: (纸本)9781467346016;9781467343596

As we know World Wide Web plays vital role in serving the needs of the user's on web. The web log files are generated as a result of an interaction between the client and the service provider on web. Web log file contains the massive hidden valuable information pertaining to the visitors, if mined can be used for predicting the navigation behavior of the users. However the task of discovering frequent sequence patterns from the web log is challenging. Sequential pattern mining provides a significant role in serving a promising approach of the access behavior of the user. This paper focuses on adopting an intelligent technique that can provide personalized web service for accessing related web pages more efficiently and effectively, so that it can be determined which web pages are more likely to be accessed by the user in future. This paper uses two intelligent algorithms for predicting the user behavior's namely Apriori and Eclat and also does the performance comparison of the two algorithms in terms of time and space complexity for the filtered data.

关键词： Proposed Architecture Filtered Data algorithm comparison Web Usage Mining Sequential Pattern Mining Apriori Eclat Recommended System

来源：评论

学校读者我要写书评

暂无评论

Edge Detection by Using Edge Density and Eleven algorithm comparisons in Three Types of Color Images

Edge Detection by Using Edge Density and Eleven Algorithm Co...

引用

Conference on Color Imaging XVII - Displaying, Processing, Hardcopy, and Applications

作者： Wang, W. X. Xu, J. Y. Henan Polytech Univ Sch Comp Sci & Technol Kaifeng 454000 Henan Peoples R China Huawei Technol Co. Ltd Chengdu Peoples R China

ISBN: (纸本)9780819489395

Edge detection in grey scale image processing is a traditional research subject, but recently more and more researchers make efforts on the edge detection in color images. This paper presents a novel edge detection algorithm using the local, nonparametric estimation of the color image density. The method firstly analyses the edge shape information provided by the local probability distribution of the color image both in the horizontal and vertical directions respectively, then it obtains the modulus for the edge detection in the color image. With the increasing of window size, the other types of distributions can be simplified to the three types of the distributions presented in this study. In experiements, eleven different edge detection algorithms are compared for the three types of color images: smooth surface objects with a few edges;thin (or lines and curves) objects with many edges;and rough surface objects with more edges. And the algorithms include fractional, the first and the second order differential operators and other non-differential ones. Experiments show that the studied method is efficient. for edge extracting in a color image, and can give a satisfactory edge detection result in most cases.

关键词： Color image edge density edge detection algorithm comparison probability distribution

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of the simultaneous perturbation stochastic approximation algorithm on the noisy sphere model

引用

THEORETICAL COMPUTER SCIENCE 2012年第C期419卷 50-72页

作者： Finck, Steffen Beyer, Hans-Georg FH Vorarlberg Univ Appl Sci A-6850 Dornbirn Austria

To theoretically compare the behavior of different algorithms, compatible performance measures are necessary. Thus in the first part, an analysis approach, developed for evolution strategies, was applied to simultaneous perturbation stochastic approximation on the noisy sphere model. A considerable advantage of this approach is that convergence results for non-noisy and noisy optimization can be obtained simultaneously. Next to the convergence rates, optimal step sizes and convergence criteria for 3 different noise models were derived. These results were validated by simulation experiments. Afterward, the results were used for a comparison with evolution strategies on the sphere model in combination with the 3 noise models. It was shown that both strategies perform similarly, with a slight advantage for SPSA if optimal settings are used and the noise strength is not too large. (C) 2011 Elsevier B.V. All rights reserved.

关键词： algorithm comparison Stochastic gradient approximation Evolution strategy Noisy optimization

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study on Meta-Heuristic Search-Based Web Service Composition

An Empirical Study on Meta-Heuristic Search-Based Web Servic...

引用

9th IEEE International Conference on e-Business Engineering (ICEBE)/8th SOAIC/6th EM2I/6th SOKMBI/4th ASOC

作者： Mao, Chengying Chen, Jifu Yu, Xinxin Jiangxi Univ Finance & Econ Sch Software & Commun Engn Nanchang 330013 Peoples R China

ISBN: (纸本)9781467326018;9780769548098

In recent years, quite a few search algorithms have been used to solve Web service composition problem. However, it is still lack of systematic analysis about these methods. In the paper, we attempt to analyze the effect of three typical meta-heuristic search algorithms. The experimental analysis is performed according to the search-based Web service composition framework. In the experiments, we mainly carry out the analysis as follows: different abstract service number, different candidate service number and different QoS constraint strength. Based on the above analysis, some guidelines of realizing Web service composition via search algorithms are yielded. For example, EDA is suitable for the composition problem with large abstract service number. PSO is more effective for the case of large candidate service number. GA is a good choose for the little-scale Web service composition problem. In addition, EDA can effectively settle the composition problem with strong QoS constraint. GA is suitable for the problem with medium constraint strength, and PSO has the poor ability to tackle the QoS constraint with high strength.

关键词： Web service composition QoS constraints meta-heuristic search algorithm comparison

来源：评论

学校读者我要写书评

暂无评论

comparison among three kinds of hybrid particle swarm optimization algorithms

Comparison among three kinds of hybrid particle swarm optimi...

引用

23rd Chinese Control and Decision Conference

作者： Zhang, Handong Fang, Ling Cen, Yuwan Anhui Univ Technol Sch Elect Engn & Informat Maanshan Anhui Peoples R China

ISBN: (纸本)9781424487363

Hybrid particle swarm optimization(PSO) is such a kind of algorithms, which combine other algorithms or technologies to enhance the basic PSO. This paper compares three representative hybrid PSOs: breeding PSO, immune PSO, and chaos PSO. These comparisons are carried out in following aspects: the goals for hybrid, basic hybrid modes, the key implementation steps, optimization performances and so on. Through these comparisons and analysis, three hybrid algorithms' construction, implementation and respective application scope are summarized,especially, the optimization performances of three hybrid PSOs have been researched carefully. The goal is to find features of the three HPSOs and provide some guidence to develop new kinds of HPSO.

关键词： hybrid PSO algorithm comparison optimization performance immune PSO chaos PSO

来源：评论

学校读者我要写书评

暂无评论

comparison among three kinds of hybrid particle swarm optimization algorithms

Comparison among three kinds of hybrid particle swarm optimi...

引用

2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)

作者： Handong Zhang Ling Fang Yuwan Cen School of Electrical Engineering & Information Anhui University of Technology Maanshan Anhui China

Hybrid particle swarm optimization(PSO) is such a kind of algorithms, which combine other algorithms or technologies to enhance the basic PSO. This paper compares three representative hybrid PSOs: breeding PSO, immune PSO, and chaos PSO. These comparisons are carried out in following aspects: the goals for hybrid, basic hybrid modes, the key implementation steps, optimization performances and so on. Through these comparisons and analysis, three hybrid algorithms’ construction, implementation and respective application scope are summarized,especially, the optimization performances of three hybrid PSOs have been researched carefully. The goal is to find features of the three HPSOs and provide some guidence to develop new kinds of HPSO.

关键词： hybrid PSO algorithm comparison optimization performance immune PSO chaos PSO

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：