Y. Chung, V. K. Prasanna, and C.-L. Wang. A fast asynchronous algorithm for linear feature extraction on IBM SP-2. In Proc. of IEEE Workshop on Computer Architecture for Machine Perception, Como, Italy, pages 294--301, September, 1995. 212 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computer Vision Algorithms on Reconfigurable Logic Arrays - Ratha (1996) (2 citations) (Correct)
....point failures to increase the system availability should be supported. The architecture of SP 2 is shown in Figure 2.7. Many standard benchmarks have been run on SP 2 [2] Judd et al. reported high performance for pattern clustering using the earlier model SP 1 [117] On SP 2, Chung et al. [49] reported twice the performance of a CM 5 for linear feature extraction. 52 PE PE PE PE I O I O I O I O I O I O Gateway Gateway Standard file server nodes Compute nodes Gateway nodes H I G H P E R F O R M A N C E S W I T C H I O SERVER NODES . Parallel File System Server nodes ....
Y. Chung, V. K. Prasanna, and C.-L. Wang. A fast asynchronous algorithm for linear feature extraction on IBM SP-2. In Proc. of IEEE Workshop on Computer Architecture for Machine Perception, Como, Italy, pages 294--301, September, 1995. 212
Parallelizing Image Feature Extraction on Coarse-grain Machines - Chung, Prasanna Self-citation (Chung Prasanna) (Correct)
....codes developed for these machines to be portable across multiple platforms. Due to these factors, such machines have been successfully deployed in a variety of applications [7] Several groups have been developing efficient parallel algorithms for irregular vision problems on these machines [2, 4, 5, 6, 8, 14]. In this paper, we develop a fast parallel algorithm for feature extraction. Image feature extraction is a fundamental task in vision systems. In general, algorithms for feature extraction consists of two major subtasks: contour pixels detection and linear approximation [13] Contour pixels ....
Y. Chung, V. Prasanna, and C. Wang, "A Fast Asynchronous Algorithm for Linear Feature Extraction on IBM SP-2," Proc. of Conference on Computer Architecture for Machine Perception, pp. 294-301, 1995.
Load Balancing Strategies for Symbolic Vision Computations - Chung, Woo, Nevatia.. Self-citation (Chung Prasanna) (Correct)
....The symbolic features used in this paper are line segments extracted from raw images [9] The line segments are represented symbolically by their end point coordinates, lengths, orientations, and average contrast. A parallel implementation of the extraction of line segments has been reported in [5]. for (each searching line segment) construct search window for (each position in search window) if (line segment is found) perform dummy operation (a) Sequential code (b) Search Window Figure 2: Typical symbolic search operation In Figure 2, we show a typical search operation for each line ....
Y. Chung, V. Prasanna, and C. Wang, "A Fast Asynchronous Algorithm for Linear Feature Extraction on IBM SP-2", Proc. of Computer Architectures for Machine Perception, pp. 294-301, 1995.
Parallel Algorithms for Linear Approximation on.. - Chung, Prasanna, Wang Self-citation (Chung Prasanna Wang) (Correct)
....algorithm by allowing each processing node to run independently of other processing nodes without violating any data dependency. Furthermore, we improve the utilization of processing node by maintaining algorithmic threads in each processing node. A preliminary version of this paper appeares in [Chung et al. 1995]. Our implementation shows that, the execution of the linear approximation on a 512 Theta 512 image can be performed in 0.065 seconds on a SP 2 having 64 processing nodes and in xxxx seconds on a T3D having 64 processing nodes. A serial implementation takes 3.45 seconds on a single processing ....
Y. Chung, V. Prasanna, and C. Wang, "A Fast Asynchronous Algorithm for Linear Feature Extraction on IBM SP-2," Proc. of the Computer Architectures for Machine Perception, pp. 294-301, 1995.
Parallelization of Perceptual Grouping on Distributed Memory.. - Cho-Li Wang (1995) Self-citation (Prasanna Wang) (Correct)
....of the code to various platforms. We believe modeling the features of parallel machines, designing data partitioning techniques, and mapping the computations to balance the load using explicit message passing is a feasible approach to solve vision problems on distributed memory parallel machines [1, 6, 10, 11]. Our algorithm can be ported to other models [14] including for example, the shared memory model discussed in [2] Acknowledgment This research was supported in part by NSF under grant CCR 9317301 and in part by ARPA under grant F49620 93 1 0620. The access to T3D was provided by the ....
Y. Chung, V. Prasanna, and C-L. Wang, "A Fast Asynchronous Algorithm for Linear Feature Extraction on IBM SP-2," IEEE Workshop on Computer Architectures for Machine Perception, September 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC