CN109636869B - Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint - Google Patents

Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint Download PDF

Info

Publication number
CN109636869B
CN109636869B CN201811434449.3A CN201811434449A CN109636869B CN 109636869 B CN109636869 B CN 109636869B CN 201811434449 A CN201811434449 A CN 201811434449A CN 109636869 B CN109636869 B CN 109636869B
Authority
CN
China
Prior art keywords
pet image
constraint
dynamic pet
pet
low
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.)
Active
Application number
CN201811434449.3A
Other languages
Chinese (zh)
Other versions
CN109636869A (en
Inventor
刘华锋
张子敬
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN201811434449.3A priority Critical patent/CN109636869B/en
Publication of CN109636869A publication Critical patent/CN109636869A/en
Application granted granted Critical
Publication of CN109636869B publication Critical patent/CN109636869B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/003Reconstruction from projections, e.g. tomography

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Nuclear Medicine (AREA)

Abstract

The invention discloses a dynamic PET image reconstruction method based on non-local total variation and low-rank constraint, which utilizes the segmentation smooth characteristic and the space-time correlation of a PET image and introduces the low-rank constraint and the non-local total variation constraint at the same time, realizes the reconstruction of the dynamic PET image, can remove the step effect and keep fine details, and is beneficial to improving early focus detection. The method optimizes the space-time correlation of the solution through the constraint of low rank and sparsity, namely, the background components and the detail components of the image are reconstructed through a combined model; meanwhile, in the reconstruction of the dynamic PET image, in order to fully consider the structural smoothness characteristic of image data, the invention introduces non-local total variation constraint, and recovers more image details and removes the step effect by utilizing the image redundancy characteristic. Compared with the prior art, the method can provide more accurate reconstructed images to improve lesion detection, and has better robustness to noise.

Description

Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint
Technical Field
The invention belongs to the technical field of PET imaging, and particularly relates to a dynamic PET image reconstruction method based on non-local total variation and low-rank constraint.
Background
Dynamic Positron Emission Tomography (DPET) enables monitoring of the spatiotemporal distribution of radiolabeled tracers in vivo, which has the potential to improve early detection, cancer characterization and treatment response assessment. The DPET uses a detector system placed around an object so as to obtain a plurality of different angle views in a series of time frames, and a radiotracer concentration map can be reconstructed by using the projection data, namely dynamic PET image reconstruction, and the dynamic processes of tracer uptake and metabolism can be better evaluated through time series images, so that the DPET has important application value in scientific research and clinical application.
PET image reconstruction is a pathologic inverse problem, and it is standard practice to use a regularization term to constrain the solution of the problem, so that the inverse problem is adaptive. In addition to traditional algorithms such as ML-EM (maximum likelihood-effective) and the like, the first type of algorithm is space smooth constraint, one of the algorithms is a Maximum A Posteriori (MAP) algorithm, and the design of penalty items for keeping smoothness of a region and sharp change of an edge is always the key point of PET (positron emission tomography) reconstruction research; another approach is to use the full variation constraint (TV) to boost the structural smoothness property of PET images, however TV-based models assume that each image pixel always has a diffusion direction of edges and gradients, which may lead to a step effect. The second category of algorithms is to exploit both temporal and spatial information to improve the quality of dynamic PET image reconstruction, temporal constraints are typically used to improve the additional robustness of the spatial solution, including spatio-temporal spline models, tracing dynamics, wavelet transforms, etc., whereas tracing dynamics methods assume that all voxels are well modeled by the same set of model dynamics, which may not be the case in practice. In addition, the wavelet transform method still leaves a selectable space for selecting the E-spline wavelet parameter vector and the appropriate wavelet coefficients, and in terms of early lesion detection problems using PET images, although the supplemental information derived from CT and MRI images is incorporated into the regularization constraints during reconstruction, it does not provide information about organ and lesion metabolism, and therefore lacks sufficient information to guide the reconstruction of dysfunctional regions. Some studies have shown that using anatomical boundaries without accurate lesion contours does not improve the lesion detection or quantification task.
Disclosure of Invention
In view of the above, the invention provides a dynamic PET image reconstruction method based on non-local total variation and low-rank constraint, which utilizes the segmentation smoothing property and the space-time correlation of a PET image and introduces low-rank constraint and non-local total variation constraint at the same time, thereby realizing dynamic PET image reconstruction, removing the step effect, keeping fine details and being beneficial to improving early lesion detection.
A dynamic PET image reconstruction method based on non-local total variation and low-rank constraint comprises the following steps:
(1) detecting biological tissues injected with the radioactive medicament by using a detector, dynamically acquiring coincidence counting vectors corresponding to each moment, and combining the coincidence counting vectors into a coincidence counting matrix Y;
(2) combining dynamic PET image sequences into a PET concentration distribution matrix X, and establishing a PET measurement equation according to a PET imaging principle;
(3) introducing low-rank constraint to the PET measurement equation to obtain a dynamic PET image reconstruction model M1 based on the low-rank constraint;
(4) non-local total variation constraint is carried out on the low-rank part and the sparse part of each frame of image, and a dynamic PET image reconstruction model M2 based on the non-local total variation constraint is further obtained;
(5) the objective function of the dynamic PET reconstruction obtained by combining the dynamic PET image reconstruction models M1 and M2 is as follows:
Figure BDA0001883421910000021
s.t.L+S=X
wherein: | | | represents the nuclear norm, | | | | the non-woven vision1Representing a 1-norm, L being a low rank portion containing periodically varying radioactivity concentrations in the image background, S being a sparse portion containing radioactivity concentrations of non-homogeneous tissue with different metabolic rates, JNLTV(L) and JNLTV(S) is the result of non-local total variation of the low rank part L and the sparse part S, lambda, mu and alphaLAnd alphaSAll are weight coefficients, Ψ (Y | X) is a likelihood function for X and Y;
(6) and (4) carrying out optimization solution on the objective function to obtain a PET concentration distribution matrix X, so as to restore a dynamic PET image sequence.
Further, the expression of the PET measurement equation is as follows:
Y=DX+R+S
wherein: d is a system matrix, and R and S are measurement noise matrices reflecting random events and scattering events, respectively.
Further, the expression of the dynamic PET image reconstruction model M1 is as follows:
M1=||L||*+λ||S||1+μΨ(Y|X)
s.t. L+S=X
further, the expression of the dynamic PET image reconstruction model M2 is as follows:
M2=αLJNLTV(L)+αSJNLTV(S)+μΨ(Y|X)
s.t. L+S=X
further, the likelihood function Ψ (Y | X) is expressed as follows:
Figure BDA0001883421910000031
Figure BDA0001883421910000032
wherein: dijIs the value of the ith row and jth column element in the system matrix D, yimFor matching the value of the element in the ith row and the mth column in the count matrix Y, xjm is the element value of the jth row and mth column in the PET concentration distribution matrix X, rim is the element value of the ith row and mth column in the measurement noise matrix R, simFor measuring the element value of the ith row and the mth column in the noise matrix S, I, J and M are natural numbers, I is more than or equal to 1 and less than or equal to I, J is more than or equal to 1 and less than or equal to J, M is more than or equal to 1 and less than or equal to M, I is the dimension which accords with the counting vector, J is the number of rows of the PET concentration distribution matrix X, namely the number of pixels of the PET image, and M is the number of columns of the PET concentration distribution matrix X, namely the sampling time length.
Further, in the step (6), an ADMM (Alternating Direction Method of Multipliers) algorithm is adopted to perform optimization solution on the objective function; the low-rank constraint problem is subjected to iterative optimization solution by using a singular value threshold algorithm and a soft shrinkage algorithm, the likelihood function problem is subjected to iterative optimization solution by using an EM (Expectation maximization) algorithm, and the non-local total variation constraint problem is subjected to iterative optimization solution by using a gradient descent method.
Different from the existing method taking time prior and space prior as two different constraints, the method optimizes the space-time correlation of the solution by using one constraint of low rank and sparsity, namely, reconstructs the background component and the detail component of the image by using a joint model; meanwhile, in the reconstruction of the dynamic PET image, in order to fully consider the structure smoothness characteristic of image data, the invention introduces non-local total variation (NLTV) constraint, and recovers more image details and removes the step effect by utilizing the image redundancy characteristic. Compared with TV, NLTV integrates local and non-local correlation of an image matrix, the invention can provide more accurate reconstructed images to improve lesion detection and has better robustness to noise.
According to the method, non-local total variation constraint is introduced into a low-rank matrix recovery analysis framework so as to ensure the structural smoothness and clear boundaries of regions of interest (ROIs) in the PET image; the low rank constraint of the image sequence eliminates noise through inherent averaging in tissues, and simultaneously introduces non-local total variation to improve the spatial resolution of the PET image is also the innovation point of the invention; the low rank and sparse matrix decomposition can provide random noise components for the NLTV constraint, which can provide enhanced clean PET images with confirmation of random noise information and in turn assist in the decomposition of the low rank matrix and sparse matrix to obtain a reconstructed result that better conforms to reality. By combining the performance of the invention in a simulation data experiment, the invention can obtain more accurate reconstruction results by comparing the results with results of an ML-EM algorithm and an LRTV algorithm (based on low rank and total variation constraint), and has important practical application value for improving early focus detection, evaluating dynamic processes of tracer uptake and metabolism and the like.
Drawings
Fig. 1 is a schematic flow chart of a dynamic PET image reconstruction method according to the present invention.
Fig. 2(a) is a template image of the monte carlo simulated Zubal chest data.
Fig. 2(b) is a template image of Hoffman brain data.
FIG. 3(a) is a real image of Zubal thorax data frame 8.
FIG. 3(b) shows a data count rate of 1X 107And simulating a PET image result of the Zubal chest data reconstruction frame 8 by using an ML-EM method for Monte Carlo.
FIG. 3(c) shows a data count rate of 1X 107Next, 8 th frame PET image results of Zubal thoracic data reconstruction were simulated for Monte Carlo using LRTV method.
FIG. 3(d) shows a data count rate of 1X 107The method is adopted to simulate the 8 th frame PET image result reconstructed by Zubal thorax data for Monte Carlo.
FIG. 4(a) is a result of an enlarged image of the portion outlined in FIG. 3 (a).
FIG. 4(b) is the image result of the enlarged portion outlined in FIG. 3 (b).
FIG. 4(c) is the image result of the enlarged portion outlined in FIG. 3 (c).
FIG. 4(d) is the image result of the enlarged portion outlined in FIG. 3 (d).
FIG. 5(a) shows a data count rate of 1X 107Deviation line plot of the lower ROI2 per frame Zubal thorax data image results.
FIG. 5(b) shows a data count rate of 1X 107Variance line plot of the lower ROI2 per frame Zubal thorax data image results.
FIG. 6(a) shows a data count rate of 1X 107The 14 th frame PET image result of Zubal thorax data reconstruction is simulated by adopting an ML-EM method for Monte Carlo.
FIG. 6(b) shows a data count rate of 1X 107The 14 th frame PET image result of Zubal thoracic data reconstruction was simulated for Monte Carlo using the LRTV method.
FIG. 6(c) shows the data count rate is 1X 107The method is adopted to simulate the result of the PET image of the 14 th frame reconstructed by Zubal thoracic cavity data for Monte Carlo.
FIG. 7(a) shows a data count rate of 1X 106The 14 th frame PET image result of Zubal thorax data reconstruction is simulated by adopting an ML-EM method for Monte Carlo.
FIG. 7(b) shows the data count rate of 1X 106The 14 th frame PET image result of Zubal thoracic data reconstruction was simulated for Monte Carlo using the LRTV method.
FIG. 7(c) shows a data count rate of 1X 106The method is adopted to simulate the result of the PET image of the 14 th frame reconstructed by Zubal thoracic cavity data for Monte Carlo.
Fig. 8(a) is a real image of frame 11 of Hoffman brain data.
FIG. 8(b) shows a data count rate of 1X 107And simulating the result of the PET image of the 11 th frame reconstructed by Hoffman brain data on Monte Carlo by adopting an ML-EM method.
FIG. 8(c) shows a data count rate of 1X 107And simulating the PET image result of the reconstructed Hoffman brain data of the 11 th frame by using a Monte Carlo method.
FIG. 8(d) shows a data count rate of 1X 107Lower application of the inventionThe method simulates the result of the 11 th frame PET image reconstructed by Hoffman brain data on Monte Carlo.
Detailed Description
In order to more specifically describe the present invention, the following detailed description is provided for the technical solution of the present invention with reference to the accompanying drawings and the specific embodiments.
As shown in FIG. 1, the dynamic PET image reconstruction method based on non-local total variation and low rank constraint of the invention comprises the following steps:
s1, establishing a measurement data matrix Y and a system matrix D according to a dynamic PET scanning mode.
Dividing a scanning process of the dynamic PET into a certain number of time frames according to needs, and constructing a measurement data matrix Y of the dynamic PET according to a time sequence of a coincidence counting vector acquired by a detector in each time frame; and counting the probability that the emitted photons at each pixel point are received by each detector, thereby obtaining a system matrix D.
And S2, establishing a dynamic PET imaging model.
For dynamic PET imaging, it requires a series of successive time frame samples of the time information of the tracer. For each individual time frame, the projection data y represents the sum of coincidence events captured by each detector during that time period, i.e., y ═ y { (y)iI ═ 1,2, …, I }, where I is the total number of detectors; the corresponding radiodensity image is recorded as x ═ { x ═ xjJ ═ 1,2, …, J }, where J is the total number of pixels; the relationship between the measurement data y and the unknown concentration profile x is:
Figure BDA0001883421910000061
due to the independence of the poisson hypothesis, we have a likelihood function of y:
Figure BDA0001883421910000062
to facilitate the solution, we log the likelihood function and minimize the negative log of the likelihood function:
Figure BDA0001883421910000063
for dynamic PET, we can combine all the time frame information to get a data matrix. For the m-th frame of projection data, vector ymRepresents the m-th column of the data matrix Y,
Figure BDA0001883421910000064
yimrepresenting projection data captured by the ith detector for the mth frame; in the same way as above, the first and second,
Figure BDA0001883421910000065
xjmrepresenting the radioactivity concentration of the jth pixel point of the mth frame; we sum the negative log-likelihood functions for each frame to yield:
Figure BDA0001883421910000066
wherein: y isimRepresenting the m-th frame of projection data ymThe value of the i-th detector of (c),
Figure BDA0001883421910000067
is the m-th frame
Figure BDA0001883421910000068
The ith entry of (2).
And S3, low-rank and sparse constraint.
Performing low rank and sparse decomposition on PET images, wherein L component comprises periodic variation of radioactivity intensity in background, and S component refers to those tissues with different metabolic rates, and establishing the following decomposition model based on the L component and the S component:
Figure BDA0001883421910000071
scaling the objective function (5) to a convex optimization problem:
Figure BDA0001883421910000072
wherein: | L | Lily calculation*Represents the kernel norm of the matrix L, i.e. the sum of the singular values of L. | S | non-woven phosphor1L represents S1And (4) norm.
And S4, non-local total variation constraint.
Let P be [ P ]1,p2,…,pm,…,pM]Representing a sequence of M frames, in which
Figure BDA0001883421910000073
Is the m-th frame image vector. Each column is divided into two rows
Figure BDA0001883421910000074
Conversion to its matrix form
Figure BDA0001883421910000075
In which UxV ═ J, is converted
Figure BDA0001883421910000076
Now in space
Figure BDA0001883421910000077
In (1). We sequentially apply to each frame of the image matrix
Figure BDA0001883421910000078
Carrying out non-local total variation constraint:
Figure BDA00018834219100000713
Figure BDA00018834219100000710
wherein: u, v are pixels in omega spacePoints, which are natural numbers, w (u, v) is a non-negative symmetric non-local weight function, GδIs a gaussian kernel with a standard deviation of δ and h is a filter parameter.
And S5, reconstructing the LRNLTV of the dynamic PET image.
Applying non-local total variation constraints to decomposed L and S respectively, and combining the low rank and sparse constraints before, we have the following objective functions:
Figure BDA00018834219100000711
s.t. L+S=X
wherein: λ, μ, αLAnd alphaSAre all weight coefficients.
And S6, optimizing algorithm based on the augmented Lagrange multiplier method.
Introducing auxiliary variables P and Q, and writing an augmented Lagrangian function of an objective function (8):
Figure BDA00018834219100000712
wherein: z, ZL,ZSBeing Lagrangian multipliers, betaL、βSIs a penalty parameter; the problem is decomposed into five sub-problems to be solved, and the sub-problems are divided into three categories according to the property of each sub-problem.
6.1 solving the L, S subproblem:
for the L subproblem, other variables are fixed, only items related to L are extracted, and a formula is arranged, wherein the formula comprises the following components:
Figure BDA0001883421910000081
solving equation (10) using singular value thresholding, then the iterative update with L is:
Figure BDA0001883421910000082
Figure BDA0001883421910000083
wherein: a. theε(Γ)=UBε(s)VT,UsVTIs the singular value decomposition of Γ, in which the soft-reduction algorithm Bε(s) is:
Figure BDA0001883421910000084
also for the S subproblem, the simplified formula is followed by:
Figure BDA0001883421910000085
solving equation (12) using a soft-shrink algorithm, then the iterative update with S is:
Figure BDA0001883421910000086
Figure BDA0001883421910000087
6.2 solving the X sub-problem:
first a negative likelihood function Ψ (w | X) for the hidden variable w is written, where
Figure BDA0001883421910000088
Representing the emitted photon from pixel j detected at coincidence line i for the mth frame:
Figure BDA0001883421910000091
next X is optimized using the EM algorithm.
E, step E: taking the condition expectation of w as a matter of course,
Figure BDA0001883421910000092
and insert it into Ψ (w | X); then we have an alternative function phi (X; X)k):
Figure BDA0001883421910000093
Figure BDA0001883421910000094
And M: calculating phi (X; X)k) For xjmAnd is made equal to 0; after simplification, x is foundjmThe solution of (a) is the root of the following quadratic equation:
Figure BDA0001883421910000095
equation (15) is a convex function, and we update x by taking the larger heeljm
Figure BDA0001883421910000096
s.t. ajm=β,
Figure BDA0001883421910000097
Wherein: []jmRepresenting the jth entry of the matrix.
6.3 solving the P, Q sub-problem:
for the P sub-problem, other variables are also fixed, only the item related to L is extracted, and the formulation is finished, including:
Figure BDA0001883421910000098
we solve equation (17) using the gradient descent method, first we write Euler-Lagrange of equation (7):
Figure BDA0001883421910000099
for fixed u, there are:
Figure BDA0001883421910000101
we will refer to each column of the L matrix
Figure BDA0001883421910000102
Conversion to its matrix form
Figure BDA0001883421910000103
ZLIs also converted to its matrix form, where U × V ═ J, and L and ZLEach frame of (a) is processed in turn; for each frame of the image, there is
Figure BDA0001883421910000104
The iteration of (2) is more recent:
Figure BDA0001883421910000105
wherein,
Figure BDA0001883421910000106
is a step of gradient descent. After all frames have been processed, the matrix is processed
Figure BDA0001883421910000107
Conversion back to vector form
Figure BDA0001883421910000108
L can be recovered and P and Z can be recovered in the same mannerLThen the P sub-problem is solved.
For the Q sub-problem, since it has the same form as the P sub-problem, it is solved in the same way; wherein the lagrange multiplier is updated as usual.
The following is that we performed experiments on Zubal thoracic and Hoffman brain template data simulated by Monte Carlo to verify the accuracy of the system reconstruction results of the present invention. Fig. 2(a) and 2(b) are schematic templates of Zubal thoracic and Hoffman brain data, respectively, used for experiments, dividing the different regions into three regions of interest (where ROI4 is the background region). The experimental operating environment is as follows: 8G memory, 3.40GHz, 64-bit operating system, CPU is intel i 7-3770; the model of the simulated PET scanner is Hamamatsu SHR-22000, and the designed radionuclide and medicine are18F-FDG, set sinogram for 64 projection angles, data results collected by 64 beams at each angle, and the size of system matrix D is 4096 × 4096. In this test, the test is carried out on a 1X 10 substrate6、1×107The projection data at two different count rates were tested.
The PET image results of the inventive reconstruction framework are compared with the image results of the ML-EM and LRTV reconstruction methods, respectively, using the same measured data matrix Y and system matrix D to control the comparability of the results. As can be seen from fig. 3(a) to fig. 3(d), the noise of the image result of the frame reconstructed by the present invention in the region is significantly smaller than that of the images reconstructed by the other two methods, and the functional region is smoother while ensuring the edge contrast. Fig. 4(a) to fig. 4(d) are enlarged image results of the framed parts of fig. 3(a) to fig. 3(d), respectively, and it is obvious that the image results reconstructed by the present invention have clearer ROI boundary information, and have obvious improvement effect on early lesion detection. Fig. 5(a) -5 (b) show the quantization error of each frame of ROI2 for Zubal thoracic data, further illustrating the accuracy of the reconstruction results of the present invention. FIG. 6(a) to FIG. 6(c) and FIG. 7(a) to FIG. 7(c) show the respective count rates of 1X 107And 1X 106The reconstruction results of the following three reconstruction methods on the 14 th frame of Zubal thoracic cavity data prove that the reconstruction results have robustness to noise, and the further analysis of the quantization results is shown in Table 1. FIGS. 8(a) -8 (d) are reconstruction experiments performed on Hoffman brain data demonstrating the reconstruction of the present inventionThe result is robust to different template data.
TABLE 1
Figure BDA0001883421910000111
The embodiments described above are presented to facilitate one of ordinary skill in the art to understand and practice the present invention. It will be readily apparent to those skilled in the art that various modifications to the above-described embodiments may be made, and the generic principles defined herein may be applied to other embodiments without the use of inventive faculty. Therefore, the present invention is not limited to the above embodiments, and those skilled in the art should make improvements and modifications to the present invention based on the disclosure of the present invention within the protection scope of the present invention.

Claims (6)

1. A dynamic PET image reconstruction method based on non-local total variation and low-rank constraint comprises the following steps:
(1) detecting biological tissues injected with the radioactive medicament by using a detector, dynamically acquiring coincidence counting vectors corresponding to each moment, and combining the coincidence counting vectors into a coincidence counting matrix Y;
(2) combining dynamic PET image sequences into a PET concentration distribution matrix X, and establishing a PET measurement equation according to a PET imaging principle;
(3) introducing low-rank constraint to the PET measurement equation to obtain a dynamic PET image reconstruction model M1 based on the low-rank constraint;
(4) non-local total variation constraint is carried out on the low-rank part and the sparse part of each frame of image, and a dynamic PET image reconstruction model M2 based on the non-local total variation constraint is further obtained;
(5) the objective function of dynamic PET reconstruction obtained by combining the dynamic PET image reconstruction models M1 and M2 is as follows:
Figure FDA0001883421900000011
s.t.L+S=X
wherein: | | non-woven hair*Represents the kernel norm, | | | | luminance1Representing a 1-norm, L being a low rank portion containing periodically varying radioactivity concentrations in the image background, S being a sparse portion containing radioactivity concentrations of non-homogeneous tissue with different metabolic rates, JNLTV(L) and JNLTV(S) is the result of non-local total variation of the low rank part L and the sparse part S, lambda, mu and alphaLAnd alphaSAll are weight coefficients, Ψ (Y | X) is a likelihood function for X and Y;
(6) and (4) carrying out optimization solution on the objective function to obtain a PET concentration distribution matrix X, so as to restore a dynamic PET image sequence.
2. The dynamic PET image reconstruction method according to claim 1, characterized in that: the expression of the PET measurement equation is as follows:
Y=DX+R+S
wherein: d is a system matrix, and R and S are measurement noise matrices reflecting random events and scattering events, respectively.
3. The dynamic PET image reconstruction method according to claim 1, characterized in that: the expression of the dynamic PET image reconstruction model M1 is as follows:
M1=||L||*+λ||S||1+μΨ(Y|X)
s.t.L+S=X。
4. the dynamic PET image reconstruction method according to claim 1, characterized in that: the expression of the dynamic PET image reconstruction model M2 is as follows:
M2=αLJNLTV(L)+αSJNLTV(S)+μΨ(Y|X)
s.t.L+S=X。
5. the dynamic PET image reconstruction method according to claim 2, characterized in that: the likelihood function Ψ (Y | X) is expressed as follows:
Figure FDA0001883421900000021
Figure FDA0001883421900000022
wherein: dijIs the value of the ith row and jth column element in the system matrix D, yimFor the value of the element in the ith row and mth column in the coincidence count matrix Y, xjmIs the value of the jth row and mth column element r in the PET concentration distribution matrix XimFor measuring the value of the element, s, in the ith row and mth column of the noise matrix RimFor measuring the element value of the ith row and the mth column in the noise matrix S, I, J and M are natural numbers, I is more than or equal to 1 and less than or equal to I, J is more than or equal to 1 and less than or equal to J, M is more than or equal to 1 and less than or equal to M, I is the dimension which accords with the counting vector, J is the number of rows of the PET concentration distribution matrix X, namely the number of pixels of the PET image, and M is the number of columns of the PET concentration distribution matrix X, namely the sampling time length.
6. The dynamic PET image reconstruction method according to claim 1, characterized in that: in the step (6), an ADMM algorithm is adopted to carry out optimization solution on the objective function; the low-rank constraint problem is subjected to iterative optimization solution by using a singular value threshold algorithm and a soft shrinkage algorithm, the likelihood function problem is subjected to iterative optimization solution by using an EM (effective electromagnetic) algorithm, and the non-local total variation constraint problem is subjected to iterative optimization solution by using a gradient descent method.
CN201811434449.3A 2018-11-28 2018-11-28 Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint Active CN109636869B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811434449.3A CN109636869B (en) 2018-11-28 2018-11-28 Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811434449.3A CN109636869B (en) 2018-11-28 2018-11-28 Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint

Publications (2)

Publication Number Publication Date
CN109636869A CN109636869A (en) 2019-04-16
CN109636869B true CN109636869B (en) 2022-07-05

Family

ID=66069457

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811434449.3A Active CN109636869B (en) 2018-11-28 2018-11-28 Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint

Country Status (1)

Country Link
CN (1) CN109636869B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110780604B (en) * 2019-09-30 2021-01-19 西安交通大学 Space-time signal recovery method based on space-time smoothness and time correlation
CN110811596B (en) * 2019-11-29 2023-04-25 浙江大学 Noninvasive cardiac potential reconstruction method based on low rank and sparse constraint and non-local total variation
CN112036000A (en) * 2020-06-18 2020-12-04 南开大学 Matrix filling-based environment temperature and humidity multi-time-slot data acquisition method
CN112508813B (en) * 2020-12-04 2022-09-06 上海交通大学 PET image reconstruction method based on combination of improved Kernel method and sparse constraint
CN114022393B (en) * 2021-11-19 2024-05-14 中国科学院长春光学精密机械与物理研究所 Image stripe noise removing method based on total variation and low-rank direction sparse constraint
CN114998750B (en) * 2022-08-01 2022-10-11 四川工程职业技术学院 Method, device, equipment and medium for removing random length strips of remote sensing image
CN116012264B (en) * 2023-03-27 2023-06-13 山东省工业技术研究院 Image recovery method based on sparse constraint

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2387778A1 (en) * 2009-01-19 2011-11-23 Koninklijke Philips Electronics N.V. Regional reconstruction and quantitative assessment in list mode pet imaging
CN102651125A (en) * 2012-04-07 2012-08-29 西安电子科技大学 Nuclear magnetic resonance image reconstruction method based on non-local total variation
CN106897971A (en) * 2016-12-26 2017-06-27 浙江工业大学 Non-local TV image denoising method based on independent component analysis and singular value decomposition
CN107993208A (en) * 2017-11-30 2018-05-04 天津师范大学 It is a kind of based on sparse overlapping group prior-constrained non local full Variational Image Restoration method
WO2018127507A1 (en) * 2017-01-06 2018-07-12 Koninklijke Philips N.V. Standardized uptake value (suv) guided reconstruction control for improved outcome robustness in positron emission tomography (pet) imaging

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140025350A1 (en) * 2012-07-20 2014-01-23 Lsi Corporation Statistical modeling based on bit-accurate simulation of an electronic device

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2387778A1 (en) * 2009-01-19 2011-11-23 Koninklijke Philips Electronics N.V. Regional reconstruction and quantitative assessment in list mode pet imaging
CN102282589A (en) * 2009-01-19 2011-12-14 皇家飞利浦电子股份有限公司 Regional reconstruction and quantitative assessment in list mode PET imaging
CN102651125A (en) * 2012-04-07 2012-08-29 西安电子科技大学 Nuclear magnetic resonance image reconstruction method based on non-local total variation
CN106897971A (en) * 2016-12-26 2017-06-27 浙江工业大学 Non-local TV image denoising method based on independent component analysis and singular value decomposition
WO2018127507A1 (en) * 2017-01-06 2018-07-12 Koninklijke Philips N.V. Standardized uptake value (suv) guided reconstruction control for improved outcome robustness in positron emission tomography (pet) imaging
CN107993208A (en) * 2017-11-30 2018-05-04 天津师范大学 It is a kind of based on sparse overlapping group prior-constrained non local full Variational Image Restoration method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《基于非局部相似性和低秩矩阵的遥感图像重构方法》;黄芝娟;《光学学报》;20160630;全文 *

Also Published As

Publication number Publication date
CN109636869A (en) 2019-04-16

Similar Documents

Publication Publication Date Title
CN109636869B (en) Dynamic PET image reconstruction method based on non-local total variation and low-rank constraint
Yokota et al. Dynamic PET image reconstruction using nonnegative matrix factorization incorporated with deep image prior
Gong et al. Iterative PET image reconstruction using convolutional neural network representation
JP7203852B2 (en) Estimation of full-dose PET images from low-dose PET imaging using deep learning
CN111627082B (en) PET image reconstruction method based on filtering back projection algorithm and neural network
Wang et al. Generalized algorithms for direct reconstruction of parametric images from dynamic PET data
Wang High temporal-resolution dynamic PET image reconstruction using a new spatiotemporal kernel method
Gong et al. Direct patlak reconstruction from dynamic PET data using the kernel method with MRI information based on structural similarity
Reader et al. Joint estimation of dynamic PET images and temporal basis functions using fully 4D ML-EM
CN102968762B (en) Polyethylene glycol terephthalate (PET) reconstruction method based on sparsification and Poisson model
Gong et al. Direct reconstruction of linear parametric images from dynamic PET using nonlocal deep image prior
CN104657950B (en) Dynamic PET (positron emission tomography) image reconstruction method based on Poisson TV
Wu et al. Improved material decomposition with a two-step regularization for spectral CT
CN108550172B (en) PET image reconstruction method based on non-local characteristics and total variation joint constraint
Kadrmas et al. 4D maximum a posteriori reconstruction in dynamic SPECT using a compartmental model-based prior
CN113476064B (en) BCD-ED-based single-scanning double-tracer PET signal separation method
Tobon-Gomez et al. Automatic construction of 3D-ASM intensity models by simulating image acquisition: Application to myocardial gated SPECT studies
Chen et al. SOUL-net: A sparse and low-rank unrolling network for spectral CT image reconstruction
Zhang et al. Deep generalized learning model for PET image reconstruction
CN115984401A (en) Dynamic PET image reconstruction method based on model-driven deep learning
Hu et al. STPDnet: Spatial-temporal convolutional primal dual network for dynamic PET image reconstruction
Yu et al. Joint reconstruction of dynamic PET activity and kinetic parametric images using total variation constrained dictionary sparse coding
Chen et al. Temporal processing of dynamic positron emission tomography via principal component analysis in the sinogram domain
Tong et al. A robust state-space kinetics-guided framework for dynamic PET image reconstruction
Bergounioux et al. Infimal convolution spatiotemporal PET reconstruction using total variation based priors

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant