Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
RULE-BASED TECHNIQUE TO AUTOMATICALLY DETERMINE THE FINAL SCAN GAIN IN STORAGE PHOSPHOR RADIOGRAPHY
Document Type and Number:
WIPO Patent Application WO/1991/009327
Kind Code:
A2
Abstract:
In storage phosphor radiography, a portion of the x-ray energy transmitted through the subject is absorbed by a storage phosphor plate. When stimulated by visible light of the right wavelength, the phosphor plate emits light (at another wavelength) in proportion to the absorbed energy. To obtain the radiogaphic image, the plate can be scanned in a raster fashion and the emitted light can be photoelectrically detected. The detected signal is then amplified, digitized, processed and finally printed on film, or displayed on a cathode ray tube (CRT). Setting the amplification gain of this scanning process, the so called final scan (or final read out) gain, is of interest in maximizing the information extracted from the phosphor. One method of setting the final scan gain invokes the use of a preliminary read out (prescan). A prescan can be conducted on the phosphor plate by use of a stimulating ray having a stimulating energy lower than the stimulating energy in the final scan. The present invention provides a technique that uses the prescan image histogram to automatically determine the final scan gain in storage phosphor radiography.

Inventors:
Sezan
Muhammed
Ibrahim, Schaetzing
Ralph
Application Number:
PCT/US1990/007253
Publication Date:
June 27, 1991
Filing Date:
December 11, 1990
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
EASTMAN KODAK COMPANY.
International Classes:
G21K4/00; A61B6/00; G01T1/00; G01T1/29; G03B42/02; G06T1/00; G06T5/40; H04N5/30; (IPC1-7): G01T1/29; G06F15/68
Foreign References:
US4682028A1987-07-21
US4652999A1987-03-24
US4731863A1988-03-15
EP0077677A21983-04-27
EP0285174A21988-10-05
EP0181518A11986-05-21
FR2450471A11980-09-26
Other References:
KERNTECHNIK. vol. 53, no. 4, April 1989, MUNICH (DE) pages 265 - 268; SCHNAKENBERG: "Digitale Lumineszenzradiographie"
Download PDF:
Claims:
We Claim:
1. A method of adjusting final scan gain to produce a final image in a storage phosphor radiography system of the type wherein a preliminary readout of an exposed storage phosphor plate is conducted by stimulating the storage phosphor with a lower intensity stimulation, obtaining a histogram of the preliminary read out results, and adjusting a higher intensity final scan stimulation based on the histogram, comprising the steps of: in a digital computer, a. generating a histogram from the results of the preliminary read out; b. detecting peaks and/or clusters of peaks A. and A2 in the histogram; c. determining one major set of peaks or clusters, A, representing structures of interest; and d. determining a gain factor g that will locate the major set of peaks at desired gray level locations in the final image based on a set of exam dependent rules and image recording conditions.
2. The method claimed in claim 1, wherein the storage phosphor radiography system includes a laser for conducting final scan stimulation of the storage phosphor, a photomultiplier tube for detecting a final image signal, and a variable gain amplifier for amplifying the final image signal, the method further comprising the step of: employing system parameters including prescan gain, laser power, photomultiplier tube setting, and the gain factor g to compute an electronic gain factor gf which is applied to the variable gain amplifier.
3. The method claimed in claim 1, wherein the steps of detecting peaks and/or clusters of peaks comprises the steps of: a. forming a cumulative distribution function (CDF) from the histogram; b. smoothing the cumulative distribution function with a sliding window average of size N., 5 to produce a smoothed cumulative distribution function; c. subtracting the smoothed cumulative distribution function from the cumulative distribution function to produce a peak detection function; d. employing the peak detection function to ,n locate a set of peaks, A. in the histogram by identifying positive to negative zero crossings of the peak detection function as the start of a detected peak and identifying a maximum following such a ,5 positive to negative zero crossing as the end of a detected histogram peak; and e. repeating steps ac with a window of size N2 where N.>N2 to locate a second set of peaks 0 4. The method claimed in claim 3 wherein the step of determining one major set of peaks, A, is performed according to the following rules: Rl. an A.peak qualifies for the set A if (1) it is an independent peak, or 5 (ii) it is not an independent peak but the total number of the significant overlaps is less than t, where t is an empirically predetermined parameter. (If an A2 peak overlaps significantly with an E.peak then the overlap is said to be a 'major 0 overlap* if the ratio of the number of pixels contained in the overlap to the total number of pixels contained in the A.peak exceeds the value R ..); and R2. an A2peak qualifies for the set A if (i) it is an independent peak, or 5 (ii) it is not independent, but its overlap with the A.peak is a major overlap and the total number of A_peaks that have major overlaps with the A. peak is at least t, or (iii) it is not independent and its overlap with the A.peak is not a major one, but there exist at least t other A2peaks with major overlaps with that A.peak, in which case, adjacent peaks that do not have major overlaps with the A.peak are combined into single peaks. 0 5. The method claimed in claim 1, wherein the sets of exam dependent rules include a set of rules for chest exams comprising the following rules: a. IF the histogram is unimodal, THEN the gain is set such that e., is mapped to gray level (or 5 code value) Q^:g=Q^ e. wherein, the superscript denotes the modality of the histogram and the subscript denotes the exam category of chest exam; b. IF the histogram is not unimodal, THEN (1) IF at least a predetermined percentage, 0 P2%, of the total number of pixels attain values in the interval [e__.,q1_11_32.1] (where q_Iu3„X denotes the largest gray level present in the prescan image) , THEN the gain is determined by the following rule: First, the local maximum of the histogram in the interval 5 *s2'e2*' s °etermined, let π denote the code value at which the local maximum occurs, then the interval [m ,q 1] is searched for the smallest code value at which the histogram attains a value less than or equal to Klh(m2)(Kl<l is a predetermined 3Q coefficient), (2) IF the percentage of pixels that attain values in the interval [e 2,q„maβx_,l] is greater than or equal to a predetermined percentage, PI, but smaller than P2 THEN the previous rule is used with 3__D K2h(m■*&,)(K1<K2<1 is a predetermined coefficient), (3) IF the percentage of pixels that attain values in the interval [e,qm!i,l] is less than PI THEN (a) IF the xrays are not collimated i. IF the histogram is bimodal, THEN ((1)) IF the percentage of the total number of prixels that arrain the value q_max is less than or equal to Pt**%, THEN, ((a)) IF the slope of the CDF between e. and s? is greater than the predetermined threshold S , THEN the gain is set such that s2 is mapped to code value Q :g=Q /s2, ((b)) IF the slope of the CDF computed between e. and s2 is less than or equal to the predetermined threshold S , THEN the gain is set such that a code value between e. and s2, determined from a convex combination of e. and s2, i.e., (L )e.+(lL )s2, is mapped to code value ((2)) IF the percentage of the total number of pixels that attain the value Qma_x is greater than P %, THEN the gain is set such that e2 is mapped to code value Q : g«Q /e2, ii. IF the histogram is not bimodal, THEN the gain is set such that e2 is mapped to code value (b) IF the xrays are collimated, THEN the gain is set as in b(l).
4. 6 The method claimed in claim 1, wherein the sets of exam dependent rules include a set of rules for extremity exams comprising the following rules: a. IF the histogram is unimodal, THEN, 1) IF the xrays are not collimated, THEN the gain is set as gQ^ e. provided that not more than P % of the pixels are mapped to the maximum code value of the system (e.g. 4095 in a 12bits/pixel system) in the final output, ELSE the gain is set such that gQ^/e"where e (e^<e.) is determined such that 1% of the pixels are mapped to the maximum code value of the system in the final output, where the superscript denotes the modality of the histogram and the subscript denotes the exam category of extremity, IF the xrays are collimated, THEN the gain is set such that e. is mapped to code value where the superscript c reflects the fact that the xrays are collimated, b. IF the histogram is not unimodal, THEN IF the xrays are not collimated, (a) IF the histogram is bimodal, THEN i. IF the slope of the CDF computed between e. and s2 is greater than the predetermined threshold S , THEN the gain is set as gQ /e2 provided that not more than Pe% of the pixels are mapped to the maximum code value of the system (e.g. 4095 in a 12bits/pixel system) in the final output, *✓ * ELSE the gam is set such that gQ /e where e (e ,≥2) is determined such that 1% of the pixels are mapped to the maximum code value of the system in the final output, ii. IF the slope of the CDF computed between e. and s2 is less than or equal to the predetermined threshold S , THEN the gain is set such that a code value between e 'and s2, determined from a convex combination of e. and s2, i.e., (L )e.+(lL )s/ is mapped to code value Q , (b) IF the histogram has more than two clusters, THEN i. IF the slope of the CDF computed between e2 and s3 is greater than the predetermined threshold S , THEN the gain is set as gQ /e_ provided that not more than P % of the pixels lie in [e.,g 1] , ELSE the gain is set such that the percentage of the pixels that are mapped to the maximum code value of the system in the final output is 1%, ii. IF the slope of the CDF computed between e2 and S3 is less than or equal to the predetermined threshold S , THEN ((a)) IF the slope of the CDF computed between e. and s2 is greater than the predetermined threshold S , THEN the gain is set such that a code value between e2 and s3, determined from a convex combination of e2 and s3, i.e., (L )e,+(lL (s,, is mapped to code value Q , ((b)) IF the slope of the CDF computed between e. and s2 is less than or equal to the predetermined threshold S , and the second cluster is closer to the third, THEN ((1)) IF the histogram has three clusters, THEN the gain is set such that a code value between e. and s2, determined from a convex combination of e. and s2, i.e., (Le)e1+(1Le)s2, is mapped to code value Q , ((2)) IF the histogram has four clusters, THEN the gain is set such that s3 is mapped to Qe:9Qe S3' ((3)) IF the histogram has more than four clusters, THEN the gain is set such that e3 is mapped to Qe:gQe/e3, ((c)) IF the slope of the CDF computed between e. and s2 is less than or equal to the predetermined threshold S , but the second cluster is closer to the first, THEN the gain is set such that a code value between e2 and s3, determined from a convex combination of e2 and s3, i.e., (L )e2+(lL )s3, is mapped to code value Q , IF the xrays are collimated, THEN the gain is set such that the end point of that of the last cluster is mapped to code value Q , where the superscript c reflects the fact that the xrays are collimated.
5. 7 The method claimed in claim 1, wherein the sets of exam dependent rules include a set of rules for abdomen exams, comprising the following rules: a. IF the histogram is unimodal, THEN 1) The gain is set as provided that not more than Pa% and not less than 0.5% of the pixels are mapped to the maximum code value of the system in the final output, ELSE the gain is set such that g»Q ι** *•***•*' "^ aVe where e is determined such that 0.5% of the pixels are mapped to the maximum code value of the system in the final output, where the superscript denotes the modality of the histogram, and the subscript denotes the exam category abdomen, and b. IF the histogram is not unimodal, THEN 1) IF the xrays are not collimated, (a) IF the histogram is bimodal, THEN i. If the slope of the CDF computed between e. and s2 is greater than the predetermined threshold S 3, THEN the gain is set as provided that not more than P 3% of the pixels are mapped to the maximum code value of the system (e.g. 4095 in a 12bits/pixel system) in the final output, ELSE the gain is set such that gQfye where e _ a (e<e2) is determined such that 0.5% of the pixels are mapped to the maximum code value of the system in the final output, ϋ« IF the slope of the CDF computed between e. and s2 is less than or equal to the predetermined threshold S . THEN the gain is set such that a code value between e. and s2, determined from a convex combination of e. and s2, i.e., (La)e1+(1La(s2, is mapped to code value Q , (b) IF the histogram has more than two clusters, THEN i. IF the slope of the CDF computed between e~ and s_ is greater than the predetermined threshold Sg, THEN the gain is set of gQ ^e3 provided that not more than P % of the pixels lie in [e_,q 1], ELSE the gain is set such that the percentage of the pixels that are mapped to the maximum code value of the system in the final output is 0.5%, ii. IF the slope of the CDF computed between e2 and s3 is less than or equal to the predetermined threshold S , THEN, ((a)) IF the slope of the CDF computed between e. and s2 is greater than the predetermined threshold S . THEN the gain is set such that a code value between e2 and s3, determined from a convex combination of e2 and s3, i.e., (L 3β)e«b+(1L_3)s, is mapped to code value Qa» ((b)) IF the slope of the CDF computed between e. and s2 is less than or equal to the predetermined threshold S 3, and the second cluster is closer to the third, THEN the gain is set such that a code value between e. and s2, determined from a convex combination of e. and s2, i.e., (L 3_)eX.+(1L3_)s Λ», is mapped to code value Q3_, ((c)) IF the slope of the CDF computed between e2 and e3 is less than or equal to the predetermined threshold S , but the second cluster is closer to first, THEN the gain is set as 9«Qa/e3, IF the xrays are collimated, THEN the gain is set such that the end point of the last cluster is mapped to code value Q^, where the superscript c reflects the fact that the xrays are collimated.
6. The method claimed in claim 1, wherein the storage phosphor radiography system includes a quality control station having a display monitor, further comprising the steps of: a. scalling the preliminaryscan image pixelbypixel to produce a quality control image, and b. displaying the quality control image on the monitor prior to final read out of the image.
7. A method of adjusting final scan to produce a final image in a storage phosphor radiography system, of the type wherein a preliminary read out of a storage phosphor plate is conducted by stimulating the storage phosphor with a lower intensity stimulation, obtaining a histogram of the preliminary read out results, and adjusting a higher intensity final scan stimulation based on the histogram, comprising the steps of: a. computing a gain factor g for the final scan stimulation, and b. scaling a preliminary scan image pixelbypixel to produce a quality control image signal, and c. displaying the quality control image signal on a monitor prior to conducting the final scan stimulation, whereby an operator viewing the quality control image may order a retake of the image prior to final read out in the event that the quality control image unsatisfactory.
Description:
RULE-BASED TECHNIQUE TO AUTOMATICALLY DETERMINE

THE FINAL SCAN GAIN IN STORAGE PHOSPHOR RADIOGRAPHY

Technical Field

This invention relates to a method of automatically determining the image read out conditions in storage phosphor radiography systems. The method is based on the histogram of a preliminary image (prescan image), read out with a low power stimulating ray prior to the final scan. Background Art

In storage phosphor radiography systems, a storage phosphor is exposed to radiation, to produce a latent image in the storage phosphor. Subsequently, the storage phosphor is scan-stimulated to release the latent image in the form of detectable radiation. One of the problems associated with storage phosphor radiography is to determine the intensity of stimulation required to produce an optimum read out of the storage phosphor. The optimum stimulation intensity depends upon the range of energies stored in the phosphor. To this end, it has been proposed to conduct a preliminary scan-stimulation at low intensity to determine the range of energies stored in the storage phosphor. A final read out scan-stimulation is then performed based on the results obtained from the preliminary read out. The intensity of the final read out scan is also referred to as final scan "gain." See for example European patent application EP0077677 A3, published 27.04.83 by Suzuki and Horikawa, where they suggest the use of a preliminary scan as a means of determining the final scan and image processing conditions. Although they proposed storage phosphor radiography systems employing manual and automatic control units that utilize the prescan information to determine the final scan conditions, they did not disclose the details of

how these units work.

In U.S. Patent 4,682,029 issued July 21, 1987 to

Tanaka et al., they used the prescan image histogram to determine the minimum (Smm. ), and the maximum

3 c (Sma ) signal levels that correspond to the "useful" image information. The final scan gain was determined such that (Smm.„) and (S„m β ax) would become respectively the signal levels Qmm... and Qmax. At the output, a predetermined transformation mapped the 0 signal within the range £Q i 'Q ] to the desired output density range £ D m i n ' D maχ 3 • In this manner, the useful image information was expressed within a predetermined range at the output. This technique used a "percent rule" to determine Smm. and Smax 5 from the prescan image histogram. The quantity S was determined from a gray level that was occupied by 0.1 to 2.0% of the total number of picture elements and Smm.„ was determined from a gray ■** level that was occupied by 0.05 to 1.0% of the total number of 0 picture elements. The major drawback of this technique is that many gray levels may have the same relative percent population. No rule was disclosed to choose among the multiple possibilities.

In European patent application EP0145982 Al, 5 published 26.06.85, Tanaka et al. used a slightly different but equivalent perspective in considering the problem. They emphasized the automatic control of a scale factor introduced in the analog-to-digital

(A/D) converter. That is, the final scan gain and the 0 scaling, followed by A/D conversion, constituted the final scan conditions. As in U.S. 4,682,028 cited above, the prescan histogram was used to determine

Smm. and S.m--.a β x. The scale factor was determined from the difference (Sm„„ax-S„m,. ) . In cases where 5 the spatial extent of the radiation exposure field is limited to a certain anatomical structure (i.e.,

collimated x-rays), the value S min is determined mainly by the scattered radiation. This value is smaller than that obtained within the image portion of the radiation exposure field. As a result, the image

5 contrast may decrease if this fact is not taken into consideration in determining the scale factor. In order to alleviate such detrimental effects, Tanaka et al. proposed a technique that required the computation of the histogram (h_) of the prescan data obtained

10 from a sub-region of the storage phosphor plate in addition to the histogram (h,) of the data obtained from the entire storage phosphor plate (sub-region area normally occupied 20% to 80% of the total plate area). The quantities Smm.„,l,,Smax,l, and i • LJ Smm.„,2i/Smax,2~ were obtained from h±. and h2_, respectively. (Usually, Smm.„,ι-,<S„,. ,2 and

Smax,l,"Sma,x„,2*Sm„a ). Tanaka et al. proposed a method to compute a value of Sm„m. from Smι.„n,l, and

Smm. ,2-,, that would be used to determine the scale 0 factor.

In European patent application EP 0154880 A2, published 18.09.85 by Tanaka et al., the prescan data were collected only from selected sub-regions of the phosphor plate. A characteristic value, S . , was 5 calculated from the mean values of the gray levels within these sub-regions. The final scan gain was determined such that S . would become the gray level Q at the final scan. In the predetermined output transformation, the quantity Q 3V was mapped to a 0 desirable output density level D . The major disadvantage of this technique is that the location of the sub-regions that are used to collect prescan data are exam-, and possibly image-dependent.

In U.S. patent 4,652,999 issued March 24, 1987, 5 Higashi et al. proposed a configuration where the final scan gain and the image processing conditions

were determined automatically from the prescan information. The so called "automatic sensitivity adjusting function" (ASAF) determined the final scan gain based on the exam type and image recording 5 conditions (e.g., chest exam and lung field magnification) . The final scan gain was determined such that the image information presented to the output station was within a predetermined range

^min'^max^' which was ma PPed to some i- L n υ predetermined density range [Dmm. ,Dma„x] at the output. But, a desired Dmax may have been specified for the lung field only rather than for the entire image. In that case, the lung field can have the desired output dynamic range only if the x-rays were

15 coned (collimated) onto the lung field (lung field magnification image). Higashi et al. addressed this problem by proposing a "secondary automatic gradation" unit which would ensure that the structure of interest, rather than the entire image, had the

20 desired dynamic range for varying image recording conditions. This control unit was provided with the recording conditions and the value at the output of the ASAF unit. The working principles of the ASAF unit for determining the final scan gain were not

25 disclosed.

As further experience with storage phosphor imaging systems has been gained, it has become apparent that further improvements in methods for adjusting the final read out conditions based on a

3 Q preliminary read out are needed.

Another problem that has been discovered as experience has been gained is that unsatisfactory exposures are not discovered until the final image is read out, processed and displayed. This whole process

35 can consume a good deal of computer time that is wasted if the image must be retaken.

Disclosure of the Invention

It is therefore the object of the present invention to provide an improved method for automatically determining the read out conditions in a 5 storage phosphor radiography system.

In the method according to this invention, peaks (or group of peaks, called clusters) that correspond to major anatomical structures and the background portion (if any) of the prescan image are detected. ,„ For example, Figure 1 shows a histogram having 3 peaks 10, 12, and 14, forming a cluster 16. A cluster is composed of j(j=l,2,..) peaks and reduces to a peak for j«l. In what follows, we use the terms 'peak* and 'cluster' interchangeably. The final scan gain is ,- then determined such that the peaks are moved to desired gray level (or code value) locations in the final scan. By placing the peaks at desired gray level locations in the final scan, the associated anatomical structures will be at the desired gray 0 levels. The desired locations depend on the exam type and on the image recording conditions. In general, the main consideration in determining the final scan gain is to be able to utilize effectively the available range of gray levels by using a gain as high as possible. At the same time, the gain should not be 5 so high to cause useful image information to saturate at the maximum gray level (in general, only the background portion of the image is allowed to saturate at the maximum gray level) . 0 One advantage of the proposed method over the previous prescan histogram based methods is the detection of individual histogram cluster supports instead of the entire histogram support,

^min^max^ * since histogram clusters, in general, correspond to major anatomical structures, 5 this technique is more flexible than the others for

maintaining the major structures at desired gray levels in the final image. Furthermore, the entire histogram support as used in the prior art methods, determined from the minimum and the maximum gray levels ( s m i n ' S maχ present in the image, may not correctly represent the useful image information range. In particular, Smm. may underestimate the true minimum, S IΩ3.-&, on the other hand, may over estimate the maximum value of the useful image information range. This can be because of the existence of insignificantly populated higher gray levels isolated from the major population range, or because of background peaks. The former situation is illustrated in Fig. 2 which illustrates a prescan histogram with isolated levels 18. The existence of such levels may be due to (1) nonuniformities in the x-ray beam, (2) x-ray noise, (3) x-ray scatter, (4) phosphor plate structure noise, and (5) scanner noise. In Fig. 2, the final scan gain based on Smax would not fully utilize the allowable dynamic range of gray levels (e.g., [0,2 -1] for a B-bit digital radiography system). The gray level e 2 in Fig. 2 is a better estimate for the maximum of the useful image information range. The method according to the present invention estimates the cluster supports (s,,e,) and [s 2 ,e,], and bases the final scan gain on the value e_.

According to one aspect of the present invention, the final scan gain in a storage phosphor radiography system is adjusted by: performing a preliminary scan read out at low intensity; generating a histogram from the results of the preliminary scan read out; locating clusters of peaks in the histogram; determining the peaks, clusters representing structures of interest; and adjusting the final scan gain such that the clusters of peaks representing anatomical structures of

interest are located at desired gray levels in the output image, depending on exam type and image recording conditions.

According to another aspect of the invention, a gain factor g is computed from the histogram data, and is applied on a pixel-by-pixel basis to the prescan image to produce a quality control image. The quality control image displayed on a monitor prior to final read out of the image so that an operator can order a retake of the image if the quality is unacceptable.

BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a histogram illustrating peaks and clusters; Fig. 2 is a histogram illustrating insignificantly populated isolated levels; Fig. 3 is a block diagram of a storage phosphor radiography system where the final-scan gain is determined by the method of the present invention; Fig. 4 is a flowchart showing the final scan gain setting method according to the present invention; Fig. 5 illustrates a prescan histogram of a chest exam; Fig. 6 illustrates a prescan histogram of a lumbar spine exam; and

Fig. 7 illustrates a prescan histogram of a hands exam. Modes of Carrying out the Invention Figure 3 is a schematic diagram illustrating a storage phosphor radiography system for implementing the final scan gain determination method of the present invention. A switch 20 is at position 1 when a prescan is conducted at the scanner station 22. The prescan data are amplified in an amplifier 24 (g_), digitized in an A/D converter 26 and fed to a digital computer 28 that performs the gain setting algorithm. Exam type, image recording condition and system parameters are provided to the computer and hence the gain setting algorithm via a user interface 30. The gain setting algorithm determines a gain factor g which is then

scaled by system parameters to determine the final scan gain g f . The gain factor g is used in computing a "quality control image" (QCI) displayed on a monitor at a quality control station 32, prior to the final read out. The QCI is computed by pixel-by-pixel scaling of the prescan image by the gain factor g. An operator inspects QCI for motion artifacts or patient misplacement. In the case of severe motion artifacts or misplacements, the operator may call for a retake, otherwise the patient is released prior to final readout. The final readout is conducted using a higher laser power (and possibly higher resolution) at the scanner station 22 with the switch 20 at position 2. The gain of the final scan amplifier 34 is set to g f where

9ι and where g, is the gain introduced by the increase laser power during the final scan. The final scan data are digitized in an A/D converter 36 and supplied to an image processing station (IPS) 38. The image processing station 38 (IPS) is a digital computer that is programmed to implement various image processing algorithms. The IPS can incorporate tone-scale transformations, unsharp masking, whose parameters can be automatically configured. The final image, or multiple images processed differently, are printed on film, or displayed on CRT, or recorded on an archiving system at the output station, or encoded and transmitted to a remote site at an output station 40. The method for setting the final scan gain according to the invention includes the following:

I. Generate the histogram, h(n), and the cumulative distribution function (CDF) (or normalized cumulative histogram), c(n), of the prescan image;

II. Detect the peaks (or clusters) in the

histogram h(n) ;

III. Based on a set of "selection rules," determine one major set of peaks of clusters representing structures of interest that are to be used in gain setting;

IV. On the basis of exam-dependent rules and image recording condition, determine the gain factor g;

V. Using the system parameters, such as the prescan gain, the laser power, photomultiplier tube settings, etc., and the gain factor g computed in Step IV, compute the electronic gain g f that is to be used in the final scan.

A flowchart showing the steps employed in the gain setting method is illustrated in Fig. 4. We now discuss each of these five steps.

STEP I (42): We denote the histogram of the prescan image by h(n), n«0,l,..,2 -1, where B is the number of bits per pixel used to represent the image. Then, CDF,c(n) is computed as

c(n)«(l/Λf)£ (*), n=0,l,..,2 B -l, (2)

where M denotes the total number of pixels in the image.

STEP II (44): Peaks of the prescan histogram, h(n), are detected, for example by using the peak detection method disclosed in U.S. Patent 4,731,863 issued March 15, 1988 to Sezan et al. which is incorporated herein by reference.

In the peak detection algorithm, a "peak detection function" is generated from CDF. First, c(n) is smoothed by convolving with a uniform rectangular window w N (n) to produce a smoothed CDF, c " N (n),: c N (n)= c{n)* w N {n) (3) where the uniform rectangular window is such that

- M -{Γ ≤n≤(* - ι) 2 «

and N is assumed to be odd. The smoothed CDF, cc„„((nn)) ,, iiss ssuubbttrraacctteedd from c(n) to generate the peak detection function r N' r N (n) = c(n)- c N (n). (5)

The following principles are applied to the peak detection function r„ to estimate the start and end points of the peaks. (i) A zero-crossing of the detection signal to negative values (henceforth, negative crossover) indicates the start of a peak. The gray level at which the negative crossover occurs is defined to be the estimate of a start point. For the ith peak, this gray level is denoted by s.. Similarly, the next negative crossover at the gray level s. , estimates the start of the next peak.

(ii) The gray level between two successive negative crossovers at which the detection signal attains its local maximum is defined to be the estimate of the end point of the peak. For the ith peak, this gray level is denoted by e.. The peaks are denoted by intervals defined by their start and end points, i.e., [s.,e.]. The length of the window, N, determines the sensitivity of peak detection. The parameter N is therefore referred to as the "peak detection sensitivity parameter." As the value of N is decreased, the peak-detection sensitivity increases. To detect peaks accurately, the above procedure (Step

II) is iterated twice with two different window sizes,

N-l^ and N-N 32 ( -^N^, and two sets of peaks are obtained:

A = {[sh e]} : t = l,2, ...,7χ} (N = N x ) A 2 = {[s c?] : i = 1, 2, ..., J 2 } (N = N 2 ) (6) where I j - 1 ! ^ ecause the sensitivity of the peak

detection increases with decreasing window size. The other parameters in the peak detection algorithm are set to the values disclosed in U.S. Pat. No. 4,731,863. STEP III (46) : The purpose of this step is to select from both A, and A 2 a final set, A, of peaks (so called "major" peaks) that will be used in gain calculation. The selection is performed on the basis of a number of rules. The rules determine the peaks (or groups of peaks) from A, and A 2 that significantly overlap with each other, and take only one representative peak (or peak cluster) into consideration in gain calculation.

The A_-intervals (or equivalently the

A_-peaks), i.e., [s 2.,e2.]'s may overlap with the

A,-intervals (or equivalently the A.-peaks), i.e.,

[s.,e.]'s. If the relative population of pixels

contained in the overlay exceeds a predetermined value then the overlap is said to be "significant." Nonoverlapping peaks, or insignificantly overlapping peaks are called "independent" peaks. The overlapping and the independent peaks are determined by the overlap detection procedure described in U.S. Patent 4,731,863. To summarize, the set A of the major peaks are formed via the following rules (R1-R2): Rl. An A,-peak qualified for the set A if (1) it is an independent peak, or (ϋ) it is not an independent peak but the total number of the significant overlaps is less than t, where t is an empirically predetermined parameter. (If an A- peak overlaps significantly with an A,-peak then the overlap is said to be a "major overlap" if the ratio of the number of pixels contained in the overlap to the total number of pixels

contained in the A.-peak exceeds the value R maj ' >

R2. An A_-peak qualifies for the set A if

(i) it is an independent peak, or

(ii) it is not independent, but its overlap with the A.-peak is a major overlap and the total number of A--peaks that have major overlaps with the

A. peak is at least t, or

(iii) it is not independent and its overlap with the A.-peak is not a major one, but there exist at least t other A 2 -peaks with major overlaps with that A.-peak. In this case, adjacent peaks that do not have major overlaps with the A.-peak are combined into single peaks. The final set A can be defined as

Λ={[s,*,e t -]: t = l,2,...,J} (7)

The overlap detection algorithm is explained in detail in U.S. Pat. No. 4,731,863. The recommended values for the parameters of the overlap detection algorithm in the present invention are: N.-2161; N 2 «541;

iven the major set of peaks determined in the previous step, the exam type (50), and the image recording condition (50), the gain factor is calculated using a rule base. The image recording condition (52) may be either (i) x-rays are collimated, or (ii) x-rays are not collimated. The exam types are classified into three major categories. That is, each incoming exam is classified into one of the following categories: (i) chest, (ii) extremity, and (iii) abdomen. Each category has its own set of rules. These rules were determined experimentally from thousands of exams.

In each category, the rule base first determines whether or not the peaks in the final set correspond to an anatomical structure, background or a mixture of

the two. Then, the gain factor is calculated with two main objectives: (1) to set the gain high enough such that the available gray level range is fully utilized, and (2) to set the gain low enough such that valuable image information is not saturated at the maximum gray level (in general, only the background portion of the image is allowed to saturate at the maximum gray level). In the following, we provide the rule base for three exam categories. In our notation, capital letters denote the user-specified (predetermined) parameters. The subscripts denote the exam category, i.e., "c" for chest, "e" for extremity and "a" for abdomen. The superscripts denote the image recording condition and the modality of the histogram. For instance,

Q u,c denote the parameter for extremity exams when x-rays are collimated and the prescan histogram is unimodal. We provide recommended values of the user-specified parameters for a 12-bit digital radiography system. These values have been obtained as a result of studying thousands of cases.

CHEST EXAMS

A. The Rule Base

1. IF the histogram is unimodal, THEN the gain is set such that e. is mapped to gray level (or

code value Q": 9 m ^^-

2. IF the histogram is not unimodal, THEN

(a) IF at least a predetermined percentage, P2%, of the total number of pixels attain values in the interval [e.,,q ma -1] (where q ms „-. denotes the largest gray level present in the prescan image) , THEN the gain is determined by the following rule: First,

the local maximum of the histogram in the interval

[s_,e_] is determined. Let m_ denote the code value at which the local maximum occurs. Then the interval [m2_,qmax-1] is searched for the smallest code value at which the histogram attains a value less than or equal to Klh(m_) (K1<1 is a predetermined coefficient) ,

(b) IF the percentage of pixels that attain values in the interval [e--,,q__ -1] is greater than or equal to a predetermined percentage, PI, but smaller than P2 THEN the previous rule is used with

K2h(m„) (K1<K2<1 is a predetermined coefficient),

(c) IF the percentage of pixels that attain values in the interval [e-,,q -1] is less than PI

THEN

• If the x-rays are not collimated i. IF the histogram is bimodal, THEN

A. IF the percentage of the total number of pixels that attain the value qma_x is less than or equal to Pc%, THEN

—(1) IF the slope of the CDF between e. and s- is greater than the predetermined threshold S , THEN the gain is set such that s 2 is mapped to code value Q : g«Q /s . —(2) IF the slope of the CDF computer between e. and s 2 is less than or equal to the predetermined theshold S , THEN the gain is set such that a code value between e. and s 2 , determined from a convex combination of e. and s_, i.e., (L c )e 1 +(1-L { ,)s 2 , is mapped to code value Q .

(0≤L C <1)

B. IF the percentage of the total number of pixels that attain the value qmax is g "reater than

P C%, THEN the gain is set such that e £_, is mapped to code vaalluuee QQ c :: gg««QQ c ee 22 ii. IF the histogram is not bimodal, THEN

the gain is set such that e 2 is mapped to code value

Q c : g= Q c /e 2 .

• IF the x-rays are collimated, THEN the gain is set as in 2(a). B. Recommended Values of Parameters

f22S0 , antero-posterior (AP) / postero-anterior

(PA) exams (patient or his back facing the x-ray tube) lateral exams (patent turned sideways) .

AP/PA exams lateral exams.

AP/PA exams lateral exams.

L c - 0.5; A c - 4095 K2 - 0.02; S c = 8 x 10 "5

EXTREMITY EXAMS A. The Rule Base

1. IF the histogram is unimodal, THEN

• IF the x-rays are not collimated, THEN the gain is set as g«Q^/e. provided that not more than Pe% of the pixels are mapped to the maximum code value of the system (e.g. 4095 in a 12-bits/pixel system) in the final output, ELSE the gain is set such that g*-Q^*/e where e(e<e.) is determined such that 1% of the pixels are mapped to the maximum code value of the system in the final output.

• IF the x-rays are collimated, THEN the is mapped to code value 2. IF the histogram is not unimodal, THEN

• IF the x-rays are not collimated (a) IF the histogram is bimodal, THEN i. IF the slope of the CDF computed between e. and s 2 is greater than the predetermined threshold S , THEN the gain is set as g-Q /e 2 provided that not more then P % of the pixels are

mapped to the maximum code value of the system (e.g. 4095 in a 12-bits/pixel system) in the final output, ELSE the gain is set such that g«Q /e where e (ef<e_) is determined such that 1% of the pixels are mapped to the maximum code value of the system in the final output. ii. IF the slope of the CDF computed between e. and s 2 is less than or equal to the predetermined threshold S , THEN the gain is set such that a code value between e. and s 2 , determined from a convex combination of e. and s 2 , i.e., (L )e.+(l-L )s 2 , is mapped to code value

(b) IF the histogram has more than two clusters, THEN i. IF the slope of the CDF computed between e 2 and s is greater than the predetermined threshold S , THEN the gain is set as <3*Q e /e 3 provided that not more than P % of the pixels lie in

[e,,Q__ -1], ELSE the gain is set such that the ^ max percentage of the pixels that are mapped to the maximum code value of the system in the final output is 1%. ii. IF the slope of the CDF computed between e_ and s 3 is less than or equal to the predetermined threshold S , THEN

A. IF the slope of the CDF computed between e. and s 2 is greater than the predetermined threshold S , THEN the gain is set such that a code value between e 2 and s 3 , determined from a convex combination of e 2 and s 3 , i.e.,

(L )e 2 +(l-L )S 3 , is mapped to code value Q .

B. IF the slope of the CDF computed between e. and s 2 less than the predetermined threshold

S , and the second cluster is closer to the third, THEN

-(1) IF the histogram has three clusters, THEN the gain is set such that a code value between e. and s 2 , determined from a convex combination of e. and s 2 , i.e., (L e )e 1 +(1-L e )s 2 , is mapped to code value Q .

-(2) IF the histogram has four clusters, THEN the gain is set such that s 3 is mapped to Q e :g=Q e /s 3 .

-(3) IF the histogram has more than four clusters, THEN the gain is set such that e 3 is mapped to Q e : g-Q e /e 3 .

C. IF the slope of the CDF computed between e. and s 2 is less than or equal to the predetermined threshold S , THEN the gain is set such that a code value between e 2 and s 3 , determined from a convex combination of e 2 and s 3 , i.e., (L )e 2 +(l-L )S 3 , is mapped to code value

Q e'

• IF the x-rays are collimated, THEN the gain is set such that the end point of the last cluster is mapped to code value Q B. Recommended Values of Parameters ζ>|=3500; Q?' c =1500 Q e =4095; Q%=3500

S e =2.0x 10- 4 ; P e = 2.0; L e = 0.4 ABDOMEN EXAMS

A. The Rule Base

1. IF the histogram is unimodal, THEN

• The gain is set as g-Q^/e. provided that not more than P % and not less than 0.5% of the pixels are mapped to the maximum code value of the system in the final output, ELSE the gain is set such that g-QjJ'/e' where e is determined such that 0.5% of the pixels are mapped to the maximum code value of the system in the final output.

2.IF the histogram is not unimodal, THEN • IF the x-rays are not collimated

(a) IF the histogram is bimodal, THEN i. IF the slope of the CDF computed between e. and s 9 is greater than the predetermined threshold Sα. THEN the gam is set a provided than not more than P % of the pixels are mapped to the maximum code value of the system (e.g.

4095 in a 12-bits/ρixel system) in the final output, ELSE the gain is set such that g=*Qr e where e

^ a

(e<e_) is determined such that 0.5% of the pixels are mapped to the maximum code value of the system in the final output. ii. IF the slope of the CDF computed between e. and s 2 is less than or equal to the predetermined threshold S , THEN the gain is set such that a code value between e. and s 2 , determined from a convex combination of e. and s 2 , i.e., (L )e.+(l-L )s 2 , is mapped to code value

Q a . «KL a cl.)

(b) IF the histogram has more than two clusters, THEN i. IF the slope of the CDF computed between e 2 and s 3 is greater than the predetermined

" threshold S_, THEN the gain is set as g-Q^/e. provided that not more than Pa% of the pixels lie in *- e 3' g max~^ ' ELSE tiιe 9 a *i* n is se such that the percentage of the pixels that are mapped to the maximum code value of the system in the final output is 0.5%. ii. IF the slope of the CDF computed between e 2 and s 3 is less than or equal to the predetermined threshold S 3_, THEN

A. IF the slope of the CDF computed between e. and s 2 is greater than the predetermined threshold Sa. THEN the gain is set such that a code value between e 2 and s 3 , determined from a convex combination of e 2 and s 3 , i.e.,

(La)e £.,.+(l-La)s«,_>, is mapped to code value Qa.

B. IF the slope of the CDF computed between e. and s 2 is less than or equal to the predetermined threshold S . and the second cluster

5 is closer to the third, THEN the gain is set such that a code value between e. and s 2 , determined from a convex combination of e. and s 2 , i.e., (L 3)eX.+(l-L3_)s * _£, is mapped to code value Q3.

C. IF the slope of the CDF computed between 0 e 2 and e 3 is less than or equal to the predetermined threshold S 3, but the second cluster is closer to first, THEN the gain is set as g«Q 3/e,

• IF the x-rays are collimated, THEN the gain is set such that the end point of the last 5 cluster is mapped to code value Q 3f~.

B. Recommended Values of Parameters

In Rules 2(a) (ii) and 2(b) (ii), the coefficients used in forming the convex combinations of peak parameters vary with the slope of the CDF as follows: 0 f 0.5, slope <4 x 10~ 5

0.4, 4 x 10~ 5 < slope < 5 x 10 "5 La. - { 0.3 5 x 10~ 5 < slope < 6 x 10 -5 0.2 6 x 10- 5 < slope < 1 x 10~ 4 0.1 slope < 1 x 10" 4 .

Q =3500; Qa. =4095; Q =3500

STEP V (54): The final scan gain g f is obtained by simply scaling the gain factor g by a coefficient that reflects the system parameters 56, such as the laser power, photomultiplier tube settings and the prescan gain. If we denote the gain introduced by the increase in laser power during the final scan be g. # and the prescan gain by g , then the final scan electronic gain g f us given by

(g p g 1 )g/ (8)

where g denotes the gain factor determined in the previous step.

EXAMPLES In the following we present three examples. The corresponding prescan image histograms, h(n)58, and CDFs, c(n)60, are illustrated in Figs. 5-7, respectively for three examples. The peak information and the gain factors calculated according to the method of the present invention are given below.

These results are obtained by using the recommended values of the parameters noted above.

Example No. 1 Exam Type: Chest (lateral)

Image Recording Condition: x-rays are not collimated.

Exam Category Used in Gain Setting: Chest

A 1 ={[0,386], [1665,3850]} A 2 -{[0,261],[2099,3495]}

A*{[0,386] , [1665,3850]}

Rule Used in Gain Setting: CHEST: 2.(c)(i)(A)(2)

Gain Factor(g) : 3.99

Example No. 2

Exam Type: Lumbar Spine (AP)

Image Recording Condition: x-rays are not collimated. Exam Category Used in Gain Setting: Abdomen A 1 -{[0,1395]}

A 2 -{[0,1015]} A-{[0,1395]}

Rule Used in Gain Setting: ABDOMEN: 1 2.(c)(i)(A)(2)

Gain Factor(g) : 1.16

Example No . 3

Exam Type: Hands

Image Recording Condition: x-rays are not collimated. Exam Category Used in Gain Setting: Extremity

A -([0,1279])

A =([0,667],[706, 1249])

A=([0,667],[706, 124])

Rule Used in Gain Setting: EXTREMITY:

2.(a)(i) Gain Factor(g): 3.17