We propose a perspective volume graphics rendering algorithm on SIMD mesh-connected computers and implement the algorithm on the parallel Algebraic Logic (PAL) computer. The algorithm is a parallel ray casting algorit...
详细信息
ISBN:
(纸本)0819429074
We propose a perspective volume graphics rendering algorithm on SIMD mesh-connected computers and implement the algorithm on the parallel Algebraic Logic (PAL) computer. The algorithm is a parallel ray casting algorithm. It decomposes the 3D perspective projection into two transformations that can be implemented in the SIMD fashion to solve the data redistribution problem caused by non-regular data access patterns in the perspective projection.
This paper addresses efficient parallel compression and classification for sets of similar images that are normally generated from satellite imagery, medical imaging (CT and MR scans) or aerial surveillance. From our ...
详细信息
ISBN:
(纸本)0819429074
This paper addresses efficient parallel compression and classification for sets of similar images that are normally generated from satellite imagery, medical imaging (CT and MR scans) or aerial surveillance. From our experiments it was observed that image similarities for each class of images can be more efficiently expressed in the domain of image compressing transforms. In particular, the paper shows that only one predictive compressing model can be constructed for the entire class of similar images of the same nature, and then used for nearly optimal compression of any image of the class. The extraction of the optimal class-compressing model still remains a computationally intensive process, which can be considerably improved on parallel computers. The paper demonstrates how a similar database compressing model can be extracted in parallel, and how this can be used for parallel similar database compression and classification of new images into appropriate similarity classes. The results of the parallel similar image analysis are demonstrated with MR and CT brain images obtained from the M.D. Anderson Cancer Center.
Many vision tasks are very complex and computationally intensive. Rear time requirements further aggravate the situation. They usually involve both structured (low-level vision) and unstructured (high-level vision) co...
详细信息
ISBN:
(纸本)0819429074
Many vision tasks are very complex and computationally intensive. Rear time requirements further aggravate the situation. They usually involve both structured (low-level vision) and unstructured (high-level vision) computations. parallel approaches offer hope in this context. parallel approaches to vision tasks and scheduling schemes for their implementation receive special emphasis in this paper. Architectural issues are also addressed. The aim is to design algorithms which can be implemented on low cost heterogeneous networks running PVM. Issues connected with general purpose architectures also receive attention. The proposed ideas have been illustrated through a practical example (of eye location from an image sequence). Next generation multimedia environments are expected to routinely employ such high performance computing platforms.
In this paper, are present a new global-search method for designing QMF (quadrature-mirror-filter) filter banks. We formulate the design problem as a nonlinear constrained optimization problem, using the reconstructio...
详细信息
ISBN:
(纸本)0819429074
In this paper, are present a new global-search method for designing QMF (quadrature-mirror-filter) filter banks. We formulate the design problem as a nonlinear constrained optimization problem, using the reconstruction error as the objective, and the other performance metrics as constraints. This formulation allows us to search for designs that improve over the best existing designs. Due to the nonlinear nature of the performance metrics, the design problem is a nonlinear constrained optimization problem with many local minima. We propose to solve this design problem use global-search methods based on Lagrangian formulations. After transforming the original constrained optimization problem into an unconstrained form using Lagrange multipliers, we apply a new global-search method to find good solutions. The method consists of a coarse-level global-search phase, a fine-level global-search phase, and a local search phase, and is suitable for parallel computation due to the minimal dependency between various key components. In our experiments, we show that our method finds better designs than existing global-search methods, including simulated annealing and genetic algorithms.
The rapid grow of both, the size of remote sensing data and the number of users in this field requires systems which are easy to use, platform independent and mighty. Currently, many users are not able to process Of e...
详细信息
ISBN:
(纸本)0818683325
The rapid grow of both, the size of remote sensing data and the number of users in this field requires systems which are easy to use, platform independent and mighty. Currently, many users are not able to process Of even access data the way they would like to. Utilizing upcoming technologies like WWW, Java and CORBA, we propose a distributed system that connects users, data bases and method bases. Latter ones help users to find an appropriate sequence of methods for processing, and incorporating a broker they schedule execution onto fast remote processing units (back-ends). We discuss design considerations concerning the interaction of the back-end with other system components, and strategies for effective job distribution.
The design and implementation of a parallel digital signal processing system on a chip containing 64 computational processors, 16 memory processors, and 16 I/O processors is described. The processors are interconnecte...
详细信息
ISBN:
(纸本)0819429074
The design and implementation of a parallel digital signal processing system on a chip containing 64 computational processors, 16 memory processors, and 16 I/O processors is described. The processors are interconnected by two levels of segmented buses. Each computational processor has a 16-bit data path and a control unit. The instruction set of the 16-bit processor supports computations on streams of data present in video, graphics, imageprocessing, and digital communication applications. Two's complement arithmetic, saturation arithmetic, and packed instructions are supported. Higher data precision such as 32-bit and 64-bit can be achieved by cascading processors. The instruction memory of each computational processor has sixteen 40-bit words. Data streaming through the processor is manipulated by the instructions in the instruction memory. Multiple operations can be performed in a single cycle in a processor. A handshake protocol is used for synchronization between the sending and receiving processors. Six programmable registers are available in each computational processor for storing data. Each memory processor has a 256 x 16 storage unit for storing additional data The memory processors can be statically configured as a delay line, FIFO, lookup table or random access memory. For each memory processor there are four FSMs supporting the four configurations. The I/O processors are provided for external communication. Multiple parallelprocessing chips, digital output from sensors, and SRAM chips can be interconnected using the I/O processors. The VLSI chip implementing the processors is organized as 16 clusters interconnected by a statically programmable hierarchical bus structure. The buses are segmented by programming the switches on the bus. Each cluster has six 16-bit data buses and four 2-bit control buses for supporting communication between four computational processors, one memory processor, and one I/O processor. In addition, adjacent processors can com
We present a parallel MPEG-2 video encoder on the Intel Paragon parallel computer. Given a video sequence or a set of sequences, the aim of the encoder is to achieve the maximum possible encoding rate. To achieve this...
详细信息
ISBN:
(纸本)0819429074
We present a parallel MPEG-2 video encoder on the Intel Paragon parallel computer. Given a video sequence or a set of sequences, the aim of the encoder is to achieve the maximum possible encoding rate. To achieve this aim, the parallel encoder works by a combined scheduling of processors, I/O nodes, and disks, enabling the system to work in a highly balanced fashion through matching of the encoding and I/O rates. An efficient data layout scheme for video frames is also proposed in order for I/O to sustain the desired data transfer rates. Using a small percentage of processors as the I/O nodes, the utilization of the system is also high. More importantly, our encoder is scalable and with an increase in the number of processors will result in a proportional increase in the encoding rate. Given any machine configuration (that is, the number of compute processors, I/O processors, and disks), our propose strategy can logically partition the system and match the I/O and encoding rates to reach the ideal encoding rate. The experimental results indicate about two-fold gain in performance compared to the previous studies. Our approach is useful for compressing a large video sequence or batches of sequences.
This paper presents a general approach to fast image indexing and searching for content-based image retrieval on a network of workstation clusters. Three primary issues in image retrieval are discussed: image feature ...
详细信息
ISBN:
(纸本)0819428361
This paper presents a general approach to fast image indexing and searching for content-based image retrieval on a network of workstation clusters. Three primary issues in image retrieval are discussed: image feature extraction and representation, similarity measure, and searching methods. A wavelet based image feature extraction scheme is introduced to represent images with multiple features such as colours, textures and shapes. In addition a feature component code is proposed to facilitate a dynamic image indexing scheme where images are queried by different features or combinations. Furthermore, the relevance feedback technique for information retrieval is used to convert image feature vectors to weight-term vectors for efficient searching.
Face recognition has potential applications in surveillance and security systems. Most algorithms proceed by constructing a feature vector, which represents those aspects of the face which vary most between individual...
详细信息
ISBN:
(纸本)0819428213
Face recognition has potential applications in surveillance and security systems. Most algorithms proceed by constructing a feature vector, which represents those aspects of the face which vary most between individuals. In general these algorithms locate critical features such as the eyes nose and mouth, and use a mixture of direct comparison, and spatial distribution of features to identify those candidate images in a large database which match the image currently under analysis. Since pixel intensity comparisons for regions around the eyes are often used to compute a measure of similarity between two images lighting can play a major part in the success of recognition techniques. By using a combination of infrared and white light image information we hope to normalise pixel intensities, reducing the error margin due to variations in lighting conditions. However, the most significant problem with recognition systems is the processing delay required to find a match. Since a high degree of certainty is required in security applications, this increases the level of processing required leading to even greater delays. This paper proposes and evaluates a parallel algorithm for face recognition. The general performance characteristics of the algorithm are analysed using formal methods to obtain the expected temporal and spatial complexities of the algorithm, and to estimate the speedup that can be achieved. Confirmation of these predictions is provided by implementing the parallel algorithm on an eight processor Sequent Balance shared memory multiprocessor and PRISM/DiST, a multiprocessor simulator.
The context of this study is the 3D reconstruction of urban scenes from aerial images. We intend to estimate a dense depth map precise enough to be exploited by recognition algorithms. In this paper, we show how a mul...
详细信息
ISBN:
(纸本)0819429597
The context of this study is the 3D reconstruction of urban scenes from aerial images. We intend to estimate a dense depth map precise enough to be exploited by recognition algorithms. In this paper, we show how a multi-view approach made up of very simple and automatic operations can achieve this goal. Unlike 2-view stereovision methods, we do not exploit a disparity map for depth estimation. The proposed method consists in directly scanning depth. For each depth hypothesis, a reference image is projected by using a planar perspective transformation. The correct hypothesis is found pixel by pixel by minimizing a simple matching criterion based on a gray level comparison. We calculate this criterion for each pixel of the reference image, each depth hypothesis and each baseline formed with the reference image and an other image of the sequence. The estimated depth map obtained with a synthetic aerial image sequence, shows that exploiting several images with different baselines reduces the reconstruction errors due to noise and false matches. We have implemented an algorithm composed of simple automatic computations, that should be highly parallelisable.
暂无评论