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

SPIE Conference on algorithm for Synthetic Aperture Radar Imagery V

作者： Mossing, JC Ross, TD Sverdrup Technol Inc Adv Syst Grp Beavercreek OH 45431 USA

ISBN: (纸本)0819428191

Testing a SAR Automatic Target Recognition (ATR) algorithm at or very near its training conditions often yields near perfect results as we commonly see in the literature. This paper describes a series of experiments near and not so near to ATR algorithm training conditions. Experiments are setup to isolate individual Extended Operating Conditions (EOCs) and performance is reported at these points. Additional experiments are setup to isolate specific combinations of EOCs and the SAR ATR algorithm's performance is measured here also. The experiments presented here are a by-product of a DARPA/AFRL Moving and Stationary Target Acquisition and Recognition (MSTAR) program evaluation conducted in November of 1997. Although the tests conducted here are in the domain of EOCs, these tests do not encompass the "real world" (i.e., what you might see on the battlefield) problem. In addition to performance results this paper describes an evaluation methodology including the Extended Operating Condition concept, as well as, data;algorithm, and figures of merit. In summary, this paper highlights the sensitivity that a baseline Mean Squared Error (MSE) ATR algorithm has to various operating conditions both near and varying degrees away from the training conditions.

关键词： performance sensitivity automatic target recognition synthetic aperture radar extended operating conditions algorithm evaluation mean square error classifier MSTAR

来源：评论

学校读者我要写书评

暂无评论

The FERET database and evaluation procedure for face-recognition algorithms

引用

IMAGE AND VISION COMPUTING 1998年第5期16卷 295-306页

作者： Phillips, PJ Wechsler, H Huang, J Rauss, PJ USA Res Lab Adelphi MD 20783 USA George Mason Univ Dept Comp Sci Fairfax VA 22030 USA

The Face Recognition Technology (FERET) program database is a large database of facial images, divided into development and sequestered portions. The development portion is made available to researchers, and the sequestered portion is reserved for testing face-recognition algorithms. The FERET evaluation procedure is an independently administered test of face-recognition algorithms. The test was designed to: (1) allow a direct comparison between different algorithms, (2) identify the most promising approaches, (3) assess the state of the art in face recognition, (4) identify future directions of research, and (5) advance the state of the art in face recognition. (C) 1998 Published by Elsevier Science B.V. All rights reserved.

关键词： face recognition algorithm evaluation image databases

来源：评论

学校读者我要写书评

暂无评论

A quantitative study of experimental evaluations of neural network learning algorithms: Current research practice

引用

NEURAL NETWORKS 1996年第3期9卷 457-462页

作者： Prechelt, L Universit?t Karlsruhe Germany

In all, 190 articles about neural network learning algorithms published in 1993 and 1994 are examined for the amount of experimental evaluation they contain. Some 29% of them employ not even a single realistic or real learning problem. Only 8% of the articles present results for more than one problem using real world data. Furthermore, one third of all articles do not present any quantitative comparison with a previously known algorithm. These results suggest that we should strive for better assessment practices in neural network learning algorithm research. For the long-term benefit of the field, the publication standards should be raised in this respect and easily accessible collections of benchmark problems should be built. Copyright (C) 1996 Elsevier Science Ltd

关键词： algorithm evaluation science experiment

来源：评论

学校读者我要写书评

暂无评论

A self-scaling implicit SQP method for large scale structural optimization

引用

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 1996年第11期39卷 1933-1953页

作者： Huang, MW Arora, JS Optimal Design Laboratory College of Engineering The University of Iowa Iowa City IA 52242 U.S.A. [*]Optimal Design Laboratory College of Engineering The University of Iowa Iowa City IA 52242 U.S.A.

The basic idea bf an implicit sequential quadratic programming (ISQP) method for constrained problems is to use the approximate Hessian of the Lagrangian without explicitly calculating and storing it. This overcomes one of the major drawbacks of the traditional SQP method where a large matrix needs to be calculated and stored. This concept of an implicit method is explained and an algorithm based on it is presented. The proposed method extends a similar algorithm for unconstrained problems where a two-loop recursion formula is used for the inverse Hessian matrix. The present paper develops a similar algorithm for not only the constrained problem but also the direct Hessian updates. Several scaling procedures for the Hessian are also presented and evaluated. The basic method and some of its variations are evaluated using a set of mathematical programming test problems, and a set of structural design test problems-small to larger scale. The ISQP method performs much better than a method that does not use any approximate Hessian matrix. Its performance is better than the full SQP method for larger scale problems. The test results also show that an appropriate scaling of the Hessian can improve both efficiency and reliability substantially.

关键词： structures optimization large scale structural design sequential quadratic programming self-scaling numerical algorithms algorithm evaluation test problems

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE OF SEVERAL OPTIMIZATION METHODS ON ROBOT TRAJECTORY PLANNING PROBLEMS

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 1994年第6期15卷 1401-1412页

作者： ECKER, JG KUPFERSCHMID, M MARIN, SP RENSSELAER POLYTECH INST ALAN M VOORHEES COMP CTRTROYNY 12180

This paper provides a comparison and analysis of the performance of a special purpose algorithm and several specific available nonlinear programming codes applied to a robot trajectory problem.

关键词： NONLINEAR PROGRAMMING algorithm evaluation ROBOT MODELING

来源：评论

学校读者我要写书评

暂无评论

METHODICAL ANALYSIS OF ADAPTIVE LOAD SHARING algorithmS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1992年第6期3卷 747-760页

作者： KREMIEN, O KRAMER, J UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED DISTRIBUTED SOFTWARE ENGN RES SECTLONDON SW7 2BZENGLAND

This paper presents a method for qualitative and quantitative analysis of load sharing algorithms, using a number of well known examples as illustration. algorithm design choices are considered with respect to the main activities of information dissemination and allocation decision making. We argue that nodes must be capable of making local decisions, and for this efficient state dissemination techniques are necessary. Activities related to remote execution should be bounded and restricted to a small proportion of the activity in the system. The quantitative analysis provides both performance and efficiency measures, including consideration of the load and delay characteristics of the environment. To assess stability, which is also a precondition for scalability, we introduce and measure load sharing hit-ratio, the ratio of remote execution requests concluded successfully. Using our analysis method, we are able to suggest improvements to some published algorithms.

关键词： ADAPTABILITY algorithm evaluation EFFICIENCY HIT-RATIO LOAD SHARING PERFORMANCE SCALABILITY STABILITY

来源：评论

学校读者我要写书评

暂无评论

DUPLICATE REMOVAL ON HYPERCUBE ENGINES - AN EXPERIMENTAL-ANALYSIS

引用

PARALLEL COMPUTING 1991年第8期17卷 845-871页

作者： TOPKAR, V FRIEDER, O SOOD, AK Department of Computer Science George Mason University Fairfax VA 22030-4444 USA

The Duplicate Removal Problem (DRP) appears in a number of applications such as protocol verification, database operations and image processing. Although numerous parallel sorting algorithms have been proposed, DRP has received relatively little attention. In this paper we propose and study three parallel duplicate removal algorithms. The algorithms are implemented and evaluated on an Intel iPSC/2 hypercube. We assume that all the data are resident in the main memory and do not consider the I/O access times. The results indicate that the performance of a parallel duplicate removal algorithm is a function of the system and data conditions, viz. the number of nodes, the number of data values, the uniqueness factors, and the processing and data transfer speeds. The results suggest amethod of selecting an optimum algorithm based on the data and system conditions. To interpret and scale the results of the experiments, we developed analytical models of the algorithms. Those models compare favorably to the results obtained experimentally. Finally the average computational complexity of each of the three algorithms is presented.

关键词： DUPLICATE REMOVAL PROBLEMS HYPERCUBE ARCHITECTURE algorithm evaluation TIMING RESULTS LUTEL PSC12

来源：评论

学校读者我要写书评

暂无评论

VALUE OF SCATTER-GRAPHS FOR THE ASSESSMENT OF ECG COMPUTER MEASUREMENT RESULTS

引用

METHODS OF INFORMATION IN MEDICINE 1990年第4期29卷 413-423页

作者： MORLET, D RUBEL, P WILLEMS, JL CATHOLIC UNIV LEUVEN HOSP GASTHUISBERGCSE COORDINATING CTRB-3000 LOUVAINBELGIUM INST NATL SCI APPL DEPT INFORMATVILLEURBANNEFRANCE

A new method is presented, different from usual methods, for the discussion of the results of computer ECG measurement programs, based on a new graphical evaluation method. The proposed “scatter-graphs” both highlight the main program results and facilitate the comparison between various wave-recognition algorithms. They allow the distinction between the reliability of an algorithm, which is its capacity to provide a maximum of measurements with a minimum amount of errors, and its precision, i.e., the standard deviation of the differences between its point estimates and the reference. The method proves to be a powerful tool for the discussion of individual, as well as the median program results in CSE Measurement Study. It allows to highlight limitations induced in performance assessment by the variability of the reference itself, and to state that the median program is at least as close to the “Gold Standard” as the median of the referees.

关键词： ECG Processing Quantitative Electrocardiography Program evaluation Graphical evaluation Method algorithm evaluation

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED METHOD TO EVALUATE THE PRECISION OF COMPUTER ECG MEASUREMENT PROGRAMS

引用

INTERNATIONAL JOURNAL OF BIO-MEDICAL COMPUTING 1988年第3-4期22卷 199-216页

作者： MORLET, D RUBEL, P ARNAUD, P WILLEMS, JL UNIV HOSP ST RAFAEL GASTHUISBERG CSE PROJECT B-3000 LEUVEN BELGIUM INST NATL SCI APPL LYON DEPT INFORMAT F-69621 VILLEURBANNE FRANCE

We present a new graphical evaluation method aimed at displaying the main characteristics of computer ECG measurement program results. The proposed graphs provide information on the number of rejected measurements and gross program errors, and on the precision of the results, i.e. the scatter of the differences between fiducial estimates given by the programs and the reference. ''Scatter-graphs'' concerning P, QRS and T wave boundary recognition from the programs paticipating in the European Concerted Action on ''Common Standards for Quantitative Electrocardiography (C.S.E.) are analysed and discussed (10 standard 12-lead ECG programs and 9 Vectorcardiographic (VCG) programs from 10 European, 5 American and 1 Japanese Centers). The method proved to be a powerful tool for a direct and global qualitative comparison of the efficiency of the algorithms elaborated by the program developers, and allowed some of the stategies adopted in these programs to be highlighted.

关键词： ECG processing Program performance evaluation algorithm evaluation Quantitative electrocardiography

来源：评论

学校读者我要写书评

暂无评论

A COMPUTATIONAL COMPARISON OF THE ELLIPSOID algorithm WITH SEVERAL NONLINEAR-PROGRAMMING algorithmS

引用

SIAM JOURNAL ON CONTROL AND OPTIMIZATION 1985年第5期23卷 657-674页

作者： ECKER, JG KUPFERSCHMID, M RENSSELAER POLYTECH INST VOORHEES COMP CTRTROYNY 12181

A computational comparison of several general purpose nonlinear programming algorithms is presented. This study was motivated by the preliminary results in [12] which show that the recently developed ellipsoid algorithm is competitive with a widely used augmented Lagrangian algorithm. To provide a better perspective on the value of ellipsoid algorithms in nonlinear programming, the present study includes some of the most highly regarded nonlinear programming algorithms and is a much more comprehensive study than [12]. The algorithms considered here are chosen from four distinct classes and 50 well-known test problems are used. The algorithms used represent augmented Lagrangian, ellipsoid, generalized reduced gradient, and iterative quadratic programming methods. Results regarding robustness and relative efficiency are presented.

关键词： nonlinear programming algorithm evaluation ellipsoid algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：