Add to ORKGIn this paper we present parallel solutions for performing image contour ranking on coarse-grained machines. In contour ranking, a linear representations of the edge contours is generated from the raw image. We describe solutions that employ different divide-and-conquer approaches and that use different communication patterns. The combining step of the divide-and-conquer solutions uses efficient sequential techniques for merging information about subimages. The proposed solutions are implemented on Intel Delta and Intel Paragon machines. We discuss performance results and present scalability analysis using different image and machine sizes
The Connection Machine is a fine-grained parallel computer having up to 64K processors. It support...
The focus of this paper is speeding up the evaluation of convolutional neural networks. While delive...
As data sets grow to exascale, automated data analysis and visualisation are increasingly important,...
Abstract—We present analytical and experimental results for fine-grained list ranking algorithms. We...
We present analytical and experimental results for fine-grained list ranking algorithms, with the ob...
As data sets grow to exascale, automated data analysis and visualization are increasingly important,...
As data sets grow to exascale, automated data analysis and visualisation are increasingly important,...
In this paper, we compare the Redundant Boundary Computation (RBC) algorithm for convolution with tr...
Parallel algorithms for programming low-level vision mechanisms on the JPL-Caltech hypercube are rep...
The contour tree is a topological abstraction of a scalar field that captures evolution in level set...
Contour tracing is an important pre-processing step in many image-processing applications such as fe...
In this paper we analyze some problems concerned with connectivity on binary images. More precisely,...
We present a study of a highly decomposable algorithm useful for the parallel generation of a contou...
The focus of this paper is speeding up the application of convolutional neural networks. While deliv...
Huge image collections are becoming available lately. In this scenario, the use of Content-Based Ima...
The Connection Machine is a fine-grained parallel computer having up to 64K processors. It support...
The focus of this paper is speeding up the evaluation of convolutional neural networks. While delive...
As data sets grow to exascale, automated data analysis and visualisation are increasingly important,...
Abstract—We present analytical and experimental results for fine-grained list ranking algorithms. We...
We present analytical and experimental results for fine-grained list ranking algorithms, with the ob...
As data sets grow to exascale, automated data analysis and visualization are increasingly important,...
As data sets grow to exascale, automated data analysis and visualisation are increasingly important,...
In this paper, we compare the Redundant Boundary Computation (RBC) algorithm for convolution with tr...
Parallel algorithms for programming low-level vision mechanisms on the JPL-Caltech hypercube are rep...
The contour tree is a topological abstraction of a scalar field that captures evolution in level set...
Contour tracing is an important pre-processing step in many image-processing applications such as fe...
In this paper we analyze some problems concerned with connectivity on binary images. More precisely,...
We present a study of a highly decomposable algorithm useful for the parallel generation of a contou...
The focus of this paper is speeding up the application of convolutional neural networks. While deliv...
Huge image collections are becoming available lately. In this scenario, the use of Content-Based Ima...
The Connection Machine is a fine-grained parallel computer having up to 64K processors. It support...
The focus of this paper is speeding up the evaluation of convolutional neural networks. While delive...
As data sets grow to exascale, automated data analysis and visualisation are increasingly important,...