A method to accelerate multi-step greedy expansion of sparse Kaczmarz
By accelerating the multi-step greedy extension of the sparse Kaczmarz method, an unconstrained model is constructed and combined with sparse prior features. Several rows and columns are selected for iterative solution, which solves the problem of image reconstruction speed and quality in large-aperture MPI systems and achieves high-quality and fast image reconstruction.
Patent Information
- Application Number
- CN202210900375.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-07-28
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2042-07-28
AI Technical Summary
Existing MPI image reconstruction methods cannot simultaneously achieve high-quality and fast image reconstruction in large-aperture systems, especially in real-time human-sized MPI imaging.
We employ an accelerated multi-step greedy extended sparse Kaczmarz method. By constructing an unconstrained model and combining it with sparse prior features, we utilize the orthogonal projection algorithm of extended Kaczmarz to select several rows and columns for iterative solution, thereby eliminating signal noise and improving convergence speed and reconstruction quality.
It achieves high-quality and fast image reconstruction of large-aperture MPI systems, solves the problem of real-time imaging of human-sized MPI systems, and improves the speed and quality of image reconstruction.
Smart Images

Figure CN115222839B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of magnetic particle imaging technology, specifically relating to an accelerated multi-step greedy expansion sparse Kaczmarz method and device. Background Technology
[0002] Magnetic particle imaging (MPI) is a preclinical imaging technique that visualizes the spatiotemporal distribution of magnetic nanoparticles. Image reconstruction of this rapid dynamic process relies on effectively addressing the ill-posed inverse problem. Current methods for reconstructing tracer concentrations from measurements either adapt to the image characteristics of MPI but suffer from high computational complexity and slow convergence, or are fast but produce insufficient image quality in the reconstructed images.
[0003] The Kaczmarz method, based on iterative processing of the system matrix rows, is suitable for online real-time image reconstruction. Many improved Kaczmarz methods have been proposed, such as the extended Kaczmarz method and the greedy random Kaczmarz method. Furthermore, existing work has proposed a sparse Kaczmarz method based on sparse prior features of MPI images and the Kaczmarz iterative method, aiming to achieve relatively fast reconstruction speed while improving the reconstruction quality of MPI images. However, for large-aperture MPI systems, the system matrix size increases, and the signal-noise ratio increases, significantly degrading both the image reconstruction quality and speed of the classic sparse Kaczmarz method.
[0004] In summary, this invention utilizes the sparse prior features of MPI images to obtain sparse solutions; it employs the extended Kaczmarz orthogonal projection algorithm to effectively eliminate Gaussian noise in the signal; and it utilizes the residual information of the equations, selecting only a few rows for iteration in each iteration process, effectively improving convergence speed and reconstruction quality. This invention proposes an accelerated multi-step greedy extended sparse Kaczmarz method for real-time image reconstruction in large-aperture magnetic particle imaging systems. This invention can achieve high-quality and fast image reconstruction of large-aperture MPI systems, and is expected to solve the problem of real-time imaging of human-sized MPI systems. Summary of the Invention
[0005] To address the aforementioned problems in the prior art, namely, the inability of existing MPI image reconstruction methods to simultaneously achieve high-quality and fast image reconstruction for large-aperture MPI systems, the first aspect of this invention proposes an accelerated multi-step greedy expanding sparse Kaczmarz method, applied to large-aperture magnetic particle imaging systems, for obtaining magnetic particle concentration and subsequently performing image reconstruction; the method includes:
[0006] S100: Obtain the system matrix, received signal, noise standard deviation, total particle concentration within the imaging field of view, and set iteration parameters of the large aperture magnetic particle imaging system as input data; the iteration parameters include the number of columns and rows selected in the iteration process, LASSO term coefficients, step size parameters, and total concentration constraint term coefficients.
[0007] S200, Based on the input data, an unconstrained model for image reconstruction of a large-aperture magnetic particle imaging system is constructed as the first model; the fidelity term and total concentration constraint term in the first model are merged to obtain a simplified first model, which is used as the second model; the unconstrained model includes a fidelity term, a total concentration constraint term, a LASSO term, and a non-negative real number characteristic function term;
[0008] S300, the second model is iteratively solved using a pre-constructed accelerated multi-step greedy extended sparse Kaczmarz method to obtain the magnetic particle concentration corresponding to the target object to be reconstructed in the large aperture magnetic particle imaging system, and then image reconstruction is performed.
[0009] In some preferred embodiments, the simplified unconstrained model for image reconstruction of the large-aperture magnetic particle imaging system is as follows:
[0010]
[0011] in, To ensure authenticity With total concentration constraint The synthesized item, A represents the system matrix, γ represents the coefficients of the total concentration constraint term, b represents the received signal, c represents the total particle concentration within the imaging field of view, T represents the transpose, λ‖φx‖1 is the LASSO norm term, λ represents the LASSO term coefficients, φ represents the invertible linear transformation, x represents the magnetic particle concentration, and I + (x) is the characteristic function term of the set of nonnegative real numbers.
[0012] In some preferred embodiments, during the iterative solution of the second model using a pre-built accelerated multi-step greedy extended sparse Kaczmarz method, the condition for terminating the iteration is:
[0013] And k≥N
[0014] Where k represents the number of iterations, δ represents the noise standard deviation, and N represents the total number of iterations.
[0015] In some preferred embodiments, the number of columns is selected in the iterative solution of the second model using a pre-built accelerated multi-step greedy extended sparse Kaczmarz method as follows:
[0016] In each iteration, the absolute value is calculated.
[0017] absolute value Sort in descending order, and then select the columns corresponding to the top M1 absolute values as the number of columns to select.
[0018] Or regarding absolute values After normalization, column M1 is randomly selected based on probability, and this number of columns is used as the number of columns to be selected.
[0019] Where H represents the conjugate transpose, and z represents... arrive Orthogonal projection variables of column space.
[0020] In some preferred embodiments, the number of rows is selected in the iterative solution of the second model using a pre-built accelerated multi-step greedy extended sparse Kaczmarz method as follows:
[0021] In each iteration, the absolute value is calculated.
[0022] absolute value Sort in descending order, and after sorting, select the rows corresponding to the first M2 absolute values as the number of rows to be selected;
[0023] Or regarding absolute values After normalization, M2 rows are randomly selected based on probability, which is used as the number of rows to be selected.
[0024] In some preferred embodiments, the second model is iteratively solved using a pre-constructed accelerated multi-step greedy extended sparse Kaczmarz method to obtain the magnetic particle concentration corresponding to the target object to be reconstructed in the large aperture magnetic particle imaging system. The method is as follows:
[0025] S301, Initialization parameters: k = 1, μ 0 =0; v k Indicates intermediate variables;
[0026] S302, when And k < N, based on absolute value Selecting the number of columns N c ;
[0027] N c The solution is obtained iteratively, with the iteration count as the number of iterations.
[0028]
[0029] Determine if the iteration has ended; if it has, then obtain... Then jump to S303; otherwise, iteratively solve for z. k-1 Where m represents the row number of the system matrix of the large-aperture magnetic particle imaging system, and t, β, μ, α represent the adjustment of y k x k v k The parameter of the iteration step size
[0030] S303, based on absolute value Select the number of rows N R ;
[0031] N R The solution is obtained iteratively, with the iteration count as the number of iterations.
[0032] y k-1 =αv k-1 +(1-α)x k-1
[0033]
[0034]
[0035]
[0036] Determine if the iteration has ended. If it has ended, calculate the sparse solution and let z... k =z k-1 If k = k + 1, jump to S302; otherwise, iteratively solve for x. k-1 .
[0037] In some preferred embodiments, the method for obtaining the sparse solution is as follows:
[0038] x k =φ -1 shrink(φx k-1 ,λ)
[0039] x k-1 =max(real(x) k-1 ), 0)
[0040] Where max represents the max function and shrink represents the generalized shrinkage operator.
[0041] A second aspect of the present invention provides an electronic device comprising: at least one processor; and a memory communicatively connected to at least one of the processors; wherein the memory stores instructions executable by the processor to implement the above-described accelerated multi-step greedy expansion sparse Kaczmarz method.
[0042] In a third aspect, the present invention provides a computer-readable storage medium storing computer instructions for execution by the computer to implement the above-described accelerated multi-step greedy expansion sparse Kaczmarz method.
[0043] The beneficial effects of this invention are:
[0044] This invention enables high-quality and rapid image reconstruction using a large-aperture MPI system.
[0045] This invention utilizes the sparse prior features of MPI images to obtain sparse solutions; it employs the extended Kaczmarz orthogonal projection algorithm to effectively eliminate Gaussian noise in the signal; and it utilizes the residual information of the equations, selecting only a few rows for iteration in each iteration process, effectively improving convergence speed and reconstruction quality. This invention proposes an accelerated multi-step greedy extended sparse Kaczmarz method for real-time image reconstruction of large-aperture magnetic particle imaging systems, which can achieve high-quality and fast image reconstruction of large-aperture MPI systems and is expected to solve the problem of real-time imaging of human-sized MPI systems. Attached Figure Description
[0046] Other features, objects, and advantages of this application will become more apparent from the following detailed description of non-limiting embodiments with reference to the accompanying drawings.
[0047] Figure 1 This is a simplified flowchart of an embodiment of the accelerated multi-step greedy expansion sparse Kaczmarz method of the present invention;
[0048] Figure 2 This is a detailed flowchart illustrating an embodiment of the accelerated multi-step greedy expansion sparse Kaczmarz method of the present invention;
[0049] Figure 3 This is a schematic diagram comparing the reconstruction results of the accelerated multi-step greedy expansion sparse Kaczmarz method according to one embodiment of the present invention with those of other reconstruction methods.
[0050] Figure 4 This is a schematic diagram of the structure of a computer system suitable for implementing an electronic device according to an embodiment of the present invention. Detailed Implementation
[0051] To make the objectives, technical solutions, and advantages of this invention clearer, the technical solutions in the embodiments of this invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this invention, not all embodiments. Based on the embodiments of this invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this invention.
[0052] The present application will now be described in further detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the invention. Furthermore, it should be noted that, for ease of description, only the parts relevant to the invention are shown in the accompanying drawings.
[0053] It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other.
[0054] The accelerated multi-step greedy expansion sparse Kaczmarz method of the present invention, such as Figure 1 As shown, it includes the following steps:
[0055] S100: Obtain the system matrix, received signal, noise standard deviation, total particle concentration within the imaging field of view, and set iteration parameters of the large aperture magnetic particle imaging system as input data; the iteration parameters include the number of columns and rows selected in the iteration process, LASSO term coefficients, step size parameters, and total concentration constraint term coefficients.
[0056] S200, Based on the input data, an unconstrained model for image reconstruction of a large-aperture magnetic particle imaging system is constructed as the first model; the fidelity term and total concentration constraint term in the first model are merged to obtain a simplified first model, which is used as the second model; the unconstrained model includes a fidelity term, a total concentration constraint term, a LASSO term, and a non-negative real number characteristic function term;
[0057] S300, the second model is iteratively solved using a pre-constructed accelerated multi-step greedy extended sparse Kaczmarz method to obtain the magnetic particle concentration corresponding to the target object to be reconstructed in the large aperture magnetic particle imaging system, and then image reconstruction is performed.
[0058] To more clearly illustrate the accelerated multi-step greedy expansion sparse Kaczmarz method of this invention, the following description is in conjunction with the appendix. Figure 1 , 2 The steps of one embodiment of the method of the present invention will be described in detail below.
[0059] S100: Obtain the system matrix, received signal, noise standard deviation, total particle concentration within the imaging field of view, and set iteration parameters of the large aperture magnetic particle imaging system as input data; the iteration parameters include the number of columns and rows selected in the iteration process, LASSO term coefficients, step size parameters, and total concentration constraint term coefficients.
[0060] In this embodiment, the input parameters are first obtained, that is, the system matrix A of the large aperture magnetic particle imaging system is obtained. m×n Received signal b m×1The noise standard deviation δ, the total particle concentration c within the imaging field of view, and the set iteration parameters are used as input data; the iteration parameters include the number of columns N selected in the iteration process. c and the number of rows N R LASSO term coefficient λ, step size parameter η, total concentration constraint term coefficient γ.
[0061] S200, Based on the input data, an unconstrained model for image reconstruction of a large-aperture magnetic particle imaging system is constructed as the first model; the fidelity term and total concentration constraint term in the first model are merged to obtain a simplified first model, which is used as the second model; the unconstrained model includes a fidelity term, a total concentration constraint term, a LASSO term, and a non-negative real number characteristic function term;
[0062] In this embodiment, an unconstrained model for image reconstruction of a large-aperture magnetic particle imaging system is first constructed. The unconstrained model consists of a fidelity term. Total concentration constraint (The total concentration constraint term indicates that the total concentration of magnetic particles in the imaging field of view remains constant. The effect of this constraint term can be enhanced by adjusting the coefficient γ. γ = 0 indicates that this constraint term has no effect.) LASSO norm term λ||φx||1 (The LASSO norm term indicates that x has sparsity in a certain invertible linear transformation domain. When φ is the identity matrix, it indicates that the MPI image itself has sparsity.) Non-negative real number set characteristic function term I + (x) constitutes the structure.
[0063] Then, by expanding the system matrix A and the received signal b, the fidelity term and the total concentration constraint term in the first model are merged to obtain a simplified first model, which serves as the second model; that is, let Combination of fidelity term and total concentration constraint term This allows the first model to be simplified to:
[0064]
[0065] S300, the second model is iteratively solved using a pre-constructed accelerated multi-step greedy extended sparse Kaczmarz method to obtain the magnetic particle concentration corresponding to the target object to be reconstructed in the large aperture magnetic particle imaging system, and then image reconstruction is performed.
[0066] In this embodiment, an accelerated multi-step greedy expansion sparse Kaczmarz method is constructed. The second model is solved using the following specific steps:
[0067] S301, Initialization parameters: k = 1, μ 0 =0, v k Indicates intermediate variables;
[0068] S302, when And k < N, introduce arrive Calculate the absolute value of orthogonal projection variables of column space. Then based on absolute value Selecting the number of columns N c The larger the absolute value, the greater the probability of being selected, thus speeding up the process. k Convergence speed. The specific process for selecting the number of columns is as follows: In each iteration, the absolute value is calculated. absolute value Sort in descending order, and then select the columns corresponding to the top M1 absolute values, using these columns as the selected column number; or, for the absolute values... After normalization, M1 columns are randomly selected based on probability, and this number is used as the number of columns to be selected; where H represents the conjugate transpose, and z represents... arrive Orthogonal projection variables of column space.
[0069] N c The solution is obtained iteratively, with the iteration count as the number of iterations.
[0070]
[0071] Determine if the iteration has ended; if it has, then obtain... Then jump to S303; otherwise, iteratively solve for z. k-1 ;
[0072] S303, using Replacing the classic Kaczmarz algorithm Calculate absolute value Decrease The norm of the noise component is used to improve the convergence accuracy of the algorithm, and the absolute value is used as a basis. Select the number of rows N R ; where absolute value The larger the value, the greater the probability of being selected, which can speed up x. k Convergence speed. The process of selecting the number of rows is as follows: in each iteration, the absolute value is calculated. absolute value Sort in descending order, and after sorting, select the rows corresponding to the first M2 absolute values, which will be the selected row numbers; or sort by absolute value... After normalization, M2 rows are randomly selected based on probability, which is used as the number of rows to be selected.
[0073] N R The solution is obtained iteratively, with the iteration count as the number of iterations.
[0074] y k-1 =αv k-1 +(1-α)x k-1 (3)
[0075]
[0076]
[0077]
[0078] In the steps above, analogous to the Nesterov acceleration algorithm, y is added here. k v k Parameters such as t, β, μ, α, y k v k These are all intermediate variables in the acceleration iteration step; t, β, μ, and α are some adjustments to y. k x k v k For details on the parameters of the iteration step size, please refer to the literature: "Xiang X, Liu X, Tan W, et al. An accelerated randomized extended Kaczmarz algorithm [C] / / Journal of Physics: Conference Series. IOP Publishing, 2017, 814(1): 012017".
[0079] Determine if the iteration has ended. If it has ended, calculate the sparse solution and let z... k =z k-1 If k = k + 1, jump to S302; otherwise, iteratively solve for x. k-1 .
[0080] The method for obtaining sparse solutions is as follows:
[0081] x k-1 =max(real(x) k-1 ), 0) (7)
[0082] x k =φ -1 shrink(φx k-1 ,λ) (8)
[0083] Where max represents the max function and shrink represents the generalized shrinkage operator.
[0084] When the formula When established, the iteration process is terminated, and the magnetic particle concentration corresponding to the target object to be reconstructed in the large aperture magnetic particle imaging system is obtained, and then image reconstruction is performed.
[0085] During the iteration process, the number of columns N is selected. c and the number of rows N R At any given time, the number of rows should not exceed 20% of the total number of rows.
[0086] Additionally, a comparative diagram illustrating the reconstruction results of the accelerated multi-step greedy expansion sparse Kaczmarz method with other reconstruction methods is shown below. Figure 3 As shown, in Figure 3 In the diagram, the sub-graphs, from left to right and from top to bottom, are as follows: Figure 3 (a) in the text refers to the phantom (i.e., the model). Figure 3 In the image, (b) shows the reconstruction result corresponding to the classic Kaczmarz method. Figure 3 In the diagram, (c) represents the reconstruction result corresponding to the classic sparse Kaczmarz method. Figure 3 In the diagram, (d) represents the reconstruction result corresponding to the sparse Kaczmarz method based on multi-step maximum residuals. Figure 3 In the diagram, (e) represents the reconstruction result corresponding to the extended sparse Kaczmarz method based on multi-step maximum residuals. Figure 3 In the diagram, (f) represents the reconstruction result corresponding to the regularized sparse Kaczmarz method based on multi-step maximum residuals. Figure 3 In the diagram, (g) represents the reconstruction result corresponding to the accelerated extended Kaczmarz method based on multi-step maximum residuals. Figure 3 In the diagram, (H) represents the reconstruction result corresponding to the regularized extended sparse Kaczmarz method based on multi-step maximum residuals. Figure 3 In the diagram, (I) represents the reconstruction result corresponding to the accelerated regular extended sparse Kaczmarz method based on multi-step maximum residual.
[0087] An electronic device according to a second embodiment of the present invention includes: at least one processor; and a memory communicatively connected to at least one of the processors; wherein the memory stores instructions executable by the processor, the instructions being executed by the processor to implement the above-described accelerated multi-step greedy expansion sparse Kaczmarz method.
[0088] A computer-readable storage medium according to a third embodiment of the present invention stores computer instructions for execution by a computer to implement the above-described accelerated multi-step greedy expansion sparse Kaczmarz method.
[0089] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working process and related descriptions of the electronic devices and computer-readable storage media described above can be referred to the corresponding processes in the foregoing method examples, and will not be repeated here.
[0090] The following is for reference. Figure 4 It shows a schematic diagram of the structure of a computer system suitable for implementing the methods, systems, and apparatus embodiments of this application. Figure 4 The server shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of this application.
[0091] like Figure 4 As shown, the computer system includes a Central Processing Unit (CPU) 401, which can perform various appropriate actions and processes based on programs stored in Read Only Memory (ROM) 402 or programs loaded from storage section 408 into Random Access Memory (RAM) 403. RAM 403 also stores various programs and data required for system operation. The CPU 401, ROM 402, and RAM 403 are interconnected via bus 404. Input / output (I / O) interface 405 is also connected to bus 404.
[0092] The following components are connected to I / O interface 405: an input section 406 including a keyboard, mouse, etc.; an output section 407 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.; a storage section 408 including a hard disk, etc.; and a communication section 409 including a network interface card such as a LAN (Local Area Network) card, modem, etc. The communication section 409 performs communication processing via a network such as the Internet. A drive 410 is also connected to I / O interface 405 as needed. A removable medium 411, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on drive 410 as needed so that computer programs read from it can be installed into storage section 408 as needed.
[0093] Specifically, according to embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 409, and / or installed from removable medium 411. When the computer program is executed by central processing unit (CPU) 401, it performs the functions defined in the methods of this application. It should be noted that the computer-readable medium described above in this application can be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in connection with an instruction execution system, apparatus, or device. In this application, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium can be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, RF, etc., or any suitable combination thereof.
[0094] Computer program code for performing the operations of this application can be written in one or more programming languages or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, and C++, and conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).
[0095] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.
[0096] The terms “first”, “second”, etc., are used to distinguish similar objects, not to describe or indicate a specific order or sequence.
[0097] The term "comprising" or any other similar term is intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus / device that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent in such process, method, article, or apparatus / device.
[0098] The technical solution of the present invention has been described above with reference to the preferred embodiments shown in the accompanying drawings. However, it will be readily understood by those skilled in the art that the scope of protection of the present invention is obviously not limited to these specific embodiments. Without departing from the principles of the present invention, those skilled in the art can make equivalent changes or substitutions to the relevant technical features, and the technical solutions after such changes or substitutions will all fall within the scope of protection of the present invention.
Claims
1. An accelerated multi-step greedy expansion sparse Kaczmarz method, applied to a large-aperture magnetic particle imaging system, for obtaining magnetic particle concentration and then performing image reconstruction; characterized in that, The method includes the following steps: S100: Obtain the system matrix, received signal, noise standard deviation, total particle concentration within the imaging field of view, and set iteration parameters of the large aperture magnetic particle imaging system as input data; the iteration parameters include the number of columns and rows selected in the iteration process, LASSO term coefficients, step size parameters, and total concentration constraint term coefficients. S200, Based on the input data, an unconstrained model for image reconstruction of a large-aperture magnetic particle imaging system is constructed as the first model; the fidelity term and total concentration constraint term in the first model are merged to obtain a simplified first model, which is used as the second model; the unconstrained model includes a fidelity term, a total concentration constraint term, a LASSO term, and a non-negative real number characteristic function term; S300, the second model is iteratively solved by the pre-constructed accelerated multi-step greedy extended sparse Kaczmarz method to obtain the magnetic particle concentration corresponding to the target object to be reconstructed in the large aperture magnetic particle imaging system, and then the image reconstruction is performed. S301, Initialization parameters: , , , ; Indicates intermediate variables. Indicates the number of iterations. Indicates the concentration of magnetic particles. express arrive Orthogonal projection variables of column space, , Indicates receiving signal, This represents the coefficient of the total concentration constraint term. This represents the total particle concentration within the imaging field of view. , Represents the system matrix. Indicates transpose; S302, when and Based on absolute value Select column number , Indicates the standard deviation of noise. Indicates the total number of iterations. Indicates conjugate transpose; Will The solution is obtained iteratively, with the iteration count as the number of iterations. ; Determine if the iteration has ended; if it has, then obtain... , = , , If the jump is to S303, otherwise iterative solution is required. ;in, This indicates the row number of the system matrix for a large-aperture magnetic particle imaging system. , , , Indicates adjustment , , The parameter of the iteration step size, Indicates the step size parameter; S303, based on absolute value Select number of rows ; Will The solution is obtained iteratively, with the iteration count as the number of iterations. , , , , Determine if the iteration has ended. If it has ended, calculate the sparse solution and let... , Jump to S302, otherwise solve iteratively. .
2. The accelerated multi-step greedy expansion sparse Kaczmarz method according to claim 1, characterized in that, The simplified unconstrained model for image reconstruction in a large-aperture magnetic particle imaging system is as follows: ; in, To ensure authenticity With total concentration constraint The synthesized item, For LASSO norm terms, Represents the coefficient of the LASSO term. This represents an invertible linear transformation. It is a characteristic function term for the set of nonnegative real numbers.
3. The accelerated multi-step greedy expansion sparse Kaczmarz method according to claim 2, characterized in that, In iteratively solving the second model using the pre-built accelerated multi-step greedy extended sparse Kaczmarz method, the termination condition for the iteration is: and .
4. The accelerated multi-step greedy expansion sparse Kaczmarz method according to claim 3, characterized in that, In iteratively solving the second model using the pre-built accelerated multi-step greedy extended sparse Kaczmarz method, the method for selecting the number of columns is as follows: In each iteration, the absolute value is calculated. ; absolute value Sort in descending order, and then select the columns corresponding to the top M1 absolute values as the number of columns to select. Or regarding absolute values After normalization, column M1 is randomly selected based on probability, and this number is used as the number of columns to be selected.
5. The accelerated multi-step greedy expansion sparse Kaczmarz method according to claim 4, characterized in that, In iteratively solving the second model using the pre-built accelerated multi-step greedy extended sparse Kaczmarz method, the method for selecting the number of rows is as follows: In each iteration, the absolute value is calculated. ; absolute value Sort in descending order, and after sorting, select the rows corresponding to the first M2 absolute values as the number of rows to be selected; Or regarding absolute values After normalization, M2 rows are randomly selected based on probability, which is used as the number of rows to be selected.
6. The accelerated multi-step greedy expansion sparse Kaczmarz method according to claim 5, characterized in that, The method for obtaining the sparse solution is as follows: ; ; in, This represents the max function. This represents the generalized contraction operator.
7. An electronic device, characterized in that, include: At least one processor; and a memory communicatively connected to at least one of the processors; The memory stores instructions that can be executed by the processor to implement the accelerated multi-step greedy expansion sparse Kaczmarz method according to any one of claims 1-6.
8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that are executed by the computer to implement the accelerated multi-step greedy expansion sparse Kaczmarz method according to any one of claims 1-6.
