A paralleldistributedprocessing method for extracting features in stereo images is presented. The algorithm is edge-based and employs the epipolar constraint. First edges are detected in a multilayered network using...
详细信息
The proceedings contain 82 papers. The special focus in this conference is on Vector and parallelprocessing. The topics include: A decoupled data-driven architecture with vectors and macro actors;a novel paradigm of ...
ISBN:
(纸本)9783540530657
The proceedings contain 82 papers. The special focus in this conference is on Vector and parallelprocessing. The topics include: A decoupled data-driven architecture with vectors and macro actors;a novel paradigm of parallel computation and its use to implement simple high performance hardware;a bus-connected multiprocessor for a rete-based production system;a model for performance prediction of message passing multiprocessors achieving concurrency by domain decomposition;workloads, observables, benchmarks and instrumentation;a method for performance prediction of parallel programs;sparse matrix algorithms for SUPRENUM;parallel givens factorization on a shared memory multiprocessor;study of a parallel lnference machine for paraliei execution of logic programs;parallel lmplementation of logic languages;prolog implementations on parallel computers;performance evaluation of parallel programs in parallel and distributed systems;the ELAN performance analysis environment;monitoring and debugging transputer-networks with NETMON-ii;an adaptive blocking strategy for matrix factorizations;factorizations of band matrices using level 3 BLAS;on the computation of breeding values;code parallelization for the LGDG large-grain dataflow computation;development of portable parallel programs with large-grain data flow 2;a latency tolerant code generation algorithm for a coarse grain dataflow machine;cedar fortran and its compiler;optimizing communication in superb;a design of performance-optimized control-based synchronization;interprocess analysis and optimization in the equational language compiler;transputer based distributed cartograptic lmage processing;parallel implementation of the convolution method in image reconstruction;analysis and design of circuit switching interconnection networks using 4x4 nodes.
In this paper we consider a new form of connectivity in binary images, called k-width-connectivity. Two pixels a and 6 of value are in the same k-width- component if and only if there exists a path of width k such tha...
详细信息
Space-based sensors currently transmit large amounts of raw data to their receiving stations, forcing large bandwidths to be used and large data archives maintained. One possible solution to this data management probl...
详细信息
Space-based sensors currently transmit large amounts of raw data to their receiving stations, forcing large bandwidths to be used and large data archives maintained. One possible solution to this data management problem is the use of more intelligent processing onboard the spacecraft. Neural networks are proposed as a trainable, mutable means of achieving sensor signal processing, sorting, and classification before infrared (IR) focal plane data leaves the cryogenic seal. Two questions arise: (1) can a neural network of appropriate size learn a sensor processing classification problem, and (2) will there be devices to implement that neural network as a smart focal plane. In this paper we concentrate on the first issue and show successful results in simulation for a massively parallel, distributed neural network solution to the closely spaced object (CSO) recognition problem, using a defocused IR sensor model with noise, and an uncooperative object or CSO at large distance. The back-propagation learning method is used to train the network. Architectural issues regarding the construction of a prototype neuromorphic focal plane device are also discussed.
Inferring 3D information from 2D images has been one of the major concerns of researchers in computer vision community. A single view of an object usually conveys insufficient 3D information about the object. The inte...
详细信息
ISBN:
(纸本)0819402370
Inferring 3D information from 2D images has been one of the major concerns of researchers in computer vision community. A single view of an object usually conveys insufficient 3D information about the object. The integration of these partial information from multiple views, however, very often yields fairly good approximation of the 3D structure of the observed object. In the past, we have developed efficient (sequential) algorithms for constructing the octrees of 3D objects from their multiple views. In this paper, we present the parallel implementation of these sequential algorithms using PARADIGM, a mechanism for composing spatial-oriented distributed programs. Alternative strategies for each phase of octree generation are discussed in the context of data partitioning and task allocation. We have implemented our proposed algorithms on Nectar, a fiber-optic based network computer currently being developed at Carnegie Mellon. It is expected that the results and experiences obtained from this research work will be beneficial to future research into real-time multi-sensor fusion.
A paralleldistributedprocessing method for extracting features in stereo images is presented. The algorithm is edge-based and employs the epipolar constraint. First edges are detected in a multilayered network using...
详细信息
A paralleldistributedprocessing method for extracting features in stereo images is presented. The algorithm is edge-based and employs the epipolar constraint. First edges are detected in a multilayered network using two methods of locating the magnitude of directional first derivatives and the zero-crossing of second derivatives of smoothed images. The combined edge detection process helps to eliminate 'phantom' edges. Then features that are likely to be detectable in both images are selected. These features are edge intervals and edge orientation, that is, the intersection of image edges with the epipolar line and the corresponding slope of the edges at those points. The feature extraction process is implemented in a two-layered paralleldistributedprocessing model. The first layer provides edge interval representations. The second layer computes a similarity of measure for each pair of primitive matches which are then forwarded to the second stage of the algorithm. The purpose of the second stage is to turn the difficult pixel correspondence problem into a constraint satisfaction problem by imposing relational constraints. This constraint satisfaction is then solved using a neural network. The results of computer simulations are presented to demonstrate the effectiveness of the approach.< >
The authors consider a new form of connectivity in binary images, called k-width-connectivity. Two pixels a and b of value '1' are in the same k-width-component if and only if there exists a path of width k su...
详细信息
The authors consider a new form of connectivity in binary images, called k-width-connectivity. Two pixels a and b of value '1' are in the same k-width-component if and only if there exists a path of width k such that a is one of the k start pixels and b is one of the k end pixels of this path. The authors present characterisations of the k-width-components and show how to determine the k-width-components of an n*n image in O(n) and O(log/sup 2/ n) time on a mesh of processors and hypercube, respectively, when the image is stored with one pixel per processor. The methods use a reduction of the k-width-connectivity problem to the 1-width-connectivity problem. A distributed, space-efficient encoding of the k-width-components of small size allows the solution to be represented using O(l) registers per processor. The hypercube algorithm also implies an algorithm for the shuffle-exchange network.< >
The proceedings contain 29 papers. The topics discussed include: the detection and tracking of multiple targets with velocity filters;algorithm for subpixel target detection using cellular automata;a hybrid SIMD/MIMD ...
The proceedings contain 29 papers. The topics discussed include: the detection and tracking of multiple targets with velocity filters;algorithm for subpixel target detection using cellular automata;a hybrid SIMD/MIMD architecture for image understanding;parallel recirculating pipeline for signal and imageprocessing;macropipelined multicomputer systems for image analysis;the arithmetic Fourier transform calculation using fiber optical parallel processors;the arithmetic Fourier transform calculation using fiber optical parallel processors;state space methods for DOA estimation;and experience using the truncated Newton method for large scale optimization.
An environment based on a specification technique, which provides methods for communication and synchronization between parallel processes, is described. The mainly graphical specification technique can be used for pa...
详细信息
An environment based on a specification technique, which provides methods for communication and synchronization between parallel processes, is described. The mainly graphical specification technique can be used for parallelprocessing, message passing, synchronous and asynchronous communication, and time-out conditions. The specification technique is supported by a number of tools. The programming technique allows for parallelprocessing and common objects.< >
Summary form only given. Generalized algorithms for vector quantization are presented and their convergence to empirical data is proved. The generalized vector quantization allows adjusted variable dimensional vectors...
详细信息
Summary form only given. Generalized algorithms for vector quantization are presented and their convergence to empirical data is proved. The generalized vector quantization allows adjusted variable dimensional vectors covering variable subregions of source data. Therefore, this class of algorithms is called variable region vector quantization. Algorithm I is the generalization of the GLA into the variable region case. This is called full-gain variable region vector quantization. Algorithm ii, on the other hand, is the variable region generalization of the gain-shape type. The formation of each variable subregion is due to the connection or grouping of elements so that the resulting set of variable dimensional super-vectors has the minimum distortion to a codebook. Algorithm iiI considers encoding and decoding for data compression. Algorithm IV gives the suboptimal minimization for the alleviation of computational load. Examples of region optimization on speech and images are given. methods presented here are applicable and matches to various pattern handling such as neural algorithms of paralleldistributedprocessing. Results obtained by fine-grain parallel computation with a guarded Horn clauses front-end is also given.
暂无评论