Image Compression Using Space-Filling Curves Michal Krátký, Tomáš Skopal, Václav Snášel Department of Computer Science, VŠB-Technical University of Ostrava.

Slides:



Advertisements
Similar presentations
On Reinsertions in M-tree Jakub Lokoč Tomáš Skopal Charles University in Prague Department of Software Engineering Czech Republic.
Advertisements

T.Sharon-A.Frank 1 Multimedia Compression Basics.
Covariance Matrix Applications
CMU SCS : Multimedia Databases and Data Mining Lecture#5: Multi-key and Spatial Access Methods - II C. Faloutsos.
11/11/02 IDR Workshop Dealing With Location Uncertainty in Images Hasan F. Ates Princeton University 11/11/02.
Nonlinear Dimension Reduction Presenter: Xingwei Yang The powerpoint is organized from: 1.Ronald R. Coifman et al. (Yale University) 2. Jieping Ye, (Arizona.
Improving the Performance of M-tree Family by Nearest-Neighbor Graphs Tomáš Skopal, David Hoksza Charles University in Prague Department of Software Engineering.
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search Tomáš Skopal Department of Computer Science, VŠB-Technical.
ADBIS 2003 Revisiting M-tree Building Principles Tomáš Skopal 1, Jaroslav Pokorný 2, Michal Krátký 1, Václav Snášel 1 1 Department of Computer Science.
Rectangle Image Compression Jiří Komzák Department of Computer Science and Engineering, Czech Technical University (CTU)
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
1 Outline  Introduction to JEPG2000  Why another image compression technique  Features  Discrete Wavelet Transform  Wavelet transform  Wavelet implementation.
Spatial indexing PAMs (II).
The Capacity of Color Histogram Indexing Dong-Woei Lin NTUT CSIE.
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
Spatial Information Systems (SIS) COMP Raster-based structures (2) Data conversion.
The Capacity of Color Histogram Indexing Dong-Woei Lin NTUT CSIE.
Losslessy Compression of Multimedia Data Hao Jiang Computer Science Department Sept. 25, 2007.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
Image Compression and Signal Processing Dan Hewett CS 525.
Lossless Compression in Multimedia Data Representation Hao Jiang Computer Science Department Sept. 20, 2007.
SWE 423: Multimedia Systems Chapter 7: Data Compression (4)
Roger Cheng (JPEG slides courtesy of Brian Bailey) Spring 2007
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
Trevor McCasland Arch Kelley.  Goal: reduce the size of stored files and data while retaining all necessary perceptual information  Used to create an.
CS559-Computer Graphics Copyright Stephen Chenney Image File Formats How big is the image? –All files in some way store width and height How is the image.
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Computer Vision – Compression(2) Hanyang University Jong-Il Park.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 8 – JPEG Compression (Part 3) Klara Nahrstedt Spring 2012.
ECE472/572 - Lecture 12 Image Compression – Lossy Compression Techniques 11/10/11.
KOHONEN SELF ORGANISING MAP SEMINAR BY M.V.MAHENDRAN., Reg no: III SEM, M.E., Control And Instrumentation Engg.
1 Image Compression. 2 GIF: Graphics Interchange Format Basic mode Dynamic mode A LZW method.
Klara Nahrstedt Spring 2011
Tessellation Data Structures
Prof. Amr Goneid Department of Computer Science & Engineering
Reversible Color Image Watermarking in YCoCg-R Color Space Aniket Roy under the supervision of Dr. Rajat Subhra Chakraborty.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 8 – Image Compression.
Indiana University Purdue University Fort Wayne Hongli Luo
CIS679: Multimedia Basics r Multimedia data type r Basic compression techniques.
Space-Filling Curves in Information Visualization Jiwen Huo
Outline Kinds of Coding Need for Compression Basic Types Taxonomy Performance Metrics.
Image Compression Fasih ur Rehman. Goal of Compression Reduce the amount of data required to represent a given quantity of information Reduce relative.
Efficient Metric Index For Similarity Search Lu Chen, Yunjun Gao, Xinhan Li, Christian S. Jensen, Gang Chen.
HPDC 2013 Taming Massive Distributed Datasets: Data Sampling Using Bitmap Indices Yu Su*, Gagan Agrawal*, Jonathan Woodring # Kary Myers #, Joanne Wendelberger.
Computer Vision – Compression(1) Hanyang University Jong-Il Park.
SOM-based Data Visualization Methods Author:Juha Vesanto Advisor:Dr. Hsu Graduate:ZenJohn Huang IDSL seminar 2002/01/24.
A New Operating Tool for Coding in Lossless Image Compression Radu Rădescu University POLITEHNICA of Bucharest, Faculty of Electronics, Telecommunications.
CS654: Digital Image Analysis
CS654: Digital Image Analysis Lecture 34: Different Coding Techniques.
Digital Image Processing Lecture 22: Image Compression
CSE 6367 Computer Vision Image Operations and Filtering “You cannot teach a man anything, you can only help him find it within himself.” ― Galileo GalileiGalileo.
JPEG.
CS654: Digital Image Analysis
DASFAA 2005, Beijing 1 Nearest Neighbours Search using the PM-tree Tomáš Skopal 1 Jaroslav Pokorný 1 Václav Snášel 2 1 Charles University in Prague Department.
Chapter 13 Discrete Image Transforms
Filtering of map images by context tree modeling Pavel Kopylov and Pasi Fränti UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER SCIENCE FINLAND.
Computer Sciences Department1. 2 Data Compression and techniques.
Efficient Game Graphics From Flash MX 2004 Game Design Demystified.
JPEG Compression What is JPEG? Motivation
Image compression.
Digital Image Processing Lecture 20: Image Compression May 16, 2005
Dimensionality Reduction
Algorithms in the Real World
Supervised Time Series Pattern Discovery through Local Importance
Digital Image Compression Using Bit Plane Slicing Method
Why Compress? To reduce the volume of data to be transmitted (text, fax, images) To reduce the bandwidth required for transmission and to reduce storage.
Presenter by : Mourad RAHALI
CSCI N207 Data Analysis Using Spreadsheet
Foundation of Video Coding Part II: Scalar and Vector Quantization
Chapter 12 Statistics.
Presentation transcript:

Image Compression Using Space-Filling Curves Michal Krátký, Tomáš Skopal, Václav Snášel Department of Computer Science, VŠB-Technical University of Ostrava Czech Republic

ITAT Presentation Outline Motivation Properties of Space-Filling Curves (SFC) Experiments –lossless compression (RLE, LZW) –lossy compression (delta compression) Conclusions

ITAT Space-Filling Curves bijective mapping of an n-dimensional vector space into a single-dimensional interval Computer Science: discrete finite vector spaces clustering tool in Data Engineering, indexing, KDD

ITAT Space-Filling Curves (examples)

ITAT Motivation Traditional methods of image processing: scanning rows or columns, i.e. along the C-curve Our assumption: other „scanning paths“ could improve the compression and could decrease errors when using lossy compression

ITAT Images scanned along SFC „Random“ Lena„Hilbert“ Lena „Z-ordered“ Lena„C-ordered“ Lena„Snake“ Lena„Spiral“ Lena

ITAT Properties of SFC SFCs partially preserve topological properties of the vector space. The topological (metric) quality of SFC: Points „close“ in the vector space are also „close“ on the curve. Two anomalies in a SFC shape: –“distance enlargements” in every SFC –symmetry of SFC: correlation of anomalies in all dimensions –jumping factor: number of “distance shrinking” occurences ( jumps over neighbours) distance shrinking distance enlargement

ITAT SFC symmetry, jumping factor Symmetry:C-curve = Snake < Random < Z-curve < Spiral < Hilbert Jumping factor:Hilbert = Spiral = Snake < C-curve < Z-curve < Random

ITAT Experiments, lossless compression neighbour color redundancy, applicability to RLE

ITAT Experiments, lossless compression pattern redundancy, applicability to LZW

ITAT Experiments, lossy compression delta compression, 6-bit delta  delta histograms Max. deltas = error pixels Tall “bell” = low entropy

ITAT Experiments, lossy compression visualization of error pixels (all color components) C-curve errors Snake curve errorsZ-curve errors

ITAT Experiments, lossy compression visualization of error pixels (all color components) Random curve errors Spiral curve errors Hilbert curve errors

ITAT Experiments, lossy compression entropy evaluation  arithmetical coding

ITAT Conclusions Choice of a suitable SFC can positively affect the compression rate (or entropy) as well as the quality of lossy compression. Experiments: symmetric curves with low (zero) jumping factor are the most appropriate  Hilbert curve