By Topic

An optimized algorithm for lossy compression of real-time 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

2 Author(s)
Gang Chen ; Int. Sch. of Software, Wuhan Univ., Wuhan, China ; Li Li

The Swinging Door Trending algorithm and the Douglas-Peucker algorithm are both staple lossy compression algorithms. The former one is widely used in real-time database software of industry, while the latter one is more popular for spatial data processing. In this paper, these two algorithms are compared first to summarize their advantages and disadvantages. And then, an optimized lossy compression algorithm for real-time data as well as a variant of it under certain constraints is proposed with the strategy “searching the farthest feasible point”. The experimental results show that the new algorithm is better than the conventional Swinging Door Trending algorithm and Douglas-Peucker algorithm at compression rate, overall error, and efficiency.

Published in:

Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on  (Volume:2 )

Date of Conference:

29-31 Oct. 2010