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

Classification of multisource remote sensing imagery using a Genetic algorithm and Markov random fields

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 1999年第3期37卷 1255-1260页

作者： Tso, BCK Mather, PM Univ Nottingham Sch Geog Nottingham NG7 2RD England

The use of contextual information for modeling the prior probability mass function has found applications in the classification of remotely sensed data, With the increasing availability of multisource remotely sensed data sets, random field models, especially Markov random fields (MRF), have been found to pro,ide a theoretically robust yet mathematical tractable way of coding multisource information and of modeling contextual behavior. It is well known that the performance of a model is dependent both on its functional form (in this case, the classification algorithm) and on the accuracy of the estimates of model parameters, In dealing with multisource data, the determination of source weighting and MRF model parameters is a difficult issue. We extend the methodology proposed in [1] by demonstrating that the use of an effective search procedure, the Genetic algorithm, leads to improved parameter estimation and hence higher classification accuracies.

关键词： model parameters remote-sensing data sorting algorithm remote sensing mass function Parameter estimation Markov random fields Genetic algorithm (GA)

来源：评论

学校读者我要写书评

暂无评论

Classification of sonar data for a mobile robot using neural networks

Classification of sonar data for a mobile robot using neural...

引用

IEEE International Joint Symposia on Intelligence and Systems

作者： Diep, D Johannet, A Bonnefoy, P Harroy, F Loiseau, P LGI2P EERIE EMA F-30000 Nimes France

ISBN: (纸本)0818685484

We study in this paper an innovative architecture of ultrasonic sensor, in conjunction with a neural network-based classification algorithm, in order to recognize some geometric obstacles encountered by a mobile robot. The ultrasonic sensor is made of the association of an array of ultrasonic transducers, building an acoustic antenna, and providing acoustic scans with a fine resolution. The neural network is a multilayer perceptron which was trained with a set of features extracted from the sonar data. Results show that, by selecting appropriate features, the network can be trained to classify some geometric shapes, like wall, corners and edges.

关键词： Ultrasonic sensors Mobile robots Neural network sonar Multilayer perceptrons Geometric forms ultrasonic transducers sorting algorithm Acoustics

来源：评论

学校读者我要写书评

暂无评论

An Only-Once-sorting algorithm

引用

Wuhan University Journal of Natural Sciences 1996年第1期1卷 38-41页

作者： Xu Xusong Zhou Jianqin Guo Feng (School of Management,Wuhan University, Wuhan 430072,China) School of Management Wuhan University Wuhan China

This paper provides a new sorting algorithm called 'Only-Once-sorting' algorithm a mathemati cal formula,this algorithm can put elements in the positions they should be stored only once,then compacts *** algor... 详细信息

关键词： mathematical formula onlv-once-sorting sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of self-electro-optic-effect-device-based (SEED-based) smart-pixel arrays used in data sorting

引用

APPLIED OPTICS 1996年第32期35卷 6397-6416页

作者： Desmulliez, MPY Wherrett, BS Waddie, AJ Snowdon, JF Dines, JAB HERIOT WATT UNIV DEPT PHYSEDINBURGH EH14 4ASMIDLOTHIANSCOTLAND

The performance factors associated with self-electro-optic-effect-device- (SEED-) based smart-pixel arrays are analyzed in terms of semiconductor technology and pixel complexity. The sorting task is chosen as a practical example. Complementary metal-oxide semiconductor (CMOS)-SEED 2 x 2 self-routing nodes operated with quasi-cw-mode lasers are shown to provide the maximum processing power and on- or off-chip communication rate. The need for new front-end amplifiers for the smart-pixel technology is emphasized. (C) 1996 Optical Society of America

关键词： optical computing optical information processing smart pixel arrays sorting algorithm perfect shuffle self-electro-optic-effect device

来源：评论

学校读者我要写书评

暂无评论

A novel deterministic sampling scheme with applications to broadcast-efficient sorting on the reconfigurable mesh

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1996年第2期32卷 215-222页

作者： Olariu, S Schwing, JL Department of Computer Science Old Dominion University Norfolk Virginia 23529

The main contribution of this work is to present a simple deterministic sampling strategy that, when used for bucket sorting, yields buckets that are remarkably well balanced, making costly balancing unnecessary. To the best of our knowledge, this is the first instance of a deterministic sampling strategy featuring this performance. Although the strategy is perfectly general, we illustrate its power by devising a VLSI-optimal, 0(1) time sorting algorithm for the reconfigurable mesh. As a by-product of the inherent simplicity of our sampling and bucketing scheme, we show that our sorting algorithm can be implemented using only 35 broadcast operations, a substantial improvement over the previously best known algorithm that requires 59 broadcasts. (C) 1996 Academic Press, Inc.

关键词： Processor PROCESSOR sorting algorithm buckets deterministic broadcasting

来源：评论

学校读者我要写书评

暂无评论

sorting strings and constructing digital search trees in parallel

引用

THEORETICAL COMPUTER SCIENCE 1996年第2期154卷 225-245页

作者： Jaja, JF Ryu, KW Vishkin, U UNIV MARYLAND DEPT ELECT ENGN COLLEGE PK MD 20742 USA KYUNGPOOK NATL UNIV DEPT COMP ENGN TAEGU SOUTH KOREA TEL AVIV UNIV DEPT COMP SCI RAMAT AVIV ISRAEL

We describe two simple optimal-work parallel algorithms for sorting a list L = (X(1),X(2),...,X(m)) of m strings over an arbitrary alphabet Sigma, where Sigma(i=1)(m) \X(i)\ = n and two elements of Sigma can be compared in unit time using a single processor. The first algorithm is a deterministic algorithm that runs in O(log(2) m/log log m) time and the second is a randomized algorithm that runs in O(log m) time. Both algorithms use O(mlog m + n) operations. Compared to the best-known parallel algorithms for sorting strings, our algorithms offer the following improvements. 1. The total number of operations used by our algorithms is optimal while all previous parallel algorithms use a nonoptimal number of operations. 2. We make no assumption about the alphabet while the previous algorithms assume that the alphabet is restricted to {1,2,...,n(0)(1)}. 3. The computation model assumed by our algorithms is the Common CRCW PRAM unlike the known algorithms that assume the Arbitrary CRCW PRAM. 4. Our algorithms use O(mlogm + n) space, while the previous parallel algorithms use O(n(1+epsilon)) space, where epsilon is a positive constant. We also present optimal-work parallel algorithms to construct a digital search tree for a given set of strings and to search for a string in a sorted list of strings. We use our parallel sorting algorithms to solve the problem of determining a minimal starting point of a circular string with respect to lexicographic ordering, Our solution improves upon the previous best-known result to solve this problem.

关键词： List ranking Computation Computational modeling Tree searching parallel random access machine model Parallel algorithms sorting algorithm deterministic algorithms concurrency theory randomized algorithms algorithms Alphabets Cosmic strings

来源：评论

学校读者我要写书评

暂无评论

Flaw identification from time and frequency features of ultrasonic waveforms

引用

IEEE TRANSACTIONS ON ULTRASONICS FERROELECTRICS AND FREQUENCY CONTROL 1996年第4期43卷 592-600页

作者： Case, TJ Waag, RC UNIV ROCHESTER DEPT ELECT ENGNROCHESTERNY 14627 UNIV ROCHESTER DEPT RADIOLROCHESTERNY 14627

Time and frequency features have been used with classification algorithms to distinguish between ultrasonic echoes from flaws in pipes and ultrasonic echoes from various geometric configurations of weld root and counterbore. Waveforms containing reflections from known geometries and from flaws were obtained and sets of features were defined using a k-nearest neighbor approach to separate waveforms into classes, Two independent databases containing various flaws and pipe geometries were used to determine these feature sets, From these databases, optimal feature sets were found to separate counterbore waveforms from crack waveforms, Optimal feature sets were also found to distinguish between waveforms from counterbore, waveforms containing both counterbore and root echoes, and waveforms from flaws, The best feature sets used with the classifier algorithms could separate waveforms from the same database with accuracy in the 92-97% range and with high confidence, Another database was obtained from pipe structures in a nuclear power plant to provide a field test of the method, When applied to this database, the same classifier algorithms and feature sets used with the other databases either resulted in a comparable percentage of correct decisions, but with low confidence, or could not classify anywhere from 79 to 88% of the waveforms, Spatial parameters based on averaging feature vectors in axial and circumferential directions were also defined and used for classification, These classifications had higher accuracy but lower confidence levels than the classifications based on individual waveforms.

关键词： echo feature extraction flaw detection pattern classification ultrasonic materials testing welding classification algorithms counterbore crack waveforms feature vectors flaw identification frequency features geometric configurations k-nearest neighbor ap sorting algorithm Echoes Eigenvector Test Method ultrasonic materials testing Feature extraction flaws SETTING waveforms Taxonomy Welding Geometric forms Flaw detection Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

OVERLAPPING COMPUTATIONS, COMMUNICATIONS AND I/O IN PARALLEL sorting

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1995年第2期28卷 162-172页

作者： CLEMENT, MJ QUINN, MJ OREGON STATE UNIV DEPT COMP SCICORVALLISOR 97331

In this paper, we present a new parallel sorting algorithm which maximizes the overlap between the disk, network, and CPU subsystems of a processing node. This algorithm is shown to be of similar complexity to known efficient sorting algorithms. The pipelining effect exploited by our algorithm should lead to higher levels of performance on distributed memory parallel processors. In order to achieve the best results using this strategy, the CPU, network, and disk operations must take comparable time. We suggest acceptable levels of system balance for sorting machines and analyze the performance of the sorting algorithm as system parameters vary. (C) 1995 Academic Press, Inc.

关键词： sorting algorithm Level of Performance Separators Communication Research system parameter central processing units IO sorting programs

来源：评论

学校读者我要写书评

暂无评论

SPATIOTEMPORAL PATTERN-RECOGNITION USING HIDDEN MARKOV-MODELS

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1995年第4期31卷 1292-1300页

作者： FIELDING, KH RUCK, DW Air Force Institute of Technology USA

A spatio-temporal method for identifying objects contained in an image sequence is presented The Hidden Markov Model (HMM) technique is used as the classification algorithm, making classification decisions based on a spatio-temporal sequence of observed object features. A five class problem is considered Classification accuracies of 100% and 99.7% are obtained for sequences of images generated over two separate regions of viewing positions. HMMs trained on image sequences of the objects moving in opposite directions showed a 98.1% successful classification rate by class and direction of movement. The HMM technique proved robust to image corruption with additive correlated noise and had a higher accuracy than a single-look nearest neighbor method. A real image sequence of one of the objects used was successfully recognized with the HMMs trained on synthetic data. This study shows the temporal changes that observed feature vectors undergo due to object motion hold information that can yield superior classification accuracy when compared with single-frame techniques.

关键词： feature extraction hidden Markov models image classification image sequences object detection additive correlated noise classification algorithm classification decisions image corruption image sequence object identification object mo sorting algorithm image sequences Image classification object recognition Object detection Feature extraction Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

PERFECT-SHUFFLE INTERCONNECTED BITONIC SORTER - OPTOELECTRONIC DESIGN

引用

APPLIED OPTICS 1995年第23期34卷 5077-5090页

作者： DESMULLIEZ, MPY TOOLEY, FAP DINES, JAB GRANT, NL GOODWILL, DJ BAILLIE, D WHERRETT, BS FOULK, PW ASHCROFT, S BLACK, P HERIOT WATT UNIV DEPT ELECT & COMP ENGNEDINBURGH EH14 4ASMIDLOTHIANSCOTLAND

The algorithmic, electronic, and optical aspects of the implementation of a perfect-shuffle interconnected bitonic sorter are analyzed. The performance metrics such as the bit output data rate and the power consumption of the system are quantified. The sorting module is designed to demonstrate the parallel nonlocal interconnection of smart-pixel arrays and the use of optical-image control masks in a functioning information processor.

关键词： OPTICAL COMPUTING OPTICAL COMMUNICATIONS PERFECT SHUFFLE OPTICAL SYSTEMS sorting algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：