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

Medical Imaging 2005 Conference

作者： dos Santos, M Furuie, SS Univ Sao Paulo Sch Med Inst Heart InCor Sao Paulo Brazil

ISBN: (纸本)0819457221

This work presents the development of a framework to make available a free, online, multipurpose and multimodality medical image database for software and algorithm evaluation. We have implemented a distributed architecture for medical image database, including authoring, storage, and repository for documents and image processing software. The system aims to offer a complete test bed and a set of resources including software, link to scientific papers, gold standards, reference images and post-processed images, enabling medical image processing community (scientists, physicians, students and industrials) to be more aware of evaluation issues. Our focus of development was on convenience and easy of use of a generic system adaptable to different contexts.

关键词： medical image image database algorithm evaluation

来源：评论

学校读者我要写书评

暂无评论

A survey of methods for image annotation

引用

JOURNAL OF VISUAL LANGUAGES AND COMPUTING 2008年第5期19卷 617-627页

作者： Hanbury, Allan Inst Comp Aided Automat Pattern Recognit & Image Proc Grp PRIP A-1040 Vienna Austria

In order to evaluate automated image annotation and object recognition algorithms, ground truth in the form of a set of images correctly annotated with text describing each image is required. In this paper, three image annotation approaches are reviewed: free text annotation, keyword annotation and annotation based on ontologies. The practical aspects of image annotation are then considered. We discuss the creation of keyword vocabularies for use in automated image annotation evaluation. As direct manual annotation of images requires much time and effort, we also review various methods to make the creation of ground truth more efficient. An overview of annotated image datasets for computer vision research is provided. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： image annotation object recognition computer vision ontology algorithm evaluation

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral data processing algorithm comparison software (HyperPACS™)

Hyperspectral data processing algorithm comparison software ...

引用

Conference on algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIII

作者： Runnels, Denise R. Leflore, Chad M. Dirbas, Joseph J. Radiance Technol Inc 775 N Univ Blvd Mobile AL 36608 USA PAR Govern Syst Corp La Jolla CA 92037 USA

ISBN: (纸本)9780819466877

Radiance Technologies has developed and integrated a multispectral/hyperspectral data analysis toolbox into an easy to use operator interface. HyperPACS(TM) (Hyperspectral data Processing algorithm Comparison Software) allows the data analyst to process spectral data in multiple input for-mats with many different spectral algorithms and/or different algorithm parameters and options. Results are compared to user supplied ground truth, and Receiver Operating Characteristic (ROC) curves providing a direct comparison of algorithm performance are generated. The HyperPACS(TM) GUI makes the software easy to use, and the architecture readily allows for the integration of custom algorithms provided by the analyst. Radiance has used HyperPACS(TM) in the evaluation of hyperspectral and multispectral algorithms in support of an ongoing program. A description of HyperPACS(TM) the GUI, and processing examples are given.

关键词： hyperspectral algorithm algorithm evaluation performance comparison hyperspectral data analysis algorithm parameter selection

来源：评论

学校读者我要写书评

暂无评论

Using controlled query generation to evaluate blind relevance feedback algorithms 06

Using controlled query generation to evaluate blind relevanc...

引用

6th ACM/IEEE Joint Conference on Digital Libraries (JCDL)

作者： Jordan, Chris Watters, Carolyn Gao, Qigang Dalhousie Univ Halifax NS Canada

ISBN: (纸本)1595933549

Currently in document retrieval there are many algorithms each with different strengths and weakness. There is some difficulty, however, in evaluating the impact of the test query set on retrieval results. The traditional evaluation process, the Cranfield evaluation paradigm, which uses a corpus and a set of user queries, focuses on making the queries as realistic as possible. Unfortunately such query sets lack the fine grained control necessary to test algorithm properties. We present an approach called Controlled Query Generation (CQG) that creates query sets from documents in the corpus in a way that regulates the theoretic information quality of each query. This allows us to generate reproducible and well defined sets of queries of varying length and term specificity. Imposing this level of control over the query sets used for testing retrieval algorithms enables the rigorous simulation of different query environments to identify specific algorithm properties before introducing user queries. In this work, we demonstrate the usefulness of CQG by generating three different query environments to investigate characteristics of two blind relevance feedback approaches.

关键词： Controlled Query Generation algorithm evaluation control environment blind relevance feedback

来源：评论

学校读者我要写书评

暂无评论

Research and implementation of a personalized recommendation system

引用

9th International Conference on Asian Digital Libraries

作者： Dong, Li Nie, Yu Xing, Chunxiao Wang, Kehong Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Tsinghua Univ Syst Div Lib Beijing 100084 Peoples R China SINA Corp Beijing 100084 Peoples R China Tsinghua Univ Res Inst Informat Technol Beijing 100084 Peoples R China

Personalized Recommendation System is a necessary part of Personalized Information Service System. In this paper, a personalized recommendation system is implemented and tested with actual website access data. Accordi... 详细信息

ISBN: (纸本)3540493751

关键词： personalized recommendation algorithm evaluation

来源：评论

学校读者我要写书评

暂无评论

Sharing medical images: a proposal of a reference image database

Sharing medical images: a proposal of a reference image data...

引用

Medical Imaging 2006 Conference

作者： dos Santos, Marcelo Furuie, Sergio S. Univ Sao Paulo Sch Med Heart Inst InCor Sao Paulo Brazil Univ Sao Paulo Polytech Sch EPUSP Sao Paulo Brazil

ISBN: (纸本)0819464244

Due to increasing number of digital images used in medical diagnosis, the image processing and analysis are becoming essential for many tasks in Medicine. One of the obstacles within the field of medical image processing is the lack of reference image datasets freely available for groups and/or individual users, in order to evaluate their new methods and applications. In order to improve this situation, this work presents the development of a framework to make available a free, online, multipurpose and multimodality medical image database for software and algorithm evaluation. The project is implemented as a distributed architecture for medical image database including a publishing workflow, authoring tools, and role-based access control. Our effort aims to offer a testbed and a set of resources including software, links to scientific papers, gold standards, reference and post-processed images, enabling the medical image processing community (scientists, physicians, students and industrials) to be more aware of evaluation issues. The proposed approach has been used as an electronic teaching system in Radiology as well.

关键词： medical image medical image database algorithm evaluation

来源：评论

学校读者我要写书评

暂无评论

evaluation of real-time QRS detection algorithms in variable contexts

引用

MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING 2005年第3期43卷 379-385页

作者： Portet, F Hernández, AI Carrault, G Univ Rennes 1 Unite INSERM Lab Traitement Signal & Image Rennes France

A method is presented to evaluate the detection performance of real-time QRS detection algorithms to propose a strategy for the adaptive selection of QRS detectors, in variable signal contexts. Signal contexts are defined as different combinations of QRS morphologies and clinical noise. Four QRS detectors are compared in these contexts by means of a multivariate analysis. This evaluation strategy is general and can be easily extended to a larger number of detectors. A set of morphology contexts, corresponding to eight QRS morphologies (normal, PVC, premature atrial beat, paced beat, LBBB, fusion, RBBB, junctional premature beat), was extracted from 17 standard ECG records. For each morphology context, the set of extracted beats, ranging from 30 to 23000, was resampled to generate 50 realisations of 20 concatenated beats. These realisations were then used as input to the QRS detectors, without noise, and with three different types of additive clinical noise (electrode motion artifact, muscle artifact, baseline wander) at three signal-to-noise ratios (5 dB, - 5 dB, - 15 dB). Performance was assessed by the number of errors, which reflected both false alarms and missed beats. The results show that the evaluated detectors are indeed complementary. For example, the Pan-Tompkins detector is the best in most contexts but the Okada detector generates fewer errors in the presence of electrode motion artifact. These results will be particularly useful to the development of a real-time system that will be able to choose the best QRS detector according to the current context.

关键词： ECG analysis QRS detection algorithm evaluation best algorithm selection real-time signal monitoring

来源：评论

学校读者我要写书评

暂无评论

Computational experience with exterior point algorithms for the transportation problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2004年第2期158卷 459-475页

作者： Papamanthou, C Paparrizos, K Samaras, N Univ Macedonia Dept Appl Informat Thessaloniki 54006 Greece

An experimental computational study to compare the classical primal simplex alaorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, four algorithms are compared on uniformly randomly generated test problems. The results are very encouraging for one of the competitive algorithms. In particular, a dual forest exterior point algoorithm is on average up to 4.5 times faster than network simplex algorithm on TPs of size 300 x 300 and for all classes. This result leads into corresponding savings in computational time. From the computational performance we conclude that as the problem size increases, exterior point algorithm get relatively faster. (C) 2003 Elsevier Inc. All rights reserved.

关键词： transportation problem network simplex algorithm exterior point simplex algorithms algorithm evaluation experimental computational study

来源：评论

学校读者我要写书评

暂无评论

Proper framework for the application of power management algorithms

引用

DESIGN AUTOMATION FOR EMBEDDED SYSTEMS 2004年第4期9卷 263-292页

作者： Thanos, G Stassinopoulos, G Natl Tech Univ Athens Dept Elect Engn & Comp Sci GR-15773 Athens Greece

A power aware system can reduce its energy dissipation by dynamically powering off during idle periods and powering on again upon a new service request arrival. We minimize the dissipated energy, by selecting the optimal waiting interval before powering off, under consideration of the expected time of the next arrival. This approach has been already proposed in the past, using the idle times distribution, rather than the interarrival periods captured at the moment of service completion. algorithms proposed in the literature utilize the history of idle periods or assume a vanishing service time. There has been no clear proposition on how service time affects the time instance of our power off decision;rather, whenever service time has been significant, a "blurred" image of the system's characteristic and a corresponding approximated optimal policy occurred. We clearly show analytically and experimentally that the idle times distribution should not be used as a primary design input, since it is the product of two separate inputs;the interarrival times and the service times. We give insight to our problem, using a mechanical equivalent established at the moment of service completion of all pending requests and show through analytical examples how service time affects our power-off decision. We explain the paradox of being advantageous to wait for intervals more than the shutdown threshold (which is a system characteristic) and show how the introduction of idle period lengths instead of interarrival periods "blurs" the input distribution, leading to non-optimal decisions. Our contribution is to define and solve the proper problem, solely relying on the interarrival distribution. Further, we examine the problem under the framework of competitive analysis. We show how the interarrival distribution that maximizes the competitive ratio, being an exponential distribution, intervenes with power management;it renders the optimization procedure worthless through its "memoryless

关键词： energy management competitive analysis optimization methods simulation algorithm evaluation

来源：评论

学校读者我要写书评

暂无评论

An efficient simplex type algorithm for sparse and dense linear programs

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2003年第2期148卷 323-334页

作者： Paparrizos, K Samaras, N Stephanides, G Univ Macedonia Dept Appl Informat Thessaloniki 54006 Greece

We present a big-M method for solving general linear programming problems with a recently developed exterior point simplex algorithm (EPSA). We also provide intuitive motivations to EPSA. We describe major steps in implementing EPSA for large-scale linear programming. Our implementation was carried out under the MATLAB environment. This algorithm seems to be more efficient than the classical primal simplex algorithm (PSA), employing Dantzig's rule. Preliminary computational studies on randomly generated sparse and dense small and medium linear programs support this belief. In particular, EPSA is up to 10 times faster than PSA on medium size linear programs. This translates into corresponding savings in CPU time. Although the computational effort required in each step of EPSA requires more time compared to an iteration step of PSA, the improvement of EPSA comes from the fact that it requires adequately less iterations than PSA. Moreover, as the problem size increases and the problem density decreases, EPSA gets relatively faster. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： linear programming simplex type algorithms big-M method algorithm evaluation numerical experiments

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：