NDLI: An array-based node-oriented max-tree representation

Content Provider	IEEE Xplore Digital Library
Author	Souza, R. Rittner, L. Lotufo, R. Machado, R.
Copyright Year	2015
Description	Author affiliation: Univ. of Campinas, Campinas, Brazil (Souza, R.; Rittner, L.; Lotufo, R.) \|\| CTI Renato Archer, Campinas, Brazil (Machado, R.)
Abstract	This paper presents an array-based node-oriented structure for the max-tree representation, which allows direct access and flexible manipulation of its nodes, and is more suitable for OpenMP parallel processing. The proposed structure is based on two arrays called node array (NA), which stores attributes of the nodes, and node index (NI), which indicates the node that each pixel belongs to. We compare it with the pixel-oriented max-tree representation based on a parent array (parent) and an ordering array (S) that allows tree traversals. We show that our max-tree representation requires less memory when the ratio between the number of image pixels and max-tree nodes is greater than 1.6, which is often the case. It is more flexible, and can compute some attributes, such as height and dynamics, with a complexity linear on the number of max-tree nodes instead of the number of image pixels. In our experiments our structure computed the height attribute on average 11.4 faster than the parent/S representation. Also, for a single area-open filter, the sequential implementation of our structure is on average 1.14 times slower and the parallel implementation in a 4-core CPU is 1.2 times faster than the parent/S structure. For an area-open filter followed by the hmax filter, our sequential implementation is 1.34 times faster and our parallel implementation is 2.32 times faster than the parent/S structure.
Starting Page	3620
Ending Page	3624
File Size	1678000
Page Count	5
File Format	PDF
e-ISBN	9781479983391
DOI	10.1109/ICIP.2015.7351479
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-09-27
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Nickel Indexes Memory management Parallel processing Vegetation Arrays Heuristic algorithms OpenMP max-tree parallel processing array-based representation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Parallel Algorithms for Graph Optimization Using Tree Decompositions

Parallel shared memory strategies for ant-based optimization algorithms

Parallel M-tree Based on Declustering Metric Objects using K-medoids Clustering

An extended multi-access memory system for SIMD architecture

Parallelization of Reordering Algorithms for Bandwidth and Wavefront Reduction

Processor arrays generation for matrix algorithms used in embedded platforms

Implementing Parallel LU Factorization with Pipelining on a MultiCore Using OpenMP

Improved Parallel Implementations of Gusfield's Cut Tree Algorithm

An implementation of OpenMP compiler for PC clusters based on array section descriptor

An array-based node-oriented max-tree representation

Similar Documents

Parallel Algorithms for Graph Optimization Using Tree Decompositions

Parallel shared memory strategies for ant-based optimization algorithms

Parallel M-tree Based on Declustering Metric Objects using K-medoids Clustering

An extended multi-access memory system for SIMD architecture

Parallelization of Reordering Algorithms for Bandwidth and Wavefront Reduction

Processor arrays generation for matrix algorithms used in embedded platforms

Implementing Parallel LU Factorization with Pipelining on a MultiCore Using OpenMP

Improved Parallel Implementations of Gusfield's Cut Tree Algorithm

An implementation of OpenMP compiler for PC clusters based on array section descriptor

An array-based node-oriented max-tree representation