US20150230771A1 - System and method for processing images - Google Patents
System and method for processing images Download PDFInfo
- Publication number
- US20150230771A1 US20150230771A1 US14/628,731 US201514628731A US2015230771A1 US 20150230771 A1 US20150230771 A1 US 20150230771A1 US 201514628731 A US201514628731 A US 201514628731A US 2015230771 A1 US2015230771 A1 US 2015230771A1
- Authority
- US
- United States
- Prior art keywords
- tilde over
- temporal
- time separated
- separated images
- selecting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
- 238000000034 method Methods 0.000 title claims abstract description 83
- 238000012545 processing Methods 0.000 title claims abstract description 16
- 238000003384 imaging method Methods 0.000 claims abstract description 52
- 230000002123 temporal effect Effects 0.000 claims abstract description 52
- 238000002591 computed tomography Methods 0.000 claims description 37
- 239000011159 matrix material Substances 0.000 claims description 33
- 238000002059 diagnostic imaging Methods 0.000 claims description 20
- 239000002872 contrast media Substances 0.000 claims description 18
- 230000010412 perfusion Effects 0.000 claims description 18
- 238000000513 principal component analysis Methods 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 10
- 230000005855 radiation Effects 0.000 claims description 8
- 238000002595 magnetic resonance imaging Methods 0.000 claims description 6
- 238000000926 separation method Methods 0.000 claims description 6
- 230000004913 activation Effects 0.000 claims 1
- 238000002599 functional magnetic resonance imaging Methods 0.000 claims 1
- 238000012880 independent component analysis Methods 0.000 claims 1
- 239000013598 vector Substances 0.000 description 17
- 230000008569 process Effects 0.000 description 14
- 230000017531 blood circulation Effects 0.000 description 9
- 230000009467 reduction Effects 0.000 description 7
- 230000006399 behavior Effects 0.000 description 6
- 239000008280 blood Substances 0.000 description 5
- 210000004369 blood Anatomy 0.000 description 5
- 238000000354 decomposition reaction Methods 0.000 description 5
- 238000001914 filtration Methods 0.000 description 5
- 238000011068 loading method Methods 0.000 description 5
- 206010028980 Neoplasm Diseases 0.000 description 4
- 210000004556 brain Anatomy 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000009206 nuclear medicine Methods 0.000 description 4
- 210000000056 organ Anatomy 0.000 description 4
- 206010073306 Exposure to radiation Diseases 0.000 description 3
- 208000006011 Stroke Diseases 0.000 description 3
- 150000001875 compounds Chemical class 0.000 description 3
- 201000010099 disease Diseases 0.000 description 3
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 3
- 230000005291 magnetic effect Effects 0.000 description 3
- 238000002600 positron emission tomography Methods 0.000 description 3
- 238000003672 processing method Methods 0.000 description 3
- 208000032382 Ischaemic stroke Diseases 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000008499 blood brain barrier function Effects 0.000 description 2
- 210000001218 blood-brain barrier Anatomy 0.000 description 2
- 230000008344 brain blood flow Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 201000011510 cancer Diseases 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000013170 computed tomography imaging Methods 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000003745 diagnosis Methods 0.000 description 2
- 230000004069 differentiation Effects 0.000 description 2
- 239000012530 fluid Substances 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 230000035790 physiological processes and functions Effects 0.000 description 2
- 238000012847 principal component analysis method Methods 0.000 description 2
- 238000007619 statistical method Methods 0.000 description 2
- 210000001519 tissue Anatomy 0.000 description 2
- 208000014644 Brain disease Diseases 0.000 description 1
- 208000032843 Hemorrhage Diseases 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 210000003484 anatomy Anatomy 0.000 description 1
- 231100000504 carcinogenesis Toxicity 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010968 computed tomography angiography Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000002526 effect on cardiovascular system Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000001493 electron microscopy Methods 0.000 description 1
- 238000002594 fluoroscopy Methods 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 208000019622 heart disease Diseases 0.000 description 1
- 230000002008 hemorrhagic effect Effects 0.000 description 1
- 239000012216 imaging agent Substances 0.000 description 1
- 230000005865 ionizing radiation Effects 0.000 description 1
- 230000000302 ischemic effect Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000001208 nuclear magnetic resonance pulse sequence Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000005298 paramagnetic effect Effects 0.000 description 1
- 230000001991 pathophysiological effect Effects 0.000 description 1
- 230000035699 permeability Effects 0.000 description 1
- 230000000135 prohibitive effect Effects 0.000 description 1
- 238000002601 radiography Methods 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 210000003625 skull Anatomy 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000001931 thermography Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000002604 ultrasonography Methods 0.000 description 1
Images
Classifications
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/50—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment specially adapted for specific body parts; specially adapted for specific clinical applications
- A61B6/504—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment specially adapted for specific body parts; specially adapted for specific clinical applications for diagnosis of blood vessels, e.g. by angiography
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B5/00—Measuring for diagnostic purposes; Identification of persons
- A61B5/0033—Features or image-related aspects of imaging apparatus classified in A61B5/00, e.g. for MRI, optical tomography or impedance tomography apparatus; arrangements of imaging apparatus in a room
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B5/00—Measuring for diagnostic purposes; Identification of persons
- A61B5/05—Detecting, measuring or recording for diagnosis by means of electric currents or magnetic fields; Measuring using microwaves or radio waves
- A61B5/055—Detecting, measuring or recording for diagnosis by means of electric currents or magnetic fields; Measuring using microwaves or radio waves involving electronic [EMR] or nuclear [NMR] magnetic resonance, e.g. magnetic resonance imaging
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/02—Arrangements for diagnosis sequentially in different planes; Stereoscopic radiation diagnosis
- A61B6/03—Computed tomography [CT]
- A61B6/032—Transmission computed tomography [CT]
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/02—Arrangements for diagnosis sequentially in different planes; Stereoscopic radiation diagnosis
- A61B6/03—Computed tomography [CT]
- A61B6/037—Emission tomography
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/48—Diagnostic techniques
- A61B6/481—Diagnostic techniques involving the use of contrast agents
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/48—Diagnostic techniques
- A61B6/486—Diagnostic techniques involving generating temporal series of image data
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/50—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment specially adapted for specific body parts; specially adapted for specific clinical applications
- A61B6/507—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment specially adapted for specific body parts; specially adapted for specific clinical applications for determination of haemodynamic parameters, e.g. perfusion CT
-
- A—HUMAN NECESSITIES
- A61—MEDICAL OR VETERINARY SCIENCE; HYGIENE
- A61B—DIAGNOSIS; SURGERY; IDENTIFICATION
- A61B6/00—Apparatus or devices for radiation diagnosis; Apparatus or devices for radiation diagnosis combined with radiation therapy equipment
- A61B6/52—Devices using data or image processing specially adapted for radiation diagnosis
- A61B6/5258—Devices using data or image processing specially adapted for radiation diagnosis involving detection or reduction of artifacts or noise
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/0002—Inspection of images, e.g. flaw detection
- G06T7/0012—Biomedical image inspection
- G06T7/0014—Biomedical image inspection using an image reference approach
- G06T7/0016—Biomedical image inspection using an image reference approach involving temporal comparison
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2200/00—Indexing scheme for image data processing or generation, in general
- G06T2200/24—Indexing scheme for image data processing or generation, in general involving graphical user interfaces [GUIs]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10072—Tomographic images
- G06T2207/10081—Computed x-ray tomography [CT]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10072—Tomographic images
- G06T2207/10088—Magnetic resonance imaging [MRI]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10072—Tomographic images
- G06T2207/10104—Positron emission tomography [PET]
Definitions
- the present invention relates generally to image processing and, more particularly, to a system and method for processing image data obtained by using a dynamic imaging technique
- Medical imaging encompasses techniques and processes used to create images of the human body for clinical purposes, including medical procedures for diagnosing or monitoring disease.
- Medical imaging technology has grown to encompass many image recording techniques including electron microscopy, fluoroscopy, magnetic resonance imaging (MRI), nuclear medicine, photoacoustic imaging, positron emission tomography (PET), projection radiography, thermography, computed tomography (CT), and ultrasound.
- Medical imaging can incorporate the use of compounds referred to as contrast agents or contrast materials to improve the visibility of internal bodily structures in an Image.
- Dynamic medical imaging involves an acquisition process that takes many “snapshots” of the organ/region/body of interest over time in order to capture a time-varying behaviour, for example, distribution of a contrast agent and hence capture of a specific biological state (disease, condition, physiological phenomenon, etc.). As the speed and digital nature of medical imaging evolves, this acquisition data can have tremendous temporal resolution and can result in large quantities of data.
- Medical imaging technologies have been used widely to improve diagnosis and care for such conditions as cancer, heart disease, brain disorders, and cardiovascular conditions. Most estimates conclude that millions of lives have been saved or dramatically improved as a result of these medical imaging technologies. However, the risk of radiation exposure from such medical imaging technologies for patients must be considered.
- the increasing use of CT in medical diagnosis has highlighted concern about the increased cancer risk to exposed patients because of the larger radiation doses delivered in CT than the more common, conventional x-ray imaging procedures.
- the effective dose of a CT Stroke series consisting of: 1) a non-enhanced CT scan to rule out hemorrhage; 2) a CT angiography to localize the occlusion causing the stroke; and 3) a two-phase CT Perfusion protocol to define the ischemic region with blood flow and blood volume and predict hemorrhagic transformation (HT) with blood-brain barrier permeability surface area product (BBB-PS); is 10 mSv, of which 4.9 mSv is contributed by the two-phase CT Perfusion protocol.
- HT hemorrhagic transformation
- BBB-PS blood-brain barrier permeability surface area product
- the CT Stroke series is predicted to induce 80 and 131 additional cancers for every exposed 100,000 male and female acute ischemic stroke (AIS) patients, respectively, with the two-phase CT Perfusion protocol alone predicted to cause half of the additional cancers (Health Risks from Exposure to Low Levels of Ionizing Radiation: BEIR VII. The National Academys Press, Washington DC, 2006).
- a method of processing a plurality of time separated images comprising: selecting a plurality of imaging units in each image; determining a temporal difference for each imaging unit; and selecting temporal differences above a threshold limit.
- a system for processing a plurality of time separated images comprising: an interface for receiving a plurality of time separated images; and a processor for selecting a plurality of imaging units in each image, determining a temporal difference for each imaging unit, and selecting temporal differences above a threshold limit.
- a computer readable medium embodying a computer program for processing a plurality of time separated images, the computer program comprising: computer program code for selecting a plurality of imaging units in each image; computer program code for determining a temporal difference for each imaging unit; and computer program code for selecting temporal differences above a threshold limit.
- FIG. 1 is a flow chart of an image processing method
- FIG. 2 schematically illustrates the positioning of imaging units in a plurality of time separated images
- FIG. 3 shows brain blood flow maps (A) to (E) from CT images processed with a statistical filtering technique
- FIG. 4 graphically shows blood flow Figure of Merit calculated for the images shown in FIGS. 3A to 3D using the regions outlined in FIG. 3E ;
- FIG. 5 is a diagram of a system for implementing the image processing method shown in FIG. 1 .
- Dynamic medical imaging involves an acquisition process that takes many “snapshots” of an organ/region/body of interest (i.e. a target region) over time in order to capture a time-varying behaviour, for example uptake and/or wash out of a contrast agent.
- This acquisition process results in the production of a plurality of time separated images.
- the method and system described herein involves processing of such time separated images.
- the plurality of time separated images may be obtained from dynamic medical imaging of a patient with or without the use of an injected contrast agent.
- a contrast agent can selectively increase the contrast of the target region in an image, for example on the basis of the target region's structure or physiological state. For example, one may inject into a patient a compound which has a biophysical, molecular, genetic or cellular affinity for a particular organ, disease, state or physiological process.
- Such contrast agents are selected to have a property that provides enhanced information to a given imaging technique by altering imaging conditions, for example by altering image contrast, to reflect the behaviour of the compound in the body.
- Contrast agents for many imaging techniques are well-known. In some cases contrast enhancement does not rely on an injected contrast agent, for example the use of “black blood” or “white blood” in magnetic resonance imaging (MRI) where specific pulse sequences are used to change the magnetic saturation of the blood and thus its appearance in the image, or tagged MRI sequences which alter the magnetic behaviour of a particular tissue or fluid.
- An injected contrast agent, or a tissue or fluid with altered behaviour may all be regarded as “imaging agents”.
- the plurality of time separated images are not limited to any particular imaging technique and include, for example, dynamic medical imaging using magnetic resonance imaging (MRI), computed tomography (CT), nuclear medicine (NM) or positron emission tomography (PET).
- MRI magnetic resonance imaging
- CT computed tomography
- NM nuclear medicine
- PET positron emission tomography
- the plurality of time separated images are also not limited to particular image types. For example, grayscale or colour images may be processed.
- An “imaging unit” may be any desired unit for separating an image into equivalent portions including, for example, a pixel, a plurality of pixels, a fraction of a pixel, a voxel, a plurality of voxels, a fraction of a voxel etc.
- the imaging unit data is represented by a value, for example a digital value, and can thus be quantified and measured.
- image intensity is measured for corresponding imaging units in the time separated images.
- a temporal difference can be determined with respect to contrast concentration.
- the temporal difference of contrast concentration can be represented as a plot of contrast enhancement as a function of time.
- FIG. 1 Two alternatives for determining temporal differences of contrast concentration and selecting temporal differences are shown in FIG. 1 .
- a temporal difference is determined for each imaging unit (step 115 ).
- the determined temporal difference or representations thereof are then ranked according to degree of observed temporal difference (step 120 ).
- Temporal differences above a threshold limit are then selected (step 125 ).
- a processed image is then constructed on the basis of the selected temporal differences (step 150 ).
- the temporal differences are not ranked. Rather, the temporal data for imaging units are analyzed to select temporal differences above a threshold limit using statistical techniques, and more particularly blind signal separation statistical techniques.
- a covariance matrix of the co-variations of all pairs of contrast enhancement plots in relation to a mean curve is established (step 130 ) and analyzed with a blind signal separation statistical technique (step 135 ), such as with a principal components analysis being applied to the covariance matrix.
- Eigenvector/eigenvalue pairs are calculated on the basis of the statistical analysis (step 140 ).
- Resulting eigenvector/eigenvalue pairs above a threshold limit are then selected on the basis of their eigenvalues (step 145 ).
- a processed image is then constructed using the selected eigenvectors, with different weightings of the selected eigenvectors being used to construct individual imaging units (step 160 ).
- the plurality of time separated images may optionally be registered to correlate corresponding locations in the time separated images to each other. Registration of the plurality of time separated images is only needed to correct for gross misregistration. Otherwise, slight movement between the time separated images may be tolerated and may even be removed by the processing method described herein.
- the plurality of time separated images may be preprocessed so that the time separated images are represented with quantifiable values or codes.
- the time separated images may be represented by digital values using known digitization techniques. If the imaging data of the plurality of time separated images is provided in a digital form, then a digitization step is not necessary.
- FIG. 2 shows a series of six chronologically ordered time separated images, t 1 to t 6 .
- a 4 ⁇ 6 array of imaging units is marked on each time separated image.
- five (5) imaging units, IU 1 to IU 5 have been selected.
- imaging unit IU 1 is selected at the same position of the array (i.e. column 1 , row 2 ) for each of the time separated images.
- each of imaging units IU 2 to IU 5 is selected in corresponding positions of the imaging unit array throughout the series of time separated images.
- values for each imaging unit at its corresponding position throughout the time separated images can be plotted as a function of time to obtain a temporal curve.
- the plotting step is illustrated by the arrows linking the corresponding positions of imaging units IU 1 , IU 2 and IU 5 .
- the temporal curve for each imaging unit can then be analyzed to determine a temporal difference. For example, a mean curve for all of the temporal curves obtained can be calculated. The mean curve is then subtracted from each of the temporal curves to obtain a temporal difference curve for each selected imaging unit.
- the marked array and the selection of imaging units IU 1 to IU 5 is for illustration purposes only, and that any number of imaging units may be selected and analyzed as desired.
- the determination of temporal differences by subtraction of a mean curve from the temporal curves for imaging units is for illustration only, and other methods of analyzing the temporal curves, for example using derivatives and/or statistical techniques are contemplated.
- n dynamic images Given a series of n dynamic (i.e. time separated) images from a CT Perfusion study, the n dynamic images can be represented compactly as a matrix:
- ⁇ tilde over (X) ⁇ [ ⁇ tilde over (x) ⁇ 1 T ⁇ tilde over (x) ⁇ 2 T . . . . . ⁇ tilde over (x) ⁇ p ⁇ 1 T ⁇ tilde over (x) ⁇ p T ] T
- the (i,j) th element of ⁇ tilde over (X) ⁇ is the j th element x ⁇ of ⁇ tilde over (x) ⁇ i .
- Each ⁇ tilde over (x) ⁇ i , i 1, . . .
- One approach to removing noise from the n dynamic images is to find an ‘expansion’ of the p ⁇ n matrix, ⁇ tilde over (X) ⁇ , and then truncate the expansion by certain pre-determined criteria.
- a common expansion is the singular value decomposition of ⁇ tilde over (X) ⁇ ;
- ⁇ is a p ⁇ p orthogonal matrix
- ⁇ tilde over (V) ⁇ is a n ⁇ n orthogonal matrix
- ⁇ tilde over (L) ⁇ is a p ⁇ n diagonal matrix with singular values of ⁇ tilde over (X) ⁇ as its diagonal elements.
- I i , . . . , I n be the singular values of ⁇ tilde over (X) ⁇ (it is assumed without loss of generality that ⁇ tilde over (X) ⁇ is of full column rank, n and p>n). Then:
- I 1 , . . . , I n are arranged in descending order and small singular values can be discarded as arising from noise.
- a simple way to reduce noise in ⁇ tilde over (X) ⁇ is to keep only r ⁇ n singular values. Then:
- ⁇ tilde over (L) ⁇ ⁇ 1 . . . I r ⁇ tilde over (0) ⁇ r+1 . . . ⁇ tilde over (0) ⁇ n ⁇
- the size of the matrix ⁇ tilde over (X) ⁇ can be as large as (256) 2 ⁇ 40-60, making it computationally prohibitive to find the SVD of ⁇ tilde over (X) ⁇ ;
- ⁇ tilde over (x) ⁇ by definition is a n ⁇ 1 vector (the sample mean time vs. enhancement curve) and the j th component of x , according to Equation (3), is:
- ⁇ tilde over (x) ⁇ ij is the j th component of ⁇ tilde over (x) ⁇ i .
- n typically 40-60.
- ⁇ is a given n ⁇ 1 vector of coefficients.
- ⁇ is also a zero mean random variable.
- the sample variance of ⁇ is given by:
- ⁇ is the eigenvalue of ⁇ tilde over (S) ⁇ and ⁇ is the corresponding eigenvector
- ⁇ is the eigenvector of ⁇ tilde over (S) ⁇ that has the highest eigenvalue.
- the sample covariance of ⁇ 1 and ⁇ 2 is:
- ⁇ 2 is once more an eigenvalue of ⁇ tilde over (S) ⁇ , and ⁇ 2 the corresponding eigenvector.
- ⁇ 2 T ⁇ tilde over (S) ⁇ 2 ⁇ 2 or the the sample variance of ⁇ 2 is ⁇ 2 .
- ⁇ 2 ⁇ 1 .
- ⁇ 2 is the second largest eigenvalue and ⁇ 2 the corresponding eigenvector.
- the vectors of coefficients ⁇ 3 , ⁇ 4 , . . . , ⁇ n are the eigenvectors of ⁇ tilde over (S) ⁇ corresponding to ⁇ 3 , ⁇ 4 , . . . , ⁇ n , the third, fourth largest, and the smallest eigenvalue.
- the sample variances of the principal components are also given by the eigenvalues of ⁇ tilde over (S) ⁇ .
- ⁇ tilde over (Z) ⁇ to be the p ⁇ n matrix of the scores of observations on principal components.
- the i th row consists of the scores of the i th observation of ⁇ tilde over ( ⁇ ) ⁇ (i.e. ⁇ tilde over (y) ⁇ i ) on all principal components ⁇ 1 , ⁇ 2 , . . . , ⁇ n ⁇ 1 , ⁇ n , that is:
- ⁇ is a n ⁇ n matrix whose columns are the eigenvectors of ⁇ tilde over (S) ⁇ and is orthogonal.
- the first principal component, ⁇ 1 , maximized is expressed by;
- ⁇ tilde over (x) ⁇ i ⁇ x is the deviation of the time vs. enhancement curve (TEC) from the i th pixel (pixel block) from the mean of TECs from all pixels (pixel blocks).
- TEC time vs. enhancement curve
- the eigenvectors; ⁇ 1 , ⁇ 2 , ⁇ 3 , ⁇ 4 , . . . , ⁇ n represent the first, second, third, fourth, . . . , and least dominant time vs. enhancement behaviour in the set of TECs from all pixels.
- the loadings of the eigenvectors ⁇ 1 , ⁇ 2 , ⁇ 3 , ⁇ 4 , . . . , ⁇ n in the TEC from the i th pixel (pixel block) are:
- the i th column of ⁇ tilde over (Z) ⁇ therefore, gives the loading map of the eigenvector ⁇ i which corresponds to the i th largest eigenvalue ⁇ i .
- Equation (1) the p ⁇ n matrix ⁇ tilde over (Y) ⁇ can be expanded by singular value decomposition as:
- ⁇ is a p ⁇ p orthogonal matrix
- ⁇ tilde over (V) ⁇ is a n ⁇ n orthogonal matrix
- ⁇ tilde over (L) ⁇ is a p ⁇ n diagonal matrix with singular values of ⁇ tilde over (Y) ⁇ as its diagonal elements.
- l 1 , . . . , l n be the singular values of ⁇ tilde over (Y) ⁇ (it is assumed without loss of generality that ⁇ tilde over (Y) ⁇ is of full column rank, n and p>n).
- ⁇ tilde over (L) ⁇ ⁇ tilde over (l) ⁇ i . . . ⁇ tilde over (l) ⁇ i . . . ⁇ tilde over (l) ⁇ n ⁇
- ⁇ tilde over (m) ⁇ i T [0 . . . l i 2 . . . 0].
- Equation (5a) is:
- ⁇ is a p ⁇ p orthogonal matrix
- ⁇ tilde over (V) ⁇ is a n ⁇ n orthogonal matrix
- ⁇ tilde over (L) ⁇ is a p ⁇ n diagonal matrix with singular values of ⁇ tilde over (Y) ⁇ , l i , . . . ,l n , as its diagonal elements; it Is also assumed without loss of generality that ⁇ tilde over (Y) ⁇ is of full column rank, n and p>n. It is shown that:
- Equation (8) also affords a very simple geometric interpretation as explained in the following.
- Equation (4a) is a n ⁇ r matrix whose i th column is ⁇ i and from Equation (4a):
- Equation (10) suggests that the TEC for the i th pixel (pixel block) is a weighted summation of r eigenvectors with the weights given by the loading of the i th pixel TEC on the eigenvectors.
- the eigenvectors ⁇ 1 , ⁇ 2 , . . . , ⁇ r ⁇ 1 , ⁇ r can be regarded as forming an orthonormal basis in n dimensional space.
- the projection of ⁇ tilde over (y) ⁇ i on ⁇ i is ⁇ tilde over (y) ⁇ i T ⁇ i and ⁇ tilde over (y) ⁇ i can be reconstituted as
- ⁇ j 1 r ⁇ ( y ⁇ i T ⁇ a ⁇ j ) ⁇ a ⁇ j T .
- ⁇ tilde over (Y) ⁇ [ ⁇ tilde over (y) ⁇ 1 T . . . ⁇ tilde over (y) ⁇ i T . . . ⁇ tilde over (y) ⁇ p T ] T , corresponding to ⁇ tilde over (X) ⁇ , where
- ⁇ i 1 r ⁇ a ⁇ i ⁇ a ⁇ i T
- ⁇ tilde over (X) ⁇ * [ ⁇ tilde over (y) ⁇ 1 *+ x . . . ⁇ tilde over (y) ⁇ i *+ x . . . ⁇ tilde over (y) ⁇ p *+ x ],
- PCA principal component analysis
- the PCA method will now be summarized based on a CT Perfusion study that generates a plurality of time separated images that capture the passage of contrast through the brain. Corresponding to each pixel in the series of images, a curve is generated that represents the contrast concentration in that pixel as a function of time. A difference curve, equal to the difference of the curve from the mean of all pixel curves is also generated. A covariance matrix of the co-variations of all pairs of difference curves is calculated and represents all possible variations about the mean curve. The principal component analysis method analyzes the covariance matrix to find common temporal patterns among the curves by finding linear combinations of the difference curves that represent most of the variations about the mean curve.
- the PCA method is tested versus the traditional filtered back-projection (FBP) method in radiation dose reduction for CT Perfusion applications.
- FBP filtered back-projection
- FIG. 3 shows brain blood flow maps of the pig calculated using the J-W model with CT Perfusion images obtained using (A) 190 mA and FBP reconstruction; (B) 100 mA, FBP reconstruction and PCA; (C) 70 mA, FBP reconstruction and PCA; and, (D) 50 mA, FBP reconstruction and PCA.
- Blood flow map (E) of FIG. 3 shows regions of interest (3 outlined circles) used for calculation of Figure of Merit of the blood flow maps shown in FIG. 4 . The regions are superimposed on a CT image which shows a coronal section through the brain of the pig. The dark areas are the skull and jaw bones.
- FIG. 4 shows that in terms of standard deviation/mean of blood flow (Figure of Merit) in the three regions shown in FIG. 3(E) : 70 mA with PCA was better than 190 mA with FBP, while 50 mA PCA was worse than 190 mA with FBP (p ⁇ 0.05).
- the image qualify of the blood flow maps in FIG. 3 also reflects this progression. Therefore, the PCA method is able to reduce radiation dose required to obtain images in CT Perfusion studies and in maintaining the quality of derived blood flow maps compared to the use of FBP alone. More specifically, the PCA method achieved approximately three fold reduction in radiation dose compared to the use of FBP alone.
- the principal component analysis methodology described herein has been implemented in a computer executable software application using C++.
- the time required to process ninety-five (95) 512 ⁇ 512 CT brain images is less than two (2) minutes on a general purpose computing device such as for example a personal computer (PC).
- PC personal computer
- An input 510 receives a plurality of time separated images, which can be previously stored, received directly from an imaging device, or communicated over a wired or wireless communication link from a remote location.
- a general purpose computing device 505 receives the time separated images from the input and executes a software application thereby to process the time separated images as described above.
- the general purpose computing device 505 interfaces with the user through a display 520 , a keyboard 515 and/or a mouse or other pointing device 525 .
- Results for example the constructed processed images, can be presented on display 520 and/or output to any suitable output device 530 , for example, a printer, a storage device, or a communication device for communicating the results to a remote location.
- the software application described herein may run as a stand-alone application or may be incorporated info other available applications to provide enhanced functionality to those applications.
- the software application may include program modules including routines, programs, object components, data structures etc. and may be embodied as computer readable program code stored on a computer readable medium.
- the computer readable medium is any data storage device that can store data, which can thereafter be read by a computer system. Examples of computer readable media include for example read-only memory, random-access memory, CD-ROMs, magnetic tape and optical data storage devices.
- the computer readable program code can also be distributed over a network including coupled computer systems so that the computer readable program code is stored and executed in a distributed fashion.
Landscapes
- Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Engineering & Computer Science (AREA)
- Medical Informatics (AREA)
- Physics & Mathematics (AREA)
- Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
- General Health & Medical Sciences (AREA)
- Radiology & Medical Imaging (AREA)
- Public Health (AREA)
- Pathology (AREA)
- Veterinary Medicine (AREA)
- Animal Behavior & Ethology (AREA)
- Surgery (AREA)
- Molecular Biology (AREA)
- Biophysics (AREA)
- Heart & Thoracic Surgery (AREA)
- Biomedical Technology (AREA)
- High Energy & Nuclear Physics (AREA)
- Optics & Photonics (AREA)
- Theoretical Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Dentistry (AREA)
- Oral & Maxillofacial Surgery (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Vascular Medicine (AREA)
- Data Mining & Analysis (AREA)
- Pulmonology (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Apparatus For Radiation Diagnosis (AREA)
- Image Processing (AREA)
Abstract
A method of processing a plurality of time separated images comprises selecting a plurality of imaging units in each image; measuring a temporal difference in each imaging unit; and selecting temporal differences above a threshold limit.
Description
- This application claims the benefit of U.S. Provisional Application No. 61/102,206 to Lee filed on Oct. 2, 2008 and entitled “SYSTEM AND METHOD FOR PROCESSING IMAGES”, the content of which is incorporated herein by reference.
- The present invention relates generally to image processing and, more particularly, to a system and method for processing image data obtained by using a dynamic imaging technique
- Medical imaging encompasses techniques and processes used to create images of the human body for clinical purposes, including medical procedures for diagnosing or monitoring disease. Medical imaging technology has grown to encompass many image recording techniques including electron microscopy, fluoroscopy, magnetic resonance imaging (MRI), nuclear medicine, photoacoustic imaging, positron emission tomography (PET), projection radiography, thermography, computed tomography (CT), and ultrasound.
- Medical imaging can incorporate the use of compounds referred to as contrast agents or contrast materials to improve the visibility of internal bodily structures in an Image.
- Medical imaging was originally restricted to acquisition of singular static images to capture the anatomy of an organ/region of the body. Currently, the use of more sophisticated imaging techniques allows dynamic studies to be made that provide a temporal sequence of images which can characterize physiological or pathophysiological information.
- Dynamic medical imaging involves an acquisition process that takes many “snapshots” of the organ/region/body of interest over time in order to capture a time-varying behaviour, for example, distribution of a contrast agent and hence capture of a specific biological state (disease, condition, physiological phenomenon, etc.). As the speed and digital nature of medical imaging evolves, this acquisition data can have tremendous temporal resolution and can result in large quantities of data.
- Medical imaging technologies have been used widely to improve diagnosis and care for such conditions as cancer, heart disease, brain disorders, and cardiovascular conditions. Most estimates conclude that millions of lives have been saved or dramatically improved as a result of these medical imaging technologies. However, the risk of radiation exposure from such medical imaging technologies for patients must be considered.
- In this regard, the increasing use of CT in medical diagnosis has highlighted concern about the increased cancer risk to exposed patients because of the larger radiation doses delivered in CT than the more common, conventional x-ray imaging procedures. This is particularly true with the two-phase CT Perfusion protocol. For illustration purposes, using the dose-length product for a protocol provided by a commercially available CT scanner (GE Healthcare), the effective dose of a CT Stroke series consisting of: 1) a non-enhanced CT scan to rule out hemorrhage; 2) a CT angiography to localize the occlusion causing the stroke; and 3) a two-phase CT Perfusion protocol to define the ischemic region with blood flow and blood volume and predict hemorrhagic transformation (HT) with blood-brain barrier permeability surface area product (BBB-PS); is 10 mSv, of which 4.9 mSv is contributed by the two-phase CT Perfusion protocol. The CT Stroke series is predicted to induce 80 and 131 additional cancers for every exposed 100,000 male and female acute ischemic stroke (AIS) patients, respectively, with the two-phase CT Perfusion protocol alone predicted to cause half of the additional cancers (Health Risks from Exposure to Low Levels of Ionizing Radiation: BEIR VII. The National Academies Press, Washington DC, 2006).
- Unless the effective dose of the two-phase CT Perfusion protocol is reduced, the benefits of medical imaging will be undermined by the concern over cancer induction. Furthermore, the concern over the risks of radiation exposure extends to other medical imaging techniques, particularly for pediatric patients or those patients undergoing repeated exposure.
- The use of statistical filtering techniques to increase the signal to noise ratio in low dose radiation imaging has been described, for example in U.S. Pat. No. 7,187,794 issued Mar. 6, 2007. However, at present the application of statistical filtering is limited to projection data prior to the construction of images. Several disadvantages are associated with statistical filtering of projection data. For example, the computational burden when working with projection data is high because each image from a dynamic sequence is typically reconstructed from ˜1,000 projections. In addition, the filtering process has to be ‘hardwired’ into the image reconstruction pipeline of the scanner. As such, statistical filters of projection data lack flexibility as they are typically specific to a scanner platform.
- Whether perceived or proven, concerns over the risk of radiation exposure will have to be addressed to assure patients of the long term safety of medical imaging techniques. Accordingly, there is a need for medical imaging techniques that allow for a reduction in radiation dose.
- It is therefore an object of the present invention to provide a novel system and method for processing images.
- In an aspect, there is provided a method of processing a plurality of time separated images comprising: selecting a plurality of imaging units in each image; determining a temporal difference for each imaging unit; and selecting temporal differences above a threshold limit.
- In another aspect, there is provided a system for processing a plurality of time separated images comprising: an interface for receiving a plurality of time separated images; and a processor for selecting a plurality of imaging units in each image, determining a temporal difference for each imaging unit, and selecting temporal differences above a threshold limit.
- In yet another aspect, there is provided a computer readable medium embodying a computer program for processing a plurality of time separated images, the computer program comprising: computer program code for selecting a plurality of imaging units in each image; computer program code for determining a temporal difference for each imaging unit; and computer program code for selecting temporal differences above a threshold limit.
- Embodiments will now be described, by way of example only, with reference to accompanying drawings in which:
-
FIG. 1 is a flow chart of an image processing method; -
FIG. 2 schematically illustrates the positioning of imaging units in a plurality of time separated images; -
FIG. 3 shows brain blood flow maps (A) to (E) from CT images processed with a statistical filtering technique; -
FIG. 4 graphically shows blood flow Figure of Merit calculated for the images shown inFIGS. 3A to 3D using the regions outlined inFIG. 3E ; and -
FIG. 5 is a diagram of a system for implementing the image processing method shown inFIG. 1 . - Dynamic medical imaging involves an acquisition process that takes many “snapshots” of an organ/region/body of interest (i.e. a target region) over time in order to capture a time-varying behaviour, for example uptake and/or wash out of a contrast agent. This acquisition process results in the production of a plurality of time separated images. The method and system described herein involves processing of such time separated images.
- Turning now to
FIG. 1 , the steps performed during processing of time separated images according to the method are illustrated. The plurality of time separated images may be obtained from dynamic medical imaging of a patient with or without the use of an injected contrast agent. A contrast agent can selectively increase the contrast of the target region in an image, for example on the basis of the target region's structure or physiological state. For example, one may inject into a patient a compound which has a biophysical, molecular, genetic or cellular affinity for a particular organ, disease, state or physiological process. Such contrast agents are selected to have a property that provides enhanced information to a given imaging technique by altering imaging conditions, for example by altering image contrast, to reflect the behaviour of the compound in the body. This may be achieved via increased X-ray attenuation at a localized site (e.g. for CT/X-ray), altered paramagnetic properties (e.g. for MRI) or the use of a radioisotope for nuclear medicine/PET. Contrast agents for many imaging techniques are well-known. In some cases contrast enhancement does not rely on an injected contrast agent, for example the use of “black blood” or “white blood” in magnetic resonance imaging (MRI) where specific pulse sequences are used to change the magnetic saturation of the blood and thus its appearance in the image, or tagged MRI sequences which alter the magnetic behaviour of a particular tissue or fluid. An injected contrast agent, or a tissue or fluid with altered behaviour, may all be regarded as “imaging agents”. - The plurality of time separated images are not limited to any particular imaging technique and include, for example, dynamic medical imaging using magnetic resonance imaging (MRI), computed tomography (CT), nuclear medicine (NM) or positron emission tomography (PET). The plurality of time separated images are also not limited to particular image types. For example, grayscale or colour images may be processed.
- During the method, within each time separated image a plurality of imaging units are selected (step 110). An “imaging unit” may be any desired unit for separating an image into equivalent portions including, for example, a pixel, a plurality of pixels, a fraction of a pixel, a voxel, a plurality of voxels, a fraction of a voxel etc.
- The imaging unit data is represented by a value, for example a digital value, and can thus be quantified and measured. Typically, image intensity is measured for corresponding imaging units in the time separated images. For dynamic imaging using contrast agents a temporal difference can be determined with respect to contrast concentration. The temporal difference of contrast concentration can be represented as a plot of contrast enhancement as a function of time.
- Two alternatives for determining temporal differences of contrast concentration and selecting temporal differences are shown in
FIG. 1 . In one alternative shown inFIG. 1 , once the plurality of imaging units has been selected from each time separated image atstep 110, a temporal difference is determined for each imaging unit (step 115). The determined temporal difference or representations thereof are then ranked according to degree of observed temporal difference (step 120). Temporal differences above a threshold limit are then selected (step 125). A processed image is then constructed on the basis of the selected temporal differences (step 150). - In the other alternative shown in
FIG. 1 , the temporal differences are not ranked. Rather, the temporal data for imaging units are analyzed to select temporal differences above a threshold limit using statistical techniques, and more particularly blind signal separation statistical techniques. For example, with respect to dynamic CT imaging using a contrast agent, once the plurality of imaging units have been selected from each time separated image atstep 110, a covariance matrix of the co-variations of all pairs of contrast enhancement plots in relation to a mean curve is established (step 130) and analyzed with a blind signal separation statistical technique (step 135), such as with a principal components analysis being applied to the covariance matrix. Eigenvector/eigenvalue pairs are calculated on the basis of the statistical analysis (step 140). Resulting eigenvector/eigenvalue pairs above a threshold limit are then selected on the basis of their eigenvalues (step 145). A processed image is then constructed using the selected eigenvectors, with different weightings of the selected eigenvectors being used to construct individual imaging units (step 160). - The plurality of time separated images may optionally be registered to correlate corresponding locations in the time separated images to each other. Registration of the plurality of time separated images is only needed to correct for gross misregistration. Otherwise, slight movement between the time separated images may be tolerated and may even be removed by the processing method described herein.
- As another optional step, the plurality of time separated images may be preprocessed so that the time separated images are represented with quantifiable values or codes. For example, the time separated images may be represented by digital values using known digitization techniques. If the imaging data of the plurality of time separated images is provided in a digital form, then a digitization step is not necessary.
- The determination of temporal differences of contrast concentration will now be further described with reference to
FIG. 2 .FIG. 2 shows a series of six chronologically ordered time separated images, t1 to t6. A 4×6 array of imaging units is marked on each time separated image. In this example, five (5) imaging units, IU1 to IU5, have been selected. As is clear from comparing the entire series of time separated images. t1 to t6, imaging unit IU1 is selected at the same position of the array (i.e.column 1, row 2) for each of the time separated images. Similarly, each of imaging units IU2 to IU5 is selected in corresponding positions of the imaging unit array throughout the series of time separated images. Accordingly, values for each imaging unit at its corresponding position throughout the time separated images can be plotted as a function of time to obtain a temporal curve. The plotting step is illustrated by the arrows linking the corresponding positions of imaging units IU1, IU2 and IU5. The temporal curve for each imaging unit can then be analyzed to determine a temporal difference. For example, a mean curve for all of the temporal curves obtained can be calculated. The mean curve is then subtracted from each of the temporal curves to obtain a temporal difference curve for each selected imaging unit. It will be understood, that the marked array and the selection of imaging units IU1 to IU5, as well as the arrows representing plotting of values for imaging units IU1, IU2, and IU5 as a function of time, is for illustration purposes only, and that any number of imaging units may be selected and analyzed as desired. Furthermore, the determination of temporal differences by subtraction of a mean curve from the temporal curves for imaging units is for illustration only, and other methods of analyzing the temporal curves, for example using derivatives and/or statistical techniques are contemplated. - A mathematical basis for blind signal separation statistical analysis of a plurality of time separated images is now provided using time separated images from a CT Perfusion study as an example.
- Given a series of n dynamic (i.e. time separated) images from a CT Perfusion study, the n dynamic images can be represented compactly as a matrix:
-
{tilde over (X)}=[{tilde over (x)} 1 T {tilde over (x)} 2 T . . . . . . {tilde over (x)} p−1 T {tilde over (x)} p T]T - where p is the number of pixels in a CT image (i.e. p=512×512, 258×258, etc) and {tilde over (x)}i, i=1, . . . , p is a n×1 vector whose elements are the pixel values in the n images or the time vs. enhancement curve from the ith pixel. Note that the (i,j)th element of {tilde over (X)} is the jth element xψ of {tilde over (x)}i. Each {tilde over (x)}i, i=1, . . . ,p can also be interpreted as repeated observations of a single time vs. enhancement curve {tilde over (χ)} (a random process consisting of n random variables, χ1, χ2, . . . ,χn−1, χn).
Notation is interpreted as follows: -
- (i) a vector is represented by a tilde above a Greek or Roman alphabet character with elements arranged in a column;
- (ii) a matrix is represented by tilde over a capitalized Greek or Roman alphabet character;
- (iii) the transpose of a vector or a matrix is indicated by a superscript T on the symbol; and
- (iv) a random variable is represented by a Greek alphabet character while an observation (samples) of a random variable is represented by the corresponding Roman alphabet character; the correspondence between Greek and Roman alphabet character will be used as shown below in the following discussion:
- χx
- ψy
- ζz
- (v) a random process consisting of n random variables is represented by a n×1 vector.
- One approach to removing noise from the n dynamic images is to find an ‘expansion’ of the p×n matrix, {tilde over (X)}, and then truncate the expansion by certain pre-determined criteria. A common expansion is the singular value decomposition of {tilde over (X)};
-
{tilde over (X)}=Ũ·{tilde over (L)}·{tilde over (V)} T (1) - where Ũ is a p×p orthogonal matrix, {tilde over (V)} is a n×n orthogonal matrix, and {tilde over (L)} is a p×n diagonal matrix with singular values of {tilde over (X)} as its diagonal elements. Let Ii, . . . , In be the singular values of {tilde over (X)} (it is assumed without loss of generality that {tilde over (X)} is of full column rank, n and p>n). Then:
-
{tilde over (L)}=└Ĩ 1 . . . Ĩ n┘ - where Ĩi i=1, . . . , n is a p×1 vector with zero elements except for the ith element which is Il. Usually the singular values I1, . . . , In are arranged in descending order and small singular values can be discarded as arising from noise. A simple way to reduce noise in {tilde over (X)} is to keep only r<n singular values. Then:
-
{tilde over (L)}=└Ĩ 1 . . . I r {tilde over (0)}r+1 . . . {tilde over (0)}n┘ - If the truncated series of singular values is used to reconstitute {tilde over (X)} according to Equation (1), then:
-
- where ũi i=1, . . . ,p is the ith column of Ũ and {tilde over (v)}i i=1, . . . ,n is the ith column of {tilde over (V)}. Evaluating the expansion, yields:
-
- Thus, in the expansion of {tilde over (X)}, keeping r singular values means that only the first r columns of Ũ and {tilde over (V)} is needed.
- The singular value decomposition (SVD) (expansion) of {tilde over (X)} as formulated here, however, has two main disadvantages in de-noising dynamic images from CT Perfusion, namely:
- 1. The size of the matrix {tilde over (X)} can be as large as (256)2×40-60, making it computationally prohibitive to find the SVD of {tilde over (X)}; and
- 2. Although the criterion of discarding small singular values makes general sense, if is difficult to justify the threshold used to keep or discard singular values.
- An alternative method to achieve the SVD of {tilde over (X)}will now be described. As stated above, the time vs. enhancement curves from each pixel (or pixel block) {tilde over (x)}i,i=1, . . . ,p can be regarded as repeated samples (observations) of the underlying random process (time vs. enhancement curve) {tilde over (χ)}. Then the sample mean of the random process,
x , can be calculated as: -
- {tilde over (x)} by definition is a n×1 vector (the sample mean time vs. enhancement curve) and the jth component of
x , according to Equation (3), is: -
- where {tilde over (x)}ij is the jth component of {tilde over (x)}i.
The zero mean random process from {tilde over (χ)} is , {tilde over (ψ)}={tilde over (χ)}−{tilde over (χ)}, where {tilde over (χ)} is the population mean of {tilde over (χ)}. For each observation (sample) {tilde over (x)}i of {tilde over (χ)}, the corresponding observation (sample) of {tilde over (ψ)} is given by: -
{tilde over (y)} i ={tilde over (x)} i −x . - The sample mean of {tilde over (ψ)}, {tilde over (y)}, a n×1 vector is given by:
-
- where {tilde over (0)} is a n×1 zero vector as expected since {tilde over (ψ)} is a zero mean random process,
- Let {tilde over (Y)}=[{tilde over (y)}1 Ty2 T . . . . . . {tilde over (y)}p−1 T{tilde over (y)}p T]T be a p×n matrix whose rows are {tilde over (y)}i T′i=1, . . . ,p. Then:
-
- where σi 2 is the sample variance of ψi i=1, . . . ,n and σij 2 is the sample covariance of ψi and ψj i,j=1, . . . ,n.
-
- is the sample covariance matrix of {tilde over (ψ)} and is of dimension n×n. In CT Perfusion n is typically 40-60.
A linear combination of ψi, i=1, . . . ,n, ζ, can be defined as: -
ζ=ã T·{tilde over (ψ)} - where ã is a given n×1 vector of coefficients. ζ is a random variable (not process) with observations zi i=1, . . . ,p given by:
-
z i =ã T·{tilde over (y)} i - by definition of ζ. The sample mean of ζ,
z , is given by: -
- Thus, ξ is also a zero mean random variable. The sample variance of ζ is given by:
-
- Determination of the vector of coefficients, ã, to maximize the sample variance of ζ, ãT·{tilde over (S)}·ã will now be investigated. Since ãT·{tilde over (S)}·ã can be made as large as required by scaling ã with a constant, the optimization can only be done by imposing a normalization condition, such as ãT·ã=1. To maximize ãT·{tilde over (S)}·ã subject to ãT·ã=1, the standard approach is to use the technique of Lagrange multipliers. That is it is sought to maximize:
-
ã T ·{tilde over (S)}·ã−λ·(ã T ·ã−1) - where λ is the Lagrange multiplier. Differentiation with respect to ã gives:
-
{tilde over (S)}·ã−λ·ã{tilde over (0)} - Thus, λ is the eigenvalue of {tilde over (S)} and ã is the corresponding eigenvector and
-
sample var(ζ)=ã T ·{tilde over (S)}·ã=ã T ·λ·ã=λ, the eigenvalue of {tilde over (S)} - That is to maximize ãT·{tilde over (S)}·ã subject to ãT·ã=1, ã is the eigenvector of {tilde over (S)} that has the highest eigenvalue.
- Let λ1 be the largest eigenvalue with the corresponding eigenvector ã1, then ζ1=ã1 T·{tilde over (ψ)} is called the first sample principal component of {tilde over (ψ)}. it Is a random variable with observations defined by zi1=ã1 T·{tilde over (y)}izi1 is also called the score of the ith observation on the first principal component. The second principal component, ζ2=ã2 T·{tilde over (ψ)}, similarly, maximizes the sample variance of ζ2, ã2 T·{tilde over (S)}·ã2, subject to being uncorrected to ζ1 and the normalization condition ã2 T·ã2=1. The observations corresponding to ζ2 is zi2=ã2 T·{tilde over (y)}i. The sample covariance of ζ1 and ζ2 is:
-
- The requirement that ζ2 is uncorrelated to ζ1 is the same as requiring:
- Thus, any of the conditions:
-
ã 2 T ·{tilde over (S)}·ã 1=0 ã 2 T ·ã 1=0 -
ã 1 T ·{tilde over (S)}·ã 2=0 ã 1 T ·ã 2=0 - can be used to specify that ζ2 is uncorrected to ζ1.
- To maximize the sample variance of ζ2, ã2 T·{tilde over (S)}·ã2, subject to the conditions that ζ2 is uncorrelated ζ1 and ã 2 T·ã=1 is the same as to maximize:
-
ã 2 T ·{tilde over (S)}·ã 2−λ2·(ã 2 T ·ã 2−1)−φã 2 T ·ã 1 - where the condition ã2 T·ã1=0 is used to specify that ζ2 is uncorrelated to ζ1 and ζ2 and φ are Lagrange multipliers. Differentiation with respect to ã2 gives:
-
{tilde over (S)}·ã 2−λ2· ã 2−φ·ã 1=0 - Multiplying through by ã1 T gives:
-
ã 1 T ·{tilde over (S)}·ã 2−λ2 ·ã 1 T ·ã 2−φ·ã 1 T ·ã 1=0 - which, since the first two terms are zero and ã1 T·ã1=1, reduces to φ=0.
-
{tilde over (S)}·ã 2−λ2 ·ã 2=0 - so λ2 is once more an eigenvalue of {tilde over (S)}, and ã2 the corresponding eigenvector.
- Again, ã2 T·{tilde over (S)}·ã2=λ2 or the the sample variance of ζ2 is λ2. Assuming that {tilde over (S)} does not have repeat eigenvalues, λ2 cannot be equal to λ1. If it did, It follows that ã2=ã1. violating the constraint that ã2 T·ã1=0. Hence λ2 is the second largest eigenvalue and ã2 the corresponding eigenvector.
- It can be shown using the same technique that for the third, fourth, . . . , nth sample principal components, the vectors of coefficients ã3, ã4, . . . , ãn are the eigenvectors of {tilde over (S)} corresponding to λ3, λ4, . . . , λn, the third, fourth largest, and the smallest eigenvalue. Furthermore, the sample variances of the principal components are also given by the eigenvalues of {tilde over (S)}.
- Define {tilde over (Z)} to be the p×n matrix of the scores of observations on principal components. In this case, the ith row consists of the scores of the ith observation of {tilde over (ψ)} (i.e. {tilde over (y)}i) on all principal components ζ1, ζ2, . . . , ζn−1, ζn, that is:
-
- where à is a n×n matrix whose columns are the eigenvectors of {tilde over (S)} and is orthogonal.
- The first principal component, ζ1, maximized is expressed by;
-
- ({tilde over (x)}i−
x ) is the deviation of the time vs. enhancement curve (TEC) from the ith pixel (pixel block) from the mean of TECs from all pixels (pixel blocks). Thus, the eigenvectors; ã1, ã2, ã3, ã4, . . . , ãn represent the first, second, third, fourth, . . . , and least dominant time vs. enhancement behaviour in the set of TECs from all pixels. The loadings of the eigenvectors ã1, ã2, ã3, ã4, . . . ,ãn in the TEC from the ith pixel (pixel block) are: -
ã 1 T ·{tilde over (y)} i , ã 2 T ·{tilde over (y)} i , ã 3 T ·{tilde over (y)} i , ã 4 T ·{tilde over (y)} i , . . . , ã n T ·{tilde over (y)} i - and is the ith row of the matrix {tilde over (Z)} while the loadings of the eigenvector ã1 in the TECs from all pixels (pixel blocks) are:
-
ã i T ·{tilde over (y)} 1 , ã i T ·{tilde over (y)} 2 , ã i T ·{tilde over (y)} 3 , ã i T ·{tilde over (y)} 4 , . . . , ã i T ·{tilde over (y)} p - and is the ith column of the matrix {tilde over (Z)}. The ith column of {tilde over (Z)}, therefore, gives the loading map of the eigenvector ãi which corresponds to the ith largest eigenvalue λi.
- To de-noise the dynamic Images from a CT Perfusion study, the reverse of the calculation of the loading maps of eigenvectors is required. Reconstituting a smooth version of the original dynamic images, {tilde over (Y)}({tilde over (X)}), from a truncated series of eigenvectors ã1, ã2, ã3, ã4, . . . ãr is necessary.
- As in Equation (1), the p×n matrix {tilde over (Y)} can be expanded by singular value decomposition as:
-
{tilde over (Y)}=Ũ·{tilde over (L)}·{tilde over (V)} T - where Ũ is a p×p orthogonal matrix, {tilde over (V)} is a n×n orthogonal matrix, and {tilde over (L)} is a p×n diagonal matrix with singular values of {tilde over (Y)} as its diagonal elements. Let l1, . . . , ln be the singular values of {tilde over (Y)} (it is assumed without loss of generality that {tilde over (Y)} is of full column rank, n and p>n). Using the singular value decomposition:
-
- Multiplying both sides of the equation by {tilde over (V)} yields:
-
- {tilde over (L)}=└{tilde over (l)}i . . . {tilde over (l)}i . . . {tilde over (l)}n┘ where {tilde over (l)}i i=1, . . . , n is a p×1 vector whose elements are all zero except the ith element which is equal to li, that is {tilde over (l)}i T=[0 . . . li . . . 0] and
-
- Then,
-
- where {tilde over (m)}i T=[0 . . . li 2 . . . 0].
Let {tilde over (V)}=[{tilde over (v)}1 . . . {tilde over (v)}i . . . {tilde over (v)}n] where {tilde over (v)}i i=1, . . . ,n is a n×1 vector. -
- Substituting in Equation (5) yields:
-
- From the discussion on eigenvectors and eigenvalues;
-
- or the singular values of {tilde over (Y)}(li) is equal to the square root of (p−1) times the eigenvalue value of {tilde over (S)}(λi), where
-
- i.e. li=√{square root over ((p−1)·λi)}
-
Thus, {tilde over (Y)}T ·{tilde over (Y)}·{tilde over (v)} i =l i 2 ·{tilde over (v)} i or {tilde over (Y)} T ·{tilde over (Y)}·ã i =l i 2 ·ã i i=1, . . . ,n (5a) - Next, consider
-
- (note that {tilde over (S)}* is not the transpose of {tilde over (S)})
- Multiplying both sides of the equation by Ũ yields:
-
-
- Let {tilde over (m)}i*=[0 . . . li 2 . . . 0p]T be a p×1 vector as defined, then
-
- Let Ũ=[ũ1 . . . ũi . . . ũp] where ũi i=1, . . . ,p is a p×1 vector.
-
- Substituting in Equation (6) yields;
-
- Thus, ũi i=1, . . . ,n is the eigenvector of {tilde over (S)}* corresponding to the ith eigenvalue
-
- which happens also to be the ith eigenvalue of {tilde over (S)}, while all ũi i=n+1, . . . ,p are eigenvectors of {tilde over (S)}* with zero eigenvalue. Also
-
{tilde over (Y)}·{tilde over (Y)} T ·ũ i =l i 2 ·ũ i i=1, . . . ,n (6a) - As stated above, Equation (5a) is:
-
{tilde over (Y)} T ·{tilde over (Y)}·{tilde over (v)} i =l i 2 ·{tilde over (v)} i - Multiplying both sides by {tilde over (Y)} yields:
-
{tilde over (Y)}·{tilde over (Y)} T ·{tilde over (Y)}·{tilde over (v)} i l i 2 ·{tilde over (Y)}·{tilde over (v)} i - Comparing with Equation (6a):
-
{tilde over (Y)}·{tilde over (v)} i =c·ũ i where c is a constant (7a) - Similarly multiplying both sides of Equation (6a) by {tilde over (Y)}T yields;
-
{tilde over (Y)} T ·{tilde over (Y)}·{tilde over (Y)} T ·ũ i =l i 2 ·{tilde over (Y)} T ·ũ i - Comparing with Equation (5a):
-
{tilde over (Y)} T ·ũ i =c*·{tilde over (v)} i where c is a constant (7b) -
- Substituting into Equation (7a) yields:
-
{tilde over (Y)}·{tilde over (Y)} T ·ũ i =c·c·ũ i - Substituting into Equation (6a) yields:
-
l i 2 ·ũ i =c*·c·ũ i - Therefore, c*·c=li 2
Without loss of generality, c* is set to: -
c*=c=1i=√{square root over ((p−1)·λi)}i=1, . . .n and n−p - Thus, for the singular value decomposition of {tilde over (Y)}:
-
{tilde over (Y)}=Ũ·{tilde over (L)}·{tilde over (V)} T - where Ũ is a p×p orthogonal matrix;
-
Ũ=[ũ l . . . ũ i . . . ũ p] and ũ i i=1, . . . ,p is a p×1 vector; - {tilde over (V)} is a n×n orthogonal matrix:
-
{tilde over (V)}=[{tilde over (v)} l . . . {tilde over (v)} i . . . {tilde over (v)}n] and {tilde over (v)} i i=1, . . . ,n is a n×1 vector; - and {tilde over (L)} is a p×n diagonal matrix with singular values of {tilde over (Y)}, li, . . . ,ln, as its diagonal elements; it Is also assumed without loss of generality that {tilde over (Y)} is of full column rank, n and p>n.
It is shown that: - {tilde over (v)}i=ãi where ãi is the ith eigenvector of
-
- corresponding to the eigenvalue
-
- and from Equation (7c)
-
- As discussed above, to de-noise {tilde over (Y)} the SVD expansion can be truncated after the rth singular value:
-
- Equation (8) also affords a very simple geometric interpretation as explained in the following.
-
- where Ã, is a n×r matrix whose ith column is ãi and from Equation (4a):
-
{tilde over (Z)} r ={tilde over (Y)}·Ã r - and the rows and columns of {tilde over (Z)}r have the same interpretation as those of {tilde over (Z)}.
-
- Equation (10) suggests that the TEC for the ith pixel (pixel block) is a weighted summation of r eigenvectors with the weights given by the loading of the ith pixel TEC on the eigenvectors.
- The eigenvectors ã1, ã2, . . . , ãr−1, ãr can be regarded as forming an orthonormal basis in n dimensional space. The projection of {tilde over (y)}i on ãi is {tilde over (y)}i T·ãi and {tilde over (y)}i can be reconstituted as
-
- The alogorithm to de-noise {tilde over (X)}=[{tilde over (x)}i T . . . {tilde over (x)}i T . . . {tilde over (x)}x p T] is as follows:
- 1. Calculate the p×n zero mean matrix, {tilde over (Y)}=[{tilde over (y)}1 T . . . {tilde over (y)}i T . . . {tilde over (y)}p T]T, corresponding to {tilde over (X)}, where
-
{tilde over (y)} i ={tilde over (x)} i −x and -
- 2. Calculate the n×n sample covariance matrix, {tilde over (S)}:
-
- 3. Calculate the n pairs of eigenvalue and eigenvectors,
-
(λi ,ã i)i=1, . . . ,n - 4. Calculate the n×n smoothing matrix by keeping only the largest r eigenvalues:
-
- 5. Smooth {tilde over (Y)}=[{tilde over (y)}i* . . . {tilde over (y)}i* . . . {tilde over (y)}p] by calculating the product:
-
- 6. Calculate a smoothed version of {tilde over (X)}* as follows:
-
{tilde over (X)}* =[{tilde over (y)} 1 *+x . . . {tilde over (y)} i *+x . . . {tilde over (y)} p *+x ], - An example of the method described herein will now be demonstrated with regard to experimental results. The principal component analysis (PCA) described herein is tested for the ability to achieve dose reduction of CT scans.
- The PCA method will now be summarized based on a CT Perfusion study that generates a plurality of time separated images that capture the passage of contrast through the brain. Corresponding to each pixel in the series of images, a curve is generated that represents the contrast concentration in that pixel as a function of time. A difference curve, equal to the difference of the curve from the mean of all pixel curves is also generated. A covariance matrix of the co-variations of all pairs of difference curves is calculated and represents all possible variations about the mean curve. The principal component analysis method analyzes the covariance matrix to find common temporal patterns among the curves by finding linear combinations of the difference curves that represent most of the variations about the mean curve. It can be shown that such linear combinations, or principal components, are the eigenvectors of the covariance matrix and that the eigenvector with the largest eigenvalue is the most prominent temporal feature among all the difference curves, the eigenvector with the second largest eigenvalue is the second most prominent temporal feature and so on, while eigenvectors with small eigenvalues are from noise in the CT images. A corollary is that each difference curve can be represented as a sum of all the principal components and by discarding components with small eigenvalues, noise can be effectively suppressed. To denoise the time series of images, the mean curve is added to all the difference curves reconstituted by using the first few principal components with large eigenvalues.
- While currently available statistical filters remove noise in projection data before image reconstruction, the principal component analysis method removes noise from the reconstructed images. Experimental results described below show that performing PCA leads to dose reduction in CT imaging.
- The PCA method is tested versus the traditional filtered back-projection (FBP) method in radiation dose reduction for CT Perfusion applications. The dose saving of PCA versus FBP on measuring brain perfusion using CT Perfusion was tested in a healthy pig, which was scanned four times with the x-ray tube current changed from 190 mA to 100 mA; 75 mA and 50 mA. respectively, while keeping other scanning parameters the same.
-
FIG. 3 shows brain blood flow maps of the pig calculated using the J-W model with CT Perfusion images obtained using (A) 190 mA and FBP reconstruction; (B) 100 mA, FBP reconstruction and PCA; (C) 70 mA, FBP reconstruction and PCA; and, (D) 50 mA, FBP reconstruction and PCA. Blood flow map (E) ofFIG. 3 shows regions of interest (3 outlined circles) used for calculation of Figure of Merit of the blood flow maps shown inFIG. 4 . The regions are superimposed on a CT image which shows a coronal section through the brain of the pig. The dark areas are the skull and jaw bones. -
FIG. 4 shows that in terms of standard deviation/mean of blood flow (Figure of Merit) in the three regions shown inFIG. 3(E) : 70 mA with PCA was better than 190 mA with FBP, while 50 mA PCA was worse than 190 mA with FBP (p<0.05). The image qualify of the blood flow maps inFIG. 3 also reflects this progression. Therefore, the PCA method is able to reduce radiation dose required to obtain images in CT Perfusion studies and in maintaining the quality of derived blood flow maps compared to the use of FBP alone. More specifically, the PCA method achieved approximately three fold reduction in radiation dose compared to the use of FBP alone. The effect of the PCA method on dose reduction in production of BBB-PS maps was not demonstrated because the blood-brain barrier remained intact. However, since blood flow, blood volume and BBB-PS are calculated together in the J-W model, the dose reduction shown using blood flow maps is expected to apply to BBB-PS maps. - The principal component analysis methodology described herein has been implemented in a computer executable software application using C++. The time required to process ninety-five (95) 512×512 CT brain images is less than two (2) minutes on a general purpose computing device such as for example a personal computer (PC).
- The method described herein can be implemented on hardware such as system 400 shown in
FIG. 5 . An input 510 receives a plurality of time separated images, which can be previously stored, received directly from an imaging device, or communicated over a wired or wireless communication link from a remote location. A generalpurpose computing device 505 receives the time separated images from the input and executes a software application thereby to process the time separated images as described above. The generalpurpose computing device 505 interfaces with the user through adisplay 520, a keyboard 515 and/or a mouse orother pointing device 525. Results, for example the constructed processed images, can be presented ondisplay 520 and/or output to any suitable output device 530, for example, a printer, a storage device, or a communication device for communicating the results to a remote location. - The software application described herein may run as a stand-alone application or may be incorporated info other available applications to provide enhanced functionality to those applications. The software application may include program modules including routines, programs, object components, data structures etc. and may be embodied as computer readable program code stored on a computer readable medium. The computer readable medium is any data storage device that can store data, which can thereafter be read by a computer system. Examples of computer readable media include for example read-only memory, random-access memory, CD-ROMs, magnetic tape and optical data storage devices. The computer readable program code can also be distributed over a network including coupled computer systems so that the computer readable program code is stored and executed in a distributed fashion.
- The above-described embodiments are intended to be examples and alterations and modifications may be effected thereto, by those of skill in the art, without departing from the scope of the invention which is defined by the claims appended hereto.
Claims (28)
1. A method of processing a plurality of time separated images comprising:
selecting a plurality of imaging units in each image;
determining a temporal difference for each imaging unit; and
selecting temporal differences above a threshold limit.
2. The method of claim 1 , further comprising ranking each measured temporal difference prior to said selecting.
3. The method of claim 1 , further comprising constructing a processed image using the selected temporal differences.
4. The method of claim 1 , wherein each imaging unit is one of a pixel and a voxel.
5. The method of claim 1 , wherein each imaging unit is one of a plurality of pixels and a plurality of voxels.
6. The method of claim 1 , wherein the temporal difference is based on contrast enhancement.
7. The method of claim 6 , wherein the temporal difference is a difference of a contrast agent.
8. The method of claim 7 , wherein contrast enhancement is based on the concentration of the contrast agent.
9. The method of claim 7 , wherein contrast enhancement is based on the activation of the contrast agent.
10. The method of claim 1 , further composing characterizing the measured temporal differences with a blind signal separation statistical technique.
11. The method of claim 1 , wherein determining the temporal difference comprises calculating a covariance matrix of temporal differences for the imaging units.
12. The method of claim 11 , further comprising analyzing the covariance matrix with a blind signal separation statistical technique to determine common temporal patterns among the temporal differences.
13. The method of claim 12 , further comprising analyzing the eigenvectors of the covariance matrix.
14. The method of claim 13 , wherein eigenvalues of the eigenvector represent the degree of temporal difference.
15. The method of claim 14 , wherein the selecting of temporal differences comprises selecting eigenvalues above the threshold limit.
16. The method of claim 1 , wherein the threshold limit is adjustable.
17. The method of claim 12 , wherein the blind signal separation statistical technique is selected from the group consisting of principal component analysis, independent component analysis, blind source deconvolution, Karhunen-Loeve transform and Hotelling transform.
18. The method of claim 1 , wherein the plurality of time separated images are obtained using a dynamic medical imaging technique.
19. The method of claim 18 , wherein the dynamic medical imaging technique comprises use of a contrast agent.
20. The method of claim 18 , wherein the time separated images are obtained using a protocol having a reduced radiation dose.
21. The method of claim 18 , wherein the time separated Images are obtained using a protocol having a reduced amount of contrast agent.
22. The method of claim 18 , wherein the dynamic medical imaging technique is magnetic resonance imaging (MRI), functional MRI, positron emission tomograghy, nuclear medecine or computed tomography.
23. The method of claim 18 , wherein the dynamic medical imaging technique is computed tomography (CT).
24. The method of claim 23 , wherein the time separated images are obtained using a CT Perfusion protocol having a reduced radiation dose.
25. The method of claim 23 , wherein the time separated images are obtained using a CT Perfusion protocol having a reduced amount of contrast agent.
26. A system for processing a plurality of time separated images comprising:
an interface for receiving a plurality of time separated images; and
a processing structure for selecting a plurality of imaging units in each image, determining a temporal difference for each imaging unit, and selecting temporal differences above a threshold limit.
27. A computer readable medium embodying a computer program for processing a plurality of time separated images, the computer program comprising:
computer program code for selecting a plurality of imaging units in each image;
computer program code for determining a temporal difference for each imaging unit; and
computer program code for selecting temporal differences above a threshold limit.
28. A system for processing a plurality of time separated images according to the method of claim 1 .
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US14/628,731 US20150230771A1 (en) | 2008-10-02 | 2015-02-23 | System and method for processing images |
US15/338,000 US20170109886A1 (en) | 2008-10-02 | 2016-10-28 | System and method for processing images |
Applications Claiming Priority (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10220608P | 2008-10-02 | 2008-10-02 | |
PCT/CA2009/001397 WO2010037233A1 (en) | 2008-10-02 | 2009-10-02 | System and method for processing images |
US201113122379A | 2011-07-19 | 2011-07-19 | |
US14/039,619 US8965086B2 (en) | 2008-10-02 | 2013-09-27 | System and method for processing images |
US14/628,731 US20150230771A1 (en) | 2008-10-02 | 2015-02-23 | System and method for processing images |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/039,619 Continuation US8965086B2 (en) | 2008-10-02 | 2013-09-27 | System and method for processing images |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/338,000 Continuation US20170109886A1 (en) | 2008-10-02 | 2016-10-28 | System and method for processing images |
Publications (1)
Publication Number | Publication Date |
---|---|
US20150230771A1 true US20150230771A1 (en) | 2015-08-20 |
Family
ID=42073000
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/122,379 Abandoned US20110262022A1 (en) | 2008-10-02 | 2009-10-02 | System and method for processing images |
US14/039,619 Expired - Fee Related US8965086B2 (en) | 2008-10-02 | 2013-09-27 | System and method for processing images |
US14/628,731 Abandoned US20150230771A1 (en) | 2008-10-02 | 2015-02-23 | System and method for processing images |
US15/338,000 Abandoned US20170109886A1 (en) | 2008-10-02 | 2016-10-28 | System and method for processing images |
Family Applications Before (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/122,379 Abandoned US20110262022A1 (en) | 2008-10-02 | 2009-10-02 | System and method for processing images |
US14/039,619 Expired - Fee Related US8965086B2 (en) | 2008-10-02 | 2013-09-27 | System and method for processing images |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/338,000 Abandoned US20170109886A1 (en) | 2008-10-02 | 2016-10-28 | System and method for processing images |
Country Status (4)
Country | Link |
---|---|
US (4) | US20110262022A1 (en) |
EP (1) | EP2332122A4 (en) |
CN (1) | CN102282587B (en) |
WO (1) | WO2010037233A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2017192629A1 (en) * | 2016-05-02 | 2017-11-09 | The Regents Of The University Of California | System and method for estimating perfusion parameters using medical imaging |
US20190057506A1 (en) * | 2016-02-29 | 2019-02-21 | Shanghai United Imaging Healthcare Co., Ltd. | Method and device for perfusion analysis |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2583241A1 (en) * | 2010-06-21 | 2013-04-24 | Koninklijke Philips Electronics N.V. | Method and system for noise reduction in low dose computed tomography |
US9129425B2 (en) | 2010-12-24 | 2015-09-08 | Fei Company | Reconstruction of dynamic multi-dimensional image data |
WO2015058320A1 (en) * | 2013-10-25 | 2015-04-30 | Acamar Corporation | Denoising raw image data using content adaptive orthonormal transformation with cycle spinning |
CN106716172B (en) * | 2014-08-14 | 2020-06-05 | 皇家飞利浦有限公司 | Acoustic streaming for fluid pool detection and identification |
JP7086630B2 (en) * | 2018-02-09 | 2022-06-20 | キヤノン株式会社 | Information processing equipment, information processing methods, and programs |
CN112035818B (en) * | 2020-09-23 | 2023-08-18 | 南京航空航天大学 | Physical encryption radiation imaging-based identity authentication system |
Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040005083A1 (en) * | 2002-03-26 | 2004-01-08 | Kikuo Fujimura | Real-time eye detection and tracking under various light conditions |
US20040101156A1 (en) * | 2002-11-22 | 2004-05-27 | Dhiraj Kacker | Image ranking for imaging products and services |
US20040167395A1 (en) * | 2003-01-15 | 2004-08-26 | Mirada Solutions Limited, British Body Corporate | Dynamic medical imaging |
US20060083407A1 (en) * | 2004-10-15 | 2006-04-20 | Klaus Zimmermann | Method for motion estimation |
US20070183629A1 (en) * | 2006-02-09 | 2007-08-09 | Porikli Fatih M | Method for tracking objects in videos using covariance matrices |
US20070211958A1 (en) * | 2003-11-12 | 2007-09-13 | Michael Khazen | Method and Means for Image Processing |
US20080146897A1 (en) * | 2004-12-07 | 2008-06-19 | Research Foundation Of City University Of New York | Optical tomography using independent component analysis for detection and localization of targets in turbid media |
US20080292194A1 (en) * | 2005-04-27 | 2008-11-27 | Mark Schmidt | Method and System for Automatic Detection and Segmentation of Tumors and Associated Edema (Swelling) in Magnetic Resonance (Mri) Images |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB9314499D0 (en) * | 1993-07-12 | 1993-08-25 | Nycomed Imaging As | Method |
EP1171028B1 (en) | 1999-03-26 | 2005-11-16 | Leif Ostergaard | System for determining haemodynamic indices by use of tomographic data |
US7187794B2 (en) | 2001-10-18 | 2007-03-06 | Research Foundation Of State University Of New York | Noise treatment of low-dose computed tomography projections and images |
US7078897B2 (en) * | 2002-01-16 | 2006-07-18 | Washington University | Magnetic resonance method and system for quantification of anisotropic diffusion |
FR2848093B1 (en) * | 2002-12-06 | 2005-12-30 | Ge Med Sys Global Tech Co Llc | METHOD FOR DETECTING THE CARDIAC CYCLE FROM AN ANGIOGRAM OF CORONARY VESSELS |
US20040218794A1 (en) * | 2003-05-01 | 2004-11-04 | Yi-Hsuan Kao | Method for processing perfusion images |
US20050113680A1 (en) * | 2003-10-29 | 2005-05-26 | Yoshihiro Ikeda | Cerebral ischemia diagnosis assisting apparatus, X-ray computer tomography apparatus, and apparatus for aiding diagnosis and treatment of acute cerebral infarct |
WO2005120353A1 (en) * | 2004-06-14 | 2005-12-22 | Canon Kabushiki Kaisha | Image processing device and method |
US7668359B2 (en) * | 2004-06-28 | 2010-02-23 | Siemens Meidcal Solutions USA, Inc. | Automatic detection of regions (such as, e.g., renal regions, including, e.g., kidney regions) in dynamic imaging studies |
JP4437071B2 (en) | 2004-12-24 | 2010-03-24 | パナソニック株式会社 | Driving assistance device |
US20080100473A1 (en) * | 2006-10-25 | 2008-05-01 | Siemens Corporate Research, Inc. | Spatial-temporal Image Analysis in Vehicle Detection Systems |
-
2009
- 2009-10-02 EP EP09817153.1A patent/EP2332122A4/en not_active Withdrawn
- 2009-10-02 US US13/122,379 patent/US20110262022A1/en not_active Abandoned
- 2009-10-02 CN CN200980147491.XA patent/CN102282587B/en not_active Expired - Fee Related
- 2009-10-02 WO PCT/CA2009/001397 patent/WO2010037233A1/en active Application Filing
-
2013
- 2013-09-27 US US14/039,619 patent/US8965086B2/en not_active Expired - Fee Related
-
2015
- 2015-02-23 US US14/628,731 patent/US20150230771A1/en not_active Abandoned
-
2016
- 2016-10-28 US US15/338,000 patent/US20170109886A1/en not_active Abandoned
Patent Citations (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040005083A1 (en) * | 2002-03-26 | 2004-01-08 | Kikuo Fujimura | Real-time eye detection and tracking under various light conditions |
US20040101156A1 (en) * | 2002-11-22 | 2004-05-27 | Dhiraj Kacker | Image ranking for imaging products and services |
US20040167395A1 (en) * | 2003-01-15 | 2004-08-26 | Mirada Solutions Limited, British Body Corporate | Dynamic medical imaging |
US20070211958A1 (en) * | 2003-11-12 | 2007-09-13 | Michael Khazen | Method and Means for Image Processing |
US20060083407A1 (en) * | 2004-10-15 | 2006-04-20 | Klaus Zimmermann | Method for motion estimation |
US20080146897A1 (en) * | 2004-12-07 | 2008-06-19 | Research Foundation Of City University Of New York | Optical tomography using independent component analysis for detection and localization of targets in turbid media |
US20080292194A1 (en) * | 2005-04-27 | 2008-11-27 | Mark Schmidt | Method and System for Automatic Detection and Segmentation of Tumors and Associated Edema (Swelling) in Magnetic Resonance (Mri) Images |
US20070183629A1 (en) * | 2006-02-09 | 2007-08-09 | Porikli Fatih M | Method for tracking objects in videos using covariance matrices |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20190057506A1 (en) * | 2016-02-29 | 2019-02-21 | Shanghai United Imaging Healthcare Co., Ltd. | Method and device for perfusion analysis |
US11004200B2 (en) * | 2016-02-29 | 2021-05-11 | Shanghai United Imaging Healthcare Co., Ltd. | Method and device for perfusion analysis |
US11631178B2 (en) | 2016-02-29 | 2023-04-18 | Shanghai United Imaging Healthcare Co., Ltd. | Method and device for perfusion analysis |
WO2017192629A1 (en) * | 2016-05-02 | 2017-11-09 | The Regents Of The University Of California | System and method for estimating perfusion parameters using medical imaging |
US20190150764A1 (en) * | 2016-05-02 | 2019-05-23 | The Regents Of The University Of California | System and Method for Estimating Perfusion Parameters Using Medical Imaging |
Also Published As
Publication number | Publication date |
---|---|
US20110262022A1 (en) | 2011-10-27 |
CN102282587A (en) | 2011-12-14 |
EP2332122A4 (en) | 2013-11-20 |
WO2010037233A1 (en) | 2010-04-08 |
US20170109886A1 (en) | 2017-04-20 |
EP2332122A1 (en) | 2011-06-15 |
US20140044334A1 (en) | 2014-02-13 |
CN102282587B (en) | 2015-11-25 |
US8965086B2 (en) | 2015-02-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8965086B2 (en) | System and method for processing images | |
US10997725B2 (en) | Image processing method, image processing apparatus, and computer-program product | |
US20180160935A1 (en) | Medical image display apparatus | |
US7283652B2 (en) | Method and system for measuring disease relevant tissue changes | |
EP1958161B1 (en) | Method and system of multivariate analysis on normalized volume-wise data in the sinogram domain for improved quality in positron emission tomography studies | |
Khader et al. | Medical diffusion: denoising diffusion probabilistic models for 3D medical image generation | |
Butler et al. | Processing of spectral X-ray data with principal components analysis | |
KR20100105576A (en) | Image analysis | |
US20090074279A1 (en) | Method and system of multivariate analysis on slice-wise data of reference structure normalized images for improved quality in positron emission tomography studies | |
DE102006046285A1 (en) | Object vessel-like structures segmented representing method for patient, involves using determined probabilities as criterion for presence of vessel in segmentation process for representation of vessel structures | |
US8526701B2 (en) | Image analysis method and system | |
US7668359B2 (en) | Automatic detection of regions (such as, e.g., renal regions, including, e.g., kidney regions) in dynamic imaging studies | |
CN117813055A (en) | Multi-modality and multi-scale feature aggregation for synthesis of SPECT images from fast SPECT scans and CT images | |
US20030048937A1 (en) | Method of processing visual imagery from a medical imaging device | |
Su et al. | Single-input–dual-output modeling of image-based input function estimation | |
US8150133B2 (en) | System and method for automatic registration of 4D (3D plus time) renal perfusion MRI data | |
Lei et al. | Estimating standard-dose PET from low-dose PET with deep learning | |
Tang et al. | A novel temporal recovery technique to enable cone beam CT perfusion imaging using an interventional C-arm system | |
Zhang et al. | Prior-image-based CT reconstruction using attenuation-mismatched priors | |
Park | 10 Spatial-domain model observers for optimizing tomosynthesis | |
Meinel et al. | Reduction of Half-Scan Shading Artifact Based on Full-Scan Correction1 | |
Mumcuoglu et al. | Simultaneous surface registration of ictal and interictal SPECT and magnetic resonance images for epilepsy studies | |
Fang et al. | Efficient 4D non-local tensor total-variation for low-dose CT perfusion deconvolution | |
Lee et al. | Robust extraction of input function from H/sub 2//sup 15/O dynamic myocardial positron emission tomography using independent component analysis | |
US10332252B2 (en) | Slope constrained cubic interpolation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |