Cart (Loading....) | Create Account
Close category search window
 

Parallel set operations with visual data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Zemanek, P. ; Fac. of Electr. Eng., Czech Tech. Univ., Prague, Czech Republic

This paper treats data structures for image representation suitable for parallel algorithms for operations associated with databases of images. In our approach, images are converted from input pixel form to linear quadtrees that allow efficient storage of image data and that are suitable for a large number of operations, e.g. set operations such as union, intersection and difference. Set operations are essential for data retrieval in spatial database queries. All the algorithms mentioned above were developed on a MasPar SIMD parallel computer

Published in:

EUROMICRO 96. Beyond 2000: Hardware and Software Design Strategies., Proceedings of the 22nd EUROMICRO Conference

Date of Conference:

2-5 Sep 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.