Results 1  10
of
2,361
A Proposal for a Parallel Watershed Transform Algorithm for RealTime Segmentation
"... The watershed transform is widely used for image segmentation on computer vision applications. However, sequential watershed algorithms are not suitable for realtime applications, once they are one demanding part of several tasks. This paper proposes a new parallel algorithm for the watershed tra ..."
Abstract
 Add to MetaCart
The watershed transform is widely used for image segmentation on computer vision applications. However, sequential watershed algorithms are not suitable for realtime applications, once they are one demanding part of several tasks. This paper proposes a new parallel algorithm for the watershed
A Data Locality Optimizing Algorithm
, 1991
"... This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation algorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory that unifi ..."
Abstract

Cited by 804 (16 self)
 Add to MetaCart
This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation algorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 542 (2 self)
 Add to MetaCart
casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axisaligned boxes). The new scanlineorder algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
, 2001
"... 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 li ..."
Abstract

Cited by 226 (3 self)
 Add to MetaCart
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
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NPhard, because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds
Simple fast algorithms for the editing distance between trees and related problems
 SIAM J. COMPUT
, 1989
"... Ordered labeled trees are trees in which the lefttoright order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching i ..."
Abstract

Cited by 405 (12 self)
 Add to MetaCart
(depth(T)): x (depth(T2))) for the best previous published algorithm due to Tai [J. Assoc. Comput. Mach., 26 (1979), pp. 422433]. Further, the algorithm presented here can be parallelized to give
Designing Efficient And Accurate Parallel Genetic Algorithms
, 1999
"... Parallel implementations of genetic algorithms (GAs) are common, and, in most cases, they succeed to reduce the time required to find acceptable solutions. However, the effect of the parameters of parallel GAs on the quality of their search and on their efficiency are not well understood. This insuf ..."
Abstract

Cited by 299 (5 self)
 Add to MetaCart
Parallel implementations of genetic algorithms (GAs) are common, and, in most cases, they succeed to reduce the time required to find acceptable solutions. However, the effect of the parameters of parallel GAs on the quality of their search and on their efficiency are not well understood
Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms
 IEEE Transactions on Image Processing
, 1993
"... Morphological reconstruction is part of a set of image operators often referred to as geodesic. In the binary case, reconstruction simply extracts the connected components of a binary image I (the mask) which are \marked " by a (binary) image J contained in I. This transformation can be ext ..."
Abstract

Cited by 336 (3 self)
 Add to MetaCart
at demonstrating the usefulness of this transformation for image ltering and segmentation tasks. Lastly, the paper focuses on implementation issues: the standard parallel and sequential approaches to reconstruction are brie y recalled; their common drawback is their ine ciency on conventional computers. To improve
A Parallel Watershed Algorithm
 In Proc. 10th Scandinavian Conference on Image Analysis (SCIA'97
, 1997
"... The watershed transformation is a popular image segmentation algorithm for grey scale images. Sequential watershed algorithms perform a highly data dependent flooding process over the global image. Parallel algorithms which distribute the image over the available processors and simulate the floodi ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The watershed transformation is a popular image segmentation algorithm for grey scale images. Sequential watershed algorithms perform a highly data dependent flooding process over the global image. Parallel algorithms which distribute the image over the available processors and simulate
Results 1  10
of
2,361