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

Watershed transform: Definitions, algorithms and parallelization strategies

Fundamenta Informaticae 2000年第1期41卷 187-228页

作者： Roerdink, Jos B.T.M. Meijster, Arnold

The watershed transform is the method of choice for image segmentation in the field of mathematical morphology. We present a critical review of several definitions of the watershed transform and the associated sequential algorithms, and discuss various issues which often cause confusion in the literature. The need to distinguish between definition, algorithm specification and algorithm implementation is pointed out. Various examples are given which illustrate differences between watershed transforms based on different definitions and/or implementations. The second part of the paper surveys approaches for parallel implementation of sequential watershed algorithms.

关键词： mathematical morphology parallel implementation sequential algorithms watershed definition watershed transform

来源：评论

学校读者我要写书评

暂无评论

Detection of the Movement of an Object From a Sequence of Images

引用

IFAC Proceedings Volumes 2000年第17期33卷 1247-1252页

作者： Gastón Lefranc Nestor González Cristián Power Universidad Católica de Valparaíso Chile Escuela de Ingeniería Eléctrica Fax: 56-32-273804 Universidad de Las Américas Chile Facultad de Ingeniería Fax: 56-2-2258520

A method is presented that allows determining the three-dimensional movement of an object starting from the analysis of a sequence of images. The mathematical model of angular relationship, gives results with small error using simple trigonometry. The method to calculate the trajectory of the movement of an object is based on the analysis of each frame, determining its location in each image, composing a line that represents the movement in time. The time of processing depends directly on the size of the analyzed images. The results are validated with video recordings carried out in laboratory and with real images.

关键词： Computer vision image processing trajectories object recognition sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

Special Session on Robotics and Computer Vision in Latin America

引用

IFAC Proceedings Volumes 2000年第17期33卷 1233-1234页

作者： Gastón Lefranc Universidad Católica de Valparaíso Chile Escuela de Ingeniería Eléctrica Fax: 56-32-273804

The aim of this sesion is the presentation of some activities and cooperation between researcher in Latin America. Some of the papers are original with new ideas in Robotics and Computer Vision.

关键词： Robotics computer vision image processing trajectories object recognition neural networks sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Signal Processing for Cochannel Interference Rejection in Cellular Communications 1

引用

IFAC Proceedings Volumes 1998年第22期31卷 453-457页

作者： John J. Shynk Department of Electrical and Computer Engineering University of California Santa Barbara CA 93106 USA

Time-division multiple access (TDMA) is a digital multiplexing technique that is widely used in some cellular communication systems. Although the user time slots within a cell are designed to be synchronized with each other, they are asynchronous with time slots in nearby cells operating on the same carrier frequencies. The resulting cochannel interference is an important consideration in such systems because it influences the cell size and the quality of service. This paper provides an overview of an adaptive array that is capable of separating and demodulating cochannel signals in a sequential manner. Least-squares algorithms with training are employed to compute the array (beamformer) coefficients such that several cochannel signals are rejected. The array output contains an estimate of one cochannel signal that is equalized and processed by the detector.

关键词： Adaptive arrays Adaptive algorithms Communication systems Least-squares algorithms sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

On-Line Adaptive Fuzzy Diagnosis System: Fusion and Supervision

引用

IFAC Proceedings Volumes 1997年第18期30卷 1195-1200页

作者： A.N. Boudaoud M.H. Masson Heudiasyc U.M.R. C.N.R.S. 6599 Université de Technologie de Compiègne B.P. 20529 60205 Compiègne Cedex France

This paper gives a description of an adaptive on-line diagnosis system for the detection of slow varying changes in dynamical systems using a fuzzy pattern recognition approach. This contribution is an extent ion of a previous paper (Boudaoud et al ., 1996), we have included in the diagnosis and supervision scheme a fusion moduleto combine the decisions of the different sources i.e. classes.

关键词： on-line diagnosis fusion fault detection sequential algorithms fuzzy sets steady states supervision dynamic systems neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal and nearly optimal algorithms for approximating polynomial zeros

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 1996年第12期31卷 97-138页

作者： Pan, VY Department of Mathematics and Computer Science Lehman College City University of New York Bronx NY 10468 U.S.A.

We substantially improve the known algorithms for approximating all the complex zeros of an n(th) degree polynomial p(x). Our new algorithms save both Boolean and arithmetic sequential time, versus the previous best algorithms of Schonhage [1], Pan [2], and Neff and Pelf [3]. In parallel (NC) implementation, we dramatically decrease the number of processors, versus the parallel algorithm of Neff [4], which was the only NC algorithm known for this problem so far. Specifically, under the simple normalization assumption that the variable a: has been scaled so as to confine the zeros of p(x) to the unit disc {x : \x\ less than or equal to 1}, our algorithms (which promise to be practically effective) approximate all the zeros of p(a) within the absolute error bound 2(-b), by using order of n arithmetic operations and order of (b + n)n(2) Boolean (bitwise) operations (in both cases up to within polylogarithmic factors). The algorithms allow their optimal (work preserving) NC parallelization, so that they can be implemented by using polylogarithmic time and the orders of n arithmetic processors or (b + n)n(2) Boolean processors. All the cited bounds on the computational complexity are within polylogarithmic factors from the optimum (in terms of n and b) under both arithmetic and Boolean models of computation (in the Boolean case, under the additional (realistic) assumption that n = O(b)).

关键词： complex polynomial zeros approximation polynomial factorization parallel algorithms computational complexity sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic Assembly Planning Based on Genetic algorithms

引用

IFAC Proceedings Volumes 1996年第1期29卷 553-558页

作者： Milad F. Sebaaly Hideo Fujimoto Nagoya Institute of Technology Department of Electromechanical Engineering Gokiso-cho Showa-ku Nagoya-shi 466 Japan

This paper introduces a new method for solving the assembly planning automation problem based on Genetic algorithms. Unlike other existing planners, the new method is not majorly sensitive to increases in product parts. The search space of assembly problems is restricted to feasible sequences only, while the GA output is stochastic in nature. To bypass this obstacle, this paper introduces a new mapping fA that transforms any randomly chosen sequence into a feasible sequence according to the assembly problem restrictions, while preserving some of its order characteristics. The algorithm GAF combining GA and fA is proved to converge when GA converges.

关键词： Assembly Factory automation Genetic algorithms Manufacturing systems Optimization problems Search methods sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

On-Line Diagnosis of a Technological System: a Fuzzy Pattern Recognition Approach

引用

IFAC Proceedings Volumes 1996年第1期29卷 6424-6428页

作者： A.N. Boudaoud M.H. Masson B. Dubuisson Heudiasyc Laboratory URA CNRS 817 BP 529 60205 Compiegne France

This paper gives a description of an adaptative on-line diagnosis system for the detection of slow varying changes in dynamical systems. This fault detection system is based on both a learning and a supervisor module. The learning module acts as an adaptatif fuzzy classifier i.e. its parameters are updated on-line. The supervisor module controls the learning periods of the classifier, it makes the adaptation of the classifier parameters on steady states, these parameters are saved without changes as evolutions occur (e.g. slow or abrupt). So, the diagnosis system is able to detect: new operation modes and slow or abrupt varying changes on the plant operation modes.

关键词： on-line diagnosis fault detection sequential algorithms fuzzy sets steady states supervision dynamic systems d.c. motor neural networks

来源：评论

学校读者我要写书评

暂无评论

ON RANDOMIZATION IN sequential AND DISTRIBUTED algorithms

引用

ACM COMPUTING SURVEYS 1994年第1期26卷 7-86页

作者： GUPTA, R SMOLKA, SA BHASKAR, S SUNY STONY BROOK DEPT COMP SCI STONY BROOK NY 11794 USA BELL NO RES RES TRIANGLE PK NC 27709 USA

Probabilistic, or randomized, algorithms are fast becoming as commonplace as conventional deterministic algorithms. This survey presents five techniques that have been widely used in the design of randomized algorithms. These techniques are illustrated using 12 randomized algorithms-both sequential and distributed-that span a wide range of applications, including: primality testing (a classical problem in number theory), universal hashing (choosing the hash function dynamically and at random), interactive probabilistic proof systems (a new method of program testing), dining philosophers (a classical problem in distributed computing), and Byzantine agreement (reaching agreement in the presence of malicious processors). Included with each algorithm is a discussion of its correctness and its computational complexity. Several related topics of interest are also addressed, including the theory of probabilistic automata, probabilistic analysis of conventional algorithms, deterministic amplification, and derandomization of randomized algorithms. Finally, a comprehensive annotated bibliography is given.

关键词： algorithms ANALYSIS OF algorithms BYZANTINE AGREEMENT COMPUTATIONAL COMPLEXITY CSP DINING PHILOSOPHERS PROBLEM DISTRIBUTED algorithms GRAPH ISOMORPHISM HASHING INTERACTIVE PROBABILISTIC PROOF SYSTEMS LEADER ELECTION MESSAGE ROUTING NEAREST-NEIGHBORS PROBLEM PERFECT HASHING PRIMALITY TESTING PROBABILISTIC TECHNIQUES RANDOMIZED OR PROBABILISTIC algorithms RANDOMIZED QUICKSORT sequential algorithms TRANSITIVE TOURNAMENTS UNIVERSAL HASHING

来源：评论

学校读者我要写书评

暂无评论

COMPUTING THE ALL-PAIRS LONGEST CHAINS IN THE PLANE

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1995年第3期5卷 257-271页

作者： ATALLAH, MJ CHEN, DZ PURDUE UNIV DEPT COMP SCIW LAFAYETTEIN 47907 UNIV NOTRE DAME DEPT COMP SCI & ENGNNOTRE DAMEIN 46556

Many problems on sequences and on special kinds of graphs involve the computation of longest chains passing points in the plane. Given a set S of n points in the plane, we consider the problem of computing the matrix of longest chain lengths between all pairs of points in S, and the matrix of ''parent'' pointers that describes the n longest chain trees. We present a simple sequential algorithm for computing these matrices. Our algorithm runs in O(n(2)) time, and hence is optimal. We also present a rather involved parallel algorithm that computes these matrices in O((log n)(2)) time using O(n(2)/log n) processors in the CREW PRAM model. These matrices enable us to report, in O(1) time, the length of a longest chain between any two points in S by using one processor, and the actual chain by using k processors, where k is the number of points of S on that chain. The space complexity of the algorithms is O(n(2)).

关键词： COMPUTATIONAL GEOMETRY CREW PRAM INCREASING CHAINS LONGEST PATHS MONGE MATRICES PARALLEL algorithms sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：