Results 11  20
of
36
Generic Algorithms For Morphological Image Operators  A Case Study Using Watersheds
, 1998
"... . The aim of the present work is to combine both the advantages of generic programming approach and the wave front propagation interpretation to develop generic algorithms for morphological image operators. The watershed operator is implemented based on this framework and a performance evaluation, u ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. The aim of the present work is to combine both the advantages of generic programming approach and the wave front propagation interpretation to develop generic algorithms for morphological image operators. The watershed operator is implemented based on this framework and a performance evaluation, using processing time, is provided to compare the generic watershed implementation in contrast to the classical implementation using hierarchical queues. Key words: generic algorithms, mathematical morphology, priority queues, wave front propagation, and watersheds. 1. Introduction Mathematical morphology is a powerful and unified approach for geometrical shape analysis and description based on a complete lattice framework. A complete lattice is a partially ordered set L such that every subset K has an infimum, denoted by K, and a supremum, denoted by K. From a theoretic point of view, a dilation, erosion, adjunction, opening, and closing are the most important algebraic notions in mathem...
Data Structures
 ACM Computer Surveys
, 1996
"... Introduction The study of data structures, i.e., methods for organizing data that are suitable for computer processing, is one of the classic topics of computer science. At the hardware level, a computer views storage devices such as internal memory and disk as holders of elementary data units (byt ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Introduction The study of data structures, i.e., methods for organizing data that are suitable for computer processing, is one of the classic topics of computer science. At the hardware level, a computer views storage devices such as internal memory and disk as holders of elementary data units (bytes), each accessible through its address (an integer). When writing programs, instead of manipulating the data at the byte level, it is convenient to organize them into higher level entities, called data structures. Most data structures can be viewed as containers that store a collection of objects of a given type, called the elements of the container. Often a total order is defined among the elements (e.g., alphabetically ordered names, points in the plane ordered by xcoordinate). A data structure has an associated repertory of operations, classified into queries, which retrieve information on the dat
Quick Decoding and Encoding of Prüfer Strings: Exercises in Data Structures
"... Cayley's Formula tells us that a complete undirected graph on n vertices has n n2 distinct spanning trees. Prfer's proof of this result establishes a onetoone correspondence between the spanning trees on n vertices and the strings of length (n  2) over an alphabet of n symbols. The p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Cayley's Formula tells us that a complete undirected graph on n vertices has n n2 distinct spanning trees. Prfer's proof of this result establishes a onetoone correspondence between the spanning trees on n vertices and the strings of length (n  2) over an alphabet of n symbols. The proof describes two algorithms. One identifies the edges in the spanning tree corresponding to a string, and the other builds the string corresponding to a list of edges in a spanning tree. Naive implementations of these algorithms have times that are quadratic in the number n of vertices. Elaborating the data structures they use reduces both times to O(n log n). This paper describes these faster implementations. The data structures they use are familiar to any student who has completed CS2. They include priority queues implemented with heaps and adjacency lists implemented with trees. 1. Introduction A spanning tree of a connected, undirected graph G is a subgraph of G that connects all of G 's ve...
Performance Metrics for Disaster Monitoring Systems ABSTRACT
"... Understanding the performance of disaster monitoring systems is a key to understanding their success, therefore; various qualitative and quantitative measures and metrics can be applied in the characterization and analysis of such systems. Through evaluation studies, problems that impede a disaster ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Understanding the performance of disaster monitoring systems is a key to understanding their success, therefore; various qualitative and quantitative measures and metrics can be applied in the characterization and analysis of such systems. Through evaluation studies, problems that impede a disaster monitoring system performance can be identified. The results can be used for system control, design, and capacity planning. Previous studies address technical performance analysis metrics for analyzing monitoring systems leaving out human and organizational dimensions of such systems. Thus, the primary objective of this study is to identify and describe a set of disaster monitoring systems performance analysis metrics that may be employed to evaluate such systems. This study may be valuable to researchers and practitioners involved in disaster and emergency response studies in planning the transportation of vital firstaid supplies and emergency personnel to disasteraffected areas, and in improving chances of survival after a natural disaster.
Worst Case Analysis of TreeMap Data Structure
, 2013
"... Data structures with relaxed balance eases the update of shared resources on asynchronous parallel architectures. This improvement is obtained by a better locking scheme of the data structure. In this paper, we describe the complexity and analyze the worst case cost of access operations on such a st ..."
Abstract
 Add to MetaCart
(Show Context)
Data structures with relaxed balance eases the update of shared resources on asynchronous parallel architectures. This improvement is obtained by a better locking scheme of the data structure. In this paper, we describe the complexity and analyze the worst case cost of access operations on such a structure. We propose a data structure with the same properties as Java TreeMap but implemented with chromatic search tree; a tree with relaxed balance. The aim of our structure is to provide a more efficient TreeMap we can use in concurrent and realtime applications. 1.
A Parallel Algorithmic Pattern
, 2003
"... This paper briefly discuss the general class of algorithms that can be implemented using parallel constructions. Common characteristics of these algorithms are also described in order to provide a generic representation for parallel algorithms. In addition it describes the parallel pattern in terms ..."
Abstract
 Add to MetaCart
This paper briefly discuss the general class of algorithms that can be implemented using parallel constructions. Common characteristics of these algorithms are also described in order to provide a generic representation for parallel algorithms. In addition it describes the parallel pattern in terms of image scannings and its relationship within mathematical morphology. Such a pattern is essential for the development of morphological operators and operations. Examples of the application of the parallel generic pattern are given for both scalar lattices and nonscalar lattices. Scalar lattices are used to give a parallel pattern representation for real values, parabolic morphology, and bbit integers. Nonscalar lattices are restricted to color lattices. Each case study presented in this paper match the generic representation of the parallel pattern.
The Journal of Systems and Software 82 (2009) 590–602 Contents lists available at ScienceDirect The Journal of Systems and Software
"... journal homepage: www.elsevier.com/locate/jss Optimization methodology of dynamic data structures based on genetic ..."
Abstract
 Add to MetaCart
(Show Context)
journal homepage: www.elsevier.com/locate/jss Optimization methodology of dynamic data structures based on genetic
10th International Workshop on Software & Compilers for Embedded Systems (SCOPES) 2007 Optimization of Dynamic Data Structures in Multimedia Embedded Systems Using Evolutionary Computation
"... Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applications share complex and intensive dynamic memory use. Thus, dynamic memory optimizations are a requirement when porting thes ..."
Abstract
 Add to MetaCart
(Show Context)
Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applications share complex and intensive dynamic memory use. Thus, dynamic memory optimizations are a requirement when porting these applications. Within these optimizations, the refinement of the Dynamically (de)allocated Data Type (or DDT) implementations is one of the most important and difficult parts for an efficient mapping onto lowpower embedded devices. In this paper, we describe a new automatic optimization approach for the DDTs of objectoriented multimedia applications. It is based on an analytical precharacterization of the possible elementary DDT blocks, and a multiobjective genetic algorithm to explore the design space and to select the best implementation according to different optimization criteria (i.e., memory accesses, memory footprint and energy consumption). Our results in reallife multimedia applications show that the best implementations of DDTs can be obtained in an automated way in few hours, while typically designers would require days to find a suitable implementation, achieving important savings in exploration time with respect to other stateoftheart heuristicsbased optimization methods for this task. 1