<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JAMP</journal-id><journal-title-group><journal-title>Journal of Applied Mathematics and Physics</journal-title></journal-title-group><issn pub-type="epub">2327-4352</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jamp.2015.37106</article-id><article-id pub-id-type="publisher-id">JAMP-57958</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  An Algorithm for Medical Imagining Compression That Is Oriented to ROI-Characteristics Protection
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>enjun</surname><given-names>Shuai</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Yang</surname><given-names>Shen</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Jing</surname><given-names>Pan</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Electronic &amp;amp; Information Engineering, School of Technology, Nanjing Tech University, Nanjing, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>srjwhy@163.com(ES)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>30</day><month>06</month><year>2015</year></pub-date><volume>03</volume><issue>07</issue><fpage>854</fpage><lpage>861</lpage><history><date date-type="received"><day>20</day>	<month>May</month>	<year>2015</year></date><date date-type="rev-recd"><day>accepted</day>	<month>12</month>	<year>July</year>	</date><date date-type="accepted"><day>15</day>	<month>July</month>	<year>2015</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In order to protect the ROI (region of interest) characteristics while greatly improving medical imaging compression ratio, we are proposing an algorithm for medical imagining compression that is oriented to ROI-characteristics protection. Firstly, an improved ROI segmentation algorithm is put forward based on the analysis of the ROI segmentation. Then, after the ROI segmented, the ROI edge is extracted and encoded with Freeman chain coding. Finally, the ROI is compressed by lossless compression with shearlet; the ROB (region of background) is compressed by the method of high ratio lossy compression combining with Wavelet and Fractal. Simulation results show that the ROI is segmented precisely. It holds edge integrity and has high quality reconstruction processed by the presented method, helping protect ROI characteristics while greatly improving the compression ratio.
 
</p></abstract><kwd-group><kwd>Medical Imaging Compression</kwd><kwd> ROI Characteristics Protecting</kwd><kwd> Segmentation</kwd><kwd> Chain Coding</kwd><kwd> Shearlet</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The new health care reform in China is causing an increase in the demand for PACS (picture archiving and communication systems). Medical equipment of digital imaging has been producing massive medical imaging in hospitals. This poses a serious challenge to the limited transmission bandwidth and storage capacity of PACS. So there is an urgent need for efficient medical imaging compression algorithm.</p><p>JEPG2000 is the basic method in current medical imaging compression for PACS. The most important thing it did was to support the ROI compression. For example, [<xref ref-type="bibr" rid="scirp.57958-ref1">1</xref>] used a bit-plane lifting algorithm. The quantized ROI wavelet coefficient was coded by SPIHT coding according to bit-planes, improving the quality of the ROI reconstruction quality. After [<xref ref-type="bibr" rid="scirp.57958-ref2">2</xref>] improved [<xref ref-type="bibr" rid="scirp.57958-ref1">1</xref>] , the wavelet coefficient was advanced based on the different interest level of ROI, reaching the balance between reconstruction quality and compression ratio. Both [<xref ref-type="bibr" rid="scirp.57958-ref1">1</xref>] and [<xref ref-type="bibr" rid="scirp.57958-ref2">2</xref>] acted on the regular rectangular space domain, but imaging segmentation region was often irregular. So [<xref ref-type="bibr" rid="scirp.57958-ref3">3</xref>] proposed the plane fitting method, which was simple and easy. And [<xref ref-type="bibr" rid="scirp.57958-ref4">4</xref>] aimed at the different importance of ROI and ROB. ROI and ROB were processed by different methods. The handling targeted had increased compression ratio as well as the PSNR. Nevertheless, these methods did not protect the ROI characteristics. The worst had inaccurate segmentation; the edges were not protected; the reconstruction quality was low; and most of the algorithm was carried out with near-lossless or lossless compression. Therefore, these methods cannot meet the need for high-speed transmission and mass storage of explosive growth of medical imaging [<xref ref-type="bibr" rid="scirp.57958-ref1">1</xref>] -[<xref ref-type="bibr" rid="scirp.57958-ref4">4</xref>] .</p><p>To solve the above problem, first of all, ROI should be accurately segmented. For this purpose, an improved ROI segmentation algorithm is proposed based on ITTI visual attention model and wavelet analysis. Secondly, to protect the edge of the ROI, freeman chain coding is used to encode ROI edge obtained at the last step of ROI segmentation. Thirdly, in order to improve the compression ratio while maintaining imaging reconstruction quality, ROI and ROB are compressed with different processes; ROI is compressed lossless with shearlet to maintain the integrity of the ROI; and ROB is compressed combining wavelet and fractal method to improve compression ratio. Finally, edge-coded information and ROI and ROB coded information are reconstructed to gain the whole recovery image.</p></sec><sec id="s2"><title>2. ROI Segmentation Analysis and Improvement</title><p>There are many ways to segment ROI. The main ways include feature point segmentation, human interaction segmentation, and segmentation based on visual attention mechanism. Among them, feature point segmentation method is applied only to the imaging having a certain type of characteristic. Although human interaction segmentation method has a better result, it is strongly influenced by subjective factors. Besides, its efficiency is low, not good for PACS as a large library.</p><sec id="s2_1"><title>2.1. Fundamental of Segmentation Based on Visual Attention Mechanism</title><p>ITTI, proposed by Laurent ITTI on the basis of feature integration theory, is currently the most widely used visual attention model. Firstly, ITTI model structures multi-scale image pyramid by Gaussian filtering method. Then finding the significant point through a series of treatment containing the Center-Surround algorithm, normalization, iterative portfolio, RSM (returns suppression mechanism) and WTA (Winner take all) network. Finally it gets ROI by salient points grown [<xref ref-type="bibr" rid="scirp.57958-ref5">5</xref>] [<xref ref-type="bibr" rid="scirp.57958-ref6">6</xref>] .</p><p>But the multi-scale image pyramid structured by Gaussian filter method is not consistent with the image processing model constructed by the mechanism of human visual attention. Moreover, there is a huge amount of calculation to be done to structure the multi-scale image pyramid with Gaussian filtering method, which is time- consuming.</p></sec><sec id="s2_2"><title>2.2. Improved ROI Segmentation Algorithm</title><p>Wavelet transform is a tool for time-frequency analysis. Multy-resolution feature is its most impeccable property, and wavelet multi-resolution feature is consistent with the human visual system. Therefore it matches the human visual attention mechanism. Comparison of Wavelet and Gaussian image pyramid is shown in figure [<xref ref-type="bibr" rid="scirp.57958-ref1">1</xref>] .</p><p>As can be seen from <xref ref-type="fig" rid="fig1">Figure 1</xref>, the wavelet image pyramid is visible to human eyes because of the strong contrast. However, Gaussian image pyramid is round, look vague. And the Gaussian running time is 0.155 s while wavelet is only 0.048 s. Efficiency is improved by 30.97%. Therefore, this paper uses wavelet instead of Gaussian to split ROI. Its frame is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. Comparison of ITTI and Improved algorithm ROI segmentation is shown in figure [<xref ref-type="bibr" rid="scirp.57958-ref3">3</xref>] .</p><p>From <xref ref-type="fig" rid="fig3">Figure 3</xref> we can find that ITTI model has the problem of over-segmentation. It is not enough to protect edge feature. A lot of important information is lost. But the improved ROI segmentation algorithm in this article is more accurate on segmentation as ITTI segmentation accuracy is just 74.6% and improved algorithm’s is</p><fig-group id="fig1"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Comparison of Wavelet and Gaussian image pyramid. (a) Source image; (b) Wavelet image pyramid; (c) Gaussian image pyramid.</title></caption><fig id ="fig1_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x5.png"/></fig></fig-group><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Improved algorithm framework of ROI segmentation</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x6.png"/></fig><fig-group id="fig3"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Comparison of ITTI and Improved algorithm ROI segmentation. (a) Source image; (b) ITTI segmentation; (c) Improved algorithm segmentation.</title></caption><fig id ="fig3_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x7.png"/></fig></fig-group><p>80.8%. It has more desired result.</p></sec></sec><sec id="s3"><title>3. Freeman Edge Protection Based on Former ROI Segmentation</title><p>ROI edge feature has a very high value of health diagnostic, but the edge can be severely damaged in the case of a high compression ratio. The damage interferes with the physician’s follow-up mission diagnosis and treatment. In order to protect the ROI edge, the article suggests firstly obtaining ROI edge, then encoding it. This coded information is transmitted as a component of the compressed information. Finally the code stream has two parts including edge information and transform compressed information of ROI and ROB. Decoder integrated the two parts to get imaging with well protected edge.</p><sec id="s3_1"><title>3.1. Edge Obtaining Based on Former ROI Segmentation</title><p>Traditional way of obtaining edge often uses operator of edge detection, but the detector operators are too sensitive to noise (e.g. Prewitt operator and Sobel operator) although they have certain smoothing effect and they have removed part of the pseudo-edge to leave out the real edge. At the same time, the positioning accuracy is not high. Robert operator is not ideal for the imaging with familiar Gaussian noise. The processed edge will be disconnected. In this paper, we get ROI through significant point growing. So obtaining processing can be finished by just preserving the pixels that does not meet region growing criteria. It is convenient and advanced. In this paper, we discuss growing with the 8 neighborhoods, setting the threshold value T as 80, and preserving the pixels t in the storage E [<xref ref-type="bibr" rid="scirp.57958-ref8">8</xref>] .</p></sec><sec id="s3_2"><title>3.2. Freeman Chain Coding</title><p>Freeman chain coding is a lossless compression algorithm of image edge. It could use only a small amount of data to store much information. But its criterion is difficult to meet because the criterion is sensitive to noise. However, because of the adequate application of wavelet and its filter characteristic, this paper can use Freeman chain coding to encode edge [<xref ref-type="bibr" rid="scirp.57958-ref9">9</xref>] . The seed was randomly selected from E, using Freeman4 direction chain coding, the Freeman4 direction of the order and Freeman4 Chain code definitions as shown in <xref ref-type="fig" rid="fig4">Figure 4</xref>(a) and <xref ref-type="fig" rid="fig4">Figure 4</xref>(b) below.</p></sec></sec><sec id="s4"><title>4. The Principle of Compression Algorithms in This Paper</title><sec id="s4_1"><title>4.1. Compression of ROI</title><p>Shearlet was born as a new tool to overcome the limitations of wavelet. Although it has not distributed three high frequency detail sub-image and a low frequency profile sub-image, its image information can be concentrated on the sub-picture containing the larger coefficient. According to this good sparse features, ROI was compressed based on shearlet in this paper [<xref ref-type="bibr" rid="scirp.57958-ref10">10</xref>] . Furthermore, we found Huffman suitable for the statistical characteristics of ROI significant transform coefficients. So we select shearlet and Huffman to compress ROI to protect the ROI characteristics and improve its reconstruction quality. This article introduces the following steps in the algorithm of ROI the specific compression:</p><p>Step 1. Shearlet transform.</p><p>Four levels of shearlet are transformed on ROI. Each level generates 10 directional sub-image.</p><p>Step 2. Quantization.</p><p>Threshold of 10 direction transform coefficients, calculates the average value, using the coefficients sum of maximum average value to approximate source image, which is the initial step of compression and de-noising.</p><p>Step 3. Entropy coding.</p><p>Huffman entropy coding of the selected coefficient [<xref ref-type="bibr" rid="scirp.57958-ref11">11</xref>] .</p><fig-group id="fig4"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Freeman4 direction chain code. (a) Freeman4 direction of the order; (b) Freeman4 Chain code definitions.</title></caption><fig id ="fig4_1"><label> (b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x8.png"/></fig><fig id ="fig4_2"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x9.png"/></fig></fig-group></sec><sec id="s4_2"><title>4.2. Compression of ROB</title><p>Aiming at these problems that the wavelet compression ratio is not high and the Fractal needs long encoding time. Wavelet and Fractal were combined to compress ROB with high compression ratio and within only a little time. So we just encode low frequency sub-image while eliminating the high-frequency sub-images directly with fractal because imaging energy is always concentrated on those areas after Wavelet transform. The following are the algorithm steps of the ROB specific compression:</p><p>Step 1. Four levels of wavelet are transformed on ROB to produce 12 high-frequency sub-image and a low- frequency sub-image. For the wavelet base in this step, a D9/7 wavelet is chosen on the basis of the confirmed experiment [<xref ref-type="bibr" rid="scirp.57958-ref12">12</xref>] ;</p><p>Step 2. High frequency sub-image information is filtered out. The low-frequency sub-image is reconstructed. Fractal encodes the reconstructed image [<xref ref-type="bibr" rid="scirp.57958-ref13">13</xref>] [<xref ref-type="bibr" rid="scirp.57958-ref14">14</xref>] .</p></sec></sec><sec id="s5"><title>5. Simulation</title><p>The overall framework of the algorithm is shown in <xref ref-type="fig" rid="fig5">Figure 5</xref>. To verify the effectiveness of the proposed method, it is necessary to perform a simulation experiment on the CT imaging of the DICOM standard brain lesion. The Nanjing Health Information Center provide CT imaging, the simulation environment is MATLABR2012b. PSNR and MSSIM are used to make sure the evaluation is objective. The definitions of MSN and PSNR are</p><disp-formula id="scirp.57958-formula5"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x10.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.57958-formula6"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x11.png"  xlink:type="simple"/></disp-formula><p>In the formula, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x12.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x13.png" xlink:type="simple"/></inline-formula> are the imaging pixel values of the reconstructed image and the original. MN is the image size. Let x and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x14.png" xlink:type="simple"/></inline-formula> be structural similarity,</p><disp-formula id="scirp.57958-formula7"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x15.png"  xlink:type="simple"/></disp-formula><p>In the formula, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x16.png" xlink:type="simple"/></inline-formula>are used to adjust the structure, contrast, and brightness weight factor. The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x17.png" xlink:type="simple"/></inline-formula> is brightness function, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x18.png" xlink:type="simple"/></inline-formula>is the contrast function, and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x19.png" xlink:type="simple"/></inline-formula> is the structural function. Their definitions are</p><disp-formula id="scirp.57958-formula8"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x20.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.57958-formula9"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x21.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.57958-formula10"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x22.png"  xlink:type="simple"/></disp-formula><fig id="fig5"  position="float"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> The overall framework of the algorithm in this paper</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x23.png"/></fig><p>where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x24.png" xlink:type="simple"/></inline-formula> is the covariance. And<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x25.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x26.png" xlink:type="simple"/></inline-formula>are respectively the standard deviation of<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x27.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x28.png" xlink:type="simple"/></inline-formula>. The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/1-1720309x29.png" xlink:type="simple"/></inline-formula> is constant. All SSIM to obtain mean values to get MSSIM is defined as</p><disp-formula id="scirp.57958-formula11"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/1-1720309x30.png"  xlink:type="simple"/></disp-formula><p>K is the number of sub-image.</p><p>ROI and the whole image were carried out on the compression simulation. As for ROI, comparing classic wavelet with the shealet is used in this article. For the whole image, this paper compares classical JEPG2000 algorithm of PACS with proposed algorithm [<xref ref-type="bibr" rid="scirp.57958-ref15">15</xref>] , and records the PSNR and MSSIM value. Compression effect is shown in <xref ref-type="fig" rid="fig6">Figure 6</xref> and <xref ref-type="fig" rid="fig7">Figure 7</xref>. The results are shown in <xref ref-type="table" rid="table1">Table 1</xref> and <xref ref-type="table" rid="table2">Table 2</xref>, carrying out time comparison is shown in <xref ref-type="table" rid="table3">Table 3</xref>.</p><p>It can be seen in <xref ref-type="table" rid="table1">Table 1</xref>, <xref ref-type="table" rid="table2">Table 2</xref> and <xref ref-type="table" rid="table3">Table 3</xref> that although improved algorithm average need 0.9s more carrying out time than JEPG2000, it is worth sacrifice. Because the characteristics of ROI were completely protected. When the ROI compression in low compression ratio, the PSNR value of shearlet is higher than average wavelet’s 51 dB, and the MSSIM value of shearlet is as high as 1.0, ROI information is completely restored, and</p><fig-group id="fig6"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Results of ROI compression. (a) ROI source image; (b) Shearlet; (c) Wavelet; (d) Shearlet; (e) Wavelet.</title></caption><fig id ="fig6_1"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x31.png"/></fig></fig-group><fig-group id="fig7"><label><xref ref-type="fig" rid="fig7">Figure 7</xref></label><caption><title> Results of the whole image compression. (a) Whole source image; (b) Improved; (c) JEPG2000; (d) Improved; (e) JEPG2000.</title></caption><fig id ="fig7_1"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/1-1720309x32.png"/></fig></fig-group><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> ROI compression results contrast</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  rowspan="2"  >Ratio</th><th align="center" valign="middle"  colspan="2"  >PSNR/db</th><th align="center" valign="middle"  colspan="2"  >MSSIN</th></tr></thead><tr><td align="center" valign="middle"  colspan="2"  >Wavelet shearlet</td><td align="center" valign="middle"  colspan="2"  >Wavelet shearlet</td></tr><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >34</td><td align="center" valign="middle" >87</td><td align="center" valign="middle" >0.99</td><td align="center" valign="middle" >1.00</td></tr><tr><td align="center" valign="middle" >30</td><td align="center" valign="middle" >31</td><td align="center" valign="middle" >83</td><td align="center" valign="middle" >0.98</td><td align="center" valign="middle" >1.00</td></tr><tr><td align="center" valign="middle" >40</td><td align="center" valign="middle" >30</td><td align="center" valign="middle" >81</td><td align="center" valign="middle" >0.95</td><td align="center" valign="middle" >1.00</td></tr><tr><td align="center" valign="middle" >50</td><td align="center" valign="middle" >30</td><td align="center" valign="middle" >80</td><td align="center" valign="middle" >0.95</td><td align="center" valign="middle" >0.99</td></tr><tr><td align="center" valign="middle" >60</td><td align="center" valign="middle" >27</td><td align="center" valign="middle" >76</td><td align="center" valign="middle" >0.91</td><td align="center" valign="middle" >0.99</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> Whole image compression results contrast</title></caption><table><tbody><thead><tr><th align="center" valign="middle"  rowspan="2"  >Ratio</th><th align="center" valign="middle"  colspan="2"  >PSNR/db</th><th align="center" valign="middle"  colspan="3"  >MSSIN</th></tr></thead><tr><td align="center" valign="middle"  colspan="2"  >JEPG2000 improved</td><td align="center" valign="middle"  colspan="2"  >JEPG2000 improved</td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >33</td><td align="center" valign="middle" >41</td><td align="center" valign="middle" >0.991</td><td align="center" valign="middle"  colspan="2"  >0.998</td></tr><tr><td align="center" valign="middle" >30</td><td align="center" valign="middle" >32</td><td align="center" valign="middle" >38</td><td align="center" valign="middle" >0.978</td><td align="center" valign="middle"  colspan="2"  >0.984</td></tr><tr><td align="center" valign="middle" >40</td><td align="center" valign="middle" >31</td><td align="center" valign="middle" >34</td><td align="center" valign="middle" >0.973</td><td align="center" valign="middle"  colspan="2"  >0.982</td></tr><tr><td align="center" valign="middle" >50</td><td align="center" valign="middle" >31</td><td align="center" valign="middle" >34</td><td align="center" valign="middle" >0.968</td><td align="center" valign="middle"  colspan="2"  >0.979</td></tr><tr><td align="center" valign="middle" >60</td><td align="center" valign="middle" >30</td><td align="center" valign="middle" >31</td><td align="center" valign="middle" >0.949</td><td align="center" valign="middle"  colspan="2"  >0.973</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr></tbody></table></table-wrap><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> Time comparison of JEPG2000 and the improved algorithm/s</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Ratio</th><th align="center" valign="middle" >JEPG2000</th><th align="center" valign="middle" >Improved</th></tr></thead><tr><td align="center" valign="middle" >20</td><td align="center" valign="middle" >10.29</td><td align="center" valign="middle" >11.24</td></tr><tr><td align="center" valign="middle" >30</td><td align="center" valign="middle" >10.79</td><td align="center" valign="middle" >11.57</td></tr><tr><td align="center" valign="middle" >40</td><td align="center" valign="middle" >6.25</td><td align="center" valign="middle" >7.09</td></tr><tr><td align="center" valign="middle" >50</td><td align="center" valign="middle" >6.23</td><td align="center" valign="middle" >7.18</td></tr><tr><td align="center" valign="middle" >60</td><td align="center" valign="middle" >4.14</td><td align="center" valign="middle" >5.17</td></tr></tbody></table></table-wrap><p>the reconstruct quality is high. When the whole image compression under the same compression ratio, in the proposed algorithm, the values of PSNR and MSSIM are higher than those of JEPG2000 classic algorithm.</p><p>Because the <xref ref-type="fig" rid="fig7">Figure 7</xref> results of the whole image compression can be seen, the reconstructed imaging of compression algorithm in this paper is clear, especially the characteristics of the ROI. The segmentation is accurate, and the edge protection is complete.</p></sec><sec id="s6"><title>6. Conclusion</title><p>This paper introduced wavelet to ITTI model, whose segmentation accuracy reached to 80.8%. We used the Freeman chain coding to encode the edge of ROI. This method significantly protected the edge, because of the good spare characteristic of shearlet. We also used shearlet to compress ROI. The PSNR value of shearlet was higher than average wavelet’s 51 dB, and the MSSIM value of shearlet was as high as 1.0. In general, the characteristics of ROI were completely protected. Because of the application of the wavelet and its filtering properties, the algorithm in this paper has the noise robustness suitable to mass storage of medical image compression for PACS.</p></sec><sec id="s7"><title>Cite this paper</title><p>RenjunShuai,YangShen,JingPan, (2015) An Algorithm for Medical Imagining Compression That Is Oriented to ROI-Characteristics Protection. Journal of Applied Mathematics and Physics,03,854-861. doi: 10.4236/jamp.2015.37106</p></sec></body><back><ref-list><title>References</title><ref id="scirp.57958-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Nister, D. and Christopoulos, C. (1998) Lossless Region of Interest with a Naturally Progressive Still Image Coding Algorithm. IEEE Transactions on Image Processing, 3, 856-860. http://dx.doi.org/10.1109/icip.1998.727388</mixed-citation></ref><ref id="scirp.57958-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Tahoces, P.G., Varela, J.R. and Ladoetal, M.J. (2008) Image Compression: Maxshift ROI Encoding Options in JPEG2000. Computer Vision and Image Understanding, 109, 139-145.  http://dx.doi.org/10.1016/j.cviu.2007.07.001</mixed-citation></ref><ref id="scirp.57958-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Ameer, S. and Basir, O. (2009) Image Compression Using Plane Fitting with Inter-Block Prediction. Image and Vision Computing, 27, 385-390. http://dx.doi.org/10.1016/j.imavis.2008.06.005</mixed-citation></ref><ref id="scirp.57958-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Li, P., Jiang, H.Q., Yang, X.P. and Liu, Y.M. (2013) Medical Image near Lossless Compression Applicable to PACS. China Image and Graphics, 18, 699-705.</mixed-citation></ref><ref id="scirp.57958-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Itti, L. and Kouch, C. (2001) Computational Modeling of Visual Attention. Nature Reviews Neuroscience, 2, 194-230. 
http://dx.doi.org/10.1038/35058500</mixed-citation></ref><ref id="scirp.57958-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Itti, L. and Kouch, C. (2001) Feature Combination Strategies for Saliency-Based Visual Attention Systems. Journal of Electronic Imaging, 10, 161-169. http://dx.doi.org/10.1117/1.1333677</mixed-citation></ref><ref id="scirp.57958-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Yang, D.H. (2002) A New Image Compression Algorithm Based on Wavelet Transform and Human Visual System. Chongqing University, Chongqing.</mixed-citation></ref><ref id="scirp.57958-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Yu, M. and Pi, Y.Q. (2012) A Extraction Method of the Region of Interest. Electronic Design Engineering, 20, 160-162.</mixed-citation></ref><ref id="scirp.57958-ref9"><label>9</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Liu</surname><given-names> Y.K. </given-names></name>,<etal>et al</etal>. (<year>2001</year>)<article-title>The Study of Freeman Chain Code Compression Algorithm</article-title><source> Journal of Computers</source><volume> 24</volume>,<fpage> 1294</fpage>-<lpage>1298</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.57958-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Guo, Q. (2010) Research on Shearlet-Based Statistical Model for Images and Its Applications. Shanghai University, Shanghai.</mixed-citation></ref><ref id="scirp.57958-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Wang, F.X. and Zhou, K. (2008) Huffman Coding to Achieve File Compression and Decompression. Wuhan Polytechnic University, 46-49.</mixed-citation></ref><ref id="scirp.57958-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Hu, H. (2010) Research on Medical Image Compression Based on Wavelet Transform. Wuhan University of Technology, Wuhan.</mixed-citation></ref><ref id="scirp.57958-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Tan, Y.S. and Zhou, X.M. (2003) A New Improved Algorithm of Fractal Image Compression. Electronics Technology, 11, 1739-1742.</mixed-citation></ref><ref id="scirp.57958-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Yang, Q. and Wang, H.J. (2013) Medical Image Fractal Compression Method Study Based on Multi-Wavelet Transform. Science Technology and Engineering, 24, 1671-1815.</mixed-citation></ref><ref id="scirp.57958-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Joan, B.R., Joan, S.S. and Francesc, A. (2009) JPEG2000 ROI Coding Method with Perfect Fine-Grain Accuracy and Lossless Recovery. Proceedings of the 43rd Asilomar Conference on Signals, Systems and Computers. Monterey, California, IEEE Signal Processing Society, USA, 558-562.</mixed-citation></ref></ref-list></back></article>