Lossy Compression of DNA Microarray Images

Slides:



Advertisements
Similar presentations
INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, ICT '09. TAREK OUNI WALID AYEDI MOHAMED ABID NATIONAL ENGINEERING SCHOOL OF SFAX New Low Complexity.
Advertisements

New Attacks on Sari Image Authentication System Proceeding of SPIE 2004 Jinhai Wu 1, Bin B. Zhu 2, Shipeng Li, Fuzong Lin 1 State key Lab of Intelligent.
A Matlab Playground for JPEG Andy Pekarske Nikolay Kolev.
1 Outline  Introduction to JEPG2000  Why another image compression technique  Features  Discrete Wavelet Transform  Wavelet transform  Wavelet implementation.
Department of Computer Engineering University of California at Santa Cruz Data Compression (3) Hai Tao.
1 Preprocessing for JPEG Compression Elad Davidson & Lilach Schwartz Project Supervisor: Ari Shenhar SPRING 2000 TECHNION - ISRAEL INSTITUTE of TECHNOLOGY.
1 A Unified Rate-Distortion Analysis Framework for Transform Coding Student : Ho-Chang Wu Student : Ho-Chang Wu Advisor : Prof. David W. Lin Advisor :
CS430 © 2006 Ray S. Babcock Lossy Compression Examples JPEG MPEG JPEG MPEG.
Image Compression - JPEG. Video Compression MPEG –Audio compression Lossy / perceptually lossless / lossless 3 layers Models based on speech generation.
Still Image Conpression JPEG & JPEG2000 Yu-Wei Chang /18.
Fast vector quantization image coding by mean value predictive algorithm Authors: Yung-Gi Wu, Kuo-Lun Fan Source: Journal of Electronic Imaging 13(2),
1 Lossless DNA Microarray Image Compression Source: Thirty-Seventh Asilomar Conference on Signals, Systems and Computers, Vol. 2, Nov. 2003, pp
IMAGE COMPRESSION USING BTC Presented By: Akash Agrawal Guided By: Prof.R.Welekar.
JPEG image compression Group 7 Arvind Babel (y07uc024) Nikhil Agarwal (y08uc086)
1 Security and Robustness Enhancement for Image Data Hiding Authors: Ning Liu, Palak Amin, and K. P. Subbalakshmi, Senior Member, IEEE IEEE TRANSACTIONS.
Improvements to the JPEG-LS prediction scheme Authors: S. Bedi, E. A. Edirisinghe, and G. Grecos Source : Image and Vision Computing. Vol. 22, No. 1, 2004,
On the Use of Standards for Microarray Lossless Image Compression Author :Armando J. Pinho*, Antonio R. C.Paiva, and Antonio J. R. Neves Source :IEEE TRANSACTIONS.
Spring 2000CS 4611 Multimedia Outline Compression RTP Scheduling.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Multiple-description iterative coding image watermarking Source: Authors: Reporter: Date: Digital Signal Processing, Vol. 20, No. 4, pp , 2010.
1 Information Hiding Based on Search Order Coding for VQ Indices Source: Pattern Recognition Letters, Vol.25, 2004, pp.1253 – 1261 Authors: Chin-Chen Chang,
Reference line approach in vector data compression Alexander Akimov, Alexander Kolesnikov and Pasi Fränti UNIVERSITY OF JOENSUU DEPARTMENT OF COMPUTER.
Image Compression Based On BTC-DPCM And It ’ s Data-Driven Parallel Implementation Author : Xiaoyan Yu 、 Iwata, M. Source : Image Processing, ICIP.
JPEG - JPEG2000 Isabelle Marque JPEGJPEG2000. JPEG Joint Photographic Experts Group Committe created in 1986 by: International Organization for Standardization.
The task of compression consists of two components, an encoding algorithm that takes a file and generates a “compressed” representation (hopefully with.
Performed by: Dor Kasif, Or Flisher Instructor: Rolf Hilgendorf Jpeg decompression algorithm implementation using HLS PDR presentation Winter Duration:
A Fast LBG Codebook Training Algorithm for Vector Quantization Presented by 蔡進義.
Blind image data hiding based on self reference Source : Pattern Recognition Letters, Vol. 25, Aug. 2004, pp Authors: Yulin Wang and Alan Pearmain.
MPEG4 Fine Grained Scalable Multi-Resolution Layered Video Encoding Authors from: University of Georgia Speaker: Chang-Kuan Lin.
Introduction to JPEG m Akram Ben Ahmed
SIMD Implementation of Discrete Wavelet Transform Jake Adriaens Diana Palsetia.
IS502:M ULTIMEDIA D ESIGN FOR I NFORMATION S YSTEM M ULTIMEDIA OF D ATA C OMPRESSION Presenter Name: Mahmood A.Moneim Supervised By: Prof. Hesham A.Hefny.
JPEG Compressed Image Retrieval via Statistical Features
Multimedia Outline Compression RTP Scheduling Spring 2000 CS 461.
Source: Pattern Recognition, 37(5), P , 2004
A Novel Data Embedding Scheme Using Optimal Pixel Pair Substitution
Source: The Journal of Systems and Software, Volume 67, Issue 2, pp ,
Face recognition using improved local texture pattern
Burrows Wheeler Transform In Image Compression
Reversible Data Hiding in JPEG Images using Ordered Embedding
Source : Signal Processing, Volume 133, April 2017, Pages
Quad-Tree Motion Modeling with Leaf Merging
Regression-Based Prediction for Artifacts in JPEG-Compressed Images
MOTION ESTIMATION AND VIDEO COMPRESSION
Representing Images 2.6 – Data Representation.
A Color Image Hiding Scheme Based on SMVQ and Modulo Operator
Centrality Bias Measure for High Density QR Code Module Recognition
Source :Journal of visual Communication and Image Representation
Reversible Data Hiding in JPEG Images
Dynamic embedding strategy of VQ-based information hiding approach
Chair Professor Chin-Chen Chang Feng Chia University
Hung, K. -L. and Chang, C. -C. , IEE Image and Signal Processing, vol
A Color Image Hiding Scheme Based on SMVQ and Modulo Operator
Digital Steganography Utilizing Features of JPEG Images
Authors: Chin-Chen Chang, Yi-Hui Chen, and Chia-Chen Lin
A new chaotic algorithm for image encryption
Author: Minoru Kuribayashi, Hatsukazu Tanaka
Data hiding method using image interpolation
Hung, K. -L. and Chang, C. -C. , IEE Image and Signal Processing, vol
Source: Pattern Recognition Letters 29 (2008)
New Framework for Reversible Data Hiding in Encrypted Domain
Unit 5: Geometric and Algebraic Connections
A Self-Reference Watermarking Scheme Based on Wet Paper Coding
Source: IEEE Transactions on Circuits and Systems,
Source: Pattern Recognition, Volume 40, Issue 2, February 2007, pp
A Fast No Search Fractal Image Coding Method
Hidden Digital Watermarks in Images
Lossless Data Hiding in the Spatial Domain for High Quality Images
Context-based, Adaptive, Lossless Image Coding (CALIC)
Source: Multidim Syst Sign Process, vol. 29, no. 4, pp , 2018
Presentation transcript:

Lossy Compression of DNA Microarray Images Source: Electrical and Computer Engineering, Vol. 2, May 2004, pp. 735-738 Authors: N. Faramarzpour, S. Shirani and M.J. Deen Speaker: Chia-Chun Wu (吳佳駿) Date: 2005/04/01

Outline 1. Introduction 2. Proposed method 3. Experimental results 4. Conclusions 5. Comments

1. Introduction Microarray images are usually massive in size. about 30MBytes (2560 × 4096) or more Lossless compression is the low compression rate that can be achieved. 2.2:1 in good implementations [4, 5]

Optimize spot coordinates and radius 2. Proposed method Initial radius: (16+16)/2 = 16 Calculated initial spot coordinates and radius Extract individual spots Input image Optimize spot coordinates and radius 16 × 16 Apply Circle to Square (C2S) transform DCT, quantize, and encode Last spot? Yes No Compressed files

where Im[i, j] is the image pixel value. 2.1 Spot extraction where Im[i, j] is the image pixel value.

2.1 Spot extraction spot sub-image (16 x 16) (c) White lines show how spot sub-images are extracted.

2.1 Spot extraction spot sub-image (16 x 16) msub= 16, nsub = 16 14 15 17 16 18 1 22 25 24 19 12 13 2 28 35 42 47 44 39 32 3 20 21 34 43 56 60 64 57 49 31 4 59 63 65 40 5 46 61 70 62 48 6 53 68 54 7 27 52 8 9 10 51 45 58 55 11 23 50 30 26 37 41 spot sub-image (16 x 16) msub= 16, nsub = 16

2.2 Parameter extraction The initial value for the radius us given by: where γ has a value between 7 and 8, Rp usually converges in 4 or 5 iterations.

2.2 Parameter extraction (9, 9) CenterX = 89916/10509= 9 14 15 17 16 18 1 249 22 25 24 19 12 13 2 286 28 35 42 47 44 39 32 3 441 20 21 34 43 56 60 64 57 49 31 4 620 59 63 65 40 5 704 46 61 70 62 48 6 758 53 68 54 7 793 27 52 8 769 9 779 10 786 51 45 58 55 11 750 23 50 745 30 26 37 41 716 598 302 379 528 680 767 791 811 855 886 878 856 824 744 660 284 264 CenterX = 89916/10509= 9 Centery = 97214/10509= 9 Initial radius Rp=(msub+nsub)/γ = (16+16)/2= 16

2.3 Circle to Square(C2S) transform Geometric representation of C2S transform

2.3 Circle to Square(C2S) transform First, r and Θ are calculated for every pixel belonging to the square. Then we have: where (Xt, Yt) is the center of the square. And then: x is expected to have a value in the range of [0, Rp].

2.3 Circle to Square(C2S) transform 35 36 37 38 39 40 34 41 42 47 44 43 56 60 64 57 49 59 63 65 46 61 70 62 48 53 68 54 50 52 45 51 58 55 14 15 17 16 18 22 25 24 19 12 13 28 35 42 47 44 39 32 20 21 34 43 56 60 64 57 49 31 59 63 65 40 46 61 70 62 48 53 68 54 27 52 51 45 58 55 23 50 30 26 37 41 C2S

2.3 Circle to Square(C2S) transform (a) A microarray image before, and (b) after applying C2S transform to each of its spots.

2.4 DCT, Quantization, and Encoding First, the image is divided into 8 × 8 blocks. Those blocks are then DCT transformed. After DCT is applied to each block, the transformed blocks are quantized. Last, the arithmetic coding is used for this application.

3. Experimental results The rate distortion curve achieved by JPEG compared to lossy compression method for the same test image.

4. Conclusions This paper proposed a new algorithm for lossy compression of microarray images. For various applications which have images with circular patterns, using a stage of C2S transform can provide improvement the overall performance of the compression.

5. Comments 由於DNA Microarray Images背景顏色是不重要的,因此,可以利用本篇論文偵測Spot的方法,將偵測出來的Spot視為重要的ROI區域,以無失真的方式進行壓縮;反之,背景則視為不重要的區域,用失真的方法進行壓縮,以提高整體的壓縮率。