# Patent

## Title
Methods of view selection for radioactive emission measurements

## Abstract

A method is described for identifying an optimal, or preferred set of views for radioactive-emission measurements of a body structure, based on modeling the body structure, in terms of its geometry and radioactive emission distribution, obtaining different sets of views of the model, and scoring the different sets of views, with a scoring function, using information theoretic measures, for example, for uniformity, reliability and separability in reconstruction.
The preferred set of views may then be applied in imaging the in-vivo body structure, that has been modeled.

## Background
RELATED APPLICATIONS
This application is a National Phase Application of PCT Application No. PCT/IL2005/000572 having International Filing Date of Jun. 1, 2005, which claims the benefit of US Provisional Patent Application No. 60/575,369, filed on Jun. 1, 2004, US Provisional Patent Application No. 60/625,971, filed on Nov. 9, 2004, US Provisional Patent Application No. 60/630,561, filed on Nov. 26, 2004, US Provisional Patent Application No. 60/632,236, filed on Dec. 2, 2004, US Provisional Patent Application No. 60/632,515, filed on Dec. 3, 2004, US Provisional Patent Application No. 60/635,630, filed on Dec. 14, 2004, US Provisional Patent Application No. 60/636,088, filed on Dec. 16, 2004, US Provisional Patent Application No. 60/640,215, filed on Jan. 3, 2005, US Provisional Patent Application No. 60/648,385, filed on Feb. 1, 2005, US Provisional Patent Application No. 60/648,690, filed on Feb. 2, 2005. The contents of the above Applications are all incorporated herein by reference.


FIELD AND BACKGROUND OF THE INVENTION
The present invention relates to selecting optimal views for measuring radiation emitted by an object. More particularly, the present invention relates to selecting the optimal views using a scoring function based on information-theoretic measures. Of particular interest is view selection for medical imaging and/or in conjunction with medical instruments, such as guided minimally invasive surgical instruments.
Radionuclide imaging is one of the most important applications of radioactivity in medicine. Its purpose is to obtain a distribution image of a radioactively labeled substance, e.g., a radiopharmaceutical, within the body following administration thereof to a patient. Radioactive-emission imaging relies on the fact that in general, pathologies, such as malignant tumors, malfunctioning organs, and inflammations, display a level of activity different from that of healthy tissue. Thus, radiopharmaceuticals, which circulate in the blood stream, are picked up by the active pathologies to a different extent than by the surrounding healthy tissue; in consequence, the pathologies are operative as radioactive-emission sources and may be detected by radioactive-emission imaging. It will be appreciated that the pathology may appear as a concentrated source of high radiation, a hot region, as may be associated with a tumor, or as a region of low-level radiation, which is nonetheless above the background level, as may be associated with carcinoma.
A reversed situation is similarly possible. Dead tissue has practically no pick up of radiopharmaceuticals, and is thus operative as a cold region.
Thus radiopharmaceuticals may be used for identifying active pathologies as well as dead tissue.
In the discussion that follows, the term organ target is intended to include pathological features within organs. These pathological features may be expressed, by radioactive-emission imaging, as any one of the following:

    i. hot regions, of a radioactive emission intensity higher than the background level;
    ii. regions of low-level radioactive emission intensity, which is nonetheless above the background level; and
    iii cold regions, of a radioactive emission intensity, lower than the background level.


Examples of radiopharmaceuticals include monoclonal antibodies or other agents, e.g., fibrinogen or fluorodeoxyglucose, tagged with a radioactive isotope, e.g., 99Mtechnetium, 67gallium, 201thallium, 111indium, 123iodine, 125iodine and 18fluorine, which may be administered orally or intravenously. The radiopharmaceuticals are designed to concentrate in the area of a tumor, and the uptake of such radiopharmaceuticals in the active part of a tumor, or other pathologies such as an inflammation, is higher and more rapid than in the tissue that neighbors the tumor. Thereafter, a radiation-emission-measuring-probe, which may be configured for extracorporeal or intracorporeal use, is employed for locating the position of the active area. Another application is the detection of blood clots with radiopharmaceuticals such as ACUTECT from Nycomed Amersham for the detection of newly formed thrombosis in veins, or clots in arteries of the heart or brain, in an emergency or operating room. Yet other applications include radioimaging of myocardial infarct using agents such as radioactive anti-myosin antibodies, radioimaging specific cell types using radioactively tagged molecules (also known as molecular imaging), etc.
The usual preferred emission for such applications is that of gamma rays, which emission is in the energy range of approximately 11-511 KeV. Beta radiation and positrons may also be detected.
Radioactive-emission imaging is performed with a radioactive-emission-measuring detector, such as a room temperature, solid-state CdZnTe (CZT) detector, which is among the more promising that is currently available. It may be configured as a single-pixel or a multi-pixel detector, and may be obtained, for example, from eV Products, a division of II-VI Corporation, Saxonburg Pa., 16056, or from IMARAD IMAGING SYSTEMS LTD., of Rehovot, ISRAEL, 76124, www.imarad.com, or from another source. Alternatively, another solid-state detector such as CdTe, HgI, Si, Ge, or the like, or a combination of a scintillation detector (such as NaI(Tl), LSO, GSO, CsI, CaF, or the like) and a photomultiplier, or another detector as known, may be used.
FIGS. 1a-1i schematically illustrate detecting units 102 and detecting blocks 101 of various geometries and constructions, and radioactive-emission-measuring probes associated with them.
FIG. 1a schematically illustrates a detecting unit 102, formed as a single-pixel detector 104, for example, a room-temperature solid-state CdZnTe (CZT) detector, having a diameter D and a thickness τd. Both the detector diameter D, or a diameter equivalent in the case of a non-circular detector, and the detector thickness τd affect the detecting efficiency. The detector diameter determines the surface area on which radioactive emission impinges; the greater the surface area, the greater the efficiency. The detector thickness affects the stopping power of the detector. High energy gamma rays may go through a thin detector, and the probability of their detection increases with detector thickness. By itself, a single-pixel detector cannot generate an image; rather, all counts are distributed over the surface area of the detector.
FIG. 1b schematically illustrates the detecting unit 102 with a collimator 108, formed as a single cell of a diameter D, a length L, and a septa thickness τ, attached to the detector 104. The collimator 108 may be, for example, of lead, tungsten or another material which substantially blocks gamma and beta rays.
The collimator's geometry, and specifically, the ratio of D/L, provides the detecting unit 102 with a collection angle δ analogous to a viewing angle of an optical camera. The collection angle δ limits the radioactive-emission detection to substantially only that radioactive emission, which impinges on the detector 104 after passing through a “corridor” of the collimator 108 (although in practice, some high-energy gamma rays may penetrate the collimator's walls).
FIG. 1c schematically illustrates a block 101 of the detecting units 102, with the collimator 108, formed as a multi-cell collimator, of a cell diameter D. The collection angle δ is defined for each of the detecting units 102 in the block, and each of the detecting units 102 forms a pixel in the block 101.
FIG. 1d schematically illustrates a radioactive-emission-measuring probe 100 which comprises several detecting units 102, of different geometries and different collection angles δ, within a housing 107.
FIGS. 1e-1i schematically illustrate the block 101, formed as a combination of a scintillation detector (such as NaI(Tl), LSO, GSO, CsI, CaF, or the like), a collimator grid, and photomultipliers.
As seen in FIG. 1e, the block 101, having proximal and distal ends 109 and 111, respectively, vis a vis an operator (not shown), is formed of the scintillation detector 104, of a single pixel, and the collimators 108, to create the detecting units 102. A plurality of photomultipliers 103 is associated with the single pixel scintillation detector 104, and with proper algorithms, as known, their output can provide a two dimensional image of the scintillations in the single pixel scintillation detector 104. In essence, this is an Anger camera, as known.
The distal view 111 of the collimator grid is seen in FIG. 1f. 
Two optional proximal views 109 of the photomultipliers 103 are seen in FIGS. 1g and 1h, as a square grid arrangement, and as an arrangement of tubes.
An Anger camera 117, of the block 101 in the housing 107 is seen in FIG. 1i. 
In each of the cases of FIGS. 1a-1i, the geometry of the collimator 108 determines the collection angle δ, wherein with no collimator, the collection angle δ, is essentially a solid angle of 4π steradians. Thus, the collimator's geometry affects both the detection efficiency and the image resolution, which are defined as follows:
i. The detection efficiency is the ratio of measured radiation to emitted radiation; and
ii. The image resolution is the capability of making distinguishable closely adjacent radioactive-emission organ targets, or the capability to accurately determine the size and shape of individual radioactive-emission organ targets.
Naturally, it is desired to optimize both the detection efficiency and the image resolution. Yet, they are inversely related to each other. The detection efficiency increases with increasing collimator's collection angle, and the image resolution decreases with increasing collimator's collection angle. For example, when the ratio of D/L is 1/2, the collection angle δ is substantially 2.5 steradians, so the cell views incident radiation within the confinement of about a 2.5-steradian sector. However, when the ratio of D/L is 1/12, the collection angle δ is substantially 0.31 steradians, so the cell views incident radiation within the confinement of about a 0.31-steradian sector.
Once the emission data is obtained, the data is processed to reconstruct the intensity distribution within the measured volume. The reconstruction process is generally complex, due to the large quantity of data which must be processed in order to obtain an accurate reconstruction. The following prior art statistical model may be used to perform reconstruction.
We assume an intensity distribution, I, defined over an input space U, where U comprises a set of basic elements (e.g., pixels in two dimensional spaces, voxels in three dimensional spaces), and I(u) is the intensity of a given basic element μ∈ U. A detecting unit positioned on a radiation-emission-measuring-probe takes a series of measurements y=(yt)t=1T from different positions and orientations around the volume U. The geometrical and physical properties of the detecting unit, together with its position and orientation in a given measurement t, determine the detection probability øt(u) of a photon emitted from location u. Thus the effective intensity of location u as viewed by the detecting unit during measurement t is øt(u)I(u).
The random count Xt(u) of photons that are emitted from location u and detected in measurement t is modeled by a Poisson process with mean øt(u)I(u). The total count of photons detected in measurement t is Yt=Σu∈U Xt(u), and the reconstruction problem is to reconstruct the intensities (I(u))u∈U from the measurements (yt)t=1T.
The 2-D Radon transform is a mathematical relationship which may be used to reconstruct the emission intensities of volume U when the set of measurements (yt)t=1T is unconstrained. The Radon transform is not statistical and does not take into account the Poissonian nature of the counts. In addition, it models the views as line projections. The Radon transform maps the spatial domain (x,y) to the Radon domain (p,φ). For a fixed projection angle, the Radon transform is simply a projection of the object. A technique known in the art as filtered back-projection (FBP) uses a back-projection operator and the inverse of the Radon transform to reconstruct the intensity distribution in volume U from measurements (yt)t=1T.
The basic, idealized problem solved by the FBP approach is to reconstruct an image from its Radon transform. The Radon transform, when properly defined, has a well-defined inverse. However, in order to invert the transform one needs measured data spanning 180°. In many medical imaging situations, the positioning of the detecting unit relative to the emitting object is constrained, so that complete measured data is not available. Reconstruction based on filtered back-projection is therefore of limited use for medical imaging. Maximum likelihood (ML) and Maximum A Posteriori (MAP) estimation methods, which address the statistical nature of the counts, have been found to provide better image reconstructions than FBP.
Limited-angle tomography is a reconstruction technique in the related art which reconstructs an image from projections acquired over a limited range of angular directions. The success of the reconstruction process depends upon the extent of the angular range acquired compared with the angular range of the missing projections. Any reconstruction from a limited range of projections potentially results in spatial distortions (artifacts) in the image. Limited angle techniques can be applied for both the Radon transform and the statistical models, but better results are generally achieved within the statistical framework. While it is known that the severity of the artifacts increases with the increasing angular range of the missing projections, limited-angle tomography does not provide information on which projections should be used in order to most effectively reconstruct the image.
Maximum likelihood (ML) estimation is a widely used method in the related art for reconstructing an image from a constrained set of measurements. A parameterization of the generative model described above is obtained by assigning an intensity I(u) to every voxel in U. The likelihood of the observed data y=(yt)t, given the set of parameters I={I(u):u∈U} is:




  
    
      
        
          L
          ⁡
          
            (
            
              y
              ❘
              I
            
            )
          
        
        =
        
          
            ln
            ⁢
            
              
            
            ⁢
            
              P
              ⁡
              
                (
                
                  y
                  ❘
                  I
                
                )
              
            
          
          =
          
          ⁢
          
            
              ln
              ⁢
              
                
                  ∏
                  t
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      
                        y
                        t
                      
                      ❘
                      I
                    
                    )
                  
                
              
            
            =
            
              
                ∑
                t
              
              ⁢
              
                ln
                ⁢
                
                  
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      
                        
                          ∑
                          u
                        
                        ⁢
                        
                          
                            x
                            t
                          
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                      
                      ❘
                      I
                    
                    )
                  
                
              
            
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            ∑
            t
          
          ⁢
          
            ln
            ⁢
            
              
            
            ⁢
            Poisson
            ⁢
            
              
            
            ⁢
            
              (
              
                
                  y
                  t
                
                ❘
                
                  
                    ∑
                    u
                  
                  ⁢
                  
                    
                      
                        φ
                        t
                      
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                    ⁢
                    
                      I
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                
              
              )
            
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            ∑
            t
          
          ⁢
          
            {
            
              
                
                  
                    
                      -
                      
                        
                          ∑
                          u
                        
                        ⁢
                        
                          
                            
                              φ
                              t
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                          ⁢
                          I
                          ⁢
                          
                            (
                            u
                            )
                          
                        
                      
                    
                    +
                  
                
              
              
                
                  
                    
                      
                        y
                        t
                      
                      ⁢
                      ln
                      ⁢
                      
                        
                          ∑
                          u
                        
                        ⁢
                        
                          
                            
                              φ
                              t
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                          ⁢
                          
                            I
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                        
                      
                    
                    -
                    
                      ln
                      ⁡
                      
                        (
                        
                          
                            y
                            t
                          
                          !
                        
                        )
                      
                    
                  
                
              
            
            }
          
        
      
    
  




Note that the lower and upper bound of an indexing variable (such as voxels u and time index t) are omitted in the following description, when they are clear from the context.

There is currently no analytic way to solve Eqn. 1 for the maximum of the likelihood function. However, optimization methods that find local maxima of the likelihood are known. One such method is the Expectation-Maximization (EM) process.
Since the data generated by the model is only partially observable by our measurements, a basic ingredient of the Expectation-Maximization formalism is to define a set of random variables that completely define the data generated by the model. In the current case, since Yt=ΣuXt(u), the set of variables {Xu(t):U∈U; t=1, . . . , T} is such a set; the generated data is x=(xt)t, where xt=(xt(u))u, and the observed data y is completely determined by x. The main tool in the EM formalism is the complete data likelihood:




  
    
      
        
          
            
              
                ln
                ⁢
                
                  
                
                ⁢
                
                  P
                  ⁡
                  
                    (
                    
                      x
                      ❘
                      I
                    
                    )
                  
                
              
              =
              
              ⁢
              
                ln
                ⁢
                
                  
                    ∏
                    t
                  
                  ⁢
                  
                    P
                    ⁡
                    
                      (
                      
                        
                          x
                          t
                        
                        ❘
                        I
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∑
                  t
                
                ⁢
                
                  ln
                  ⁢
                  
                    
                      ∏
                      u
                    
                    ⁢
                    
                      Poisson
                      ⁢
                      
                        
                      
                      ⁢
                      
                        (
                        
                          
                            
                              x
                              t
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                          ❘
                          
                            
                              
                                φ
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                            ⁢
                            
                              I
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                          
                        
                        )
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∑
                  t
                
                ⁢
                
                  
                    ∑
                    u
                  
                  ⁢
                  
                    {
                    
                      
                        
                          -
                          
                            
                              φ
                              t
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                        
                        ⁢
                        
                          I
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                      
                      +
                      
                        
                          
                            x
                            t
                          
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                        ⁢
                        
                          ln
                          ⁡
                          
                            (
                            
                              
                                
                                  φ
                                  t
                                
                                ⁡
                                
                                  (
                                  u
                                  )
                                
                              
                              ⁢
                              
                                I
                                ⁡
                                
                                  (
                                  u
                                  )
                                
                              
                            
                            )
                          
                        
                      
                      +
                      
                        ln
                        ⁡
                        
                          (
                          
                            
                              
                                x
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                            !
                          
                          )
                        
                      
                    
                    }
                  
                
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




Since the likelihood depends on the complete data, which is only partially observable, we take its expectation with respect to the space of the unobserved data, given the current set of hypothesized parameters (i.e. the current estimator). The result is a function Q(I|I′) which assigns likelihood to sets I of model parameters, given the current set I′, and given the observed data y:




  
    
      
        
          
            
              
                Q
                ⁡
                
                  (
                  
                    I
                    |
                    
                      I
                      ′
                    
                  
                  )
                
              
              =
              
              ⁢
              
                E
                ⁡
                
                  [
                  
                    
                      ln
                      ⁢
                      
                        
                      
                      ⁢
                      
                        P
                        (
                        
                          x
                          ⁢
                          
                            
                            I
                            )
                          
                        
                        
                      
                      ⁢
                      y
                    
                    ;
                    
                      I
                      ′
                    
                  
                  ]
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  ∑
                  t
                
                ⁢
                
                  
                    ∑
                    u
                  
                  ⁢
                  
                    {
                    
                      
                        
                          -
                          
                            
                              φ
                              t
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                        
                        ⁢
                        
                          I
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                      
                      +
                      
                        E
                        ⁡
                        
                          [
                          
                            
                              
                                
                                  x
                                  t
                                
                                ⁡
                                
                                  (
                                  u
                                  )
                                
                              
                              |
                              
                                y
                                t
                              
                            
                            ;
                            
                              I
                              ′
                            
                          
                          ]
                        
                      
                    
                  
                
              
            
          
        
        
          
            
              
              ⁢
              
                
                  ln
                  ⁡
                  
                    (
                    
                      
                        
                          φ
                          t
                        
                        ⁡
                        
                          (
                          u
                          )
                        
                      
                      ⁢
                      
                        I
                        ⁡
                        
                          (
                          u
                          )
                        
                      
                    
                    )
                  
                
                +
                C
              
              }
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where C is a term which is independent of the intensities I. The function Q(I|I′) is maximized by the following new estimates:





  
    
      
        
          
            I
            ⁡
            
              (
              u
              )
            
          
          =
          
            
              1
              
                
                  ∑
                  t
                
                ⁢
                
                  
                    φ
                    t
                  
                  ⁡
                  
                    (
                    u
                    )
                  
                
              
            
            ⁢
            
              
                ∑
                t
              
              ⁢
              
                E
                ⁡
                
                  [
                  
                    
                      
                        
                          x
                          t
                        
                        ⁡
                        
                          (
                          u
                          )
                        
                      
                      |
                      
                        y
                        t
                      
                    
                    ;
                    
                      I
                      ′
                    
                  
                  ]
                
              
            
          
        
        ;
        
          ∀
          
            u
            ∈
            
              U
              .
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




The expectation in Equation 4 is obtained as follows:




  
    
      
        
          
            
              
                P
                
                  
                    X
                    t
                  
                  ⁡
                  
                    (
                    u
                    )
                  
                
              
              (
              
                
                  
                    
                      x
                      t
                    
                    ⁡
                    
                      (
                      u
                      )
                    
                  
                  ⁢
                  
                    
                    
                      
                        y
                        t
                      
                      ;
                      
                        I
                        ′
                      
                    
                    )
                  
                
                =
                
                  
                    
                      
                        P
                        
                          Y
                          t
                        
                      
                      ⁡
                      
                        (
                        
                          
                            
                              y
                              t
                            
                            |
                            
                              
                                x
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                          
                          ;
                          
                            I
                            ′
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                        P
                        
                          
                            X
                            t
                          
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                      
                      ⁡
                      
                        (
                        
                          
                            
                              x
                              t
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                          |
                          
                            I
                            ′
                          
                        
                        )
                      
                    
                  
                  
                    
                      P
                      
                        Y
                        t
                      
                    
                    ⁡
                    
                      (
                      
                        
                          y
                          t
                        
                        |
                        
                          I
                          ′
                        
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              =
              
                
                  
                    
                      
                        Poisson
                        (
                        
                          
                            
                              y
                              t
                            
                            -
                            
                              
                                x
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                          
                          |
                          
                            
                              ∑
                              
                                v
                                ≠
                                u
                              
                            
                            ⁢
                            
                              
                                
                                  φ
                                  t
                                
                                ⁡
                                
                                  (
                                  v
                                  )
                                
                              
                              ⁢
                              
                                
                                  I
                                  ′
                                
                                ⁡
                                
                                  (
                                  v
                                  )
                                
                              
                            
                          
                        
                        )
                      
                    
                  
                  
                    
                      
                        Poisson
                        ⁡
                        
                          (
                          
                            
                              
                                x
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                            |
                            
                              
                                
                                  φ
                                  t
                                
                                ⁡
                                
                                  (
                                  u
                                  )
                                
                              
                              ⁢
                              
                                
                                  I
                                  ′
                                
                                ⁡
                                
                                  (
                                  u
                                  )
                                
                              
                            
                          
                          )
                        
                      
                    
                  
                
                
                  Poisson
                  (
                  
                    
                      y
                      t
                    
                    |
                    
                      
                        ∑
                        v
                      
                      ⁢
                      
                        
                          
                            φ
                            t
                          
                          ⁡
                          
                            (
                            v
                            )
                          
                        
                        ⁢
                        
                          I
                          ⁡
                          
                            (
                            v
                            )
                          
                        
                      
                    
                  
                  )
                
              
            
          
        
        
          
            
              =
              
                Binomial
                (
                
                  
                    
                      
                        x
                        t
                      
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                    |
                    
                      
                        
                          
                            φ
                            t
                          
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                        ⁢
                        
                          
                            I
                            ′
                          
                          ⁡
                          
                            (
                            u
                            )
                          
                        
                      
                      
                        
                          ∑
                          v
                        
                        ⁢
                        
                          
                            
                              φ
                              t
                            
                            ⁡
                            
                              (
                              v
                              )
                            
                          
                          ⁢
                          
                            
                              I
                              ′
                            
                            ⁡
                            
                              (
                              v
                              )
                            
                          
                        
                      
                    
                  
                  ;
                  
                    y
                    t
                  
                
                )
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




It follows that




  
    
      E
      [
      
        
          
            
              x
              t
            
            ⁡
            
              (
              u
              )
            
          
          |
          
            y
            t
          
        
        ;
        
          I
          ′
        
      
      ]
    
    =
    
      
        y
        t
      
      ⁢
      
        
          
            φ
            t
          
          ⁢
          
            (
            u
            )
          
          ⁢
          
            
              I
              ′
            
            ⁡
            
              (
              u
              )
            
          
        
        
          
            ∑
            v
          
          ⁢
          
            
              
                φ
                t
              
              ⁡
              
                (
                v
                )
              
            
            ⁢
            
              
                I
                ′
              
              ⁡
              
                (
                v
                )
              
            
          
        
      
    
  
  ,




and hence the EM iteration is:





  
    
      
        
          I
          ⁡
          
            (
            u
            )
          
        
        =
        
          
            1
            
              
                ∑
                t
              
              ⁢
              
                
                  φ
                  t
                
                ⁡
                
                  (
                  u
                  )
                
              
            
          
          ⁢
          
            
              ∑
              t
            
            ⁢
            
              
                y
                t
              
              ⁢
              
                
                  
                    φ
                    t
                  
                  ⁢
                  
                    (
                    u
                    )
                  
                  ⁢
                  
                    
                      I
                      ′
                    
                    ⁡
                    
                      (
                      u
                      )
                    
                  
                
                
                  
                    ∑
                    v
                  
                  ⁢
                  
                    
                      
                        φ
                        t
                      
                      ⁡
                      
                        (
                        v
                        )
                      
                    
                    ⁢
                    
                      
                        I
                        ′
                      
                      ⁡
                      
                        (
                        v
                        )
                      
                    
                  
                
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




It is provable that each EM iteration improves the likelihood. Thus, given a random starting estimator, the EM algorithm iterates the above improvement step until it converges to a local maximum of the likelihood. Several random starts increase the chance of finding a globally good estimator.
It is usually desired to maximize the expected posterior probability (given a proper prior) rather than the expected likelihood. In that case we assume a prior probability on the intensities P(I)=πuP(I(u)). A proper conjugate prior for the Poisson distribution is the Gamma distribution:




  
    
      
        
          P
          ⁡
          
            (
            
              I
              ⁡
              
                (
                u
                )
              
            
            )
          
        
        =
        
          
            Gamma
            (
            
              
                
                  I
                  ⁡
                  
                    (
                    u
                    )
                  
                
                |
                
                  α
                  u
                
              
              ;
              
                β
                u
              
            
            )
          
          ⁢
          
            
              β
              u
              
                
                  α
                  u
                
                +
                1
              
            
            
              Γ
              ⁡
              
                (
                
                  
                    α
                    u
                  
                  +
                  1
                
                )
              
            
          
          ⁢
          
            
              
                I
                ⁡
                
                  (
                  u
                  )
                
              
              ⁢
              
                
              
            
            
              α
              u
            
          
          ⁢
          
            e
            
              
                -
                
                  β
                  u
                
              
              ⁢
              
                I
                ⁡
                
                  (
                  u
                  )
                
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




Now the maximization is done on Q(I|I′)=E[lnP(x|I)p(I)|y;I′]. Plugging the Gamma prior into Q, and solving for I(u), we get the following EM iteration for the maximum posterior estimation:




  
    
      
        
          
            
              
                I
                ⁡
                
                  (
                  u
                  )
                
              
              =
              
              ⁢
              
                
                  
                    α
                    u
                  
                  +
                  
                    
                      ∑
                      t
                    
                    ⁢
                    
                      E
                      ⁡
                      
                        [
                        
                          
                            
                              
                                x
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                            |
                            
                              y
                              t
                            
                          
                          ;
                          
                            I
                            ′
                          
                        
                        ]
                      
                    
                  
                
                
                  
                    β
                    u
                  
                  +
                  
                    ∑
                    
                      
                        φ
                        t
                      
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  1
                  
                    
                      β
                      u
                    
                    +
                    
                      
                        ∑
                        t
                      
                      ⁢
                      
                        
                          φ
                          t
                        
                        ⁡
                        
                          (
                          u
                          )
                        
                      
                    
                  
                
                [
                
                  
                    α
                    u
                  
                  +
                  
                    
                      ∑
                      t
                    
                    ⁢
                    
                      
                        y
                        t
                      
                      ⁢
                      
                        
                          
                            φ
                            t
                          
                          ⁢
                          
                            (
                            u
                            )
                          
                          ⁢
                          
                            
                              I
                              ′
                            
                            ⁡
                            
                              (
                              u
                              )
                            
                          
                        
                        
                          
                            ∑
                            v
                          
                          ⁢
                          
                            
                              
                                φ
                                t
                              
                              ⁡
                              
                                (
                                u
                                )
                              
                            
                            ⁢
                            
                              
                                I
                                ′
                              
                              ⁡
                              
                                (
                                v
                                )
                              
                            
                          
                        
                      
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        
          
            
              (
              8
              )
            
          
        
        
          
            
              (
              9
              )
            
          
        
      
    
  




The EM update step can be formulated in matrix notation as follows. Let Φ be the matrix of the projections [φt(u)]t,u, and let I,I′,y, α and β be represented as column vectors. Equation 8 can be written in vector and matrix notations as:




  
    
      
        I
        =
        
          
            α
            +
            
              
                I
                ′
              
              ·
              
                (
                
                  
                    Φ
                    T
                  
                  ⁢
                  
                    y
                    
                      Φ
                      ⁢
                      
                        
                      
                      ⁢
                      
                        I
                        ′
                      
                    
                  
                
                )
              
            
          
          
            β
            +
            
              
                Φ
                T
              
              ⁢
              1
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




where the explicit multiplication and division denote element-wise operations, and where 1 is a vector (of the appropriate length) consisting solely of 1′s.

Limited computational resources (i.e., when the entire projection matrix Φ cannot be kept in memory) may require breaking the update computation according to a partition of Φ into a set of sub-matrices (Φi). In that case the intensities can be updated gradually (using only one sub-matrix at each step) according to the following computation:




  
    
      
        I
        =
        
          
            α
            +
            
              
                I
                ′
              
              ·
              
                
                  ∑
                  i
                
                ⁢
                
                  
                    φ
                    i
                    T
                  
                  ⁢
                  
                    
                      y
                      t
                    
                    
                      
                        Φ
                        t
                      
                      ⁢
                      
                        I
                        ′
                      
                    
                  
                
              
            
          
          
            β
            +
            
              
                ∑
                i
              
              ⁢
              
                
                  Φ
                  i
                  T
                
                ⁢
                1
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




where yi is the vector of observations that are obtained using the views of Φi.

In order to achieve a reconstructed image which is adequate for medical diagnostic and treatment purposes, a high-resolution image of the tested object must be obtained. When high-resolution detecting units are used, their efficiency is relatively low, and the detecting units must remain at each position for a relatively long time in order to achieve a high probability of detection. Since during medical testing, measurements are generally performed at many locations as the detecting unit is moved relative to the observed organ, the testing procedure generally requires a long time and is physically and emotionally difficult for the patient. Additionally, reconstruction is based upon a large quantity of data, and is a lengthy and computationally complex process.
SUMMARY OF THE INVENTION
A method is described for identifying an optimal, or preferred set of views for radioactive-emission measurements of a region of interest within the body. The method is based on a model of the region of interest, and the preferred sets of views are identified for the model, preferably using information theoretic measures. The preferred sets of views may then be applied to the region of interest, in vivo.
The present invention successfully addresses the shortcomings of the presently known configurations by providing methods for identifying optimal, or preferred sets of views for radioactive-emission measurements of a region of interest within the body. The methods are based on models of the region of interest, and the preferred sets of views are identified for the models, preferably using information theoretic measures. The preferred sets of views may then be applied to the region of interest, in vivo.
Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. Although methods and materials similar or equivalent to those described herein can be used in the practice or testing of the present invention, suitable methods and materials are described below. In case of conflict, the patent specification, including definitions, will control. In addition, the materials, methods, and examples are illustrative only and not intended to be limiting.
Implementation of the method and system of the present invention involves performing or completing selected tasks or steps manually, automatically, or a combination thereof. Moreover, according to actual instrumentation and equipment of preferred embodiments of the method and system of the present invention, several selected steps could be implemented by hardware or by software on any operating system of any firmware or a combination thereof. For example, as hardware, selected steps of the invention could be implemented as a chip or a circuit. As software, selected steps of the invention could be implemented as a plurality of software instructions being executed by a computer using any suitable operating system. In any case, selected steps of the method and system of the invention could be described as being performed by a data processor, such as a computing platform for executing a plurality of instructions.



BRIEF DESCRIPTION OF THE DRAWINGS
The file of this patent contains at least one drawing executed in color photograph. Copies of this patent with color photograph(s) will be provided by the Patent and Trademark Office upon request and payment of necessary fee.
The invention is herein described, by way of example only, with reference to the accompanying drawings. With specific reference now to the drawings in detail, it is stressed that the particulars shown are by way of example and for purposes of illustrative discussion of the preferred embodiments of the present invention only, and are presented in the cause of providing what is believed to be the most useful and readily understood description of the principles and conceptual aspects of the invention. In this regard, no attempt is made to show structural details of the invention in more detail than is necessary for a fundamental understanding of the invention, the description taken with the drawings making apparent to those skilled in the art how the several forms of the invention may be embodied in practice.
In the drawings:
FIGS. 1a-1i show detecting units and blocks of various geometries and constructions and radioactive-emission-measuring probes, associated with them.
FIGS. 1j and 1k present the principles of modeling, for obtaining an optimal set of views, in accordance with the present invention;
FIGS. 1l and 1m pictorially illustrate a view and viewing parameters associated with it, in accordance with definitions of the present invention.
FIG. 2 is a simplified flowchart of a method for selecting a set of optimal views of a volume to be imaged, according to a first preferred embodiment of the present invention.
FIG. 3 shows an example of a volume with two views.
FIG. 4 illustrates the concept of uniform coverage of a volume.
FIG. 5 is a simplified flowchart of a method for selecting a set of optimal views of a volume to be imaged, according to a second preferred embodiment of the present invention.
FIG. 6 shows four models of a prostate emittance model.
FIGS. 7a-7f show emittance models of a given volume to illustrate view selection using the separability criterion.
FIGS. 7g-7j show emittance models of a given volume to illustrate view selection using a weighted-combination criterion.
FIG. 8 is a simplified flowchart of an iterative method for selecting a set of views, according to a preferred embodiment of the present invention.
FIG. 9 is a simplified flowchart of a single iteration of a view selection method, according to a preferred embodiment of the present invention.
FIG. 10 is a simplified flowchart of a method for selecting a set of optimal views of a volume to be imaged, according to a third preferred embodiment of the present invention.
FIG. 11 is a simplified block diagram of a set selector for selecting a set of optimal views of a volume to be imaged, according to a first preferred embodiment of the present invention.
FIG. 12 is a simplified block diagram of a set selector for selecting a set of optimal views of a volume to be imaged, according to a second preferred embodiment of the present invention.
FIGS. 13-18 illustrate view set selection results for the uniformity criterion.
FIGS. 19-24 illustrate view set selection results for the separability criterion.
FIGS. 25-32 illustrate view set selection results for the reliability criterion, based on the Fisher information measure.
FIG. 33 illustrates view set selection results for the reliability criterion, based on minimizing the inverse mean of the Fisher information measure.



DESCRIPTION OF THE PREFERRED EMBODIMENTS
The present invention is of methods for identifying optimal, or preferred sets of views for radioactive-emission measurements of a region of interest within the body. The methods are based on models of the region of interest, and the preferred sets of views are identified for the models, preferably using information theoretic measures. The preferred sets of views may then be applied to the region of interest, in vivo. The principles and operation of the methods for optimizing radioactive-emission measurements, according to the present invention, may be better understood with reference to the drawings and accompanying descriptions.
Before explaining at least one embodiment of the invention in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of the components set forth in the following description or illustrated in the drawings. The invention is capable of other embodiments or of being practiced or carried out in various ways. Also, it is to be understood that the phraseology and terminology employed herein is for the purpose of description and should not be regarded as limiting.
Referring now to the drawings, FIGS. 1j and 1k present the principles of modeling, for obtaining an optimal set of views, in accordance with the present invention.
FIG. 1j schematically illustrates a body section 120, having a region of interest (ROI) 130. The region of interest 130 may be associated with an organ 140, with a specific radioactive-emission-density distribution, possibly suggestive of a pathological feature 150, termed herein an organ target 150. Additionally, there may be certain physical viewing constraints, associated with the region of interest 130.
We thus consider the following problem: how can we best identify an optimal and permissible set of views for radioactive-emission measurements of the region of interest 130, for reconstructing a three-dimensional image of it?
In accordance with the present invention, our approach is delineated by the following process:

    i. modeling the region of interest 130, as a model 160 of a volume U, possibly with one or several modeled organ targets HS, within anatomical constraints AC, as seen in FIG. 1k;
    ii. obtaining an optimal and permissible set of views for the modeled volume U of FIG. 1k; and
    iii. applying the optimal set of views to the in-vivo region of interest 130 and the organ 140 of FIG. 1j. 


It will be appreciated that the model 160 of the region of interest 130 may be based on general medical information of the organ 140 and common pathological features associated with it. Additionally, the model may be based on information related to a specific patient, such as age, sex, weight, and body type. Furthermore, a structural image, such as by ultrasound or MRI, may be used for providing information about the size and location of the organ 140 in relation to the body section 120, for generating the model 160.
The present application concentrates on the second step of the process, namely, obtaining the optimal and permissible set of views for the volume U of the model 160.
Referring now to the drawings, FIGS. 1l and 1m pictorially illustrate a view and viewing parameters associated with it, in accordance with definitions of the present invention.
Seen in FIG. 1l is a volume U, subdivided into voxels u. The volume U is defined in a six-degree coordinate system (x;y;z;ω;θ;σ) and has a point of origin P0(x0; y0; z0; ω0; θ0; σ1). A detecting unit 102 is positioned at a location and orientation P1(x1; y1; z1; ω1; θ1; σ1). The detecting unit 102 has a detector 104 of a specific detector material of a thickness τd, and a collimator 108 of a diameter D and a length L, so as to define a collection angle δ. The location, orientation, and collection angle parameters determine a three-dimensional sector S, which is the portion of the volume U that is within the detector unit's field of view. The probability of detection of a given voxel outside of sector S is negligible, since a photon emitted from the given voxel outside of sector S will have a very low probability of reaching detector 104 through collimator 108.
FIG. 1m schematically illustrates the emission rate of the volume U, as a function of time, given that a radioactive material of a specific half-life has been administered at a time T0.
A view may thus be defined as a group of nonzero probabilities of detecting a radioactive emission associated with all the voxels that form sector S (FIG. 1l).
A view is sometimes referred to as a projection, and the two terms are synonymous. Furthermore, a view defined over the sector S can be naturally extended to be defined over the group of all voxels in the volume U, by simply associating a zero probability with every voxel outside the sector S. This enables applying mathematical operations over the entire volume U.
The viewing parameters, which are the factors affecting the detection of radioactive emissions, are as follows:

    i. Location and Orientation Parameters:
    
        a location and an orientation in a six-dimensional space, P1(x1; y1; z1; ω1; θ1; σ1), with respect to the origin P0(x0; y0; z0; ω0; θ0; σ0) of the volume U, in which the detecting unit 102 is positioned;
    
    
    ii. Detector-unit Parameters:
    
        the detector unit geometry (e.g. length L, diameter D, and/or collection angle δ), which together with the location and orientation parameters, P1(x1; y1; z1; ω1; θ1; σ1) with respect to the origin P0(x0; y0; z0; ω0; θ0; σ0) define the sector S;
        the septa thickness τ, which affects the probability that a photon that enters the collimator will reach the detector as well as crosstalk effects (which occur when a photon which entered a neighboring cell penetrates the collimator and reaches the detector), hence, the detector efficiency
        the detector material, which affects the detector efficiency; and
        the detector thickness τd, which affects the detector's stopping power, hence, its efficiency;
    
    
    iii. Attenuation Parameters:
    
        attenuation properties of all the voxels within the sector S, as they affect the probabilities that radioactive emissions from a specific voxel within the sector S will reach the detector, wherein different voxels within the sector S may have different attenuation properties, since several types of tissue may be involved;
    
    
    iv. Time Parameters:
    
        since the radiopharmaceutical decays with a specific half-life, the time ti since administration, and the duration of the measurement Δt1, affect the number of emissions that occur during the radioactive-emission measurement.
    
    
    v. Radiopharmaceutical Parameters:


The half-life t1/2, of the radiopharmaceutical, the types of radioactive emission, whether gamma or beta, and the energies of the radioactive emission affect the probability of detection.
Some of these viewing parameters are fixed for a particular situation. Specifically, the tissue attenuation parameters are given. Additionally, the time t1 since administration of the radiopharmaceutical is generally governed by the blood pool radioactivity, since it is generally necessary to wait until the blood pool radioactivity dies out for low-level detection to be possible. For the remaining viewing parameters, optimization may be carried out.
To recapitulate the problem describe above, an intensity distribution I, in terms of radioactive emissions per seconds, is defined over the volume U, forming our input space. U comprises a set of basic elements u (e.g., pixels in two dimensional spaces, voxels in three dimensional spaces), and I(u) is the intensity in a given basic element u∈U. An inverse (or reconstruction) problem arises when one cannot sample directly from I, but can sample from a given set of views Φ. A projection φ∈Φ is defined by the set of probabilities {φ(u):u∈U}, where φ (u) is the probability of detecting a radioactive emission from a voxel u, as defined by viewing parameters, such as the physical and geometrical properties of the detecting unit, as well as the attenuation parameters of the viewed volume U, and the time parameters. A measurement is obtained by choosing a view φ∈Φ, and then sampling according to the viewing parameters.
In the following analysis, I is the intensity of a radioactive substance, and the viewing parameters include the geometrical properties of a collimated detecting unit and the detecting unit's position and orientation with respect to volume U. The number of radioactive emissions counted by the detecting unit within a time interval is a Poisson distribution, where (p (u) is the detection probability of a photon emitted from voxel u∈U and the mean of the distribution is the weighted sum Σu∈uφ(u)I(u).
The projection set is thus defined by a matrix Φ, whose rows are the projections of the chosen views. I is a vector of densities (specified per each element in U), and ΦI is a vector of respective effective intensity levels for the views in the set. A vector of measurements y is obtained by a random sample from each view (according to the associated Poisson distribution). As discussed above, there are various known reconstruction methods that provide estimators for I given the projections Φ and the measurements y.
We consider here the following problem: Assume that there is a large pool of candidate views to choose from, but due to time restrictions or other restrictions, we are limited to a specific number of views N. Which are the best N projections in terms of the quality of the reconstruction? It is further assumed that the pool of projections may be constrained, and hence general sampling theorems (e.g., Radon Transform) cannot be applied. For instance, we consider a scenario in emission tomography where the detecting unit can be located on top of one face of a given volume but not on the others. In such cases, prior-art methods do not clearly establish what is the best scanning scheme, in order to provide the best reconstruction of the radioactive intensity distribution of the volume.
The following embodiments are of a method for selecting a set of optimal views of a volume to be imaged, and are not confined to a specific reconstruction algorithm. View selection is preferably based on information theoretic measures that quantify the quality of the data fed to the reconstruction algorithm.
Reference is now made to FIG. 2, which is a simplified flowchart of a method for selecting a set of optimal views of a volume to be imaged, according to a first preferred embodiment of the present invention. In step 200, a volume is provided, and is preferably represented as a collection of voxels. In step 210, a collection of views of the volume is provided. Each view reflects a possible data collection option, from which the goal is to select a set of views which together provide the desired image reconstruction quality. Each view is associated with one or more viewing parameters, such as the location and orientation of the detecting unit with respect to the volume.
The viewing parameters preferably further contain at least one of the following detecting unit characteristics: detector material, detector thickness, collimator length, diameter, septa thickness, and collection angle. When the viewing parameters include detecting unit characteristics, such as those discussed above, the view may be said to incorporate a model of a detecting unit.
In the preferred embodiment, the viewing parameters include a detection duration parameter, which corresponds to the duration of the measurement is performed (at the associated location, orientation, etc.). Increasing the detection duration generally improves the probability of the detection for those voxels in the detecting unit's collection angle.
Preferably, the viewing parameters include a type of radiopharmaceutical. The type of radiopharmaceutical determines the type of radioactivity being detected, and consequently the probability of detection.
Preferably, the viewing parameters include a time of detection, tD, relative to an initial time t0. As discussed above, in conjunction with FIG. 1m, during radionuclide imaging a radiopharmaceutical is administered to a patient, and after a suitable interval, to allow the radiopharmaceutical to disperse throughout the body, measurements are taken. Since the radiopharmaceutical decays at a specific rate after administration, depending on its half-life, the length of time between when the radiopharmaceutical is administered and the time of measurement affects the radioactive emission detection of the given view.
The view set is preferably tailored to correspond to the actual limitations and constraints likely to be encountered when collecting data for a given object. For example, in medical applications the detecting unit can generally view the body structure only from certain distances and orientations, which are determined by the patient's anatomy and the structure of the probe. The view set may therefore be designed to contain views having only those viewing parameter values consistent with attainable distances and orientations. The view set may also be designed to contain views having only those viewing parameter values suitable for a given measurement scenario, for example having identical values for the type of radiopharmaceutical and time since administration.
Preferably, the collection of views represents a quantized continuum of views. The view collection thus reflects the detection probability distribution for a detecting unit making periodic measurements while moving along a trajectory.
Reference is now made to FIG. 3, which shows a non-limiting example of a volume 300 with two views, V1 and V2. Volume 300 divided into twenty-seven cube-shaped voxels (labeled 1-27). Each view reflects a number of viewing parameters, in the case shown a location (in the XYZ coordinate system), orientation (ω, θ and σ) and collection angle δ. The viewing parameters determine which voxels in volume 300 are within a detecting unit's collection angle, and generally affect the probability of detection for each voxel. The probability of detection may be affected by additional factors, including the attenuation coefficients within the volume.
During data collection, the probability of detection for each voxel is dependent on the parameters outlined above. In the preferred embodiment, a respective projection is calculated for each view, giving the view's detection probability distribution (i.e. the detection probability for each voxel of the volume). For a given view, the associated projection will have significant detection probabilities only for those voxels within the sector defined by the detecting unit's collection angle and location and orientation, as illustrated in conjunction with FIG. 1l. 
The detection probability distribution for each view, that is the group of probabilities for each voxel, for a given view, is calculated according to techniques known in the art for determining the detection probability of a radioactive emission from a given voxel, under the constraints specified by the viewing parameters, for example, based on computer simulations of the geometry and the other viewing parameters, delineated hereinabove.
Generally, more distant voxels will have a lower probability of detection than closer voxels along the same line of sight. The volume attenuation coefficient may be constant or may vary over the volume. Thus, different sets of views may be produced for a single sector, by defining volumes with differing attenuation coefficients. For example, bone tissue and muscle tissue have different attenuations. Anatomical knowledge of the body structure being imaged may be used to develop a model of the volume U with a non-uniform attenuation that reflects the expected attenuation of the given body structure.
Referring again to FIG. 2, in step 220 a scoring function is provided. The scoring function rates the information that is obtainable from the volume using any set of views (containing at least one view) taken from the collection of views. Several examples of scoring functions based on information-theoretic measures are discussed in detail below. Preferably, the scoring function is a function of the detection probability distribution, as given by the projections. Several preferred embodiments of the scoring function, are discussed in detail below.
In step 225, sets of views are formed from the collection of views. A score is then calculated for each of the sets.
In step 230, the scores calculated in step 225 are used to select one of the formed sets of views. A given scoring function may be used to select a set in a number of ways. In a first preferred embodiment, a required number of views is specified, and the highest scoring set with the specified number of views is selected. In a second preferred embodiment, the user may specify a minimal score which is known to provide satisfactory information quality, and select the smallest set which provides the specified score. However given a large collection of views the required number of calculations may be prohibitive. A third preferred embodiment used to reduce the computational burden is the greedy algorithm embodiment described for FIGS. 8-9 below.
Since each view is associated with known values of the viewing parameter(s), selecting a view effectively specifies known viewing parameter values. The selected set of views thus defines a set of viewing parameter values, which may be used to collect data which yields a high-quality reconstruction of the emission distribution of the volume.
As discussed above, the scoring function is a measure of the quality of information which may be gathered for the volume using the given set of views. In a first preferred embodiment, the scoring function implements a uniformity criterion, to ensure uniform coverage of the volume. It is often desired to obtain a uniform reconstruction quality among a given set of voxels W⊂U, where W is the set of voxels for which it is desired to obtain uniform detection. Note that by selecting the appropriate W, the uniformity criterion is applied to all or a portion of the body. The uniformity criterion ensures that the spread of the total influence of each element on the set of measurements is as uniform as possible. The uniformity criterion depends only on the collection of views Φ and requires no assumptions on the distribution I. For a set Φ of projections, the total influence of an element, u, is given by Σ100 ∈Φφ (u). Normalizing these values to P101(u), such that




  
    
      
        ∑
        
          u
          ∈
          W
        
      
      ⁢
      
        
          P
          Φ
        
        ⁡
        
          (
          u
          )
        
      
    
    =
    1
  
  ,




a probability measure is obtained for which the entropy H(Φ) can serve as a uniformity measure:





  
    
      
        
          H
          ⁡
          
            (
            Φ
            )
          
        
        =
        
          -
          
            
              ∑
              
                u
                ⁢
                
                  
                
                ∈
                W
              
            
            ⁢
            
              
                P
                Φ
              
              ⁢
              log
              ⁢
              
                
              
              ⁢
              
                
                  P
                  Φ
                
                ⁡
                
                  (
                  u
                  )
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




The selected set Φ* is the set (containing the required number of views) that satisfies:

Φ*=arg max101 H(Φ)  (13)

Reference is now made to FIG. 4, which illustrates the concept of uniform coverage of a volume. Volume 400 consists of twenty-seven cube-shaped voxels, including voxels 410 and 420. A, B, C and D are three views of volume 400, showing the detector position and orientation for each view. For the uniformity criterion, it is desired that the overall influence of voxels 410 and 420 be approximately equal.
Assume that the probabilities of detection are as follows:












View
Voxel 410
Voxel 420

















A
0.6
0


B
0.2
0.5


C
0
0.3


D
0
0.1









Consider two possible sets of views: set {A, B, C} and set {B, C, D}. For set {A, B, C}, the total contribution of voxel 410 is 0.8 (0.6+0.2+0) and of voxel 420 is 0.8 (0+0.5+0.3). Normalizing these values for set {A, B, C} gives a probability set of [0.5,0.5]. For set {B, C, D}, the total contribution of voxel 410 is 0.2 (0.2+0+0) and of voxel 420 is 0.9 (0.5+0.3+0.1). Normalizing these values for set for set {B, C, D} gives a probability set of [0.18,0.82]. Thus:

H({A, B, C})=−(0.5*log20.5+0.5*log20.5)=−(−0.5-0.5)=1

H({B, C, D})=−(0.18*log20.18+0.82*log20.82)=−(−0.44-0.07)=0.51

Set {A, B, C} is thus seen to provide a more uniform coverage of volume 400 than set {B, C, D}.

In the above, the scoring function is defined independently of the emission intensity of the volume. However, scoring functions may be defined which calculate the score for a given set in relation to one or more emittance models. An emittance model is a representation of a specific radioactive-emission intensity distribution within the volume U, so as to model organ targets, such as hot regions, of a radioactive emission intensity, higher than the background level, regions of low-level radioactive emission intensity, which is nonetheless above the background level, and cold regions, of a radioactive emission intensity, lower than the background level. Given an object or class of objects, emittance models may be devised to reflect expected or typical emission patterns for the given object. The information quality given by a set of views may thus be measured in relation to expected emitted intensities from the volume.
Reference is now made to FIG. 5, which is a simplified flowchart of a method for selecting a set of optimal views of a volume to be imaged, according to a second preferred embodiment of the present invention. A volume is provided in step 500 and a collection of views is provided in step 510, essentially as described above. The current method differs from the method of FIG. 2 by the addition of step 515, in which a set of one or more emittance models is provided. An emittance model specifies the radiative intensity of each voxel in the volume. As discussed above, some of the viewing parameters affect the radiative intensity of the voxels in the volume, for example the type of radiopharmaceutical and the time since administration of the radiopharmaceutical. Therefore, the emittance models provided in step 515 preferably correspond to the relevant viewing parameters.
Once the emittance models are provided, a scoring function is provided in step 520. Sets of views are formed in step 525, and each of the formed sets is scored with the scoring function. In step 530, a set of views is selected from the collection of views based on the calculated scores.
Developing an emittance model for a particular object involves analyzing known information about the object to determine expected emission patterns of the object. In the preferred embodiment, the volume corresponds to a body structure. Preferably the body structure is one of: a prostate, a heart, a brain, a breast, a uterus, an ovary, a liver, a kidney, a stomach, a colon, a small intestine, an oral cavity, a throat, a gland, a lymph node, the skin, another body organ, a limb, a bone, another part of the body, and a whole body. In order to develop a model of a particular body structure, for example a prostate, many factors may be considered. Physical aspects, such as the size and shape of the prostate and the position of the prostate within the torso may be considered, as well as medical knowledge regarding typical emissions from healthy and diseased prostates. Additional information may concern variations between individuals, such as age, weight, percentage of body fat, and the like.
Reference is now made to FIG. 6, which shows four models of a prostate emittance model. Three views are given for each of the emittance models shown. Each of the views is a maximum intensity projection (MIP) along a different one of the three axes. For example, in an X-Y projection the intensity of a given point is taken as the maximum intensity for that point along a line parallel to the z-axis. Thus the volume in effect becomes “transparent”, and the maximum intensity regions are shown clearly. Variations in emission levels are indicated by differences in shading. The emittance model is shaped as an ellipsoid, the typical shape of a prostate. Since a diseased prostate is generally characterized by one or more hot regions, each of the emittance models shown has a number of high-emittance portions (two hot regions in Models A-C and three hot regions in Model D). Each high-emittance area is an ellipsoid, with a size of approximately 1 cubic centimeter. The intensity of the modeled organ targets varies randomly from two to eight times brighter than the surrounding volume.
In the preferred embodiment, one or more of the emittance models contains at least one high-emittance portion (i.e. hot region). A prostate containing a tumor, for example, may be modeled as an ellipsoid volume with one or more high-emittance portions. A high-emittance portion is characterized by an intensity that is greater than the background intensity by a factor of at least (1+α), where α is a parameter specified by the user. In practice, a hotspot is usually detectable only if the radiation levels within the hotspot are higher than the background level by a factor of 1.5-2. α is therefore typically defined between 0.5-1. However, the detectability of a hotspot rises as the radioactive intensity of the body rises, raising the photon count. Thus, a lower value of α may be used when high-intensity emittance models are used.
In the preferred embodiment, one or more of the emittance models contains at least one low-emittance portion. A low-emittance portion is characterized by an intensity that is lower than the background intensity by a factor of at least (1+β), where β is a parameter specified by the user. In heart imaging, for example, the locations of interest are low-emittance portions of the structure, indicating non-functional tissues. A diseased heart may therefore be modeled as a heart-shaped volume with low-emittance portions.
Note that an emittance model need not contain high- or low-emittance portions, but may have a uniform intensity or a slowly varying intensity. Following are two more embodiments of scoring functions, both of which include considerations of the emission pattern of the volume, in light of the emittance models provided in step 515.
Following are a number of preferred embodiments of scoring functions which score view sets in relation to one or more emittance models.
In a second preferred embodiment, the scoring function implements a separability criterion. Separability is a measure of the extent to which the measurements that are obtained from each pair of models can be distinguished from one another.
The concept of separability is illustrated in FIGS. 7a-7c, each of which shows an emittance model of a given volume 700. Each of the emittance models contains two high-emittance portions (hot regions), 710 and 720, which are located in respectively different locations in each of the models. It can be seen that the hot regions in emittance models 7b and 7c are in similar portions of the volume, as opposed to the hot regions in model 7a. It may therefore be difficult to distinguish between reconstructions of emittance models 7b and 7c. The separability criterion ensures that the selected set includes views which provide reconstructions which distinguish between emittance models 7b and 7c. 
Letting I be the emittance model set, a measure for the dissimilarity of any two given densities in I is defined. Since most state-of-the-art estimating algorithm are aimed at finding ML estimators, in the current example the scoring function is based on the likelihood function. The likelihood of an estimator of I, given a set of Poissonian measurements y is:




  
    
      
        
          L
          ⁡
          
            (
            I
            )
          
        
        =
        
          
            ∑
            t
          
          ⁢
          
            {
            
              
                -
                
                  
                    ∑
                    u
                  
                  ⁢
                  
                    
                      
                        φ
                        t
                      
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                    ⁢
                    
                      I
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                
              
              +
              
                
                  y
                  t
                
                ⁢
                ln
                ⁢
                
                  
                    ∑
                    u
                  
                  ⁢
                  
                    
                      
                        φ
                        t
                      
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                    ⁢
                    
                      I
                      ⁡
                      
                        (
                        u
                        )
                      
                    
                  
                
              
              -
              
                ln
                ⁡
                
                  (
                  
                    
                      y
                      t
                    
                    !
                  
                  )
                
              
            
            }
          
        
      
    
    
      
        (
        14
        )
      
    
  




For separability, it is desired that this measure be different for each I∈I. Since the measure is a random variable that depends on the actual measurements, all possible pairings of emittance models should be examined to ensure that the resulting distributions are separable. A scoring function that captures this separability is given by the square of the difference between the means of the distributions normalized by the sum of their variances:




  
    
      
        
          
            SEPARABILIITY
            Φ
          
          ⁡
          
            (
            
              
                I
                1
              
              ,
              
                I
                2
              
            
            )
          
        
        =
        
          
            
              
              
                
                  E
                  ⁢
                  
                    
                  
                  ⁢
                  
                    L
                    ⁡
                    
                      (
                      
                        I
                        1
                      
                      )
                    
                  
                
                -
                
                  E
                  ⁢
                  
                    
                  
                  ⁢
                  
                    L
                    ⁡
                    
                      (
                      
                        I
                        2
                      
                      )
                    
                  
                
              
              
            
            2
          
          
            
              Var
              ⁢
              
                
              
              ⁢
              
                L
                ⁡
                
                  (
                  
                    I
                    1
                  
                  )
                
              
            
            +
            
              Var
              ⁢
              
                
              
              ⁢
              
                L
                ⁡
                
                  (
                  
                    I
                    2
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




The expectations and variances in Equation 15 are taken over random measurements y, sampled from the true intensity I1 (note that the measure is not symmetric).
Since the true (unknown) intensity can be any I∈I, a projection set Φ* that maximizes the worst-case separability is desired. That is:

Φ*=arg maxΦminI1,I2∈I SEPARABILITY101 (I1,I2)  (16)

Scoring for separability is based on the minimum separability obtained with a given set of views for all of the possible pairings of emittance models from the set of emittance models, thereby enabling defining a desired resolution in more than one direction, or in more than one portion of the volume. All of the emittance models are modeled on a substantially identical volume. The emittance models preferably differ from one another in the modeled organ targets, where the modeled organ targets are separated by a difference of at least the required resolution (where the displacement which produces the required resolution is denoted delta herein). Substantially identical sets of views are formed from the collection of views, and each of the formed sets is scored with respect to each of the pairs. One of the sets of views is selected, based on the minimum or average score for the plurality of pairs.
For example, assume the set of emittance models contains the three models 7a-7c. A separability score is calculated for a given formed set of views by applying Equation 15 to all three pairs 7a/7b, 7a/7c, and 7b/7c. The lowest of the three calculated values is taken as the separability score for the formed set. Once a separability score has been calculated in such manner for each of the formed sets of views, the view set having the highest separability is selected.
The separability criterion may be used to ensure that a required resolution is obtained in all or a portion of the body. In a preferred embodiment, view set selection for separability is performed utilizing a set of emittance models consisting of one pair of emittance models having substantially identical volumes but with different modeled organ targets. The modeled organ targets are separated by a delta in a given direction so as to define a required resolution in that direction and portion of the volume U. Substantially identical sets of views are formed from the collection of views, and scored with respect to the pair of emittance models, using a scoring function based on the separability criterion, and one of the sets of views is selected based on the separability scores. The selected set is thus the set which provides the optimum resolution in the given direction and in the vicinity of the modeled organ targets.
A similar approach may be used to ensure resolution in more than one direction and/or portion of the volume U. Consider for example, a pair of models of substantially identical volumes, as follows: The model of FIG. 7d, which schematically illustrates the volume U, having the modeled organ target HS, whose center is at a location (x;y;z)HS, and the model of FIG. 7e, which schematically illustrates the volume U, having the modeled organ target HS′, whose center is at a location (x;y;z)HS′. FIG. 7e also shows modeled organ target HS of FIG. 7d superimposed over the present emittance model to illustrate that HS′ is somewhat displaced from HS, along the x-axis, and the displacement, is denoted as delta1 in the present example. The displacement delta may be measured, for example, in mm.
An optimal set of views, from the standpoint of separability, is that which will best distinguish between the model of FIG. 7d and that of FIG. 7e. Thus, a score, in terms of separability is given for the pair of models, and relates to a resolution as defined by the difference between the models of the pair. In the present example, the difference is delta1 along the x-axis, around the locations of HS and HS′, so the score given by the information theoretic measure of separability will relate specifically to a resolution as defined by delta1 along the x-axis, around the locations of HS and HS′. Other portions of the volume U and other directions may have different resolutions.
For example, consider the model of FIG. 7f, which schematically illustrates the volume U, having the modeled organ target HS′′, whose center is at a location (x;y;z)HS′′, and shows HS of FIG. 7d and HS′ of FIG. 7e superimposed over the present emittance model. HS′′ is displaced from HS, along the z-axis, a displacement delta2. and additionally, HS′′ is displaced from HS′, along the x- and z- axes, a displacement delta3.
Scores, in terms of separability, may be given to all the paring combinations, that is the models of FIGS. 7d-7e, relating to delta1; the models of FIGS. 7d-7f, relating to delta2, and the models of FIGS. 7e-7f, relating to delta3. An optimal set of views may be selected based on its minimum or average scores for all the pairing combinations; for example, the optimal set may be that whose average score for all the pairing combinations is the highest. Alternatively, a weighted average may be applied.
In an additional preferred embodiment, the scoring function implements a reliability criterion, which is a measure of how reliably the intensity distribution of a given object may be reconstructed from the sampled views. Since the input to the reconstructed algorithm is a random sample, the output estimator is also random. A desired property of this output is that it be reliable in the sense that similar estimators for different projected samples (i.e. different sets of measurements) of the same input intensity are obtained with high confidence.
The Fisher Information, FΦ(I) is a measure, known in the art, which is used to evaluate the expected curvature of the likelihood of a model I (taken over measurements sampled from the model I). The Fisher Information is defined as:

F101(I)=−E∇2L(I)  (17)

The derivatives are taken with respect to the parameters of the intensity I, and the expectation is taken with respect to the random counts. Intuitively, a sharper curvature means that a maximum-likelihood estimation algorithm is more likely to produce a low-variance estimator. Indeed, this property is captured by the Cramer-Rao lower bound, which states that the inverse of the Fisher Information is a lower bound for the variance of any unbiased estimator, where an estimator f of the intensity I is unbiased if Ef(y)=I.
The Fisher information provides a value, FΦ(I)u,v, for each pair of voxels u and v. To provide a single measure for the reliability of the estimator, the average level, worst case, or other reasonable measure may be taken over the voxels. In the current example, the scoring function is based on the average Fisher information. Starting with a set of emittance models to be used by the estimating algorithm to provide a reliable estimator, the average of the above measure is maximized over the entire set, defining the selected set Φ* as:




  
    
      
        
          Φ
          *
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              max
              φ
            
            ⁢
            
              
                ∑
                
                  I
                  ∈
                  I
                
              
              ⁢
              
                
                  ∑
                  
                    u
                    ∈
                    U
                  
                
                ⁢
                
                  
                    [
                    
                      
                        F
                        Φ
                      
                      ⁡
                      
                        (
                        I
                        )
                      
                    
                    ]
                  
                  
                    u
                    ,
                    u
                  
                
              
            
          
        
      
    
    
      
        (
        18
        )
      
    
  




Alternately, a set may be chosen to minimize the inverse of the Fisher information, by selecting for:




  
    
      
        
          Φ
          *
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              φ
            
            ⁢
            
              
                ∑
                
                  I
                  ∈
                  I
                
              
              ⁢
              
                
                  ∑
                  
                    u
                    ∈
                    U
                  
                
                ⁢
                
                  
                    [
                    
                      
                        
                          F
                          Φ
                        
                        ⁡
                        
                          (
                          I
                          )
                        
                      
                      
                        -
                        1
                      
                    
                    ]
                  
                  
                    u
                    ,
                    u
                  
                
              
            
          
        
      
    
    
      
        (
        19
        )
      
    
  




Since inverting FΦ(I) may be computationally expensive, the [FΦ(I)−1]u,u term in Equation 19 may be replaced with 1/[FΦ(I)]u,u (thus neglecting the off-diagonal elements of the Fisher Information matrix FΦ(I)). Note that Equations 18 and 19 are not mathematically equivalent, and may therefore yield different selected sets.
In the preferred embodiment, scoring is performed using the reliability criterion, and two or more emittance models are provided, having substantially identical volumes, but different modeled organ targets. Substantially identical sets of views are formed for all the emittance models, and each set is scored for reliability. One of the sets of views is then selected based on the average score for all the of the emittance models.
In a fourth preferred embodiment, a weighted combination of several information theoretic measures is used. For example, a plurality of models may be provided, all having substantially identical dimensions and volumes, as follows:
i. a first model, free of radioactive emission sources, as seen in FIG. 7g, for scoring sets of views in terms of uniformity;
ii. a pair of models with slightly different distributions of radioactive emission sources, as seen in FIGS. 7h and 7i, for scoring sets of views in terms of separability;
iii. a model with a given distribution of radioactive emission sources, as seen in any one of FIGS. 7h, 7i or 7j, for scoring sets of views in terms of reliability.
Identical sets of views may be applied to all the models, and each view may be scored in terms of uniformity, separability, and reliability. An optimal set of views may be selected based on a summation of the three scores, or based on a weighted average of the three scores, where the relative weight given to each criterion reflects the relative importance of each measure per the given application.
The scoring function is preferably defined in accordance with one of the following: worst case effectiveness for the given view over the volume, average effectiveness for the given view over the volume, worst case effectiveness for the given view over the set of emittance models and average effectiveness for the given view over the set of emittance models.
As discussed above, selecting the best set of size N from amongst a large set of candidate projections is computationally complex. Since the size of the collection of views and of the required set may be large, a brute force scheme might not be computationally feasible.
In an additional preferred embodiment, a so-called “greedy algorithm” is used to incrementally construct larger and larger sets, until a set containing the required number of views is obtained. The algorithm starts with an initial set, and in each iteration adds the view that yields the maximum improvement of the set score (hence the name “greedy”).
In theoretical terms, assume p(*) is the quality measure we are using for the view selection, and assume without loss of generality that we are trying to maximize this measure. We gradually build a set W of projections as follows. We start with an empty set W=Ø, and at every stage choose the projection that maximizes the quality measure when added to the current set:

W←arg maxW′{ρ(W′)|W′=W∪{φ(},φ∈Φ}  (21)

In other words, during a given iteration, a respective score is calculated for a combination of the previous set with each of the views which is not a member of the current set. The current set is then expanded by adding the view which yielded the highest respective score, and the expanded current set serves as the input to the following iteration. Thus the number of times the scoring function is calculated per iteration drops from iteration to iteration. For a large initial collection of views, the greedy algorithm reduces the total number of computations required for set selection.
Reference is now made to FIG. 8, which is a simplified flowchart of an iterative “greedy” method for selecting a set of views, according to a preferred embodiment of the present invention. In step 800 an initial set of views is established from the collection of views. In the preferred embodiment, the initial set is an empty set. In step 810 the view set is incrementally increased by a single view during each iteration, until a set containing the required number of views has been selected.
Reference is now made to FIG. 9, which is a simplified flowchart of a single iteration of the view selection method of FIG. 8, according to a preferred embodiment of the present invention. The method of FIG. 9 expands the current set of views by a single view. The method begins with a current set of views, which is the initial set (step 800 above) for the first iteration, or the set formed at the end of the previous iteration (step 920 below) for all subsequent iterations. In step 900, a respective expanded set is formed for each view not yet in the current set of views. A given view's expanded set contains all the views of the current set as well as the given view. In step 910, a respective score is calculated for each of the expanded sets using the scoring function. Finally, in step 920, the current set is equated to the highest-scoring expanded set by adding the appropriate view to the current set. The newly formed current set serves as an input to the subsequent iteration, until the desired number of views is attained.
Following is a further preferred embodiment of a view selection method, in which multiple view sets are first formed from one or more scoring functions, and then a final selection is made of one of the resulting sets.
Reference is now made to FIG. 10, which is a simplified flowchart of a method for selecting a set of optimal views of a volume to be imaged, according to a third preferred embodiment of the present invention. In step 1000, a volume to be imaged is provided. The volume preferably corresponds to a body structure. In step 1010, a collection of views for performing radiation detection of a volume is provided. Each of the views is associated with at least one viewing parameter. Preferably the viewing parameters consist of at least one the following: detector location, detector orientation, viewing angle, material, thickness, collimator length, septa thickness, cell size, detection duration, time of detection, and a type of radiopharmaceutical.
In step 1020 at least one scoring function is provided. Each scoring functions is for scoring sets of views, essentially as described above. As discussed above, a single scoring function may be used to select several sets of views, where each set of views contains a different number of views.
In step 1030, multiple sets of views are formed from the collection of views, using the scoring function(s) provided in step 1020. In a first preferred embodiment, each of the sets is formed using a different one of the scoring functions. In an alternate preferred embodiment, one or more of the scoring functions are used to form more than one set of views, where sets formed with the same scoring function have differing numbers of views.
In step 1040, a selected set of views is obtained from the sets formed in step 1030. Knowledge about the conditions under which a particular set of measurements will be taken may be used to determine the optimal final set of views for a given data collection scenario.
In a first preferred embodiment, the final set of views is obtained by choosing one of the sets formed in step 1030 using a set selection criterion. For example, a respective set is formed in step 1030 for each of the uniformity, separability, and reliability criteria independently. A set selection criterion which calculates an overall performance rating for a given set taking all three criteria into account is defined, and the formed set with the highest overall rating is selected as the final set.
In another preferred embodiment, the selected set of views is obtained by merging the sets formed in step 1030 according to the relative importance of the respective scoring function used to form each set.
In the preferred embodiment, the method further consists of providing at least one emittance model representing the radioactive-emission density distribution of the volume, and scoring with at least one of the scoring functions of step 1020 is performed in relation to the emittance models. Preferably the emittance model(s) represent a body structure.
As discussed above, since each view is associated with one or more parameters, the selected set yields a group of optimal parameter values for performing effective detection of the intensity distribution of a volume. For example, if each view is associated with a view location parameter the selected set defines a set of locations for collecting emission data from an object, in order to provide a high-quality reconstruction of the intensity distribution of the object.
Reference is now made to FIG. 11, which is a simplified block diagram of a set selector for selecting a set of optimal views of a volume to be imaged, according to a first preferred embodiment of the present invention. Set selector 1100 consists of volume provider 1110, view provider 1120, scoring function provider 1130, and set selector 1140. Volume provider 1110 provides the volume to be imaged. View provider 1120 provides a collection of views of the volume to be imaged, where each of the views is associated with at least one viewing parameter. Scoring function provider 1130 provides a scoring function, which can score any set of view(s) from the collection with a score that rates information obtained from the volume by the set. Set selector 1140 utilizes the volume, views, and scoring functions to select a set from the collection.
Preferably, set selector 1100 further contains projection calculator 1150 which calculates a detection probability distribution for each of the views, in accordance with the respective viewing parameters and a volume attenuation coefficient.
Reference is now made to FIG. 12, which is a simplified block diagram of a set selector for selecting a set of optimal views of a volume to be imaged, according to a second preferred embodiment of the present invention. Set selector 1200 consists of volume provider 1210, view provider 1220, scoring functions provider 1230, sets former 1240, and set chooser 1260. Volume provider 1210 provides the volume to be imaged. View provider 1220 provides a collection of views of the volume to be imaged, where each of the views is associated with at least one viewing parameter. Scoring functions provider 1230 provides one or more scoring functions. Each of the scoring functions can be used to calculate a score for any set of view(s) from the collection. The calculated score rates the information obtained from the volume by the given set. Sets former 1240 uses the various scoring functions to form multiple sets of views from the collection of view, as discussed above for FIG. 10. Set obtainer 1260 obtains a final set of views from the sets of views formed by sets former 1240.
Preferably, set selector 1200 further contains projection calculator 1250 which calculates a detection probability distribution for each of the views, in accordance with the respective viewing parameters and a volume attenuation coefficient.
The above described set selection methods may each be embodied as a computer program stored on a computer-readable storage medium. In a first preferred embodiment, the computer-readable storage medium contains a set of instructions for selecting a set of optimal views of a volume to be imaged, consisting of the following routines. A volume provision routine provides the volume to be imaged. A view provision routine provides a collection of views of the volume to be imaged, each of the views being associated with at least one viewing parameter. A scoring function provision routine provides a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set. The set formation routine forms sets of views from the collection of views, and scores them using the scoring function. The set selection routine selects a set of views from the collection of views, based on the scoring function.
In a second preferred embodiment, the computer-readable storage medium contains a set of instructions for selecting a set of optimal views of a volume to be imaged, consisting of the following routines. A volume provision routine provides the volume to be imaged. A view provision routine provides a collection of views of the volume to be imaged, each of the views being associated with at least one viewing parameter. A scoring functions provision routine provides at least one scoring function. Each of the scoring functions is usable to calculate a score for any set of at least one view taken from the collection of views. The score rates information obtained from the volume by the set of views. A sets formation routine selects multiple sets of the views using the scoring function(s), and a set obtaining routine obtains a final set of views from the sets formed by the sets formation routine.
It is expected that during the life of this patent many relevant detection probes, detector types, radiation-based detection systems and algorithms will be developed and the scope of the corresponding terms are intended to include all such new technologies a priori.
As used herein the term “about” refers to±10%.
Additional objects, advantages, and novel features of the present invention will become apparent to one ordinarily skilled in the art upon examination of the following examples, which are not intended to be limiting. Additionally, each of the various embodiments and aspects of the present invention as delineated hereinabove and as claimed in the claims section below finds experimental support in the following examples.
EXAMPLES
Reference is now made to the following examples, which together with the above descriptions, illustrate the invention in a non-limiting fashion.
FIGS. 13-18 illustrate view set selection results for the uniformity criterion. The selected views are chosen from a collection of views using an entropy-based scoring function. The specified viewing parameters are the detector location and the detector type (having a given detector size, D, and collimator length, L). Each view is defined for one of three detector types, large (D=10, L=25), medium (D=5, L=12.5) or small (D=2.5, L=6.25).
FIG. 13 shows a selected set of 500 views. The location of each view in the XY surface is shown, along with the associated detector type. As expected, the selected views are distributed relatively evenly over the XY surface and over the three detector types shown.
FIGS. 14a-14c show the resulting coverage provided by the selected views, from the top, side, and front aspects of the volume respectively. Even coverage is indicated by an even hue in the figure. Uniform coverage is well obtained for the side and front aspects, but is less successfully obtained for the top aspect.
FIG. 15 illustrates the distribution of the detector types as a function of the number of views in the set. The large detectors, with their high sensitivity but low resolution, predominate only for small selected sets. As the size of the selected set increases the number of small detectors increases, improving the coverage of the collected data.
FIGS. 16-18 show the value of the entropy measure, used for the uniformity criterion, for each of the detector types, as the number of views increases. For sets including up to 400 views, the large detector gives the highest entropy level (i.e. enables the most uniform coverage). However, for selected sets containing more than 400 views the highest entropy value is obtained with the small detector. This is in accordance with FIG. 15, which shows an increasing proportion of small detector views as the size of the selected set increases.
FIGS. 19-24 illustrate view set selection results for the separability criterion. The viewing parameters include detector location, detector orientation, and one of three detector types, large (D=10, L=25), medium (D=5, L=12.5) or small (D=2.5, L=6.25).
FIGS. 19-21 show selected sets containing 100 views having a single detector type, for large, medium, and small detectors respectively. Each view shows the detector location in the XY surface and the detector orientation (arrow), as seen from above where the shorter the arrow is the more downward it is pointing. The figures show that the selected set for the large detectors contains views which are mostly in the center of the XY surface and pointing directly in to the volume, whereas the selected set for the small detectors has the detectors located around the periphery of the volume and oriented at an angle towards the center of the volume.
FIGS. 22-24 show a selected set containing 1000 views selected for the separability criterion. The selected set includes views of all three detector types. The selected set contains 55 large-detector views (FIG. 22), 370 medium-detector views (FIG. 23), and 575 small-detector views. Similarly to FIGS. 19-21, as the detectors decrease in size they are physically more dispersed over the XY surface.
FIGS. 25-32 illustrate view set selection results for the reliability criterion, based on the Fisher information measure. The specified viewing parameters are the location (on the XY surface) and the detector type. Each view is defined for one of four detector types, large (D=10, L=25), medium (D=5, L=12.5), small (D=2.5, L=6.25), and extra-focused (D=5, L=25).
FIGS. 25-29 show selected sets based on the Fisher information measure, containing 100, 200, 500, 1000, and 2000 views respectively. As can be seen, for a small number of views the detectors are distributed around the periphery of the volume. As the number of views in the selected set increases, the detector move towards the center of the XY surface. In generally the selected sets with a greater number of views contain a higher proportion of small detector views than do the selected sets with fewer views. In particular, it is seen in FIG. 29 that the large detectors are concentrated in the center of the XY surface, while the smaller detectors are dispersed around the circumference.
FIG. 30 shows the detector coverage of a volume for selected sets containing 500, 1000, and 2000 views. The coverage is shown from the XY, YZ, and XZ aspects of the volume. It is seen from the figure that for a small number of views, the views are clustered around the exterior of the volume. As the number of views increases, an increasingly uniform distribution of views is achieved.
FIGS. 31-32 show the number of detectors selected for each of the four detector types, as the total number of selected views is increased. The selected set is constrained to have no more than 3400 views of a single detector type. It can be seen that the detectors are selected in order of size, as the total number of selected views increases. It is only after the number of the large detector views nears 3400 that the number of medium detector views begins to increase significantly, and so forth. The Fisher information measure is thus seen to select for larger-sized detectors, in order to ensure high-reliability reconstructions from the collected data.
FIG. 33 illustrates view set selection results for the reliability criterion, based on minimizing the inverse mean of the Fisher information measure. In accordance with the Cramer-Rao lower bound, the inverse of the Fisher Information is a lower bound for the variance of the intensity I.
FIG. 33 shows the behavior of the Fisher inverse mean for the three detector types, large (D=10, L=25), medium (D=5, L=12.5), and small (D=2.5, L=6.25). The number of collimators is normalized for the collimator size, so that an effective detector number of 1600 is achieved with 100 large detectors, 400 medium detectors, or with 1600 small detectors. The Fisher inverse mean of the medium and small detectors is relatively close, with the large detector having a greater mean value. Since our aim is to minimize the score, it is seen that the smaller detectors are more efficient in providing a low-variance estimation.
By enabling high-quality reconstruction based on data collected from a limited collection of views, the above described view set selection techniques present a way to resolve the current conflict between the relatively large-pixel detectors needed for measurement speed and data processing considerations, with the small-pixel detectors needed until now to obtain a high-resolution reconstruction. The data obtained using the selected set of views enables a high-resolution reconstruction from a smaller number of measurements. Additionally, reconstructing the intensity distribution from a smaller quantity of collected data simplifies the computational process. The above described embodiments are particularly suitable for medical imaging purposes, where a high-resolution image is needed and it is desired to minimize the difficulties of the patient undergoing the diagnostic testing or treatment.
Radioactive emission imaging, in accordance with the present invention may be performed with a radioactive-emission-measuring detector, such as a room temperature, solid-state CdZnTe (CZT) detector. It may be configured as a single-pixel or a multi-pixel detector, and may be obtained, for example, from eV Products, a division of II-VI Corporation, Saxonburg Pa., 16056, or from IMARAD IMAGING SYSTEMS LTD., of Rehovot, ISRAEL, 76124, www.imarad.com, or from another source. Alternatively, another solid-state detector such as CdTe, HgI, Si, Ge, or the like, or a combination of a scintillation detector (such as NaI(Tl), LSO, GSO, CsI, CaF, or the like) and a photomultiplier, or another detector as known, may be used.
It is appreciated that certain features of the invention, which are, for clarity, described in the context of separate embodiments, may also be provided in combination in a single embodiment. Conversely, various features of the invention, which are, for brevity, described in the context of a single embodiment, may also be provided separately or in any suitable subcombination.
Although the invention has been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall within the spirit and broad scope of the appended claims. All publications, patents and patent applications mentioned in this specification are herein incorporated in their entirety by reference into the specification, to the same extent as if each individual publication, patent or patent application was specifically and individually indicated to be incorporated herein by reference. In addition, citation or identification of any reference in this application shall not be construed as an admission that such reference is available as prior art to the present invention.

## Claims

1. A method for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, the method comprising:
providing the volume to be imaged;
providing a collection of views of the volume to be imaged, each said view is associated with at least one viewing parameter selected from a group consisting of a detector location, a detector orientation, a viewing angle, a detector material, a detector thickness, a collimator length, a septa thickness, a cell size, a detection duration, a time of detection, and a type of the radiopharmaceutical;
providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
forming sets of views and scoring them, by the scoring function;
selecting a set of views from the collection, based on the scoring function; and
instructing a three dimensional (3D) reconstruction of an intensity distribution in at least some of the volume from radioactive-emission measurements of said selected set of views.

2. The method of claim 1, wherein the volume includes a body structure, selected from the group consisting of:
a human prostate, a human heart, a human brain, a human breast, a human uterus, a human ovary, a human liver, a human kidney, a human stomach, a human colon, a human small intestine, a human oral cavity, a human throat, a human gland, a human lymph node, a human skin, another human body organ, a human limb, a human bone, another part of the human body, a whole human body,
an animal prostate, an animal heart, an animal brain, an animal teat, an animal uterus, an animal ovary, an animal liver, an animal kidney, an animal stomach, an animal gastrointestinal track, an animal oral cavity, an animal throat, an animal gland, an animal lymph node, an animal skin, another animal body organ, an animal limb, an animal bone, another part of an animal body, a whole animal body,
a model of a human prostate, a model of human heart, a model of human brain, a model of human breast, a model of human uterus, a model of human ovary, a model of human liver, a model of human kidney, a model of human stomach, a model of human colon, a model of human small intestine, a model of human oral cavity, a model of human throat, a model of human gland, a model of human lymph node, a model of human skin, another human body organ, a model of human limb, a model of human bone, another part of the human body, a model of whole human body,
a model of animal prostate, a model of animal heart, a model of animal brain, a model of animal teat, a model of animal uterus, a model of animal ovary, a model of animal liver, a model of animal kidney, a model of animal stomach, a model of animal gastrointestinal track, a model of animal oral cavity, a model of animal throat, a model of animal gland, a model of animal lymph node, a model of animal skin, another animal body organ, a model of animal limb, a model of animal bone, another part of a model of animal body, and a model of whole animal body.

3. The method of claim 1, and further including imaging the volume with the selected set of views.

4. The method of claim 1, wherein:
providing the volume to be imaged further includes providing a model of a body structure to be imaged,
and further including imaging an in-vivo body structure, which corresponds to the model of the body structure, with the selected set of views.

5. The method of claim 1, wherein each of the views is associated with a collimated solid-state detector pixel.

6. The method of claim 5, wherein each of the views is associated with at least two viewing parameters, selected from the group consisting of: a solid-state-detector-pixel location, a solid-state-detector-pixel orientation, a solid-state-detector-pixel material, a solid-state-detector-pixel thickness, a solid-state-detector-pixel size, a septa thickness, a collimator solid collection angle, measurement duration, time elapsed from the administration of the radiopharmaceutical, the radiopharmaceutical half life, radioactive-emission particle, and radioactive-emission energy.

7. The method of claim 1, further comprising calculating for each of the views a respective detection probability distribution of the volume for each of the views, in accordance with respective viewing parameters and a volume attenuation coefficient.

8. The method of claim 1, wherein the selecting a set of views from the collection includes selecting a set from the group consisting of:
a minimal-size set, which attains a predefined score, and a highest scoring set, having a predefined number of views.

9. The method of claim 1, wherein the collection of views comprises a quantized continuum of views.

10. The method of claim 1, wherein the scoring function is selected from the group consisting of:
an information-theoretic entropy measure, for ensuring uniform coverage of the volume,
a worst-case effectiveness for the given view over the volume, and
an average effectiveness for the given view over the volume.

11. The method of claim 1, further comprising providing at least one emittance model, wherein an emittance model comprises a representation of a radioactive-emission density distribution of the volume.

12. The method of claim 11, wherein:
the providing at least one emittance model comprises providing a pair of models of substantially identical volumes, but different radioactive-emission density distributions, wherein the difference between the radioactive-emission density distributionsis defined by at least one delta;
the scoring function is based on an information theoretic measure of separability;
the forming the sets of views from the collection of views and scoring them, comprises forming substantially identical sets of views for the pair of models and scoring the sets with respect to the pair; and
the selecting one of the sets of views, based on its score, comprises selecting based on the score for the pair.

13. The method of claim 11, wherein:
the providing the at least one emittance model includes providing at least two emittance models, and further wherein the scoring function is selected from the group consisting of:
a worst-case effectiveness for the given view over the set of emittance models, and an average effectiveness for the given view over the set of emittance models.

14. The method of claim 11, wherein the scoring function comprises an information theoretic measure, selected from the group consisting of:
an information-theoretic Fisher information measure, for ensuring reliable reconstruction of the radioactive-emission density distribution,
an information-theoretic likelihood measure, for ensuring separable reconstructions of the at least one emittance model, and
a combination thereof.

15. The method of claim 11, wherein the providing at least one emittance model includes modeling a radioactive-emission density distribution in at least one modeled body structure.

16. The method of claim 15, wherein the body structure is selected from the group consisting of: selected from the group consisting of a human prostate, a human heart, a human brain, a human breast, a human uterus, a human ovary, a human liver, a human kidney, a human stomach, a human colon, a human small intestine, a human oral cavity, a human throat, a human gland, a human lymph node, a human skin, another human body organ, a human limb, a human bone, another part of the human body, a whole human body, an animal prostate, an animal heart, an animal brain, an animal teat, an animal uterus, an animal ovary, an animal liver, an animal kidney, an animal stomach, an animal gastrointestinal track, an animal oral cavity, an animal throat, an animal gland, an animal lymph node, an animal skin, another animal body organ, an animal limb, an animal bone, another part of an animal body, and a whole animal body.

17. The method of claim 1, wherein said collection of views comprises a collection of radionuclide imaging views.

18. A method for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, the method comprising:
providing the volume to be imaged;
providing at least one emittance model;
providing a collection of views of the volume to be imaged;
providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
forming sets of views and scoring them, by the scoring function; and
selecting a set of views from the collection, based on the scoring function;
wherein an emittance model comprises a representation of a radioactive-emission
density distribution of the volume,
wherein:
the providing at least one emittance model comprises providing a plurality of emittance models of substantially identical volumes, but different radioactive-emission density distributions,
the forming sets of views from the collection of views and scoring them, comprises forming substantially identical sets of views for all the models and scoring the sets with respect to each model, based on the information theoretic measure of reliability; and
the selecting one of the sets of views, based on its score, comprises selecting based on the average score for the plurality of models.

19. A method for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, the method comprising:
providing the volume to be imaged;
providing at least one emittance model;
providing a collection of views of the volume to be imaged;
providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
forming sets of views and scoring them, by the scoring function; and
selecting a set of views from the collection, based on the scoring function;
wherein an emittance model comprises a representation of a radioactive-emission density distribution of the volume, wherein:
the providing at least one emittance model comprises providing a plurality of pairs of models of substantially identical volumes, but different radioactive-emission density distributions, wherein the difference between the radioactive-emission density distributions for each pair is defined by at least one delta;
the scoring function is based on an information theoretic measure of separability;
the forming the sets of views from the collection of views and scoring them, comprises forming substantially identical sets of views for the plurality of pairs of models and scoring the sets with respect to each of the pairs; and
the selecting one of the sets of views, based on its score, comprises selecting based on an average score for the plurality of pairs.

20. A method for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, the method comprising:
providing the volume to be imaged;
providing at least one emittance model;
providing a collection of views of the volume to be imaged;
providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
forming sets of views and scoring them, by the scoring function; and
selecting a set of views from the collection, based on the scoring function;
wherein an emittance model comprises a representation of a radioactive-emission density distribution of the volume, wherein:
the providing the at least one emittance model includes providing a first and a second emittance models of different radiation emission density distributions and a third emittance model of no radiation emission density distribution; and
the providing the scoring function comprises providing a scoring function as a combination of uniformity, separability and reliability.

21. A method for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, the method comprising:
providing the volume to be imaged;
providing a collection of views of the volume to be imaged;
providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
forming sets of views and scoring them, by the scoring function; and
selecting a set of views from the collection, based on the scoring function;
wherein the selecting comprises:
initially establishing a current set of views from the collection of views; and
iteratively expanding the current set until a predefined number of views are obtained, wherein a set expansion iteration comprises:
forming a respective expanded set for each view not in the current set, wherein an expanded set comprises the current set and a respective view;
calculating a respective score for each of the expanded sets using the scoring function; and
equating the current set equal to a highest-scoring expanded set.

22. The method of claim 21, wherein the initially established current set is an empty set.

23. A non-transitory computer-readable storage medium containing a set of instructions for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, the set of instructions comprising:
a volume provision routine for providing the volume to be imaged;
a view provision routine for providing a collection of views of the volume to be imaged, each said view is associated with at least one viewing parameter selected from a group consisting of a detector location, a detector orientation, a viewing angle, a detector material, a detector thickness, a collimator length, a septa thickness, a cell size, a detection duration, a time of detection, and a type of the radiopharmaceutical;
a scoring function provision routine for providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
a set formation routine, for forming sets of views and scoring them, by the scoring function; and
a set selection routine selecting a set from the collection, based on the scoring function;

wherein said set is used for instructing a three dimensional (3D) reconstruction of an intensity distribution in at least some of the volume from radioactive-emission measurements of said selected set of views.

24. A computer system, configured for selecting a set of optimal views of a volume to be imaged by radioactive-emission, after an administration of a radiopharmaceutical, comprising:
a volume provision routine for providing the volume to be imaged;
a view provision routine for providing a collection of views of the volume to be imaged, each said view is associated with at least one viewing parameter selected from a group consisting of a detector location, a detector orientation, a viewing angle, a detector material, a detector thickness, a collimator length, a septa thickness, a cell size, a detection duration, a time of detection, and a type of the radiopharmaceutical;
a scoring function provision routine for providing a scoring function, by which any set of at least one view from the collection is scorable with a score that rates information obtained from the volume by the set;
a set formation routine, for forming sets of views and scoring them, by the scoring function; and
a set selection routine selecting a set from the collection, based on the scoring function;
wherein said set is used for instructing a three dimensional (3D) reconstruction of an intensity distribution in at least some of the volume from radioactive-emission measurements of said selected set of views.