<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ep-patent-document PUBLIC "-//EPO//EP PATENT DOCUMENT 1.3//EN" "ep-patent-document-v1-3.dtd">
<ep-patent-document id="EP05722238B9W1" file="EP05722238W1B9.xml" lang="en" country="EP" doc-number="1743299" kind="B9" correction-code="W1" date-publ="20090304" status="c" dtd-version="ep-patent-document-v1-3">
<SDOBI lang="en"><B000><eptags><B001EP>ATBECHDEDKESFRGBGRITLILUNLSEMCPTIESILT..FIRO..CY..TRBGCZEEHUPLSK....IS..........</B001EP><B003EP>*</B003EP><B005EP>J</B005EP><B007EP>DIM360 Ver 2.15 (14 Jul 2008) -  2500000/0 2999001/0</B007EP></eptags></B000><B100><B110>1743299</B110><B120><B121>CORRECTED EUROPEAN PATENT SPECIFICATION</B121></B120><B130>B9</B130><B132EP>B1</B132EP><B140><date>20090304</date></B140><B150><B151>W1</B151><B155><B1551>de</B1551><B1552>Ansprüche EN</B1552><B1551>en</B1551><B1552>Claims EN</B1552><B1551>fr</B1551><B1552>Revendications EN</B1552></B155></B150><B190>EP</B190></B100><B200><B210>05722238.2</B210><B220><date>20050318</date></B220><B240><B241><date>20061018</date></B241><B242><date>20070412</date></B242></B240><B250>en</B250><B251EP>en</B251EP><B260>en</B260></B200><B300><B310>0400731</B310><B320><date>20040322</date></B320><B330><ctry>SE</ctry></B330><B310>554926 P</B310><B320><date>20040322</date></B320><B330><ctry>US</ctry></B330></B300><B400><B405><date>20090304</date><bnum>200910</bnum></B405><B430><date>20070117</date><bnum>200703</bnum></B430><B450><date>20080827</date><bnum>200835</bnum></B450><B452EP><date>20071129</date></B452EP><B472><B475><date>20080827</date><ctry>LT</ctry><date>20081227</date><ctry>IS</ctry></B475></B472><B480><date>20090304</date><bnum>200910</bnum></B480></B400><B500><B510EP><classification-ipcr sequence="1"><text>G06T   5/50        20060101AFI20050930BHEP        </text></classification-ipcr></B510EP><B540><B541>de</B541><B542>VERFAHREN, COMPUTERPROGRAMMPRODUKT UND VORRICHTUNG ZUR VERBESSERUNG EINES COMPUTERISIERTEN TOMOGRAPHIEBILDES</B542><B541>en</B541><B542>METHOD, COMPUTER PROGRAM PRODUCT AND APPARATUS FOR ENHANCING A COMPUTERIZED TOMOGRAPHY IMAGE</B542><B541>fr</B541><B542>METHODE, PRODUIT DE PROGRAMME INFORMATIQUE ET APPAREIL POUR AMELIORER UNE IMAGE TOMOGRAPHIQUE INFORMATISEE</B542></B540><B560><B561><text>US-A- 5 594 767</text></B561><B561><text>US-A- 5 655 532</text></B561><B561><text>US-A- 5 715 334</text></B561><B561><text>US-A1- 2004 024 302</text></B561></B560></B500><B700><B720><B721><snm>SPIES, Hagen</snm><adr><str>Djurgardsgatan 21 C</str><city>S-582 29 Linköping</city><ctry>SE</ctry></adr></B721><B721><snm>FLOOD, Katarina, T.</snm><adr><str>Trädgardstorget 4</str><city>S-582 24 Linköping</city><ctry>SE</ctry></adr></B721><B721><snm>LOOCK, Tomas</snm><adr><str>Porsvägen 29</str><city>S-590 54 Sturefors</city><ctry>SE</ctry></adr></B721><B721><snm>HEDLUND, Martin</snm><adr><str>Rödbetsvägen 9</str><city>S-582 75 Linköping</city><ctry>SE</ctry></adr></B721></B720><B730><B731><snm>Contextvision AB</snm><iid>07139290</iid><irf>PC-EP-21027989</irf><adr><str>Storgatan 24</str><city>582 23 Linköping</city><ctry>SE</ctry></adr></B731></B730><B740><B741><snm>Bokinge, Ole</snm><sfx>et al</sfx><iid>09210961</iid><adr><str>Awapatent AB 
Junkersgatan 1</str><city>582 35 Linköping</city><ctry>SE</ctry></adr></B741></B740></B700><B800><B840><ctry>AT</ctry><ctry>BE</ctry><ctry>BG</ctry><ctry>CH</ctry><ctry>CY</ctry><ctry>CZ</ctry><ctry>DE</ctry><ctry>DK</ctry><ctry>EE</ctry><ctry>ES</ctry><ctry>FI</ctry><ctry>FR</ctry><ctry>GB</ctry><ctry>GR</ctry><ctry>HU</ctry><ctry>IE</ctry><ctry>IS</ctry><ctry>IT</ctry><ctry>LI</ctry><ctry>LT</ctry><ctry>LU</ctry><ctry>MC</ctry><ctry>NL</ctry><ctry>PL</ctry><ctry>PT</ctry><ctry>RO</ctry><ctry>SE</ctry><ctry>SI</ctry><ctry>SK</ctry><ctry>TR</ctry></B840><B860><B861><dnum><anum>SE2005000393</anum></dnum><date>20050318</date></B861><B862>en</B862></B860><B870><B871><dnum><pnum>WO2005091219</pnum></dnum><date>20050929</date><bnum>200539</bnum></B871></B870><B880><date>20070117</date><bnum>200703</bnum></B880></B800></SDOBI><!-- EPO <DP n="1"> -->
<description id="desc" lang="en">
<heading id="h0001"><u style="single">Technical Field</u></heading>
<p id="p0001" num="0001">The present invention relates to a method, an apparatus and a computer program product for improving a digital image, and more specifically a computerized tomography image consisting of reconstructed data, according to the preamble of the respective independent claim.</p>
<heading id="h0002"><u style="single">Technical Background</u></heading>
<p id="p0002" num="0002">It is known that in computerized tomography (CT) images, the intensity level may be used for distinguishing different types of tissue. A CT system may be calibrated such that the intensity values correspond to Hounsfield units (HU) as given in the table below:
<tables id="tabl0001" num="0001">
<table frame="all">
<tgroup cols="2">
<colspec colnum="1" colname="col1" colwidth="34mm"/>
<colspec colnum="2" colname="col2" colwidth="34mm"/>
<tbody>
<row>
<entry><b>Tissue</b></entry>
<entry><b>Intensity value [HU]</b></entry></row>
<row>
<entry>Bone</entry>
<entry align="right">1000</entry></row>
<row>
<entry>Liver</entry>
<entry align="right">40-60</entry></row>
<row>
<entry>White matter in brain</entry>
<entry align="right">46</entry></row>
<row>
<entry>Gray matter in brain</entry>
<entry align="right">43</entry></row>
<row>
<entry>Blood</entry>
<entry align="right">40</entry></row>
<row>
<entry>Muscle</entry>
<entry align="right">10-40</entry></row>
<row>
<entry>Kidney</entry>
<entry align="right">30</entry></row>
<row>
<entry>Cerebrospinal fluid</entry>
<entry align="right">15</entry></row>
<row>
<entry>Water</entry>
<entry align="right">0</entry></row>
<row>
<entry>Fat</entry>
<entry align="right">-50 - 100</entry></row>
<row>
<entry>Air</entry>
<entry align="right">-1000</entry></row></tbody></tgroup>
</table>
</tables><!-- EPO <DP n="2"> --></p>
<p id="p0003" num="0003">The Hounsfield units normally range from -1000 to 3000, but in some applications the HU scale is shifted into values between 0 and 4000.</p>
<p id="p0004" num="0004">As is apparent from the table above, examination of different types of tissue requires the inspection of different intensity value ranges, also referred to as intensity windows.</p>
<p id="p0005" num="0005">Due to the limitations of display screens, and also to limitations of the human eye, it is common to display a maximum of 256 (2<sup>8</sup>) different gray values or shades on the display screen. Hence, in order to obtain a useful view of a CT image showing tissues having intensity values close to each other, it is necessary to display only a limited portion of the total HU scale.</p>
<p id="p0006" num="0006">In the following, the displayed or processed intensity value range will be referred to as an 'intensity window'. If e.g. bones are examined one typically chooses a very wide window width of 1000-2000 HU, whereas for the examination of soft tissue, more narrow window widths of 400-600 HU are used and for brain examinations very narrow window widths of 50-100 HU are common.</p>
<p id="p0007" num="0007">Due to the different anatomies viewed and the very different intensity ranges, the different cases require different noise reduction and contrast enhancement treatment. However it is still desirable to store the result in one image and be able to switch between intensity windows in case different tissues are to be examined.</p>
<p id="p0008" num="0008">In <patcit id="pcit0001" dnum="US5594767A"><text>US 5,594,767</text></patcit>, an original CT image is combined with a smoothed version of the original CT image, the combination being based on a classification map. The smoothed image is non-selectively smoothed, i.e. it<!-- EPO <DP n="3"> --> smoothes the entire image, regardless of the values of the respective image elements.</p>
<heading id="h0003"><u style="single">Summary of the Invention</u></heading>
<p id="p0009" num="0009">It is an object of the present invention, which is defined by the appended claims, to provide an improved method for improving a CT image.</p>
<p id="p0010" num="0010">The objective is achieved by a method, a device, a signal, and a computer program product according to the appended independent claims. Embodiments are set forth in the appended dependent claims and in the following description.</p>
<p id="p0011" num="0011">in brief, there is provided a method for enhancing a CT image composed of a plurality of elements, each having an intensity value indicative of a tissue type. The method comprises receiving a first CT image, providing a plurality of copies of said first CT image, subjecting said plurality of copies of said first CT image to an enhancement processing, where said enhancement processing enhances said plurality of copies of said first CT image with respect to predetermined intensity value ranges, and combining said processed plurality of copies of said first CT image with said first CT image, whereby an enhanced CT image is provided, said combining being based on a classification with respect to intensity values of regions within said first CT image and said plurality of copies of said first CT image.</p>
<p id="p0012" num="0012">A CT image may be any representation of CT scan data, e.g. a two-, three- or four dimensional data set.</p>
<p id="p0013" num="0013">The plurality of copies of the first CT image constitute enhancement processed full or partial copies of the first CT image, e.g. they may comprise subsets of the elements of the first CT image.<!-- EPO <DP n="4"> --></p>
<p id="p0014" num="0014">The enhancement processing may be any processing with a view to improving the quality of the plurality of copies of the first CT image.</p>
<p id="p0015" num="0015">According to yet another aspect, there is provided a method for enhancing a first digital image composed of a plurality of elements, each having an intensity value associated therewith. The method comprises receiving a first digital image, providing, by enhancement processing based on said first digital image, a plurality of copies of said first digital image, and combining said plurality of copies of said first digital image with said first digital image, whereby an enhanced digital image is provided. The combining is based on a classification with respect to intensity values of regions within said first digital image and the plurality of copies of said first digital images. The enhancement processing is performed with respect to predetermined intensity value ranges. The digital image may be any type of medical image, such as a CT image, an x-ray image etc. The digital image may be two-, three-, or four dimensional.</p>
<p id="p0016" num="0016">This approach allows for intrinsically different processing of different intensity windows. Also, the above described method enables the use of different processing settings for different intensity windows and then combines the results into one image.</p>
<p id="p0017" num="0017">The presented approach also allows the use of more advanced processing methods that for instance adapt locally to the image structure in an anisotropic way.</p>
<p id="p0018" num="0018">Hence, in contrast to prior art, the present invention keeps a weight for each considered intensity window, i.e. tissue class. Then different methods are applied to the different regions and finally the results are combined. A plurality of different images are created<!-- EPO <DP n="5"> --> that are combined into a single result according to the original intensity values.</p>
<p id="p0019" num="0019">According to further aspects, there are provided a computer program product and an apparatus for implementing the above described method.</p>
<heading id="h0004"><u style="single">Brief description of the drawings</u></heading>
<p id="p0020" num="0020">Embodiments will now be described in more detail with reference to the appended drawings.</p>
<p id="p0021" num="0021"><figref idref="f0001">Fig. 1</figref> is a schematic flow chart illustrating a *method according to the present disclosure.</p>
<p id="p0022" num="0022"><figref idref="f0002">Fig. 2</figref> is a schematic flow chart illustrating a detail of the flow chart of <figref idref="f0001">Fig. 1</figref>.</p>
<p id="p0023" num="0023"><figref idref="f0003">Fig. 3</figref> is a schematic diagram of a device 1 in which the method of <figref idref="f0001">Figs 1</figref> and <figref idref="f0002">2</figref> may be implemented.</p>
<p id="p0024" num="0024"><figref idref="f0004">Fig. 4</figref> is a section of a simplified CT image.</p>
<p id="p0025" num="0025"><figref idref="f0004">Fig. 5</figref> is a first processed version of the CT image in <figref idref="f0004">Fig. 4</figref>.</p>
<p id="p0026" num="0026"><figref idref="f0005">Fig. 6</figref> is a second processed version of the CT image in <figref idref="f0004">Fig. 4</figref>.</p>
<p id="p0027" num="0027"><figref idref="f0005">Fig. 7</figref> is a combined CT image based on the first and second CT images.</p>
<p id="p0028" num="0028"><figref idref="f0006">Figs 8-10</figref> illustrates masks used in combining the CT images.</p>
<heading id="h0005"><u style="single">Description of Embodiments</u></heading>
<p id="p0029" num="0029">For a description of the general function of a CT system, reference is made to <patcit id="pcit0002" dnum="US5594767A"><text>US 5,594,767</text></patcit>. Hence, the description of how a CT image is generated is left out.</p>
<p id="p0030" num="0030"><figref idref="f0001">Fig. 1</figref> flow chart illustrating a method for improving CT scan data. In step 101, a CT image is received. It is understood that a CT image, for the purpose of this description, may be received in different<!-- EPO <DP n="6"> --> manners and formats, e.g. from a storage device, via a computer network, or directly from a computer that performed an image reconstruction based on CT detector data.</p>
<p id="p0031" num="0031">Furthermore, in the following description, the CT images are assumed to be two-dimensionally indexed data sets, composed of a plurality of elements, each of which being associated with an intensity value, which may be presented in Hounsfield units. Hence, the original CT image received in step 101 has been subjected to some known type of preprocessing and/or image reconstruction such as to provide a data set that is processable as an image.</p>
<p id="p0032" num="0032">In step 102, processing parameters are received. Such processing parameters may include an indication of what intensity value range or ranges to study, an indication of what type or types of processing to perform, an indication of parameters subject to which the respective processing is to be performed. The input or inputs in step 102 may be received in different manners, e.g. in the form of a selection made by a user, in the form of an automatic determination made based on what is to be studied (e.g. what type of tissue), or it may be preprogrammed.</p>
<p id="p0033" num="0033">It is recognized that steps 101 and 102 may be performed in the reverse order.</p>
<p id="p0034" num="0034">In a first embodiment, the original CT image may be used as input to the processing step 103, whereby an enhanced image is provided as an output, and whereby the original CT image, or a copy thereof, is maintained.</p>
<p id="p0035" num="0035">One or more CT image copies may be provided based on the original CT image. The CT image copy may be used as input to the processing step 103, so<!-- EPO <DP n="7"> --> as to maintain the CT image intact. The CT image copies may be complete or partial copies of the original CT image. For example, a CT image copy may be a copy of only a region of the original CT image, such that the CT image copy becomes smaller than the original CT image. As another example, a CT image copy may be a copy of only those elements of the original CT image, which have intensity values within a certain, predetermined intensity value range. The CT image copies may be stored in a working memory or in a non-volatile memory.</p>
<p id="p0036" num="0036">Step 102 and the step of providing the CT image copy may be performed in reverse order.</p>
<p id="p0037" num="0037">In step 103, the CT image copies are subjected to enhancement processing, whereby an enhancement processed CT image is obtained.</p>
<p id="p0038" num="0038">Each one of the images may be processed in a predetermined manner. In one embodiment, the different images are subjected to processing within certain intensity windows. In another embodiment, the different images are subjected to different types of processing, i.e. to different algorithms. In yet another embodiment, the different images are subjected to the same type of processing but with different processing parameters. In yet another embodiment, one of the images is not subjected to processing at all, whereas the other images are.</p>
<p id="p0039" num="0039">In one embodiment, the CT image is maintained and then combined with the enhancement processed CT image. In yet another embodiment, also the original CT image is subjected to enhancement processing and then combined with another enhancement processed CT image. Hence, two, three or more enhancement processed CT images may be provided and combined.<!-- EPO <DP n="8"> --></p>
<p id="p0040" num="0040">There are many different types of processing of the original CT image and/or the CT image copies: low-pass filters, contrast enhancement using unsharp masking as described in <patcit id="pcit0003" dnum="US5038387A"><text>US 5,038,387</text></patcit>, rank filters such as the median and its variants and more advanced processing methods such as adaptive filtering, such as described in <nplcit id="ncit0001" npl-type="s"><text>Westin,C.-F., Richolt, J., Moharir, V. &amp; Kikinis, R.: Affine Adaptive Filtering of CT Data, Medical Image Analysis 4, 161-177. 2000</text></nplcit> and in <patcit id="pcit0004" dnum="US6556720B"><text>US 6,556,720</text></patcit>. Such adaptive filtering may for example be based on local structure analysis, as described in <patcit id="pcit0005" dnum="US4747150A"><text>US 4,747,150</text></patcit>, <patcit id="pcit0006" dnum="US4747151A"><text>US 4,747,151</text></patcit>, <patcit id="pcit0007" dnum="US4747152A"><text>US 4,747,152</text></patcit> and <nplcit id="ncit0002" npl-type="s"><text>Carmona, R.A. &amp; Zhong, S.: Adaptive smoothing respecting feature directions, IEEE Transactions on Image Processing 7(3), 353-358. 1998</text></nplcit>. Other types of processing includes mean-shift filtering as described in <nplcit id="ncit0003" npl-type="s"><text>Dominguez, G.F., Bischof, H. &amp; Beichel, R.: Fast 3D Mean Shift Filter for CT Images, SCIA, 438-445, 2003</text></nplcit>, <nplcit id="ncit0004" npl-type="s"><text>Göteborg, Sweden, Springer, LNCS 2749</text></nplcit>; variational methods as described in<nplcit id="ncit0005" npl-type="s"><text> Niessen, W., Ter Haar Romeny, B. &amp; Viergever, M.A.: Geodesic Deformable Models for Medical Image Analysis, IEEE Transaction on Medical Imaging 17(4), 634-641, 1998</text></nplcit> and <nplcit id="ncit0006" npl-type="s"><text>Gilboa, G., Sochen, N. &amp; Zeevi, Y.Y.: Forward and Backward Diffusion Processes for Adaptive Image Enhancement and Denoising, IEEE Transaction on Image Processing 11(7), 689-703, 2002</text></nplcit>; multiband techniques such as those described in<nplcit id="ncit0007" npl-type="s"><text> Dippel, S., Stahl, M., Wiemker, R. &amp; Blaffert, T.: Multiscale Contrast Enhancement Radiographies: Laplacian Pyramid Versus Fast Wavelet Transform, IEEE Transactions on Medical Imaging 21(4), 343-353, 2002</text></nplcit>, <nplcit id="ncit0008" npl-type="s"><text>Vuylsteke, P.P. &amp; Schoeters, E.P.: Multiscale Image Contrast Amplification (MUSICA), SPIE Vol. 2167</text></nplcit> <nplcit id="ncit0009" npl-type="s"><text>Medical Imaging: Image Processing, 551-560. 1994</text></nplcit> and in <patcit id="pcit0008" dnum="US5644662A"><text>US 5,644,662</text></patcit>; or<!-- EPO <DP n="9"> --> wavelet techniques as described in.<nplcit id="ncit0010" npl-type="s"><text>Yang, G.Z., Rubens, M.B. &amp; Hansell, D.M.: The use of hybrid structural filtering for the detection of obliterative bronchiolitis from computed tomographic images, IPA, IEE Conference Publication No. 443, 631-635, 1997</text></nplcit>.</p>
<p id="p0041" num="0041">In one embodiment, it is determined beforehand which data subsets of the original CT image or CT image copy need to be processed, whereby all other data elements are excluded from the processing, in order to increase the overall execution speed. However, in a simple implementation the entire data set can be processed in parallel, or sequentially.</p>
<p id="p0042" num="0042">There is no explicit need to segment the various intensity windows beforehand and it suffices to apply the various enhancement schemes adapted to each window in parallel. However, in order to speed up the overall calculation, it is possible to compute masks (weights) for each window as described below and only apply the computation where the associated weight differs from zero.</p>
<p id="p0043" num="0043">In step 104, the enhancement processed images and possibly also the original CT image (or a copy thereof) are combined or merged such that a combined CT image is obtained. Merging of the results obtained by the different processing methods or parameter settings is based, on the associated intensity window or intensity value range. As changes are more visible for smaller window widths, the results may be ranked according to the window width, such that smaller windows are given priority over larger windows.</p>
<p id="p0044" num="0044">In the following, a description of an algorithm for merging the images will be given with reference to <figref idref="f0002">Fig.<!-- EPO <DP n="10"> --> 2</figref>, wherein the windows are assumed to be specified by their respective center c and width w.</p>
<p id="p0045" num="0045">The algorithm may consist of the following steps, which are performed for all data elements:</p>
<p id="p0046" num="0046">In step 1041, the CT images are prioritized according to window width (intensity value range), such that the window having the smallest width is placed first: w1 &lt; w2 &lt; ... &lt; wN. By prioritizing the intensity windows, it is possible to control which window is to be used in case of overlapping areas.</p>
<p id="p0047" num="0047">In step 1042, region masks are determined by thresholding the original image, according to the following exemplifying pseudo code, wherein masks is the thus far segmented data, orgIm is the original CT image, maskX is a mask for the respective CT image copy and maskB is a mask for the non-segmented parts of the original image.
<pre listing-type="program-listing">      maskS = 0
      for X = 1 ... N
            {
            maskX = 1 if (cX - wX/2 ≤ orgIm ≤ cX + wX/2) and (maskS =
            0)
            maskS = maskS + maskX
            }
      maskB = non-segmented parts</pre></p>
<p id="p0048" num="0048">Step 1042 may also be expressed according to the following:
<ol id="ol0001" ol-style="">
<li>1. initialize: <i>M<sub>s</sub></i>(<i>m,n</i>)=0 ∀<i>n</i>,<i>m</i><br/>
x=1<!-- EPO <DP n="11"> --></li>
<li>2. <maths id="math0001" num=""><math display="block"><msub><mi>M</mi><mi>x</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>=</mo><mrow><mo>{</mo><mtable columnalign="left"><mtr><mtd><mn>1</mn></mtd><mtd><mi mathvariant="italic">if</mi><mspace width="1em"/><mfenced separators=""><msub><mi>c</mi><mi>x</mi></msub><mo>-</mo><mmultiscripts><msub><mo>/</mo><mn>2</mn></msub><mprescripts/><none/><msub><mi>w</mi><mi>x</mi></msub></mmultiscripts></mfenced><mo>≤</mo><mi>I</mi><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>≤</mo><mfenced separators=""><msub><mi>c</mi><mi>x</mi></msub><mo>+</mo><mmultiscripts><msub><mo>/</mo><mn>2</mn></msub><mprescripts/><none/><msub><mi>w</mi><mi>x</mi></msub></mmultiscripts></mfenced><mspace width="1em"/><mi mathvariant="italic">AND</mi><mspace width="1em"/><msub><mi mathvariant="italic">M</mi><mi>s</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>=</mo><mn>0</mn></mtd></mtr><mtr><mtd><mn>0</mn></mtd><mtd><mi mathvariant="italic">else</mi></mtd></mtr></mtable></mrow></math><img id="ib0001" file="imgb0001.tif" wi="141" he="20" img-content="math" img-format="tif"/></maths></li>
<li>3. <maths id="math0002" num=""><math display="block"><msub><mi>M</mi><mi>s</mi></msub><mo>=</mo><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>=</mo><msub><mi>M</mi><mi>s</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>+</mo><msub><mi>M</mi><mi>x</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced></math><img id="ib0002" file="imgb0002.tif" wi="61" he="12" img-content="math" img-format="tif"/></maths></li>
<li>4. ifx&lt;N then x = x+1 goto step 2</li>
<li>5. <maths id="math0003" num=""><math display="block"><msub><mi>M</mi><mi>b</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>=</mo><mo>‖</mo><msub><mi>M</mi><mi>s</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>-</mo><mn>1</mn><mo>‖</mo></math><img id="ib0003" file="imgb0003.tif" wi="49" he="13" img-content="math" img-format="tif"/></maths></li>
</ol>
where M<sub>i</sub> indicates mask number i and i=x, s, b, I represents the original image data and m,n indexes the data elements.</p>
<p id="p0049" num="0049">It is recognized that steps 1041 and 1042 may be performed in the reverse order.</p>
<p id="p0050" num="0050">In step 1044, which is optional, the masks are smoothened by convolving with a low-pass kernel designated G: <maths id="math0004" num=""><math display="block"><mi>maskX</mi><mo mathvariant="normal">=</mo><mi mathvariant="normal">G</mi><mo mathvariant="normal">*</mo><mi>maskX for X</mi><mo mathvariant="normal">=</mo><mn mathvariant="normal">1</mn><mspace width="1em"/><mo mathvariant="normal">…</mo><mspace width="1em"/><mi mathvariant="normal">N</mi><mo mathvariant="normal">,</mo><mi mathvariant="normal">B</mi></math><img id="ib0004" file="imgb0004.tif" wi="78" he="8" img-content="math" img-format="tif"/></maths></p>
<p id="p0051" num="0051">Step 1044 may also be expressed according to the following: <maths id="math0005" num=""><math display="block"><msub><mi>M</mi><mi>x</mi></msub><mo>=</mo><mi>G</mi><mo>*</mo><msub><mi>M</mi><mi>x</mi></msub></math><img id="ib0005" file="imgb0005.tif" wi="30" he="9" img-content="math" img-format="tif"/></maths> which is to be understood as convolution of the entire mask array.</p>
<p id="p0052" num="0052">In step 1045, the region masks are normalized according to the following exemplifying pseudo code: <maths id="math0006" num=""><math display="block"><mi>maskX</mi><mo mathvariant="normal">=</mo><mi>maskX</mi><mo>/</mo><mfenced separators=""><mi>mask</mi><mo>⁢</mo><mn>1</mn><mo>+</mo><mi>mask</mi><mo>⁢</mo><mn>2</mn><mo>+</mo><mo>…</mo><mo>+</mo><mi>maskN</mi><mo>+</mo><mi>maskB</mi></mfenced><mspace width="1em"/><mi>for X</mi><mo mathvariant="normal">=</mo><mn mathvariant="normal">1</mn><mspace width="1em"/><mo mathvariant="normal">…</mo><mspace width="1em"/><mi mathvariant="normal">N</mi><mo mathvariant="normal">,</mo><mi mathvariant="normal">B</mi></math><img id="ib0006" file="imgb0006.tif" wi="151" he="14" img-content="math" img-format="tif"/></maths></p>
<p id="p0053" num="0053">Step 1045 may also be expressed as: <maths id="math0007" num=""><math display="block"><msub><mi>M</mi><mi>x</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>=</mo><mfrac><mrow><msub><mi>M</mi><mi>x</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced></mrow><mrow><msub><mi>M</mi><mn>1</mn></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>+</mo><msub><mi>M</mi><mn>2</mn></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>+</mo><mo>…</mo><mo>+</mo><msub><mi>M</mi><mi>N</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>+</mo><msub><mi>M</mi><mi>B</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced></mrow></mfrac></math><img id="ib0007" file="imgb0007.tif" wi="113" he="18" img-content="math" img-format="tif"/></maths><!-- EPO <DP n="12"> --></p>
<p id="p0054" num="0054">In step 1046, the results are combined according to the following exemplifying pseudo code, wherein enhIm designates the enhanced combined CT image and wherein resultX etc indicates the output of the processing step 104a-c for CT image copy number X: <maths id="math0008" num=""><math display="block"><mi>enhIm</mi><mo mathvariant="normal">=</mo><mi>maskB</mi><mo mathvariant="normal">⋅</mo><mi>orgIm</mi><mo mathvariant="normal">+</mo><mi>mask</mi><mo>⁢</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">⋅</mo><mi>result</mi><mo>⁢</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">+</mo><mo mathvariant="normal">…</mo><mo mathvariant="normal">+</mo><mi>maskN</mi><mo mathvariant="normal">⋅</mo><mi>resultN</mi></math><img id="ib0008" file="imgb0008.tif" wi="153" he="9" img-content="math" img-format="tif"/></maths></p>
<p id="p0055" num="0055">Step 1046 may also be expressed as: <maths id="math0009" num=""><math display="block"><mi>E</mi><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>=</mo><msub><mi>M</mi><mi>B</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>⋅</mo><mi>I</mi><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>+</mo><msub><mi>M</mi><mn>1</mn></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>⋅</mo><msub><mi>R</mi><mn>1</mn></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>+</mo><mo>…</mo><mo>+</mo><msub><mi>M</mi><mi>N</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced><mo>⋅</mo><msub><mi>R</mi><mi>N</mi></msub><mfenced separators=""><mi>m</mi><mo>⁢</mo><mi>n</mi></mfenced></math><img id="ib0009" file="imgb0009.tif" wi="145" he="12" img-content="math" img-format="tif"/></maths><br/>
where E denotes the final enhanced image and R<sub>i</sub>, i=1..N, the previously obtained results from the processing according to the individual intensity windows.</p>
<p id="p0056" num="0056">It should be noted that in order to avoid artifacts near the boundaries of the respective regions, it is possible to apply a low-pass filter to the segmented masks in step 1044 above. In one embodiment, a small Binomial or Gaussian filter may be chosen, however any other low-pass kernel will do.</p>
<p id="p0057" num="0057">The method segments the original data and then applies a spatial transition (smoothing) between areas to smooth the transition.</p>
<p id="p0058" num="0058">The combining as described above, and in particular the normalizing, may be useful as the proposed method recombines intensity values and it is essential that the local mean of these Hounsfield units is not altered by the processing.</p>
<p id="p0059" num="0059">In step 105, the combined CT image is output, e.g. by being displayed on a screen, stored in a memory or sent via a network.</p>
<p id="p0060" num="0060">Optionally, a step 1047 comprising a morphological closing and/or opening may be included with respect to the masks, thereby removing or filling small gaps in the<!-- EPO <DP n="13"> --> respective masks. The morphological closing and/or opening step 1047 may be arranged to take place at anytime between the determination of the region masks 1042 and the combining 1046 of the CT images.</p>
<p id="p0061" num="0061"><figref idref="f0003">Fig. 3</figref> is a schematic diagram of a device 1 in which the above described method may be implemented. The device 1 comprises receiving means 2 for receiving a CT image from e.g. a network, a storage medium or from a preprocessing device. The device 1 further comprises a processing unit 3, which is adapted for performing the above described method or methods. The device 1 also comprises output means 4 for outputting an enhanced CT image. The processing unit may consist of a programmable processor, which by means of software is programmed to perform the described method. In another embodiment, the preprocessing device may take the shape of a digital signal processor that is adapted to perform the described method. Such a preprocessing device may be provided in the form of e.g. an ASIC or any structure having similar functionality.</p>
<p id="p0062" num="0062">It is also possible to implement the method in the form of a propagated signal comprising components for performing the steps of the above described method when said components are executed in a computer.</p>
<p id="p0063" num="0063">Below, the processing of a section of a simplified 2D CT image will be described with reference to <figref idref="f0004 f0005 f0006">Figs 4-10</figref>. In <figref idref="f0004 f0005">Figs 4-7</figref>, the horizontal axis illustrates image elements in e.g. a vertical line of the respective CT image. The vertical axis illustrates the HU value of the respective image element in the section.</p>
<p id="p0064" num="0064"><figref idref="f0004">Fig. 4</figref> is a section of an original CT image, e.g. as received in step 101 (<figref idref="f0001">Fig. 1</figref>). In the described example, two intensity windows will be considered: a wide window<!-- EPO <DP n="14"> --> ranging from about 1250 HU to about 3650 HU, which is illustrated by the dotted lines in <figref idref="f0004">Fig. 4</figref>; and a narrow window ranging from about 2150 to about 2600 HU, which is illustrated by the dashed lines in <figref idref="f0004">Fig. 4</figref>. The respective window may be determined as described above. In one particular embodiment, the limits of the intensity window may be determined by a graphical user interface, wherein the lines illustrating the limits of the intensity window are presented in relation to a section of the image that is to be processed, whereby the user, by means of a pointing device, drags the lines to desired positions.</p>
<p id="p0065" num="0065"><figref idref="f0004">Fig. 5</figref> is a first processed version of the original CT image in <figref idref="f0004">Fig. 4</figref>, as provided by step 103 (<figref idref="f0001">Fig. 1</figref>). In the illustrated embodiment, the original CT image of <figref idref="f0004">Fig. 4</figref> has been subjected to a low-pass filter, with respect to the wide window. Such low-pass filtering suppresses noise.</p>
<p id="p0066" num="0066"><figref idref="f0005">Fig. 6</figref> is a second processed version of the original CT image in <figref idref="f0004">Fig. 4</figref>. In the illustrated embodiment, the original CT image has been subjected to a structure-adaptive processing with respect to the narrow window. Such structure-adaptive processing preserves small details in the CT image, but does not suppress noise to the same extent.</p>
<p id="p0067" num="0067"><figref idref="f0005">Fig. 7</figref> is a combined CT image based on the first and second processed CT images, as provided by step 104 (<figref idref="f0001">Fig. 1</figref>). The combination has been made with respect to the intensity windows associated with the first and second processed CT images.</p>
<p id="p0068" num="0068"><figref idref="f0006">Figs 8-10</figref> illustrates masks used in combining the CT images. <figref idref="f0006">Fig. 8</figref> illustrates the mask associated with the narrow window, i.e. with all image elements having values within that window. <figref idref="f0006">Fig. 9</figref> illustrates the mask<!-- EPO <DP n="15"> --> associated with the wide window, i.e. with all image elements falling within that window, but outside the narrow window. <figref idref="f0006">Fig. 10</figref> illustrates the background mask, i.e. with all image elements falling outside both the narrow and the wide window. It should be noted that the masks have a slightly smooth transition, due to the low-pass filtering of the original binary masks.</p>
<p id="p0069" num="0069">It should also be noted that in case a morphological closing and/or opening step 1047 (<figref idref="f0002">Fig. 2</figref>) would be performed with respect to the masks illustrated in <figref idref="f0006">Figs 8 and 9</figref>, then the unevenness shown in the regions between 50-90 and 170-210 on the horizontal scale would be removed.</p>
<p id="p0070" num="0070">Referring back to <figref idref="f0005">Fig. 7</figref>, it is noted that for those elements whose HU values fall outside both windows, the data from the original CT image (<figref idref="f0004">Fig. 4</figref>) is used. For those elements whose HU values fall within the narrow window, the data from the second CT image (<figref idref="f0005">Fig. 6</figref>) is used. For those elements whose HU values fall within the wide window, but outside the narrow window, the data from the first CT image (<figref idref="f0004">Fig. 5</figref>) is used.</p>
<p id="p0071" num="0071">Even though the above description focuses on 2D image slices, the method is analogously applicable to the processing of higher dimensional data such as direct 3D or 4D enhancement of CT data.</p>
<p id="p0072" num="0072">It should also be noted that although the description focuses on CT images, the described method is analogously applicable to any type of image, and in particular to medical images, such as x-ray, MRI, etc.</p>
<p id="p0073" num="0073">Additional areas of application for the method described above include, but is not limited to, nondestructive testing, e.g. for use in quality assurance in<!-- EPO <DP n="16"> --> the manufacturing industry; analysis of logs in saw mills and in connection with airport luggage security checks.</p>
</description><!-- EPO <DP n="17"> -->
<claims id="claims01" lang="en">
<claim id="c-en-01-0001" num="0001">
<claim-text>A method of enhancing a first digital image composed of a plurality of elements, each having an intensity value, said image depicting objects, the method comprising:
<claim-text>receiving (101) said first digital image,</claim-text>
<claim-text>providing at least one copy of said first digital image,</claim-text>
<claim-text>subjecting said at least one copy to enhancement processing (103) such that each said at least one copy is enhanced with respect to a respective predetermined intensity value range corresponding to one object class, and</claim-text>
<claim-text>combining (104) said at least one copy with said first digital image, whereby an enhanced digital image is provided, said combining comprising:
<claim-text>determining (1042) a first region mask for said first image, said first region mask defining an area within the first image, whose elements have intensity values within a first intensity value range,</claim-text>
<claim-text>determining (1042) a respective additional region mask for said at least one copy, said respective additional region mask defining an area within a respective copy, whose elements have intensity values within said predetermined intensity value range, and</claim-text>
<claim-text>combining (1046) said first image and said at least one copy, weighted by their respective region masks, whereby said enhanced image is provided, wherein the method is <b>characterized by</b> further comprising:
<claim-text>prioritizing (1041) said first digital image and said at least one copy of said first digital image, whereby an element of an image having a higher priority is included in the enhanced image and a correspondingly located element of an image having a lower priority is excluded from the enhanced image.</claim-text></claim-text></claim-text></claim-text></claim>
<claim id="c-en-01-0002" num="0002">
<claim-text>The method of claim 1, further comprising receiving an indication of said predetermined value range and associating said predetermined intensity value range with said at least one copy of said first digital image.</claim-text></claim>
<claim id="c-en-01-0003" num="0003">
<claim-text>The method of claim 1, wherein said enhancement processing (103) is adaptive to a local structure defined by at least some of said plurality of elements.</claim-text></claim>
<claim id="c-en-01-0004" num="0004">
<claim-text>The method of claim 3, wherein said local structure is defined by a group of elements whose intensity values are within said predetermined intensity value range.<!-- EPO <DP n="18"> --><!-- EPO <DP n="19"> --><!-- EPO <DP n="20"> --></claim-text></claim>
<claim id="c-en-01-0005" num="0005">
<claim-text>The method of claim 1, wherein said enhancement processing (103) comprises applying a non-linear filter to said at least one copy of said first digital image.</claim-text></claim>
<claim id="c-en-01-0006" num="0006">
<claim-text>The method of claim 1, wherein said enhancement processing (103) is selected from a group consisting of a noise reduction using a low pass filter, a contrast enhancement using unsharp masking, a rank filtering, an adaptive filtering, a mean-shift filtering, a variational method, a multiband technique and a wavelet technique.<!-- EPO <DP n="21"> --></claim-text></claim>
<claim id="c-en-01-0007" num="0007">
<claim-text>The method of any one of claims 1 or 6, further comprising smoothing (1044) said region masks.</claim-text></claim>
<claim id="c-en-01-0008" num="0008">
<claim-text>The method of any one of claims 1-7 further comprising normalizing (1045) said region masks.</claim-text></claim>
<claim id="c-en-01-0009" num="0009">
<claim-text>The method of any one of claims 1-8, further comprising subjecting at least one of said region masks to a morphological closing and/or opening algorithm.</claim-text></claim>
<claim id="c-en-01-0010" num="0010">
<claim-text>The method of any one of claims 1-9, wherein said first digital image is selected from a group consisting of a two-dimensional array, a three-dimensional array and a four-dimensional array.</claim-text></claim>
<claim id="c-en-01-0011" num="0011">
<claim-text>The method as claimed in any one of claims 1-10, wherein said first digital image is subjected to a second enhancement processing prior to said combining (104).</claim-text></claim>
<claim id="c-en-01-0012" num="0012">
<claim-text>The method as claimed in claim 11, wherein said second enhancement processing is performed with respect to a second predetermined intensity value range.</claim-text></claim>
<claim id="c-en-01-0013" num="0013">
<claim-text>The method as claimed in any one of claims 1 to 12, wherein said first digital image is a CT image and wherein said object class is a tissue type.</claim-text></claim>
<claim id="c-en-01-0014" num="0014">
<claim-text>A computer program product comprising software code portions for performing the steps of any one of claims 1-13, when said product is run on a computer.</claim-text></claim>
<claim id="c-en-01-0015" num="0015">
<claim-text>A storage medium having stored thereon a computer program product according to claim 14.</claim-text></claim>
<claim id="c-en-01-0016" num="0016">
<claim-text>A propagated signal comprising software code for performing the steps of the method according to any one of claims 1-13, when said software code is run on a computer.<!-- EPO <DP n="22"> --><!-- EPO <DP n="23"> --></claim-text></claim>
<claim id="c-en-01-0017" num="0017">
<claim-text>A device for enhancing a first digital image composed of a plurality of elements, each having an intensity valuer, said image depicting objects, the device comprising:
<claim-text>means (2) for receiving said first digital image,</claim-text>
<claim-text>means (3) for providing at least one copy said first digital image,</claim-text>
<claim-text>means for subjecting said at least one copy to enhancement processing (103) such that each said at least one copy is enhanced with respect to a respective predetermined intensity value range corresponding to one object class, and</claim-text>
<claim-text>means for combining (104) said at least one copy with said first digital image, whereby an enhanced digital image is provided, said device further comprising:
<claim-text>means for determining (1042) a first region mask for said first image, said first region mask defining an area within the first image, whose elements have intensity values within a first intensity value range,</claim-text>
<claim-text>means for determining (1042) a respective additional region mask for said at least one copy, said respective additional region mask defining an area within a respective copy, whose elements have intensity values within said predetermined intensity value range, and</claim-text>
<claim-text>means for combining (1046) said first image and said at least one copy, weighted by their respective region masks, whereby said enhanced image is provided, wherein the device is <b>characterized in that</b> it further comprises:
<claim-text>means for prioritizing (1041) said first digital image and said at least one copy of said first digital image, whereby an element of an image having a higher priority is included in the enhanced image and a correspondingly located element of an image having a lower priority is excluded from the enhanced image.</claim-text></claim-text></claim-text><!-- EPO <DP n="24"> --></claim-text></claim>
</claims><!-- EPO <DP n="25"> -->
<claims id="claims02" lang="de"><!-- EPO <DP n="26"> -->
<claim id="c-de-01-0001" num="0001">
<claim-text>Verfahren zum Verbessern eines ersten Digitalbildes, zusammengesetzt aus einer Mehrzahl von Elementen mit jeweils einem Intensitätswert, wobei das Bild Gegenstände wiedergibt, mit den folgenden Verfahrensschritten:
<claim-text>- Aufnehmen (101) des ersten digitalen Bildes,</claim-text>
<claim-text>- Bereitstellen wenigstens einer Kopie des ersten digitalen Bildes,</claim-text>
<claim-text>- Unterwerfen wenigstens einer Kopie einem Verbesserungsprozess (103), wobei jede der wenigstens einen Kopie in Bezug auf einen jeweiligen vorgegebenen Intensitätswertbereich, entsprechend einer Objektklasse verbessert wird,</claim-text>
<claim-text>- Kombinieren (104) die wenigstens eine Kopie mit dem ersten digitalen Bild, wobei ein verbessertes digitales Bild erzeugt wird, und wobei das Kombinieren umfasst:
<claim-text>Bestimmen (1042) einer ersten Bereichsmaske für das erste Bild, wobei die erste Bereichsmaske ein Feld innerhalb des ersten Bildes definiert, dessen Elemente Intensitätswerte innerhalb des ersten Intensitätswertbereiches aufweisen;</claim-text>
<claim-text>Bestimmen (1042) einer entsprechenden zusätzlichen Bereichsmaske für die wenigstens eine Kopie, wobei die entsprechende zusätzliche Bereichsmaske ein Feld innerhalb einer entsprechenden Kopie definiert, dessen Elemente Intensitätswerte innerhalb des genannten vorbestimmten Intensitätwertbereiches aufweisen, und</claim-text>
<claim-text>Kombinieren (1046) des ersten Bildes mit der wenigstens einen Kopie, gewichtet durch deren entsprechende Bereichsmasken, wobei das genannte verbesserte Bild geschaffen wird, wobei das Verfahren durch den weiteren Verfahrensschritt <b>gekennzeichnet</b>:
<claim-text>Priorisieren (1041) des ersten digitalen Bildes und der wenigstens einen Kopie des ersten digitalen Bildes, wobei ein Element eines Bildes mit höherer Priorität im verbesserten Bild eingeschlossen ist,<!-- EPO <DP n="27"> --> und ein entsprechend angeordnetes Element eines Bildes mit einer niederen Priorität vom verbesserten Bild ausgeschlossen ist.</claim-text></claim-text></claim-text></claim-text></claim>
<claim id="c-de-01-0002" num="0002">
<claim-text>Verfahren nach Anspruch 1, umfassend das Aufnehmen einer Anzeige des genannten vorgegebenen Wertbereiches sowie dessen Zuordnen zu der genannten wenigstens einen Kopie des genannten ersten digitalen Bildes.</claim-text></claim>
<claim id="c-de-01-0003" num="0003">
<claim-text>Verfahren nach Anspruch 1, wobei der Verbesserungsprozess (103) an eine lokale Struktur anpassbar ist, definiert durch wenigstens einige der Mehrzahl von Bildelementen.</claim-text></claim>
<claim id="c-de-01-0004" num="0004">
<claim-text>Verfahren nach Anspruch 3, wobei die genannte lokale Struktur definiert ist durch eine Gruppe von Elementen, deren Intensitätswerte innerhalb des genannten vorgegebenen Intensitätswertbereiches liegen.</claim-text></claim>
<claim id="c-de-01-0005" num="0005">
<claim-text>Verfahren nach Anspruch 1, wobei der genannte Verbesserungsprozess (103) das Anwenden eines nicht-linearen Filters auf die genannte wenigstens eine Kopie des ersten digitalen Bildes umfasst.</claim-text></claim>
<claim id="c-de-01-0006" num="0006">
<claim-text>Verfahren nach Anspruch 1, wobei der genannte Verbesserungsprozess (103) ausgewählt ist aus einer Gruppe, bestehend aus einem Rauschunterdrücken unter Verwendung eines low-path Filters, einer Kontrastverbesserung unter Verwenden einer unscharfen Maske, einem Bereich filtern, einem adaptiven Filtern, einem Mittelverschiebefiltern (mean-shift filtering), einem Variationenverfahren, einer Multibandtechnik und einer Wellenlängentechnik.</claim-text></claim>
<claim id="c-de-01-0007" num="0007">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 6, weiterhin umfassend das Glätten (1044) der genannten Bereichsmasken.</claim-text></claim>
<claim id="c-de-01-0008" num="0008">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 7, weiterhin umfassend das Normalisieren (1045) der genannten Bereichsmasken.<!-- EPO <DP n="28"> --></claim-text></claim>
<claim id="c-de-01-0009" num="0009">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 8, weiterhin umfassend das Unterwerfen wenigstens einer der genannten Bereichsmasken einem morphologischen Schließ- und/oder Öffnungs-Algorithmus.</claim-text></claim>
<claim id="c-de-01-0010" num="0010">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 9, <b>dadurch gekennzeichnet, dass</b> das erste genannte digitale Bild ausgewählt ist aus einer Gruppe, umfassend ein zweidimensionales Feld, ein dreidimensionales Feld und ein vierdimensionales Feld.</claim-text></claim>
<claim id="c-de-01-0011" num="0011">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 10, <b>dadurch gekennzeichnet, dass</b> das genannte erste digitale Bild einem zweiten Verbesserungsprozess vor dem genannten Kombinieren (104) unterworfen wird.</claim-text></claim>
<claim id="c-de-01-0012" num="0012">
<claim-text>Verfahren nach Anspruch 11, <b>dadurch gekennzeichnet, dass</b> der zweite Verbesserungsprozess in Bezug auf einen vorgegebenen Intensitätswertbereich ausgeführt wird.</claim-text></claim>
<claim id="c-de-01-0013" num="0013">
<claim-text>Verfahren nach einem der Ansprüche 1 bis 12, <b>dadurch gekennzeichnet, dass</b> das genannte erste digitale Bild ein CT-Bild ist, und dass die Objektklasse eine Gewebeart ist.</claim-text></claim>
<claim id="c-de-01-0014" num="0014">
<claim-text>Computerprogrammprodukt, umfassend Softwarecodebereiche zum Durchführen der Schritte gemäß einem der Ansprüche 1 bis 13, wenn das genannte Produkt auf einem Computer läuft.</claim-text></claim>
<claim id="c-de-01-0015" num="0015">
<claim-text>Speichermedium, auf dem ein Computerprogrammprodukt gemäß Anspruch 14 gespeichert ist.</claim-text></claim>
<claim id="c-de-01-0016" num="0016">
<claim-text>Ein fortschreitendes Signal, umfassend einen Softwarecode zum Durchführen der Schritte gemäß dem Verfahren nach einem der Ansprüche 1 bis 13, wenn der Softwarecode (TS) auf einem Computer läuft.<!-- EPO <DP n="29"> --></claim-text></claim>
<claim id="c-de-01-0017" num="0017">
<claim-text>Vorrichtung zum Verbessern eines ersten Digitalbildes, zusammengesetzt aus einer Mehrzahl von Elementen, deren jedes einen Intensitätswert aufweist, wobei das Bild ein Objekt wiedergibt, umfassend:
<claim-text>- Mittel (2) zum Aufnehmen des ersten digitalen Bildes</claim-text>
<claim-text>- Mittel (3) zum Bereitstellen wenigstens einer Kopie des genannten ersten digitalen Bildes</claim-text>
<claim-text>- Mittel zum Unterwerfen der wenigstens einen Kopie einem Verbesserungsprozess (103), derart, dass jede der genannten wenigstens einen Kopie in Bezug auf einen entsprechenden vorgegebenen Intensitätswertbereich entsprechend einer Objektklasse unterworfen wird, und</claim-text>
<claim-text>- Mittel zum Kombinieren (104) der wenigstens einen Kopie mit dem genannten ersten digitalen Bild, wobei das verbesserte digitale Bild erzeugt wird, wobei die Vorrichtung weiterhin umfasst:
<claim-text>- Mittel zum Bestimmen (1042) einer ersten Bereichsmaske für das genannte erste Bild, wobei die erste Bereichsmaske ein Feld innerhalb des ersten Bildes definiert, dessen Elemente Intensitätswerte innerhalb eines ersten Intensitätswertbereiches aufweist</claim-text>
<claim-text>- Mittel zum Bestimmen (1042) einer entsprechenden zusätzlichen Bereichsmaske für die genannte wenigstens eine Kopie, wobei die entsprechende zusätzliche Bereichsmaske ein Feld innerhalb einer entsprechenden Kopie definiert, dessen Elemente Intensitätswerte innerhalb des genannten vorgegebenen Intensitätswertbereiches aufweisen, und</claim-text>
<claim-text>- Mittel zum Kombinieren (1046) des ersten Bildes und der ersten genannten Kopie, gewichtet durch ihre entsprechenden Bereichsmasken, wobei das genannte verbesserte Bild erzeugt wird, <b>dadurch gekennzeichnet, dass</b> weiterhin vorgesehen sind:
<claim-text>- Mittel zum Priorisieren (1041) des genannten ersten digitalen Bildes und der genannten wenigstens einen Kopie des ersten digitalen<!-- EPO <DP n="30"> --> Bildes, wobei ein Element eines Bildes einer höheren Priorität im verbesserten Bild eingeschlossen ist, und ein entsprechend angeordnetes Element eines Bildes mit einer niedrigeren Priorität vom verbesserten Bild ausgeschlossen ist.</claim-text></claim-text></claim-text></claim-text></claim>
</claims><!-- EPO <DP n="31"> -->
<claims id="claims03" lang="fr">
<claim id="c-fr-01-0001" num="0001">
<claim-text>Procédé d'amélioration d'une première image numérique constituée d'une pluralité d'éléments, chacun ayant une valeur d'intensité, ladite image représentant des objets, le procédé comprenant :
<claim-text>la réception (101) de ladite première image numérique,</claim-text>
<claim-text>la fourniture d'au moins un exemplaire de ladite première image numérique,</claim-text>
<claim-text>la soumission d'au moins ledit exemplaire à un traitement d'amélioration (103) de sorte qu'au moins ledit exemplaire soit amélioré par rapport à une gamme de valeurs d'intensité prédéterminée respective correspondant à une classe d'objet, et</claim-text>
<claim-text>la combinaison (104) d'au moins ledit exemplaire avec une première image numérique, moyennant quoi une image numérique améliorée est obtenue, ladite combinaison comprenant :
<claim-text>la détermination (1042) d'un masque d'une première région pour ladite première image, ledit masque de la première région définissant une zone dans la première<!-- EPO <DP n="32"> --> image dont les éléments ont des valeurs d'intensité dans une première gamme de valeurs d'intensité,</claim-text>
<claim-text>la détermination(1042) d'un masque respectif d'une région supplémentaire pour au moins ledit exemplaire, ledit masque respectif de région supplémentaire définissant une zone dans un exemplaire respectif dont les éléments ont des valeurs d'intensité dans ladite gamme de valeurs d'intensité prédéterminée, et</claim-text>
<claim-text>la combinaison (1046) de ladite première image et dudit exemplaire, pondérée par leurs masques de région respectifs, moyennant quoi, une image améliorée est obtenue, le procédé étant <b>caractérisé par le fait qu'</b>il comprend en outre :
<claim-text>le classement par ordre de priorité (1041) de ladite première image numérique et dudit exemplaire de ladite première image numérique, moyennant quoi un élément d'une image ayant une priorité supérieure est intégré dans l'image améliorée et un élément situé de façon correspondante d'une image ayant une priorité inférieure est exclu de l'image améliorée.</claim-text></claim-text></claim-text></claim-text></claim>
<claim id="c-fr-01-0002" num="0002">
<claim-text>Procédé selon la revendication 1, comprenant en outre la réception d'une indication de ladite gamme de valeurs prédéterminée et l'association de ladite gamme de valeurs d'intensité prédéterminée avec au moins ledit exemplaire de ladite première image numérique.</claim-text></claim>
<claim id="c-fr-01-0003" num="0003">
<claim-text>Procédé selon la revendication 1, dans lequel ledit traitement d'amélioration (103) s'adapte à une structure locale définie par au moins certains des multiples éléments.</claim-text></claim>
<claim id="c-fr-01-0004" num="0004">
<claim-text>Procédé selon la revendication 3, dans lequel ladite structure locale est définie par un groupe<!-- EPO <DP n="33"> --> d'éléments dont les valeurs d'intensité entrent dans ladite gamme d'intensité prédéterminée.</claim-text></claim>
<claim id="c-fr-01-0005" num="0005">
<claim-text>Procédé selon la revendication 1, dans lequel ledit traitement d'amélioration (103) comprend l'application d'un filtre non linéaire au moins audit exemplaire de ladite première image.</claim-text></claim>
<claim id="c-fr-01-0006" num="0006">
<claim-text>Procédé selon la revendication 1, dans lequel ledit traitement d'amélioration (103) est choisi dans un groupe comprenant une réduction du bruit en utilisant un filtre passe-bas, un renforcement du contraste en utilisant un masquage flou, un filtrage de rang, un filtrage adaptatif, un filtrage à décalage moyen, un procédé à variations, une technique multibande et une technique par ondelettes.</claim-text></claim>
<claim id="c-fr-01-0007" num="0007">
<claim-text>Procédé selon l'une quelconque des revendications 1 à 6, comprenant en outre le lissage (1044) desdits masques de région.</claim-text></claim>
<claim id="c-fr-01-0008" num="0008">
<claim-text>Procédé selon l'une quelconque des revendications 1 à 7, comprenant en outre la normalisation (1045) desdits masques de région.</claim-text></claim>
<claim id="c-fr-01-0009" num="0009">
<claim-text>Procédé selon l'une quelconque des revendications 1 à 8, comprenant en outre la soumission d'au moins l'un desdits masques de région à un algorithme morphologique de fermeture et/ou d'ouverture.</claim-text></claim>
<claim id="c-fr-01-0010" num="0010">
<claim-text>Procédé selon l'une quelconque des revendications 1 à 9, dans lequel ladite première image numérique est choisie dans le groupe comprenant une série bidimensionnelle, une série tridimensionnelle et une série quadridimensionnelle.</claim-text></claim>
<claim id="c-fr-01-0011" num="0011">
<claim-text>Procédé selon l'une quelconque des revendications 1 à 10, dans lequel ladite première<!-- EPO <DP n="34"> --> image numérique est soumise à un deuxième traitement d'amélioration avant ladite combinaison (104).</claim-text></claim>
<claim id="c-fr-01-0012" num="0012">
<claim-text>Procédé selon la revendication 11, dans lequel ledit second traitement d'amélioration est réalisé par rapport à une deuxième gamme de valeurs d'intensité prédéterminée.</claim-text></claim>
<claim id="c-fr-01-0013" num="0013">
<claim-text>Procédé selon l'une quelconque des revendications 1 à 12, dans lequel ladite première image numérique est une image TD et dans lequel ladite classe d'objets est de type tissu.</claim-text></claim>
<claim id="c-fr-01-0014" num="0014">
<claim-text>Produit de programme informatique comprenant des parties de codec logiciel pour réaliser les étapes selon l'une quelconque des revendications 1 à 13, ledit produit étant lu sur un ordinateur.</claim-text></claim>
<claim id="c-fr-01-0015" num="0015">
<claim-text>Support de stockage comportant, stocké sur celui-ci, un produit de programme informatique selon la revendication 14.</claim-text></claim>
<claim id="c-fr-01-0016" num="0016">
<claim-text>Signal propagé comprenant un codec logiciel pour réaliser les étapes du procédé selon l'une quelconque des revendications 1 à 13, ledit codec logiciel étant lu sur un ordinateur.</claim-text></claim>
<claim id="c-fr-01-0017" num="0017">
<claim-text>Dispositif pour améliorer une première image numérique constituée d'une pluralité d'éléments, chacun ayant une valeur d'intensité, ladite image représentant des objets, le dispositif comprenant :
<claim-text>des moyens (2) de réception de ladite première image numérique,</claim-text>
<claim-text>des moyens (3) de fourniture d'au moins un exemplaire de ladite première image numérique,</claim-text>
<claim-text>des moyens de soumission d'au moins ledit exemplaire à un traitement d'amélioration (103) de<!-- EPO <DP n="35"> --> sorte qu'au moins ledit exemplaire soit amélioré par rapport à une gamme de valeurs d'intensité prédéterminée respective correspondant à une classe 'd'objet, et</claim-text>
<claim-text>la combinaison (104) d'au moins ledit exemplaire avec une première image numérique, moyennant quoi une image numérique améliorée est obtenue, ledit dispositif comprenant en outre :
<claim-text>des moyens de détermination (1042) d'un masque d'une première région pour ladite première image, ledit masque de la première région définissant une zone dans la première image dont les éléments ont des valeurs d'intensité dans une première gamme de valeurs d'intensité,</claim-text>
<claim-text>des moyens de détermination (1042) d'un masque respectif d'une région supplémentaire pour au moins ledit exemplaire, ledit masque respectif de région supplémentaire définissant une zone dans un exemplaire respectif dont les éléments ont des valeurs d'intensité dans ladite gamme de valeurs d'intensité prédéterminée, et</claim-text>
<claim-text>des moyens de combinaison (1046) de ladite première image et dudit exemplaire, pondérée par leurs masques de région respectifs, moyennant quoi, une image améliorée est obtenue, le procédé étant <b>caractérisé par le fait qu'</b>il comprend en outre :
<claim-text>des moyens de classement par ordre de priorité (1041) de ladite première image numérique et dudit exemplaire de ladite première image numérique, moyennant quoi un élément d'une image ayant une priorité supérieure est intégré dans l'image améliorée<!-- EPO <DP n="36"> --> et un élément situé de façon correspondante d'une image ayant une priorité inférieure est exclu de l'image améliorée.</claim-text></claim-text></claim-text></claim-text></claim>
</claims>
<drawings id="draw" lang="en">
<figure id="f0001" num="1"><img id="if0001" file="imgf0001.tif" wi="165" he="170" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="37"> -->
<figure id="f0002" num="2"><img id="if0002" file="imgf0002.tif" wi="165" he="194" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="38"> -->
<figure id="f0003" num="3"><img id="if0003" file="imgf0003.tif" wi="165" he="110" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="39"> -->
<figure id="f0004" num="4,5"><img id="if0004" file="imgf0004.tif" wi="165" he="222" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="40"> -->
<figure id="f0005" num="6,7"><img id="if0005" file="imgf0005.tif" wi="165" he="223" img-content="drawing" img-format="tif"/></figure><!-- EPO <DP n="41"> -->
<figure id="f0006" num="8,9,10"><img id="if0006" file="imgf0006.tif" wi="165" he="130" img-content="drawing" img-format="tif"/></figure>
</drawings>
<ep-reference-list id="ref-list">
<heading id="ref-h0001"><b>REFERENCES CITED IN THE DESCRIPTION</b></heading>
<p id="ref-p0001" num=""><i>This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.</i></p>
<heading id="ref-h0002"><b>Patent documents cited in the description</b></heading>
<p id="ref-p0002" num="">
<ul id="ref-ul0001" list-style="bullet">
<li><patcit id="ref-pcit0001" dnum="US5594767A"><document-id><country>US</country><doc-number>5594767</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0001">[0008]</crossref><crossref idref="pcit0002">[0029]</crossref></li>
<li><patcit id="ref-pcit0002" dnum="US5038387A"><document-id><country>US</country><doc-number>5038387</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0003">[0040]</crossref></li>
<li><patcit id="ref-pcit0003" dnum="US6556720B"><document-id><country>US</country><doc-number>6556720</doc-number><kind>B</kind></document-id></patcit><crossref idref="pcit0004">[0040]</crossref></li>
<li><patcit id="ref-pcit0004" dnum="US4747150A"><document-id><country>US</country><doc-number>4747150</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0005">[0040]</crossref></li>
<li><patcit id="ref-pcit0005" dnum="US4747151A"><document-id><country>US</country><doc-number>4747151</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0006">[0040]</crossref></li>
<li><patcit id="ref-pcit0006" dnum="US4747152A"><document-id><country>US</country><doc-number>4747152</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0007">[0040]</crossref></li>
<li><patcit id="ref-pcit0007" dnum="US5644662A"><document-id><country>US</country><doc-number>5644662</doc-number><kind>A</kind></document-id></patcit><crossref idref="pcit0008">[0040]</crossref></li>
</ul></p>
<heading id="ref-h0003"><b>Non-patent literature cited in the description</b></heading>
<p id="ref-p0003" num="">
<ul id="ref-ul0002" list-style="bullet">
<li><nplcit id="ref-ncit0001" npl-type="s"><article><author><name>WESTIN,C.-F.</name></author><author><name>RICHOLT, J.</name></author><author><name>MOHARIR, V.</name></author><author><name>KIKINIS, R.</name></author><atl>Affine Adaptive Filtering of CT Data</atl><serial><sertitle>Medical Image Analysis</sertitle><pubdate><sdate>20000000</sdate><edate/></pubdate><vid>4</vid></serial><location><pp><ppf>161</ppf><ppl>177</ppl></pp></location></article></nplcit><crossref idref="ncit0001">[0040]</crossref></li>
<li><nplcit id="ref-ncit0002" npl-type="s"><article><author><name>CARMONA, R.A.</name></author><author><name>ZHONG, S.</name></author><atl>Adaptive smoothing respecting feature directions</atl><serial><sertitle>IEEE Transactions on Image Processing</sertitle><pubdate><sdate>19980000</sdate><edate/></pubdate><vid>7</vid><ino>3</ino></serial><location><pp><ppf>353</ppf><ppl>358</ppl></pp></location></article></nplcit><crossref idref="ncit0002">[0040]</crossref></li>
<li><nplcit id="ref-ncit0003" npl-type="s"><article><author><name>DOMINGUEZ, G.F.</name></author><author><name>BISCHOF, H.</name></author><author><name>BEICHEL, R.</name></author><atl>Fast 3D Mean Shift Filter for CT Images</atl><serial><sertitle>SCIA</sertitle><pubdate><sdate>20030000</sdate><edate/></pubdate></serial><location><pp><ppf>438</ppf><ppl>445</ppl></pp></location></article></nplcit><crossref idref="ncit0003">[0040]</crossref></li>
<li><nplcit id="ref-ncit0004" npl-type="s"><article><author><name>GÖTEBORG</name></author><author><name>SWEDEN</name></author><author><name>SPRINGER</name></author><atl/><serial><sertitle>LNCS</sertitle><vid>2749</vid></serial></article></nplcit><crossref idref="ncit0004">[0040]</crossref></li>
<li><nplcit id="ref-ncit0005" npl-type="s"><article><author><name>NIESSEN, W.</name></author><author><name>TER HAAR ROMENY, B.</name></author><author><name>VIERGEVER, M.A.</name></author><atl>Geodesic Deformable Models for Medical Image Analysis</atl><serial><sertitle>IEEE Transaction on Medical Imaging</sertitle><pubdate><sdate>19980000</sdate><edate/></pubdate><vid>17</vid><ino>4</ino></serial><location><pp><ppf>634</ppf><ppl>641</ppl></pp></location></article></nplcit><crossref idref="ncit0005">[0040]</crossref></li>
<li><nplcit id="ref-ncit0006" npl-type="s"><article><author><name>GILBOA, G.</name></author><author><name>SOCHEN, N.</name></author><author><name>ZEEVI, Y.Y.</name></author><atl>Forward and Backward Diffusion Processes for Adaptive Image Enhancement and Denoising</atl><serial><sertitle>IEEE Transaction on Image Processing</sertitle><pubdate><sdate>20020000</sdate><edate/></pubdate><vid>11</vid><ino>7</ino></serial><location><pp><ppf>689</ppf><ppl>703</ppl></pp></location></article></nplcit><crossref idref="ncit0006">[0040]</crossref></li>
<li><nplcit id="ref-ncit0007" npl-type="s"><article><author><name>DIPPEL, S.</name></author><author><name>STAHL, M.</name></author><author><name>WIEMKER, R.</name></author><author><name>BLAFFERT, T.</name></author><atl>Multiscale Contrast Enhancement Radiographies: Laplacian Pyramid Versus Fast Wavelet Transform</atl><serial><sertitle>IEEE Transactions on Medical Imaging</sertitle><pubdate><sdate>20020000</sdate><edate/></pubdate><vid>21</vid><ino>4</ino></serial><location><pp><ppf>343</ppf><ppl>353</ppl></pp></location></article></nplcit><crossref idref="ncit0007">[0040]</crossref></li>
<li><nplcit id="ref-ncit0008" npl-type="s"><article><author><name>VUYLSTEKE, P.P.</name></author><author><name>SCHOETERS, E.P.</name></author><atl>Multiscale Image Contrast Amplification (MUSICA)</atl><serial><sertitle>SPIE</sertitle><vid>2167</vid></serial></article></nplcit><crossref idref="ncit0008">[0040]</crossref></li>
<li><nplcit id="ref-ncit0009" npl-type="s"><article><atl/><serial><sertitle>Medical Imaging: Image Processing</sertitle><pubdate><sdate>19940000</sdate><edate/></pubdate></serial><location><pp><ppf>551</ppf><ppl>560</ppl></pp></location></article></nplcit><crossref idref="ncit0009">[0040]</crossref></li>
<li><nplcit id="ref-ncit0010" npl-type="s"><article><author><name>YANG, G.Z.</name></author><author><name>RUBENS, M.B.</name></author><author><name>HANSELL, D.M.</name></author><atl>The use of hybrid structural filtering for the detection of obliterative bronchiolitis from computed tomographic images</atl><serial><sertitle>IPA, IEE Conference</sertitle><pubdate><sdate>19970000</sdate><edate/></pubdate><vid>443</vid></serial><location><pp><ppf>631</ppf><ppl>635</ppl></pp></location></article></nplcit><crossref idref="ncit0010">[0040]</crossref></li>
</ul></p>
</ep-reference-list>
</ep-patent-document>
