A Method for Efficiently Previewing Domain-Bound DICOM Images in Teleradiology



Similar documents
JPEG Image Compression by Using DCT


Image Compression through DCT and Huffman Coding Technique

Introduction to image coding

THREE DIMENSIONAL REPRESENTATION OF AMINO ACID CHARAC- TERISTICS

CHAPTER 2 LITERATURE REVIEW

A Novel Method to Improve Resolution of Satellite Images Using DWT and Interpolation

SYMMETRIC EIGENFACES MILI I. SHAH

Object Recognition and Template Matching

Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding

Simultaneous Gamma Correction and Registration in the Frequency Domain

Adaptive Face Recognition System from Myanmar NRC Card

Keywords: Image complexity, PSNR, Levenberg-Marquardt, Multi-layer neural network.

Data Mining: Algorithms and Applications Matrix Math Review

DATA ANALYSIS II. Matrix Algorithms

BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES

Image Compression and Decompression using Adaptive Interpolation

MEDICAL IMAGE COMPRESSION USING HYBRID CODER WITH FUZZY EDGE DETECTION

ANALYSIS OF THE EFFECTIVENESS IN IMAGE COMPRESSION FOR CLOUD STORAGE FOR VARIOUS IMAGE FORMATS

Non-negative Matrix Factorization (NMF) in Semi-supervised Learning Reducing Dimension and Maintaining Meaning

Accurate and robust image superresolution by neural processing of local image representations

A Custom-made MATLAB Based Software to Manage Leakage Current Waveforms

PIXEL-LEVEL IMAGE FUSION USING BROVEY TRANSFORME AND WAVELET TRANSFORM

Study and Implementation of Video Compression Standards (H.264/AVC and Dirac)

Index Terms: Face Recognition, Face Detection, Monitoring, Attendance System, and System Access Control.

2695 P a g e. IV Semester M.Tech (DCN) SJCIT Chickballapur Karnataka India

Review Jeopardy. Blue vs. Orange. Review Jeopardy

Conceptual Framework Strategies for Image Compression: A Review

Nonlinear Iterative Partial Least Squares Method

Partial Least Squares (PLS) Regression.

Hybrid Lossless Compression Method For Binary Images

Mathematical Model Based Total Security System with Qualitative and Quantitative Data of Human

CHAPTER 7 CONCLUSION AND FUTURE WORK

Principal Component Analysis

Secured Lossless Medical Image Compression Based On Adaptive Binary Optimization

Subspace Analysis and Optimization for AAM Based Face Alignment

RUN-LENGTH ENCODING FOR VOLUMETRIC TEXTURE

A comprehensive survey on various ETC techniques for secure Data transmission

Redundant Wavelet Transform Based Image Super Resolution

USING SPECTRAL RADIUS RATIO FOR NODE DEGREE TO ANALYZE THE EVOLUTION OF SCALE- FREE NETWORKS AND SMALL-WORLD NETWORKS

High-Dimensional Data Visualization by PCA and LDA

Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation

HSI BASED COLOUR IMAGE EQUALIZATION USING ITERATIVE n th ROOT AND n th POWER

How To Fix Out Of Focus And Blur Images With A Dynamic Template Matching Algorithm

Modelling, Extraction and Description of Intrinsic Cues of High Resolution Satellite Images: Independent Component Analysis based approaches

AUTHORIZED WATERMARKING AND ENCRYPTION SYSTEM BASED ON WAVELET TRANSFORM FOR TELERADIOLOGY SECURITY ISSUES

IMPROVED NETWORK PARAMETER ERROR IDENTIFICATION USING MULTIPLE MEASUREMENT SCANS

Introduction to Matrix Algebra

A tutorial on Principal Components Analysis

Study and Implementation of Video Compression standards (H.264/AVC, Dirac)

Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies

Wavelet analysis. Wavelet requirements. Example signals. Stationary signal 2 Hz + 10 Hz + 20Hz. Zero mean, oscillatory (wave) Fast decay (let)

Soft Clustering with Projections: PCA, ICA, and Laplacian

DYNAMIC DOMAIN CLASSIFICATION FOR FRACTAL IMAGE COMPRESSION

Sachin Patel HOD I.T Department PCST, Indore, India. Parth Bhatt I.T Department, PCST, Indore, India. Ankit Shah CSE Department, KITE, Jaipur, India

Mathematics Course 111: Algebra I Part IV: Vector Spaces

The Scientific Data Mining Process

Comparison of different image compression formats. ECE 533 Project Report Paula Aguilera

LINEAR ALGEBRA W W L CHEN

Force/position control of a robotic system for transcranial magnetic stimulation

QUANTIZED PRINCIPAL COMPONENT ANALYSIS WITH APPLICATIONS TO LOW-BANDWIDTH IMAGE COMPRESSION AND COMMUNICATION. D. Wooden. M. Egerstedt. B.K.

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

A Fast Scene Constructing Method for 3D Power Big Data Visualization

CROP CLASSIFICATION WITH HYPERSPECTRAL DATA OF THE HYMAP SENSOR USING DIFFERENT FEATURE EXTRACTION TECHNIQUES

Manifold Learning Examples PCA, LLE and ISOMAP

Data Storage. Chapter 3. Objectives. 3-1 Data Types. Data Inside the Computer. After studying this chapter, students should be able to:

Video Authentication for H.264/AVC using Digital Signature Standard and Secure Hash Algorithm

ADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING

JPEG compression of monochrome 2D-barcode images using DCT coefficient distributions

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Introduction to Principal Components and FactorAnalysis

Introduction to Medical Image Compression Using Wavelet Transform

Performance Analysis of medical Image Using Fractal Image Compression

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

How to Send Video Images Through Internet

New high-fidelity medical image compression based on modified set partitioning in hierarchical trees

Visualization of Large Font Databases

Analysis of Internet Topologies: A Historical View

Dimensionality Reduction: Principal Components Analysis

Systems of Linear Equations

Operation Count; Numerical Linear Algebra

Image Authentication Scheme using Digital Signature and Digital Watermarking

A VIDEO COMPRESSION TECHNIQUE UTILIZING SPATIO-TEMPORAL LOWER COEFFICIENTS

Combating Anti-forensics of Jpeg Compression

STUDY OF MUTUAL INFORMATION IN PERCEPTUAL CODING WITH APPLICATION FOR LOW BIT-RATE COMPRESSION

LOCAL SURFACE PATCH BASED TIME ATTENDANCE SYSTEM USING FACE.

Adaptive Demand-Forecasting Approach based on Principal Components Time-series an application of data-mining technique to detection of market movement

Functional-Repair-by-Transfer Regenerating Codes

REGION OF INTEREST CODING IN MEDICAL IMAGES USING DIAGNOSTICALLY SIGNIFICANT BITPLANES

Friendly Medical Image Sharing Scheme

A Dynamic Programming Approach for Generating N-ary Reflected Gray Code List

TOOLS FOR 3D-OBJECT RETRIEVAL: KARHUNEN-LOEVE TRANSFORM AND SPHERICAL HARMONICS

Low-resolution Image Processing based on FPGA

Mehtap Ergüven Abstract of Ph.D. Dissertation for the degree of PhD of Engineering in Informatics

Principle Component Analysis and Partial Least Squares: Two Dimension Reduction Techniques for Regression

1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving Simultaneous Equations and Matrices

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression

FCE: A Fast Content Expression for Server-based Computing

A Comparison of Speech Coding Algorithms ADPCM vs CELP. Shannon Wichman

Transcription:

A Method for Efficiently Previewing Domain-Bound DICOM Images in Teleradiology Simon Gangl, Domen Mongus and Borut Žalik Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova ulica 17, 2000 Maribor, Slovenia simon.gangl@um.si ABSTRACT Efficient data transmission is of special importance where real-time remote navigation through image archives is desirable. Previews of images can be employed for such purposes, specifically in the area of teleradiology. This paper proposes a method for preview generation, based on principal component analysis. The redundancy existing within a set of medical images is exploited by representing an input image as a linear combination of principal components. In this way, previews are compactly represented by a vector of projection coefficients, where a compression ratio of more than 1:100 can be achieved. As confirmed by results, the loss of information is comparable to standard image compression techniques. KEYWORDS: medical imaging, previewing, image compression, teleradiology, PCA. 1 INTRODUCTION While modern medical imaging methods acquire significant quantities of data, maintaining an overview of the available information is more critical than ever [1, 2, 3]. Navigation through information systems becomes more successful with the ability to obtain an immediate visual preview of the stored information (images). As shown by psychophysical studies [4, 5], high responsiveness and immediate data delivery are necessary for preview purposes, while moderate losses in image quality are acceptable [6]. Furthermore, studies of remote cooperation based on visual data, which is as well a key principle of teleradiology, have been successfully conducted in various areas [7]. However, remote navigation demands the simultaneous transmission of large numbers of images, often exceeding available network bandwidth. Several methods for medical image compression are already being applied in order to cope with constantly increasing amounts of data [8, 9]. By exploiting the redundancy present within single images, the typically achieved compression ratio is between 1:2 and 1:4 [9, 10]. However, a domain of medical images is characterized by a highdegree of similarity due to the anatomy of human beings. This important aspect of redundancy has not yet been as properly exploited regarding compression. This paper proposes an efficient compression algorithm for exploiting similarities within a domain of medical images. The algorithm is intended for fast previewing of archived medical records by expressing images as linear combinations of characteristic patterns. A detailed description of the used technique for transforming domain-specific knowledge (images) to a statistical projection space, is given in Section 2. The process of efficiently transmitting an image preview, is given in Section 3. The experimental results are provided in Section 4, while Section 5 presents the discussion. ISBN: 978-0-9891305-5-4 2014 SDIWC 199

2 CONSTRUCTING A DOMAIN-SPECIFIC IMAGE PROJECTION SPACE Similarities among medical images are easily observable even at a visual level, indicating the presence of a high degree of redundancy. It would be beneficial to exploit this redundancy by extracting common characteristic patterns from a set of medical images. These characteristic patterns could then be used for the construction of new images from the same domain. The whole medical image space could be satisfactorily covered by an appropriate selection of the characteristic patterns. A statistical tool for the suitable determination of these characteristic patterns is Principal Component Analysis (PCA) [11]. PCA transforms the data of possibly-correlated variables into data of uncorrelated variables [11]. It is often applied to emphasize similarities within data, by extracting the main (principal) components from a representative training-set [12, 13, 14]. Arbitrary data samples can, therefore, be represented as a linear combination of these components. In our method, PCA is applied to a set of medical images that are represented as one-dimensional vectors. The covariance for all pairs of vectors is calculated, and represented within a covariance matrix. The principal components are found by obtaining the eigenvectors of the covariance matrix. The eigenvectors are then aligned into a projection matrix by placing them one after another. An arbitrary image can then be projected to that projection space by converting it into a vector, and multiplying the vector by the projection matrix. To this point, the approach is based on previous work, which already introduced basic compression of DICOM images using a single PCA projection space [14]. The key improvement of the method proposed is that two projection spaces are used - the general projection space (GPS), and the specific projection space (SPS). The GPS contains general characteristic patterns of medical images covering the whole human body, while the SPS includes patterns from specific parts of the human body (i.e. head, stomach). In this way, a compact representation of arbitrary images is achieved by expressing them as coefficient vectors of both spaces principal components. A diagram of the GPS creation is presented in Figure 1. The process of creating a domain-specific projection space, consisting of the GPS as well as the SPS, is subsequently presented in three steps. Figure 1: Diagram of the GPS creation. ISBN: 978-0-9891305-5-4 2014 SDIWC 200

Step 1: Firstly, a large set of images is gathered, covering the whole spectrum of the domain (for example, arbitrary CT images of the whole body). Several hundred or even thousands of various images from the domain are included. Due to mathematical restrictions, the images have to be of the same resolution and bit-depth. Step 2: The GPS is created only once during the system initialization by applying the PCA method to the set of images, similarly as described in [14]. In this case, the procedure consists of four sub-steps: The GPS is obtained by calculating the eigenvectors of the covariance matrix C. Since these eigenvectors represent the principal components of the data from, they can be used to accurately represent images from the same domain [15]. The eigenvectors are arranged decreasingly, according to their related eigenvalues, i.e. their visual importance. In order to finally form the GPS, the eigenvectors are aligned into the projection matrix G, where each eigenvector represents one column. Each image from is transformed into a vector by aligning its rows (or columns) one after another. These vectors represent the base vectors of an N-dimensional vector space ( ), where the variables are correlated. The origin of the vector space is translated to the point (0, 0,..., 0 N ) by subtracting the average value of each base vector from its components. In other words, the average image intensity is subtracted from its pixels. The dimensionality of the vector space is reduced by expressing the mutual dependency of the base vectors, using a covariance matrix [14]: ( )( ) where C i,j is the (i,j)-th element of the covariance matrix, x i and x j are the vectors for which the covariance is calculated, and are their average values (due to step 2.2 these average values are always 0), and N EL is the dimensionality of the vectors, which is equal to the total number of pixels within the input images. An arbitrary image can now be projected to the GPS by using the following equation: where i p is the projection of the input image vector i to the GPS, defined by matrix G. Equivalently, the image can be restored by: where is the restored vectorized image. However, may differ from the original, where the difference e is estimated by This difference is handled by introducing the SPS. Step 3: The SPS is generated from a set of images, from a specific field (usually, ). While and are disjoint, enhances a subset of by an adjustable set of specific images. The process of SPS formation is performed over the following steps (see Figure 2): ISBN: 978-0-9891305-5-4 2014 SDIWC 201

Figure 2: Diagram of the SPS creation. The set of differences arising from projecting to the GPS is firstly obtained (eq. 4). is separated to negative and positive sets of errors, thus defining two separate sets of vectors, i.e. and. As an analogy to the creation of the GPS, the SPS is created by applying the PCA method separately to and, in order to obtain projection matrices S- and S+. Three matrices (G, S -, S + ) are defined using the described procedure, which are then employed to compactly represent arbitrary images as coefficients of a linear combination of principal components. These coefficients can then be used to generate their previews. 3 TRANSMITTING AN IMAGE PREVIEW An image preview is generated over two steps; image compression, and reconstruction (see Figure 3): 3.1 Image Compression The image vector i is firstly projected to the GPS using equation 2. The vector c g of general projection coefficients is determined and a basic approximation of the image is created. The positive and negative difference images and are obtained and projected to the SPS, using the following equations: ISBN: 978-0-9891305-5-4 2014 SDIWC 202

The vectors c - and c + of positive and negative specific projection coefficients are obtained as a result. 3.2 Image Reconstruction The vectors c g, c -, and c + are used to compute the image preview, using equation 7: As can be seen, the preview generation is straightforward and computationally efficient. Additionally, by obtaining the preview of a specific image, a pointer for a possible transmission in original quality is created. Figure 3: Diagram of the image preview generation. ISBN: 978-0-9891305-5-4 2014 SDIWC 203

4 RESULTS For experiments, the GPS was created from a set of 232 CT images, which consisted of two head and three stomach scans. The SPS was formed by using 193 CT images of two distinct stomach scans. These images were chosen at equal anatomical distance, for the GPS the distance between consecutive images being 10mm, and for the SPS 5mm. The resolution of all images was 512x512 pixels, with a bit-depth of 8 bits/pixel. Previews of a few hundred sample images of the stomach were generated using, the presented method. Four characteristic images are shown on Figure 4, for a visual comparison. The error in the created preview images from Figure 4 was quantitatively evaluated by calculating the mean absolute error (MAE) and the mean square error (MSE), as defined by equations 8 and 9: where image, and preview, respectively. is the (j,k)-th pixel of the original is the (j,k)-th pixel of the image For comparison, the images were compressed using JPEG and JPEG2000 standards, by means of default quantization parameters [16, 17], as shown in Tables 1 and Tables 2. Figure 4: Comparison of original (a-d) and preview (a'-d') images. Table 1: Comparison of original and reconstructed images of the stomach in terms of reconstruction error. The Average MAE was in all cases calculated using 100 pictures, which contained a MAE greater than zero. Images Preview-PCM JPEG JPEG2000 MAE MSE MAE MSE MAE MSE (a) & (a ) 4.2 46.7 1.3 3.6 4.9 42.8 (b) & (b ) 4.5 50.4 1.3 3.6 4.5 38.9 (c) & (c ) 3.0 30.8 1.2 3.5 4.4 38.4 (d) & (d ) Average 4.1 4.4 44.9 54.3 1.2 1.2 3.4 3.5 4.7 4.5 42.3 41.2 ISBN: 978-0-9891305-5-4 2014 SDIWC 204

Table 2: Comparison of file sizes (Size) and compression ratios (CR) by algorithm. Images Preview-PCM JPEG JPEG2000 Size CR Size CR Size CR (a) & (a ) 75.1 1 : 3.41 (b) & (b ) 76.8 1 : 3.33 2.4 1 : 107 (c) & (c ) 74.5 1 : 3.44 30.0 1 : 8.55 (d) & (d ) Average 2.4 1 : 107 73.8 75.7 1 : 3.47 1 : 3.38 30.0 1 : 8.55 300 250 200 150 100 50 0 (a) (b) (c) (d) It is evident from the results in Table 1 that the presented method introduces moderate errors of a similar degree to those of JPEG2000, however, they both introduce considerably larger errors than JPEG. At the same time, the achieved compression ratio of our method is approximately 13-times higher than JPEG2000 and 32-times higher than JPEG (see Table 2 and the bar-graph in Figure 5). It is even more important to stress that our method yields constant compressed file size (constant compression ratio), as given by equation: ( ) where q is the resulting file size, and w is the storage requirement for one coefficient (both in bytes). It should be recalled that positive and negative errors are encoded separately, resulting in two sets of SPS coefficients. Due to the covariance definition, the number of projected coefficients for each set ( ) is one less than the number of training samples. It is obvious that the compressed file size is only directly proportional to the number of training samples (images) included in the sets, used for the projection space creation. Original DICOM JPEG JPEG2000 Preview-PCM Figure 5: Comparison of file sizes by various methods. In order to evaluate the proposed method, the proportion between the compression ratio (CR) and the created error (MAE) is used as a figure of merit, denoted by compression efficiency (CE) [18]: The CE for JPEG, JPEG2000, and our method, are presented in Table 3, according to equation 11 and the results from Tables 1 and 2. It is obvious that our method achieves significantly higher CE ratings than conventional approaches. This method introduces a MAE comparable to JPEG2000 while, at the same time, a considerably higher compression ratio is achieved for images from the projection space domain. Table 3: Comparison in terms of CE. Images Preview-PCM JPEG JPEG2000 (a) 23.1 2.6 1.7 (b) (c) (d) Average 21.6 32.4 23.7 24.3 2.6 2.9 2.9 2.8 1.9 1.9 1.8 1.9 The influence of the SPS was studied in order to further analyse the method. Figure 6 shows image ISBN: 978-0-9891305-5-4 2014 SDIWC 205

previews generated for CT images of the head, which are not included in the SPS domain. successfully employed for adding detail to the GPS domain, whenever this is desirable. Table 4: Comparison between the original and preview images of the head in terms of reconstruction error. Images Preview-PCM MAE MSE (a) & (a ) 4.2 82.8 (b) & (b ) 3.7 51.4 (c) & (c ) 7.0 126.2 (d) & (d ) Average 6.3 6.8 108.2 119.8 5 DISCUSSION Figure 6: Comparison of original (a-d) and preview (a'-d') images. Because images of the head are not part of the SPS domain, a higher degree of error is introduced (see Table 4) compared to domain specific images (see Table 1). As a result, the MAE of stomach images (4.4) is 35.3% smaller than that of head images (6.8). It follows that the SPS can be This paper presented a new method for the construction of medical image previews for remote navigation based on principal component analysis. A projection space for a medical domain was generated from a set of representative images and used to generate a preview of an arbitrary image from the same domain. The compression of the preview image was achieved by generating and storing a vector of projection coefficients. The compressed images were, therefore, of a constant size, where the number of coefficients (and the related compression ratio) only depended on the number of images used for the construction of the projection space. The conducted experiments prove that the compression ratios achieved by the presented method, were 13-times higher than JPEG2000 and 32-times higher than JPEG. At the same time, the obtained errors regarding compressed images were of a similar degree to those introduced by JPEG2000. Further quality improvements for any specific sub-domain can be achieved by additionally employing a specific projection space. ACKNOWLEDGMENTS This work was supported by the Slovenian Research Agency under grant 1000-10-310121 and project P2-0041. ISBN: 978-0-9891305-5-4 2014 SDIWC 206

REFERENCES [1] D. Power, E. Politou, M. Slaymaker, S. Harris, and A. Simpson, A relational approach to the capture of DICOM files for grid-enabled medical imaging databases, in: Haddad, H., Liebrock, L.M., Omicini, A., and Wainwright, R.L., Eds. SAC 2004. Proceedings of the ACM symposium on applied computing, Mar 14-17, Nicosia, Cyprus. New York: ACM, pp. 272-297, 2004. [2] H. Müller, N. Michoux, D. Bandon, and A. Geissbuhler, A review of content-based image retrieval systems in medical applications - clinical benefits and future directions, Int. J. Med. Informatics, vol. 73(1), pp. 1-23, 2004. [3] C.Y. Chang and M.D. Tsai, Knowledgebased navigation system for building health diagnosis, Adv. Eng. Inform., vol. 27(2), pp. 246-260, 2013. [4] H.A. Allen and G.W. Humphreys, A psychophysical investigation into the preview benefit in visual search, Vision Res., vol. 47(6), pp. 735-745, 2007. [5] L. Wan, W. Feng, Z. Lin, T.T. Wong, and Z.Q. Liu, Perceptual image preview, Multimedia Syst. J., vol. 14(4), pp. 195-204, 2008. [6] J. Struber and J. Tichon, Minimum technical requirements and evaluating effectiveness of teleradiology, Technology and Health Care, vol. 11(6), pp. 391-398, 2003. [7] W. A. Hatem, A. Kwan, and J. Miles, Comparing the effectiveness of face to face and computer mediated collaboration, Adv. Eng. Inform., vol. 26(2), pp. 383-395, 2012. [8] National Electrical Manufacturers Association (NEMA), Digital imaging and communications in medicine (DICOM) - Part 5: Data structures and encoding, Rosslyn (VA): The Association, 2009. [9] B. Ramakrishnan and N. Sriraam, Internet transmission of DICOM images with effective low bandwidth utilization, Digital Signal Process., vol. 16(6), pp. 825-831, 2006. [10] Y.Y. Chen, Medical image compression using DCT-based subband decomposition and modified SPIHT data organization, Int. J. Med. Informatics, vol. 76(10), pp. 717-725, 2007. [11] R. Lenz and T.H. Bui, Recognition of nonnegative patterns, in: J. Kittler, M. Petrou, and M.S. Nixon, Eds. ICPR 2004. Proceedings of the 17th international conference on pattern recognition, Aug 23-26, Cambridge, UK. Washington, DC: IEEE CS Press, pp. 498-501, 2004. [12] X. Han, Nonnegative principal component analysis for cancer molecular pattern discovery, IEEE/ACM Trans. Comput. Biol. Bioinf., vol. 7(3), pp. 537-549, 2010. [13] S. Gangl and D. Mongus, Comparison of face recognition algorithms in terms of the learning set selection, in: M. Wimmer and M. Ilcik, Eds. CESCG 2010. Proceedings of the 14th central European seminar on ISBN: 978-0-9891305-5-4 2014 SDIWC 207

computer graphics, May 10-12, Budmerice, Slovakia. Vienna: Technische Universität Wien, pp. 37-43, 2010. [14] S. Gangl and B. Žalik, Partially Lossless Compression of DICOM Image Sets, in: A.R. de Mendarozqueta and M. Groppo, Eds. CAIS 2011. Anales del 40JAIIO, Aug 29 - Sep 2, Córdoba, Argentina. Buenos Aires: SADIO, pp. 131-136, 2011. [15] M. Turk and A. Pentland, Eigenfaces for recognition, J. Cognitive Neurosci., vol. 3(1), pp. 71-86, 1991. [16] JPEG. (September 2013). Joint Photographic Experts Group [Online] http://www.jpeg.org/jpeg/index.html [17] JPEG2000. (September 2013). Joint Photographic Experts Group [Online] http://www.jpeg.org/jpeg2000/index.html [18] S.C. Lo, H. Li, and M.T. Freedman, Optimization of wavelet decomposition for image compression and feature preservation, IEEE Trans. Med. Imaging, vol. 22(9), pp. 1141-1151, 2003. ISBN: 978-0-9891305-5-4 2014 SDIWC 208