Sparse Representation of Measurements

A computer system using sparse techniques with L2 and L0 norm terms updates dictionaries to efficiently analyze MR scans, reducing scan times and improving user experience while enabling accurate quantitative longitudinal analysis.

JP2024542970AActive Publication Date: 2024-11-19Q BIO INC
View PDF 13 Cites 0 Cited by

Patent Information

Application Number
JP2024524571
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2021-10-25
Filing Date
2021-10-28
Publication Date
2024-11-19
Estimated Expiration
2041-10-28

AI Technical Summary

Technical Problem

Characterizing physical properties of a sample using non-invasive techniques is often time-consuming, complex, and expensive, with methods like MRI requiring long scan times and causing discomfort to patients due to narrow magnet diameters, and longitudinal analysis is difficult due to the lack of quantitative measurement of anatomical changes over time.

Method used

A computer system employing sparse techniques that utilize a dictionary of non-invasive measurements, past measurements, and predetermined features, with L2 and L0 norm terms, to determine weights and update dictionaries, allowing for efficient and accurate quantitative analysis and reduced scan times by minimizing costs and improving user experience.

Benefits of technology

The system facilitates rapid and accurate MR scan times, reduces resource consumption, and enhances user experience by enabling efficient quantitative analysis and longitudinal tracking of anatomical changes without the need for repeated pixel-level recordings.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024542970000001_ABST
    Figure 2024542970000001_ABST
Patent Text Reader

Abstract

A computer system for performing the sparsity technique is described. During operation, the computer system accesses or obtains information related to at least non-invasive measurements performed on the individual, past non-invasive measurements, and a dictionary of predefined features or basis functions associated with the past non-invasive measurements. It is noted that the non-invasive measurements and the past non-invasive measurements may include or correspond to magnetic resonance (MR) measurements. For example, the MR measurements may include magnetic resonance imaging (MRI) scans. The computer system then updates the dictionary of predefined features based at least in part on the non-invasive measurements and the past non-invasive measurements, where the updating includes performing a minimization technique using a cost function having an L2 norm term and an L0 norm term. The computer system then determines weights associated with features in the updated dictionary of predefined features based at least in part on the non-invasive measurements.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This application claims the benefit of priority under 35 U.S.C. §119(e) to U.S. Nonprovisional Application No. 17 / 510,258, entitled “SPARSE REPRESENTATION OF MEASUREMENTS,” filed on October 25, 2021, the entirety of which is incorporated herein by reference.

[0002] The described embodiments relate generally to sparse representation of measurements for use in image reconstruction and / or longitudinal analysis. [Background technology]

[0003] Many non-invasive characterization techniques are available to determine one or more physical parameters of a sample. For example, magnetic properties can be studied using magnetic resonance or MR (often called "nuclear magnetic resonance" or NMR), a physical phenomenon in which atomic nuclei in a magnetic field absorb and re-emit electromagnetic radiation. Furthermore, density changes and short- and long-range periodic structures in solids or hard materials can be studied using characterization techniques such as X-ray imaging, X-ray diffraction, computed tomography, neutron diffraction, and electron microscopy, in which electromagnetic waves or high-energy particles with small de Broglie wavelengths are absorbed or scattered by the sample. Furthermore, density changes and motions in soft materials and fluids can be studied using ultrasound imaging, in which ultrasound waves are transmitted and reflected in the sample.

[0004] In each of these and other non-invasive characterization techniques, one or more external excitations (such as particle flux or incident radiation, static or time-varying scalar fields, and / or static or time-varying vector fields) are applied to the sample, and the resulting response of the sample in the form of a physical phenomenon is measured directly or indirectly to determine one or more physical parameters. As an example, MR magnetic nuclear spins may be partially aligned (or polarized) in an applied external DC magnetic field. These nuclear spins may precess or rotate about the direction of the external magnetic field with an angular frequency (sometimes called the "Larmor frequency") given by the product of the gyromagnetic ratio of the nuclear species and the magnitude or strength of the external magnetic field. The polarization of the nuclear spins can be temporarily changed by applying a perturbation to the polarized nuclear spins, such as one or more radio frequency (RF) pulses (more generally electromagnetic pulses) orthogonal or perpendicular to the direction of the external magnetic field, with a pulse width corresponding to the angular frequency. From the resulting dynamic response of the nuclear spins (such as the time-varying total magnetization), information can be obtained about the physical and material properties of the sample, such as one or more physical parameters associated with the sample.

[0005] Moreover, in general, each characterization technique may allow one or more physical parameters to be determined in small volumes or voxels of a sample that can be represented using tensors. Take magnetic resonance imaging (MRI) for example, which measures the nuclear spins (protons or isotopes) versus the magnitude of an external magnetic field to determine an image of the three-dimensional (3D) or anatomical structure and / or chemical composition of different materials or types of tissue. 1 In particular, by applying a non-uniform or spatially varying magnetic field to the sample, 1 The resulting fluctuations in the angular frequency of the precession of the H spins are usually 1 The measured dynamic response of the H spins is used to spatially localize into voxels, which can be used to generate images of the internal anatomy of a patient, etc. Summary of the Invention [Problem to be solved by the invention]

[0006] However, characterization of the physical properties of samples is often time-consuming, complex, and expensive. For example, acquisition of high spatial resolution (i.e., small voxel size) MR images by MRI often requires extensive characterization of the physical properties of various tissue types in patients. 1 It is necessary to perform many measurements (sometimes called "scans") lasting longer than the relaxation time of the H spins. Furthermore, to achieve high spatial resolution, a large uniform external magnetic field is usually used during MRI. The external field is usually generated using a toroidal shaped superconducting magnet with a narrow inner diameter, which feels cramped for many patients. Furthermore, Fourier transform techniques are sometimes used to facilitate image reconstruction, but at the cost of imposing constraints on the RF pulse sequence and therefore on the MR scan time.

[0007] Long MR scan times, combined with the occluded environment of the magnet bore in the case of MRI, can lead to a poor user experience. Furthermore, long MR scan times reduce throughput and therefore increase the cost of performing characterization. These types of issues can constrain or limit the use of many characterization techniques.

[0008] Furthermore, longitudinal analysis or follow-up is difficult to perform using many characterization techniques. For example, longitudinal follow-up using MRI requires repeated scanning of an individual as a function of time. However, MRI was originally designed as a qualitative characterization technique optimized for the diagnosis of acute diseases. MRI was not designed to accurately measure or quantify changes in anatomical structures or tissue properties over time. Several existing approaches attempt to accelerate the longitudinal analysis of MRI scans using past information. These existing approaches generally require pixel-by-pixel recording and often fail to capture new or changed anatomical features. [Means for solving the problem]

[0009] A computer system for performing a sparsity technique is described. The computer system (including one or more computers) includes, for example, an interface circuit for communicating with a measurement device (performing measurements), a processor for executing program instructions, and a memory for storing the program instructions. During operation, the computer system accesses or obtains information related to at least non-invasive measurements performed on an individual, past non-invasive measurements, and a dictionary of predefined features or basis functions associated with the past non-invasive measurements. The computer system then updates the dictionary of predefined features based at least in part on the non-invasive measurements and the past non-invasive measurements, the updating including performing a minimization technique using a cost function having an L2 norm term and an L0 norm term. The computer system then determines weights associated with features in the updated dictionary of predefined features based at least in part on the non-invasive measurements.

[0010] It should be noted that the non-invasive measurements and the previous non-invasive measurements may include or correspond to MR measurements, for example MR measurements may include MRI scans.

[0011] Additionally, the non-invasive measurements and the previous non-invasive measurements may include MR parameters associated with voxels within the individual, for example parameters may include density of nuclei, longitudinal relaxation time along a direction parallel to an external magnetic field, and / or transverse relaxation time along a direction perpendicular to an external magnetic field.

[0012] Further, the non-invasive measurements may include at least a component of magnetization associated with the individual, and the computer system may calculate at least a predicted component of the magnetization of the voxel associated with the individual based at least in part on the measured component of the magnetization, a forward model, an external magnetic field, and an RF pulse sequence, and may solve an inverse problem by iteratively modifying the parameters associated with the voxel in the forward model until a difference between the predicted component of the magnetization and the measured component of the magnetization is less than a predefined value.

[0013] Additionally, the past non-invasive measurements may be associated with the individual or a group of individuals, hi some embodiments, the group of individuals may exclude individuals.

[0014] Note that determining the weights may involve a gradient descent method.

[0015] Additionally, the dictionary of predefined features and the updated dictionary of predefined features may correspond to a portion of an anatomical structure of the individual.

[0016] Another embodiment provides a computer-readable storage medium for use with the computer system, the computer-readable storage medium including program instructions that, when executed by the computer system, cause the computer system to perform at least some of the operations described above.

[0017] Another embodiment provides a method of performing the sparsity technique, the method including at least some of the above operations performed by the computer system.

[0018] This summary is provided for the purpose of illustrating several exemplary embodiments so as to provide a basic understanding of some aspects of the subject matter described herein. It will therefore be understood that the features described above are merely illustrative and should not be construed in any way as narrowing the scope or spirit of the subject matter described herein. Other features, aspects, and advantages of the subject matter described herein will become apparent from the following detailed description, figures, and claims. [Brief description of the drawings]

[0019] [Figure 1] FIG. 1 is a block diagram illustrating an example of a system according to an embodiment of the present disclosure. [Diagram 2]FIG. 2 is a flow diagram illustrating an example method for determining model parameters associated with a specimen according to an embodiment of the present disclosure. [Diagram 3] FIG. 3 is a diagram illustrating an example of communication between components in the system of FIG. 1 according to an embodiment of the present disclosure. [Figure 4] FIG. 4 is a diagram illustrating an example of a machine learning model according to an embodiment of the present disclosure. [Diagram 5] FIG. 5 is a diagram illustrating an example of a neural model according to an embodiment of the present disclosure. [Figure 6] FIG. 6 illustrates an example of classification or segmentation of one or more anatomical structures in a sample according to an embodiment of the present disclosure. [Figure 7] FIG. 7 is a flow diagram illustrating an example method for determining coefficients in a representation of coil sensitivities and MR information associated with a sample according to an embodiment of the present disclosure. [Figure 8] FIG. 8 is a diagram illustrating an example of communication between components in the system of FIG. 1 according to an embodiment of the present disclosure. [Figure 9] FIG. 9 is a flow diagram illustrating an example method for performing the sparsity technique according to an embodiment of the present disclosure. [Figure 10] FIG. 10 is a diagram illustrating an example of communication between components in the system of FIG. 1 according to an embodiment of the present disclosure. [Figure 11] FIG. 11 is a flow diagram illustrating an example method for performing the sparsity technique according to an embodiment of the present disclosure. [Figure 12] FIG. 12 is a diagram illustrating an example of image reconstruction from a sparse representation of MRI data according to an embodiment of the present disclosure. [Figure 13] FIG. 13 is a diagram illustrating an example of a sampling pattern used in FIG. 12 according to an embodiment of the present disclosure. [Figure 14] FIG. 14 is a diagram illustrating example images using different sampling patterns using MRI data according to an embodiment of the present disclosure. [Figure 15] FIG. 15 is a diagram illustrating an example of a sampling pattern according to an embodiment of the present disclosure. [Figure 16]FIG. 16 is a block diagram illustrating an example of an electronic device according to an embodiment of the present disclosure. [Figure 17] 17 is a diagram illustrating an example of a data structure used by the electronic device of FIG. 14 in accordance with an embodiment of the present disclosure. Note that like reference numerals refer to corresponding parts throughout the drawings. Additionally, multiple instances of the same part are designated by a common prefix separated by a dash from the instance number. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0020] In a first set of embodiments, a computer system for performing the sparse technique is described. During operation, the computer system accesses or obtains information related to at least non-invasive measurements performed on the individual, past non-invasive measurements (related to the individual or group of individuals), and a dictionary of pre-defined features or basis functions related to the past non-invasive measurements (and corresponding to at least a portion of the anatomy of the individual or group of individuals). It is noted that the non-invasive measurements and the past non-invasive measurements may include or correspond to MR measurements. For example, the MR measurements may include MRI scans. The computer system then updates the dictionary of pre-defined features based at least in part on the non-invasive measurements and the past non-invasive measurements, where the updating includes performing a minimization technique using a cost function having an L2 norm term and an L0 norm term. The computer system then determines weights associated with features in the updated dictionary of pre-defined features based at least in part on the non-invasive measurements.

[0021] By updating a dictionary of predefined features and determining weights, these analysis techniques may facilitate quantitative analysis of non-invasive measurements. For example, the analysis techniques may enable quantitative longitudinal analysis to be performed on MR scans. This longitudinal analysis may not require pixel-level recording of the MR scan. Furthermore, because the analysis techniques provide a sparse representation of the MR scan, comparisons during the longitudinal analysis may be performed more efficiently and accurately, which may allow new or modified anatomical features to be incorporated. Furthermore, the sparse representation may allow subsequent MR scans to be performed differentially (e.g., MR scans of one or more regions having changes relative to previous non-invasive measurements) and therefore more quickly. As a result, the analysis techniques may facilitate more accurate analysis of MR scans, reduce the time and cost of performing MR scans, and improve the overall user experience.

[0022] In a second group of embodiments, a computer system (including one or more computers) is described for determining coefficients in a representation of the coil susceptibility and MR information associated with a sample. In operation, the computer system may acquire MR signals associated with the sample from a measurement device. The computer system may then access a predefined set of coil magnetic field basis vectors, where a weighted superposition of the predefined set of coil magnetic field basis vectors with coefficients represents the coil sensitivity of a coil in the measurement device, the predefined coil magnetic field basis vectors being a solution to Maxwell's equations. The computer system may then use the MR signals and the predefined set of coil magnetic field basis vectors to solve a nonlinear optimization problem for the MR information and coefficients associated with the sample.

[0023] By expressing the coil sensitivities and solving a nonlinear optimization problem, the computational techniques can reduce the MR scan time for measuring MR signals. For example, the operations performed by the computer system can allow for skipping and subsequent reconstruction of multiple MR scan lines in the measurements performed by the measurement device when solving the nonlinear optimization technique. Apart from or in addition to reducing the time required to solve the nonlinear optimization problem, this ability can reduce the MR scan time associated with the measurements performed by the measurement device. In fact, the computational techniques can achieve theoretical limits at which MR scan time can be accelerated for a given set of coils, field of view, external magnetic field strength (or resolution), and 2D or 3D measurements. As a result, the computational techniques can reduce the cost of performing MR scans and improve the overall user experience.

[0024] In a third group of embodiments, as mentioned above, existing MRI approaches often involve multiple MR scans and long MR scan times, as well as expensive magnets and / or an obstructed environment in the magnet bore, which can degrade the user experience.

[0025] One approach to addressing these issues is to use a simulation of the response physics of the sample to one or more excitations to determine information, such as one or more physical parameters. For example, using a forward model based on voxel-level model parameters and one or more differential equations that describe the physical phenomena, a computer system can use information specifying one or more excitations as inputs to the forward model to simulate the response physics of the sample as an output of the forward model.

[0026] However, this approach often replaces the problems associated with a large number of MR scans and long MR scan times with the problems associated with accurately determining model parameters at the voxel level. For example, the model parameters are typically determined by repeatedly applying one or more excitations, performing measurements, and solving an inverse problem that uses the measurements to calculate the corresponding model parameters until a desired accuracy of the simulated response physics is achieved (this is sometimes referred to as an "iterative approach"). Generally, determining model parameters using such existing techniques is difficult, time-consuming, and costly, which may inhibit or limit the use of response physics simulations for sample characterization.

[0027] A third group of embodiments describes a system for determining model parameters associated with a sample. In operation, the system may apply an excitation to the sample using an excitation source. The system may then measure a response associated with the sample to the excitation using a measurement device. The system may further use information identifying the measured response and the excitation as input to a predefined predictive model to calculate model parameters for each voxel in a forward model having a plurality of voxels representing the sample. The forward model may simulate the response physics occurring in the sample for a given excitation. The forward model may further be a function of the excitation, the model parameters of the plurality of voxels, and a differential or phenomenological equation that approximates the response physics. The system may then determine the accuracy of the model parameters using a processor by comparing at least the measured response to a predicted value of the response calculated using the forward model, the model parameters, and the excitation. If the accuracy exceeds a predefined value, the system may further provide the model parameters as an output to a user, another electronic device, a display, and / or a memory.

[0028] By determining model parameters for voxels within a sample (sometimes referred to as "tensor field mapping" or TFM because parameters within a voxel can be represented by hybrid tensors as opposed to true tensors of vector fields), the computational techniques can reduce or eliminate the need for iterative measurements and adaptations in determining the model parameters. As a result, the computational techniques can significantly reduce the use of system resources (e.g., processor time, memory, etc.) in determining the model parameters. Furthermore, in cases where accuracy is insufficient (e.g., accuracy is less than a predefined value), the computational techniques can be used to guide modifications of the excitation to promote rapid convergence to model parameters having a desired accuracy. Furthermore, by providing a forward model that predicts physical phenomena based on the determined model parameters for a range of excitation values ​​or excitation intensities, the computational techniques can facilitate rapid and accurate characterization of the sample (e.g., determination of one or more physical parameters of the sample). Thus, the computational techniques can be used to dynamically adapt or change the excitation used in the measurement and / or to promote improved characterization of the sample.

[0029] These capabilities may result in shorter MR scan or measurement times, increased throughput, and reduced measurement costs, improved user experience (e.g., less time people spend in the occluded environment of the magnet bore inside the MR scanner), and increased use of characterization techniques. Additionally, computational techniques may facilitate quantitative analysis of measurements, improve precision, and reduce error, thereby improving people's health and well-being.

[0030] In general, this computational technique can be used in conjunction with a variety of characterization techniques and forward models to quantitatively simulate the response physics that occurs within a sample to a given excitation. For example, characterization techniques may include X-ray measurements (such as X-ray imaging, X-ray diffraction or computed tomography), neutron measurements (such as neutron diffraction), electron measurements (such as electron microscopy or electron spin resonance), optical measurements (such as optical imaging or optical spectroscopy to determine the complex refractive index at one or more wavelengths), infrared measurements (such as infrared imaging or infrared spectroscopy to determine the complex refractive index at one or more wavelengths), ultrasound measurements (such as ultrasound imaging), proton measurements (such as proton scattering), MR measurements or MR techniques (such as MRI, MR spectroscopy or MRS using one or more nuclei, magnetic resonance spectroscopic imaging or MRSI, MR elastography or MRE, MR thermometry or MRT, magnetic field relaxometry, diffusion tensor imaging and / or other MR techniques such as, for example, functional MRI, metabolic imaging, molecular imaging, perfusion imaging, etc.), impedance measurements (such as electrical impedance at DC and / or AC frequencies) and / or magnetic susceptibility measurements (such as magnetic susceptibility at DC and / or AC frequencies). Thus, the excitation may include at least one of an electromagnetic beam in the X-ray band of wavelengths (e.g., 0.01-10 nm), a neutron beam, an electron beam, an electromagnetic beam in the optical band of wavelengths (e.g., 300-800 nm), an electromagnetic beam in the infrared band of wavelengths (e.g., 700 nm-1 mm), a sound wave in the ultrasound band of wavelengths (e.g., 0.2-1.9 mm), a proton beam, an electric field associated with an impedance measuring device, a radio frequency associated with an MR device or scanner, and / or a magnetic field associated with a magnetic susceptibility measuring device. However, other non-invasive characterization techniques (e.g., positron emission spectroscopy), integrated treatments (e.g., proton beam therapy or proton beam implants, radiation therapy, magnetically guided nanoparticles, etc.), and / or different ranges of wavelengths (e.g., ultraviolet wavelengths between 10-400 nm) may be used. In general, computational techniques may be used to "excite" a region of space with a wide variety of excitations, as long as a forward model exists that describes the response physics to these excitations. In the following discussion, MR techniques are used as an example of a characterization technique.

[0031] It should be noted that the sample may include organic or inorganic matter. For example, the sample may include an inanimate (i.e., non-biological) sample, a biological organism (such as a human or animal, i.e., an in vivo sample), or a tissue sample from an animal or human (i.e., a part of an animal or human). In some embodiments, the tissue sample is one that has been previously removed from an animal or human. Thus, the tissue sample may be a formalin-fixed, paraffin-embedded pathology sample (such as a biopsy sample). In the following discussion, the sample is a human or individual, which is used as an example.

[0032] An embodiment of the system will now be described. FIG. 1 is a block diagram illustrating an example of a system 100. In the system 100, an excitation source 110 selectively provides excitation to a sample 112, and a measurement device 114 selectively performs measurements on the sample 112 to measure the response of the sample 112 to the excitation. The system 100 further includes a computer 116. As will be further described below with reference to FIG. 16, the computer 116 may include subsystems such as a processing subsystem, a memory subsystem, and a network subsystem. For example, the processing subsystem may include a processor that executes program instructions, the memory subsystem may include a memory that stores program instructions, and the networking subsystem may include an interface that communicates instructions or commands to the excitation source 110 and the measurement device 114 (such as one or more sensors), receives measurements from the measurement device 114, and selectively provides determined model parameters.

[0033] During operation, a communications engine (or module) 120 in the computer 116 can provide instructions or commands over the network 118 (such as one or more wired and / or wireless links or interconnections) to the excitation source 110 causing the excitation source 110 to apply an excitation to the sample 112. This excitation may have at least a wavelength and an intensity or flux. For example, the excitation may include electromagnetic radiation, radio frequency, a particle beam, sound waves, a magnetic field, and / or an electric field.

[0034] In some embodiments, the excitation may include an external magnetic field, optional gradients in the magnetic field, and / or an RF pulse sequence (which may also be referred to as "measurement conditions" or "scan instructions") that polarize one or more types of nuclei in the sample 112. Thus, the excitation source 110 may include a magnet that applies the external magnetic field, optional gradient coils that apply the optional gradients, and / or an RF coil that applies the RF pulse sequence.

[0035] The communications engine 120 may then provide instructions or commands to the measurement device 114 over the network 118, thereby causing the measurement device 114 to perform a measurement of the response of at least a portion of the sample 112 to the excitation. Additionally, the measurement device 114 may provide measurement results to the communications engine 120 over the network 118. It is noted that the measurement device 114 may include an x-ray detector, a neutron detector, an electron detector, an optical detector, an infrared detector, an ultrasonic detector, a proton detector, an MR device or scanner, an impedance measuring device (such as a gel-coated table in the MR device or scanner), and / or a magnetic susceptibility measuring device.

[0036] In some embodiments, the measurement device 114 may include one or more RF pickup coils or another magnetic sensor (magnetometer, superconducting quantum interference device, optoelectronic, etc.) that measures a time-varying or time-domain electrical signal corresponding to the dynamic behavior of nuclear spins in one or more types of atomic nuclei, or at least an average component of magnetization corresponding to the collective dynamic behavior (which may be referred to as the "magnetic response") of nuclear spins of at least a portion of the sample 112. For example, the measurement device 114 may measure the transverse magnetization of at least a portion of the sample 112 as it precesses in the xy plane.

[0037] It should be noted that the measurements provided by the measurement device 114 may be other than or different from images. For example, the measurements may be other than the results of an MRI. For example, the measurements may include or correspond to (such as one or more components of) the free induction decay of nuclear spins in the sample 112. As a result, in some embodiments, the measurements may not involve performing a Fourier transform on the measured electrical signals (and thus may not be performed in k-space and may not involve pattern matching in k-space such as MR fingerprinting). However, in general, the measurements may be specified in the time domain and / or the frequency domain. Thus, in some embodiments, various signal processing (filtering, image processing, etc.), noise cancellation, and transformation techniques (discrete Fourier transform, Z transform, discrete cosine transform, data compression, etc.) may be performed on the measurements.

[0038] After receiving the measurements, an analysis engine (or module) 122 in the computer 116 may analyze the measurements. This analysis may include determining the (possibly time-varying) 3D position of the sample 112 relative to the measurement device 114 (which may be referred to as "3D recorded information"). For example, the registration may include performing a point set registration, such as with fiducial markers at known spatial locations. The registration may use a global or local positioning system to determine the change in position of the sample 112 relative to the measurement device 114. Alternatively or additionally, the registration may be based at least in part on the variation of the Larmor frequency and on the predefined spatial magnetic field inhomogeneity or magnetic field variation of the excitation source 110 and / or the measurement device 114 (such as an MR device or scanner). In some embodiments, the analysis may include aligning voxels based at least in part on the recorded information with desired voxel locations and / or resampling and / or interpolating the measured signal to different voxel locations, which may facilitate subsequent comparison with previous measurements or results.

[0039] Additionally, the analysis engine 122 may use the measurements to determine model parameters for a forward model having multiple voxels representing the sample 112 and simulating the response physics that occurs in the sample 112 to a given excitation over a range of possible excitations (i.e., the forward model may be more general than one that determines a predicted response to a specific or singular excitation). Notably, with appropriate model parameters for the voxels of the sample 112, the analysis engine 122 may use the forward model to accurately and quantitatively simulate or calculate a predicted response of the sample 112 to an excitation (such as a predicted component of magnetization). It is noted that the forward model may be based at least in part on or may use one or more differential equations or one or more phenomenological equations that approximate the response physics of the sample 112 on a voxel-by-voxel basis. For example, the forward model may be based at least in part on or may use Bloch equations, Bloch-Trey equations (thus the forward model may include simulation of dynamics such as motions associated with breathing, heartbeat, blood flow, mechanical motion, etc.), full Liouvillean calculations (such as Liouville supermatrix of interactions between two or more elements), full Hamiltonian, Maxwell equations (e.g., the forward model may calculate the magnetic and electrical properties of the sample 112), heat diffusion equations, Penne equations, and / or another simulation technique that represents the physics of the response of the sample 112 to a type of excitation. In some embodiments, additional error terms may be added to the Bloch equations because assumptions underlying the Bloch equations are invalid (e.g., parallel and antiparallel components of magnetization are coupled if the state of magnetization is not reset before the RF pulse sequence). Thus, the forward model may be able to calculate the dynamic (e.g., time-varying) state of the sample 112 in response to any excitation within a range of possible excitations or excitation values.

[0040] In some analytical approaches, computer 116 may determine the model parameters by solving an inverse problem by iteratively modifying model parameters associated with voxels in the forward model until the difference between the predicted response and the measured dynamic magnetic response is less than a predefined value (such as 0.1, 1, 5, or 10%). (Note that an "inverse problem" starts with one or more outcomes or outputs and then calculates the inputs or causes. This is the inverse of a "forward problem" that starts with an input and then calculates one or more outcomes or outputs.) However, in this "iterative approach," excitation source 110 can repeatedly apply different excitations and measurement device 114 can repeatedly perform corresponding measurements. As a result, iterative approaches can be time-consuming, expensive, and complicated. Thus, iterative approaches can consume significant resources in system 100 until appropriate model parameters are determined.

[0041] To address these issues, as described further below with reference to FIGS. 2-5, the computational engineering analysis engine 122 may use one or more predefined or pre-trained predictive models (e.g., the predictive models may be personalized predictive models, such as machine learning models or neural networks that may be specific to a particular sample or individual) to calculate model parameters for each voxel, at least in part. For example, the analysis engine 122 may use information identifying the measurement and excitation as input to a predictive model that provides model parameters associated with the voxel as output. Thus, the predictive model may be trained or embedded based on model parameter information that is based at least in part on the measurement or measurement results. In some embodiments, the predictive model may correct the measurement for extrinsic characteristics or signatures of the particular excitation source 110 and / or measurement device 114 (such as RF noise or spatial magnetic field inhomogeneity) and / or the particular excitation or measurement conditions, such that the determined model parameters are specific to the sample 112 at the particular time the measurement was performed.

[0042] The model parameters are the spin-lattice relaxation time T1 (which is the time constant associated with the loss of signal intensity as the component of the nuclear spin magnetization vector of a type of nucleus relaxes to become parallel to the direction of the external magnetic field), the spin-spin relaxation time T2 (which is the time constant associated with the broadening of the signal as the component of the nuclear spin magnetization vector of a type of nucleus relaxes to become perpendicular to the direction of the external magnetic field), and the adjusted spin-spin relaxation time T2 * , proton or nuclear density (more generally, the density of one or more types of atomic nuclei), diffusion (such as components of the diffusion tensor), velocity / flow, temperature, off-resonance frequency, electrical conductivity or permittivity, and / or magnetic susceptibility or permittivity.

[0043] If a subsequent simulation using these model parameters provided by the prediction model, the forward model, and one or more excitations of one or more predicted responses (such as simulated or predicted MR signals) of the sample 112 matches the corresponding measurements (if the difference between the predicted response and the measurement is, for example, less than a predefined value, e.g., 0.1, 1, 5, or 10%, or if the accuracy exceeds a predefined value), a results engine (or module) 124 in the computer 116 may provide the determined model parameters, such as by providing an output to a user, to another electronic device, to a display, and / or to a memory. In some embodiments, the results engine 124 may output a tensor field map of the sample 112 with the model parameters in 3 spatial by 1 time by up to N measurement dimensions, where each measurement may be a vector or a scalar quantity.

[0044] Thus, if the accuracy exceeds a pre-specified value (such as 90, 95, 99 or 99.9%), the model parameters may be calculated in a single pass without further iterations. As a result, model parameters with accuracy exceeding a pre-specified value may be calculated in fewer (or no) iterations (and therefore more quickly) using a pre-specified predictive model than an iterative approach that does not use a pre-specified predictive model.

[0045] Alternatively, if the accuracy is less than the predefined value, computer 116 may perform one or more iterations in which one or more different, modified, or amended excitations (such as different RF pulse sequences) are applied to sample 112 by excitation source 114 and one or more corresponding additional measurements are performed by measurement device 114. These one or more additional measurements may be used by computer 116 to determine the model parameters to an accuracy less than the predefined value.

[0046] For example, the analysis engine 122 may use a second predefined predictive model (such as a second machine learning model or a second neural network) to determine a modified excitation. Notably, using information specifying the excitation and accuracy as input, the second predictive model may output the modified excitation. The system 100 may then repeat the operations of applying, measuring, calculating, and determining using the modified excitation instead of the excitation. Thus, the second predictive model may learn or incorporate excitation information based at least in part on the remaining difference between the predicted response and the measurement to reduce or eliminate the remaining difference in one or more subsequent iterations of the operations performed by the system 100. In some embodiments, the second predictive model may modify the sampling frequency, characterization technique, etc. to determine additional information that allows the determination of the model parameters using the first predictive model to converge (i.e., have an accuracy less than a predefined value). In other words, the next perturbation or disturbance may be selected to minimize the error or difference across the hyper-dimensional space.

[0047] In some embodiments, if the accuracy is less than a predefined value, a learning engine (or module) 126 in computer 116 may add the excitation and measured response to a training data set and use the training data set to determine revised versions of the predictive model for subsequent use in determining the model parameters. In this manner, measurements performed by system 100 may be selectively used in adaptive learning techniques to improve the predictive model and thus the model parameters determined for a range of excitations (such as different values ​​of wavelength and intensity or luminous flux).

[0048] Using the model parameters and forward models, the analysis engine 122 may simulate or predict the response of the sample 112 to any excitation, such as any external magnetic field strength or direction (e.g., 0T, 6.5 mT, 1.5T, 3T, 4.7T, 9.4T, and / or 15T, or a time-varying direction, e.g., a slowly rotating external magnetic field), any gradient, any pulse sequence, any magnetic state or condition (e.g., a state in which the magnetization or polarization of the sample 112 has not been reset or remagnetized prior to the measurement), etc. Thus, the model parameters and forward models may be used to facilitate faster and more accurate measurements, such as soft tissue measurements, morphological studies, chemical shift measurements, magnetization transfer measurements, MRS, one or more types of nuclear measurements, Overhauser measurements, and / or functional imaging. For example, in embodiments in which the computer 116 determines the model parameters simultaneously (i.e., in real-time) with measurements performed on the sample 112 by the excitation source 110 and the measurement device 114, the system 100 may rapidly characterize one or more physical parameters of the sample 112 (at the voxel level or on average) on time scales smaller than T1 or T2 in any type of tissue. With this capability, the system 100 may perform an initial measurement to determine the model parameters, and then use the determined model parameters to simulate or predict MR signals to complete or complete ongoing measurements being performed by the system 100, and results may be obtained more quickly (and thus in shorter MR scan times). It should be noted that in some embodiments, the system 100 may determine results (such as detection of anomalies or changes in the sample 112) based at least in part on a quantitative comparison of previous results obtained on the sample 112, such as stored model parameters of voxels in the sample 112 determined during a previous MR scan of the sample 112. Such comparison may be facilitated by 3D recorded information that allows alignment of voxel positions within the sample 112 at different times.In some embodiments, the results are based at least in part on a physician's order, medical test results (e.g., blood tests, urine sample tests, biopsies, genetic or genomic tests, etc.), the individual's medical history, the individual's family history, a quantitative tensor field map having voxel-dependent multidimensional data of the sample 112 or other samples, the impedance of the sample 112, the hydration level of the sample 112, and / or other inputs.

[0049] Additionally, as further described below with reference to FIG. 6, in some embodiments, the analysis engine 122 may use the determined model parameters and a third predefined predictive model (such as a third machine learning model and / or a third neural network) to classify or segment one or more anatomical structures within the sample 112. For example, using the simulated or predicted responses at the voxel level of the sample 112, or the model parameters determined at the voxel level, the third predictive model may output the location of different anatomical structures and / or may output a classification of different voxels (such as whether an organ type is associated with a particular disease state, e.g., cancer type, cancer stage, etc.). Thus, in some embodiments, the third predictive model may be trained based on or incorporate a classification of segmentation information based at least in part on the variation (such as discontinuous changes) of model parameters across boundaries between different voxels. This functionality may enable the analysis engine 122 to identify different anatomical structures (which may aid in the determination of model parameters) and / or to diagnose or make diagnostic recommendations for a medical condition or disease state. In some embodiments, classification or segmentation is performed before, simultaneously with, or after determination of the model parameters.

[0050] In some embodiments, the learning engine 126 may train the predictive model, the second predictive model, and / or the third predictive model, at least in part, using the simulated data set. For example, the learning engine 126 may generate the simulated data set using the forward model, the range of model parameters, and the range of excitations. In this manner, the simulated data may be used to accelerate the training of one or more predictive models.

[0051] Of note, since computational techniques may capture all relevant information during measurements (e.g., MR scans), the forward model may be used in an offline mode to curate an extensive, labeled dataset that includes many possible scenarios (e.g., different measurement conditions). This database may be used to train a predictive model. This feature may address the difficulty of obtaining accurately labeled, reproducible, and artifact-free MR data.

[0052] In conjunction with the generated data set, one or more predictive models can be used to select regularization that accelerates initial data acquisition and / or noise removal. Additionally, one or more predictive models can be used to accelerate simulation or reconstruction using a forward model. For example, the predictive models can provide initial model parameters for use in the forward model, which may reduce the number of iterations required for measurements and simulations to converge to a solution with accuracy above a predefined value. In this manner, if the initial model parameters yield a predicted response that differs significantly from the measurements, the model parameters can be improved, which can then be fed back into subsequent measurements and simulations to further improve the predicted response.

[0053] Furthermore, if there are portions of the model-parameter space that are not covered by the predictive model, new data points may be accurately generated and labeled to train the predictive model. Furthermore, predictive models may be trained based on different metrics corresponding to different applications. For example, predictive models may be trained to optimize the excitation used in different scenarios (fast scanning for asymptomatic populations, high accuracy for specific tissue characteristics, robustness to signal-to-noise ratio variations, different hardware imperfections, etc.).

[0054] In some embodiments, the analysis engine 122 may run a neural network to determine first model parameters based at least in part on measured or simulated data, and may run a brute force nonlinear numerical calculation to solve the inverse problem using measured or simulated data to determine second model parameters. The difference between the first and second model parameters from these two "inverse solutions" may be used as the error in the neural network based approach. In this approach, the numerical approach may provide real-time feedback to the neural network and back-propagate / update the neural network weights, allowing the neural network to train. This hybrid approach does not require or require pre-training, but may leverage the pattern matching advantages of large neural networks and the determinism and accuracy of simulation / computation techniques to solve the inverse problem. This hybrid approach may assist the neural network when it has inputs that are different from any of the examples used to train the neural network. Similarly, the hybrid approach may be used to go directly from time domain measurements to model parameterized outputs (i.e., outputs of the inverse problem). In some embodiments, the hybrid approach is implemented using a generative inverse network (GAN).

[0055] It should be noted that in some embodiments, the forward model may not depend on a particular MR device or scanner. Instead, the forward model may be, for example, specific to an individual. The predicted response calculated using the forward model may be adjusted to include characteristics or signatures of a particular MR device or scanner, such as magnetic field inhomogeneity or spatial variations of the magnetic field, RF noise, a particular RF pickup coil or another magnetic sensor, variations of the characteristics or signature due to external magnetic field strength or measurement conditions (such as voxel size), geographic location, time (e.g., due to geomagnetic storms), etc. Thus, the predicted response may be machine specific.

[0056] Although the above discussion illustrates computational techniques using a single predictive model for the sample 112, in other embodiments, there may be multiple predictive models for the sample 112. For example, different predictive models may be used to determine model parameters for different parts of the sample 112 (such as different organs or different types of tissue), and thus different voxels. Thus, in some embodiments, different predictive models may be used to provide T1, T2 values ​​for different types of tissue, such as those summarized in Table 1.

[0057] [Table 1]

[0058] 9-15, in some embodiments, the analysis engine 122 may receive information relating to or specifying results of measurements (sometimes referred to as non-invasive measurements) performed on an individual from the measurement device 114, or may access or retrieve information in local or remote memory within or associated with the system 100 via the memory engine 128 (or module). Additionally, the analysis engine 122 may access or retrieve via the memory engine 128 past non-invasive measurements (which may have been performed on an individual or groups of individuals, and which may or may not include the individual), and a dictionary of pre-defined features or basis functions associated with the past non-invasive measurements.

[0059] It should be noted that the non-invasive measurements and the previous non-invasive measurements may include or correspond to MR measurements. For example, the MR measurements may include MRI scans. Furthermore, the non-invasive measurements and the previous non-invasive measurements may include MR parameters associated with voxels within the individual. In particular, the parameters may include density of nuclei, longitudinal relaxation times along a direction parallel to the external magnetic field, and / or transverse relaxation times along a direction perpendicular to the external magnetic field.

[0060] The analysis engine 128 may then update the dictionary of predetermined features based at least in part on the non-invasive measurements and the past non-invasive measurements. In particular, the updating may include performing a minimization technique with a cost or error function having an L2-norm term and an L0-norm term. The analysis engine 128 may then determine (e.g., using gradient descent techniques) weights associated with features in the updated dictionary of predetermined features (such as weights in a weighted linear convolution of features in the updated dictionary) based at least in part on the non-invasive measurements. For example, the weights may be determined by performing a least-squares fit of the non-invasive measurements based at least in part on the features in the updated dictionary and / or by using gradient descent. In some embodiments, the weights may be determined using a pre-trained machine learning model (such as a supervised learning model or a neural network) that outputs weights based at least in part on the updated dictionary of predetermined features and the non-invasive measurements. In combination with the updated dictionary features, the weights may provide a sparse representation of the non-invasive measurements. Note that the dictionary of pre-defined features and the updated dictionary of pre-defined features may correspond to a portion of an individual's anatomy.

[0061] Additionally, the results engine 124 may present or provide the sparse representation, such as by providing output to a user, to another electronic device, to a display, and / or to memory (via the memory engine 128).

[0062] In some embodiments, the analysis engine 122 may perform analysis on a sparse representation of the non-invasive measurements. For example, the non-invasive measurements may include at least one component of magnetization associated with the individual, and the analysis engine 122 may calculate at least a predicted component of magnetization of a voxel associated with the individual based at least in part on the measured component of magnetization, the forward model, the external magnetic field, and the RF pulse sequence used to measure the non-invasive measurements, and solve the inverse problem by iteratively modifying parameters associated with the voxel in the forward model until the difference between the predicted component of magnetization and the measured component of magnetization is less than a predefined value (such as a 1, 5, or 10% difference or error).

[0063] Alternatively or additionally, the analysis engine 122 may perform a longitudinal analysis of the non-invasive measurements based at least in part on the sparse representation and the sparse representation of at least a subset of the past non-invasive measurements. It should be noted that the longitudinal analysis may not require or use pixel-level registration operations between the non-invasive measurements and the subset of the past non-invasive measurements. Furthermore, the longitudinal analysis may be used with previous information to detect, for example, changes in anatomical features, or more generally, changes in the non-invasive measurements relative to a baseline provided by at least a subset of the past non-invasive measurements. Thus, if an individual is known to be at risk for liver cancer, more time may be spent acquiring high quality images of the liver. Based at least in part on the detected changes, the communication engine 116 may provide instructions to the excitation source 110 and / or the measurement device 114 to perform additional non-invasive measurements of at least a portion of the individual associated with the changes. The results engine 124 may present or provide results of the longitudinal analysis (e.g., information identifying detected changes), such as by providing output to a user, to another electronic device, to a display, and / or to memory (via the memory engine 128).

[0064] Additionally, although system 100 is illustrated as having certain components, in other embodiments system 100 may have fewer or more components, two or more components may be combined into a single component, and / or the location of one or more components may be altered.

[0065] Method embodiments are now described. Figure 2 is a flow diagram illustrating an example method 200 for determining model parameters associated with a sample. The method may be performed by a system (such as system 100 of Figure 1) or one or more components within a system (such as excitation source 110, measurement device 114, and / or computer 116).

[0066] During operation, a source in the system can apply an excitation to the sample (operation 210), the excitation having at least a wavelength and an intensity or light flux. For example, the excitation may include one of electromagnetic radiation, radio frequency, a particle beam, sound waves, a magnetic field, and / or an electric field. Thus, the excitation may include at least one of an electromagnetic beam in an x-ray band of wavelengths, a neutron beam, an electron beam, an electromagnetic beam in an optical band of wavelengths, an electromagnetic beam in an infrared band of wavelengths, sound waves in an ultrasonic band of wavelengths, a proton beam, an electric field associated with an impedance measuring device, radio frequency associated with a magnetic resonance device, and / or a magnetic field associated with a magnetic susceptibility measuring device.

[0067] A measurement device in the system may then measure a response associated with the exciting sample (operation 212). For example, the measurement device may include at least one of an x-ray detector, a neutron detector, an electron detector, an optical detector, an infrared detector, an ultrasonic detector, a proton detector, a magnetic resonance device, an impedance measuring device, and / or a magnetic susceptibility measuring device. It is noted that the measured response may include a time domain response of the sample and may be other than or different from the image.

[0068] Additionally, the system may use information identifying the measured response and excitation as input to a predetermined predictive model to calculate model parameters for each voxel in a forward model having a plurality of voxels representing the sample (operation 214). The forward model may simulate the response physics that occurs within the sample to a predetermined excitation having a predetermined wavelength and a predetermined intensity or predetermined flux selected from a range of measurement conditions including excitation, wavelength and intensity or flux, and at least different wavelengths and at least different intensities or different flux. Additionally, the forward model may be a function of the excitation, the model parameters of the plurality of voxels, and a differential or phenomenological equation that approximates the response physics.

[0069] In addition, the predetermined predictive model may include a machine learning model and / or a neural network. In some embodiments, the predetermined predictive model includes a personalized predictive model corresponding to an individual.

[0070] The system may then determine the accuracy of the model parameters by comparing at least the measured response to a prediction of the response calculated using the forward model, the model parameters, and the excitation (operation 216).

[0071] Further, if the accuracy exceeds a predefined value (operation 218), the system may provide the model parameters, for example, as output to a user, to another electronic device, to a display, and / or to memory (operation 220).

[0072] Thus, if the accuracy exceeds a predefined value (operation 218), the model parameters may be calculated in a single pass without further iterations. As a result, model parameters having accuracy above a predefined value may be calculated in fewer iterations with a predefined predictive model than an iterative approach without a predefined predictive model.

[0073] Alternatively, if the accuracy is less than a preset value (operation 218), the system may calculate a modified excitation having at least a modified wavelength, a modified intensity, or a modified flux using the information identifying the excitation and the accuracy as input to a second predefined predictive model (operation 222), and repeat the apply, measure, calculate, and determine operations using the modified excitation instead of the excitation (operation 224). It is noted that the second predefined predictive model may include a machine learning model and / or a neural network.

[0074] In some embodiments, the system optionally performs one or more any additional or alternative actions, for example, if the accuracy is less than a predefined value (operation 218), the system may add the excitation and measured response to a training data set and use the training data set to determine a revision of the predictive model.

[0075] Additionally, the system may classify or segment one or more anatomical structures in the sample using the model parameters and a third predictive model. For example, the third predictive model may include a machine learning model and / or a neural network.

[0076] Additionally, the system may train the predictive model using a simulation data set calculated using the forward model, a range of model parameters, and a range of excitations.

[0077] 3 is a diagram illustrating an example of communication between components in system 100 (FIG. 1). In particular, a processor 310 in computer 116 may execute program instructions (PI) 312 stored in memory 314. When processor 310 executes program instructions 312, processor 310 may perform at least a portion of the operations in a computing technique.

[0078] During the computational techniques, the processor 310 may provide instructions 318 to an interface circuit (IC) 316. In response, the interface circuit 316 may provide the instructions 318 to the excitation source 110, for example, in one or more packets or frames. Further, after receiving the instructions 318, the excitation source 110 may apply excitation 320 to the sample.

[0079] The processor 310 may then provide instructions 322 to the interface circuit 316. In response, the interface circuit 316 may provide the instructions 322 to the measurement device 114, for example, in one or more packets or frames. Further, after receiving the instructions 322, the measurement device 114 may measure a response 324 associated with the sample exciting 320. The measurement device 114 may then provide the measured response 324 to the computer 116, for example, in one or more packets or frames.

[0080] After receiving the measured response 324, the interface circuit 316 may provide the measured response 324 to the processor 310. Using the measured response 324 and information specifying the excitation 320 as inputs to a predetermined predictive model, the processor 310 may then calculate model parameters (MPs) 326 for each voxel in a forward model having a number of voxels representing the sample.

[0081] Additionally, the processor 310 may determine an accuracy 328 of the model parameters by comparing at least the measured response 324 to a prediction of the response calculated using the forward model, the model parameters 326, and the excitation 320. If the accuracy 328 exceeds a predefined value, the processor 310 may provide the model parameters 326 as an output, for example, to a user, another electronic device (via the interface circuitry 316), a display 330, and / or the memory 314.

[0082] Otherwise, when the accuracy is less than a predefined value, the processor 310 may perform an improvement operation 332. For example, the processor 310 may calculate a modified excitation using information specifying the excitation 320 and the accuracy 328 as input to the second predetermined predictive model, and repeat the apply, measure, calculate, and determine operations using the modified excitation instead of the excitation 320. Alternatively or additionally, the processor 310 may add the excitation 320 and the measured response 324 to a training data set and use the training data set to determine a modified version of the predictive model.

[0083] Next, embodiments of predictive models are described. For example, the predictive models may include machine learning models, such as supervised learning models or unsupervised learning techniques (such as clustering). In some embodiments, the machine learning models may include support vector machines (SVMs), classification and regression trees, logistic regression, LASSO, LASSO logistic regression, linear regression, non-linear regression, pattern recognition, Bayesian techniques, and / or other (linear or non-linear) supervised learning techniques.

[0084] FIG. 4 illustrates an example of a machine learning model 400. In this machine learning model, a weighted (using weights 408) linear or nonlinear combination 416 of measurements 410, one or more corresponding excitations 412, and one or more errors 414 between the one or more measurements 410 and one or more predicted responses determined using the forward model, current examples of model parameters of voxels in the forward model, and one or more excitations 412 are used to calculate modified examples of model parameters 418. Thus, in some embodiments, the predictive model 400 is used in conjunction with the forward model to iteratively modify examples of model parameters until the accuracy of the predicted response falls below a predefined value (i.e., until a convergence criterion is achieved). However, in some embodiments, the machine learning model may be used to determine the model parameters in one pass, i.e., in an open-loop manner.

[0085] Alternatively or additionally, the predictive model may include a neural network. A neural network is a generalized function approximator. For example, techniques such as deep learning typically use past examples as input. Typically, these machine learning models have no reference point to use to estimate the error in the prediction, and therefore cannot determine the actual function they are trying to approximate. In particular, it is difficult for a neural network to make predictions based on inputs that are significantly different from the examples it has learned from. In this respect, a neural network can be thought of as a lossy computational compression engine.

[0086] However, by training the neural network using a wide variety of excitations, measured responses, and corresponding model parameters, the neural network can provide model parameters (or initial estimates of the model parameters) of a forward model that simulates the physics of the sample's response to the excitation. Because the neural network is an effective approximation / compression, it can run faster with less computational power for the same input. Furthermore, because the function is known in the forward model, the response can be calculated and the accuracy of the prediction can be evaluated (as opposed to using an approximation). Thus, computational techniques may be used to determine when the prediction is unreliable. In particular, as discussed above with respect to FIG. 4, a neural network may be used in combination with a forward model to iteratively modify example model parameters until the accuracy of the predicted response falls below a predefined value (i.e., until a convergence criterion is achieved). However, in some embodiments, the neural network may be used to determine the model parameters in one pass, i.e., in an open-loop manner.

[0087] FIG. 5 illustrates an example of a neural network 500. The neural network may be implemented using a convolutional neural network or a recurrent neural network. For example, the neural network 500 may include a network architecture 512 including an initial convolutional layer 514 that provides filtering of the input 510 (such as one or more measurements and a difference or error between one or more measurements and a forward model, a current example of model parameters, and one or more predicted responses determined using excitation), an additional convolutional layer 516 that applies weights, and an output layer 518 (such as a rectified linear layer) that performs selection (e.g., selection of a modified example of the model parameters). It is noted that the details of the different layers of the neural network 500 and their interconnections may define the network architecture 512 (such as a directed acyclic graph). These details may be specified by the instructions of the neural network 500. In some embodiments, the neural network 500 is reconstructed as a series of matrix multiplication operations. The neural network 500 may be capable of handling real-world variance in inputs of one million or more. It should be noted that the neural network 500 may be trained using deep learning techniques or GANs. In some embodiments of the machine learning model 400 (FIG. 4) and / or the neural network 500, current examples of the model parameters are used as inputs.

[0088] In some embodiments, the large convolutional neural network may include 60M parameters and 650,000 neurons. The convolutional neural network may include eight learning layers with weights, including five convolutional layers and three fully connected layers, with a final 1000 softmax or normalized exponential functions that generate a distribution over 1000 class labels for different possible model parameters. Some of the convolutional layers are followed by a max pooling layer. To speed up training, the convolutional neural network may use non-saturating neurons (such as local response normalization) and efficient double-parallelized GPUs to realize the convolutional operation. In addition, regularization techniques (sometimes called "dropout") may be used to reduce overfitting in the fully connected layers. In dropout, predictions from different models are efficiently combined to reduce the test error. In particular, the output of each hidden neuron is set to zero with probability 0.5. Neurons that are "dropped out" in this way do not contribute to the forward pass and do not participate in backpropagation. Note that a convolutional neural network may maximize the objective of multinomial logistic regression, which is equivalent to maximizing the average over the training cases of the log-probability of the correct label under the predictive distribution.

[0089] In some embodiments, the kernels of the second, fourth, and fifth convolutional layers are connected to the kernel maps of the previous layer present on the same GPU. The kernels of the third convolutional layer may be connected to all the kernel maps of the second layer. Furthermore, the neurons of the fully connected layer may be connected to all the neurons of the previous layer. Furthermore, a response normalization layer may follow the first and second convolutional layers, and a max pooling layer may follow both response normalization layers, as well as the fifth convolutional layer. A nonlinear model of neurons, such as a rectified linear unit, may be applied to the outputs of all the convolutional layers and the fully connected layer.

[0090] In some embodiments, the first convolutional layer filters the input image of 224×224×3 with 96 kernels of size 11×11×3 with a stride of 4 pixels (which is the distance between the receptive field centers of adjacent neurons in the kernel map). Note that the second convolutional layer may take the (response-normalized and pooled) output of the first convolutional layer as input and filter it with 256 kernels of size 5×5×48. Furthermore, the third, fourth, and fifth convolutional layers may be coupled to each other without an intervening pooling or normalization layer. The third convolutional layer may have 384 kernels of size 3×3×256 coupled to the (normalized and pooled) output of the second convolutional layer. Furthermore, the fourth convolutional layer may have 384 kernels of size 3×3×192, and the fifth convolutional layer may have 256 kernels of size 3×3×192. Each fully connected layer has 4096 neurons. Note that the numerical values ​​in the preceding and remaining discussion below are for illustration purposes only, and different values ​​may be used in other embodiments.

[0091] In some embodiments, the convolutional neural network is implemented using at least two GPUs, where one GPU executes a portion of a layer portion and the other GPU executes the remaining layer portion, and the GPUs may communicate at a particular layer. The input of the convolutional neural network may be 150, 528 dimensional, and the number of neurons in the remaining layers of the convolutional neural network may be given by 253, 440-186, 624-64, 896-64, 896-43, and 264-4096-4096-1000.

[0092] Next, an embodiment of a forward model is described. The forward model is a 3D model of voxels in a portion of a sample (such as an individual), and may include model parameters in the Bloch equations for each of the voxels. In particular, with a quasi-static magnetic field B0 along the z-axis, the Bloch equations become:

number

number

number

[0093] In principle, the solution space of model parameters in the Bloch equations of a sample may be underdetermined, i.e., the model parameters to be determined may be significantly greater than the number of observations to specify or constrain the model parameters. Thus, when learning a predictive model or using a predictive model to determine model parameters (such as using computations in layers of a machine learning model or neural network), the computational techniques may exploit additional information to constrain or reduce the dimensionality of the problem. For example, the anatomical aspects of the sample may be determined using other imaging techniques such as computed tomography, x-ray, ultrasound, etc. Furthermore, regions that are dissimilar (i.e., have very different measurements, e.g., different measured MR signals) to the type of tissue of interest (such as cardiac tissue) may be excluded from the forward model (such as by setting model parameters to zero in these regions). In this way, for example, regions containing air may be excluded. Other constraints in the forward model include thermodynamic constraints on heat flow (from hot to cold) for perfusion, or MRT to quantify metabolism. Furthermore, the predictive model may be trained using measurements at different magnetic field strengths B0 (which may provide similar information as a pseudorandom pulse sequence) using different pulse sequences and / or different MR techniques, which may reduce the ratio of model parameters to observed values ​​and simplify the training of the predictive model.

[0094] Alternatively or additionally, tissue (such as anomalies or changes) that deviate significantly from a predicted or simulated response (e.g., predicted MR signal) based on previous MR measurements or scans may be the focus of the forward model, for example by using a contour map (such as a cubic spline) to bound (or specify boundaries of) regions where there are significant differences. In some embodiments, when training a predictive model or using a predictive model to determine model parameters (e.g., using computations in a machine learning model or layer within a neural network), the difference or error between the measured and simulated or predicted responses may be represented using one or more level set functions, and the boundaries of regions having errors above a threshold may be determined based on the intersection of a plane corresponding to the threshold with the one or more level set functions.

[0095] In some embodiments, a layer of the neural network may calculate first and second derivatives along the surface of the model parameter solution in the sample. (To facilitate the calculation of the derivatives, the model parameters may be represented using one or more level set functions.) A set of voxels along the line where the first derivative is zero may be identified. This set of voxels may be fitted with a cubic spline such that the error between the voxel locations and the cubic spline is minimized. This fitting operation may be repeated for all boundaries in the model-parameter-solution space. Further, the largest continuous surface within the boundary defined by the cubic spline may be determined, and the model-parameter-solution calculation may be repeated to determine a new continuous surface within the previous continuous surface. This generalized framework may minimize the error over the intra-voxel volume, thereby improving the agreement between the measurement and the simulated or predicted response based on the forward model.

[0096] For example, a neural network can solve the inverse problem using the Jacobian matrix of the model parameters of the voxels in the forward model and Newton's method to modify the model parameters of the voxels in successive layers based on how perturbations in the model parameters affect the difference or error between the measurement and the predicted response.

[0097] In some embodiments, if a portion of a sample contains one voxel, there may be 4-10 model parameters (specifying a forward model) that need to be determined for a particular type of tissue. If a voxel contains M types of tissue, there may be 4M-10M model parameters that need to be determined for a particular type of tissue. As the number of voxels increases, this may seem like a daunting problem.

[0098] However, because different nuclides have different Larmor frequencies, the spatial distribution of the nuclides and their local concentrations may be determined from the measurements. A predefined anatomical template of the body (or part of the body) and the initial model parameters of the associated forward model may then be scaled to match the spatial distribution of the nuclides and their local concentrations. For example, predetermined or predefined ranges of model parameters for different types of tissue may be used to determine the initial model parameters. In some embodiments, the initial model parameters are based on model parameters associated with previous measurements or MR scans.

[0099] A lookup table with simulated or predicted responses (generated using one or more forward models) as a function of associated model parameters and excitation may then be used to modify the initial model parameters or to calculate model parameters for voxels within the sample. For example, simulated or predicted responses that are similar to the measurement may be identified, and the difference or error between these simulated or predicted responses and the measurement may be used to guide the interpolation between the model parameters in the lookup table.

[0100] In some embodiments, for a tissue type (e.g., a particular organ), the model parameters determined using different layers of the neural network may be iteratively refined as the size of the voxels in the different layers is gradually reduced (hence the number of voxels increases). This analysis may be driven by the error between the measurement and the simulated or predicted response using the forward model. Proceeding through successive layers of the neural network may focus on residual regions with errors larger than a convergence or accuracy criterion. For example, the model parameters of the forward model in one layer of the neural network may be based on measurements at one magnetic field strength, and the error may be determined based on the predicted response of the forward model at another magnetic field strength. It is further noted that initially, the predicted or forward model may assume that there is no contribution or interaction between different voxels. However, as the error and voxel size are reduced, such contributions and / or interactions may be included in subsequent layers of the neural network. In some embodiments, if there are multiple candidates for model-parameter solutions (with similar errors) to the inverse problem for a layer in the neural network, at least some of these candidates may be retained for use in subsequent layers (i.e., a unique model-parameter solution may not be identified at this point). Alternatively, if there is no unique model-parameter solution within a desired error range (e.g., less than 50, 25, 10, 5, or 1%), the best (lowest error) model-parameter solution may be retained. Furthermore, if there is no model-parameter solution within the desired error range, additional measurements may be performed using a second predictive model to modify the excitation.

[0101] Thus, the inverse problem of determining model parameters based on measurements can be "solved" using a predictive model that provides model parameters that minimize the error or difference between the measurements and the simulated or predicted response, generated based on the forward model, the model parameters, and the excitation. In some embodiments, the inverse problem is solved using one or more analytical techniques, including least squares, convex quadratic minimization, steepest descent, quasi-Newton, simplex, Levenberg-Marquardt, simulated annealing, genetic techniques, graph-based techniques, another optimization technique, and / or Kalman filtering (or linear quadratic estimation).

[0102] It should be noted that training the predictive model may use dynamic programming. In particular, the training problem may be partitioned and run in parallel by multiple computers, e.g., in a cloud-based computing system. For example, a particular thread may attempt to solve the inverse problem for a particular measurement condition. Multiple potential model parameter solutions generated by the computer (or processor) may be combined (e.g., using linear superposition) to determine an error metric that is minimized using one or more analytical techniques.

[0103] Furthermore, as mentioned above, the inverse problem can be iteratively solved by a predictive model (such as a machine learning model or neural network) by first finding suitable model parameters for the forward model (e.g., model parameters that minimize the error between the measurement and the simulated or predicted response) using a coarse voxel size, and then attempting to progressively find suitable parameters using smaller voxel sizes in layers or stages of computation. Note that the final voxel size (or a suitable range of voxel sizes, since in some embodiments the voxel size is not fixed) used in this iterative procedure may be determined based on the gyromagnetic ratio of the nuclei being scanned. Furthermore, the voxel size or location may be selected such that the voxel is evenly divided into a set of subvoxels, or such that there is a certain amount of overlap with the preview voxel size, effectively "oversampling" the overlapping region and potentially further localizing where the MR signal originates. This last technique may be similar to shifting the entire gradient system in one or more dimensions by a distance dx that is smaller than the characteristic length of the voxel (such as the length, width or height of the voxel). In some embodiments, the voxel size in the predictive model or forward model is smaller than that used in the measurements (i.e., the predictive model or forward model may use super-resolution techniques). For example, at a magnetic field strength of 3T, it may be 512x512 voxels or 1024x1024 voxels. Note that the voxel size is 0.25 3 mm 3 It may be less than.

[0104] Here, we describe an embodiment of a technique for segmenting different types of tissue, which may be used by a third predictive model (such as a neural network). obv A dictionary D of measured time-sampled MR trajectories (or vectors) in a multidimensional parameter space for different types of tissue dj (for j = 1 to n) such that mr This section stipulates:

number

number

[0105] Consider the case of two adjacent voxels u and v. The intra-voxel linear equation U y and V y needs to be solved for both u and v. Several outcomes are possible. First, y , V y , the analysis may terminate with a unique model parameter solution (a "unique model parameter solution" may be a vector of best fit to the existing forward model, i.e., with an error or difference smaller than a convergence or accuracy criterion). Alternatively, y V y There may be a unique model parameter solution that is not U y The model parameter solution of V y We constrain V to have a single model parameter solution. y In this case, the analysis may be terminated. However, y , V y , neither of them may have a unique model parameter solution, in which case a unique model parameter solution may be obtained by combining the equation systems (i.e., effectively increasing the voxel size). Furthermore, U y , V y,There are cases where neither has a model parameter solution, in which case the intra-voxel problem cannot be solved without further constraints.

[0106] In the last case, we may be able to see the neighboring voxel w, i.e. the serial voxels u, v, w, and the corresponding intravoxel linear equation U y , V y , W y We need to solve the equation for u, v, and w. y , W y Note that reduces to the previous case. If the intra-voxel linear equations do not reduce to the previous case, we can recursively apply this pairing operation until they do, and then solve the intra-voxel linear equations as before.

[0107] In general, this analysis technique may be thought of as isomorphic to the problem of fitting a 3D surface (or volume) to minimize error. One challenge in this regard is to find a model parameter solution α j The problem with this is that it assumes that all adjacent volumes have equal influence on

[0108] The error minimization may initially assume that there is no inter-voxel contribution (i.e., voxels are independent). Then, inter-voxel contributions may be included. In particular, when considering adjacent voxel volumes, there are two distinct classes: volumes that share a surface, and volumes that share only a 1D edge. The minimization function can be improved by weighting the error contribution of the voxel u at the center of the relative coordinate system. If the contribution to the error is r-2 where r is the distance between the centre points of the voxels, and assuming 1 mm isotropic voxels in the weighting, the minimization or fitting problem with inter-voxel contributions can be expressed as:

number

[0109] Alternatively, the magnetic contribution from neighboring voxels is r 2 Since is proportional to , given a sphere of radius R from the center of the primary or central voxel in the minimization problem, the surrounding voxels may be weighted based on how much the sphere expands into the volume of the neighboring voxels (and thus how strong the contribution between them is estimated to be). For example, there may be three different weights that need to be assigned, including a weight for voxels that share a 2-dimensional surface, a weight for voxels that share a 1-dimensional line, and a weight for voxels that share a 0-dimensional point. Because there may not be a uniform tissue distribution within each voxel, the weights may be dynamically adjusted to model different types of distributions within each voxel to find a distribution that minimizes the error. This may provide the ability to identify multiple MR signatures within a voxel for different types of tissue. Note that as computing power improves, the accuracy of the third prediction model may improve, and the analytical techniques used to solve the minimization problem (and thus the inverse problem) may be modified.

[0110] Thus, in embodiments where a voxel's forward model depends on the forward models of surrounding or neighboring voxels, the voxel's forward model may be calculated using second or Nth order effects. For example, if there are N first order forward models (where N is an integer), then there may be N! / (N-27)! second order forward models (where all voxels interact). In some embodiments, locality is used to simplify the inverse problem. In this way, a forward model may be generated by incorporating how the forward models of neighboring voxels affect the first order (center) voxel or the forward model of the first order voxel.

[0111] In some embodiments, a dithering technique is used to overcome the arbitrary location of a voxel relative to the distribution of tissue types in the body. In particular, for any voxel arrangement and current voxel size, there may be more than one type of tissue in a voxel. This may cause the forward model parameters of this voxel to change significantly. This may suggest that more than one forward model is required for that voxel. To check this, the voxel may be displaced by a distance dx (which is a fraction of the length, width or height of the voxel) and the forward model parameters may be determined again (e.g., using a predictive model). In the process, the tissue distribution is determined. As a result, this approach can effectively improve the spatial resolution in the analysis without changing the voxel size.

[0112] Figure 6 illustrates an example of classification or segmentation of one or more anatomical structures 600. In particular, Figure 6 illustrates identifying or segmenting an organ 610 based at least in part on discontinuous changes in T1 and T2 at voxel boundaries.

[0113] While the above discussion illustrates computational techniques using MR techniques, this approach may be generalized to measurement systems that can physically model and measure samples in real time using a wide variety of characterization techniques. In general, computational techniques may use a combination of mechanical and / or electromagnetic waves to "perturb" or "excite" the scanned volume in order to assess the accuracy of predictions in terms of how the volume will respond to the perturbations. This also includes the ability to simulate the system itself and any parts of the environment in which the system is located that may affect the correctness or accuracy of the forward model the system is trying to generate to describe the scanned or measured volume.

[0114] It is noted that different characterization techniques may provide tensor field mapping and the ability to detect anomalies in the tensor field. These maps may be images or quantitative tensor field maps, and each of the characterization techniques may provide visualization of different types of tensor field maps captured with different types of measurements. By looking at or considering two or more of these maps, the system may have access to orthogonal information.

[0115] In this manner, the system may provide a method for real-time or near real-time capture of high or hyper-dimensional pseudo or hybrid tensors or matrices for each voxel in 3D space. Using electromagnetic and / or mechanical perturbations or excitations, the system may use different characterization techniques to measure the disturbances and responses and to simulate the responses.

[0116] The result of this characterization may be a (4+N)D (3 spatial dimensions, 1 time dimension, and up to N measurement dimensions at each point in space) quantitative model of the scanned volume. Note that the (4+N)D quantitative model may be projected onto any subset of the full (4+N)D space, including 2D or 3D images.

[0117] In some embodiments, the use of multi-dimensional data and models improves diagnostic accuracy (i.e., reduces false positive rates) compared to conventional MRI approaches, even when larger voxel sizes are used. Thus, computational techniques can improve diagnostic accuracy at larger voxel sizes (or weaker external magnetic fields) than are required for conventional MRI. However, as noted above, computational techniques may be used in conjunction with a wide variety of measurement techniques, either separately or in addition to MRI.

[0118] Some existing MR scanners use multiple receive channels (each with a receiver and associated antenna) to speed up or shorten the time required for an MR scan, an approach sometimes called "MRI parallel imaging."

[0119] It is worth noting that the gradient coils of the MR scanner phase-encode (in time) the MR signals, making the output MR signals distinct from each other. Furthermore, when there are multiple receive channels, there is redundancy in the acquired phase-encoded MR signals. In principle, by utilizing different phase profiles, the redundancy allows some of the phase-encoded MR signals (such as some of the MR scan lines) to be skipped and subsequently reconstructed from other phase-encoded MR signals, thereby shortening the MR scan time.

[0120] For example, in the case of 2D space, an RF pulse may be applied during an MR scan, after which the x and y gradient coils are opened and an MR line in k-space is read out. These operations (application of an RF pulse and readout of an MR line) may then be repeated multiple times for additional MR lines (with different phase encodings) until, for example, 256 MR lines are read out. By using, for example, 32 receive channels and skipping measurements of some of these MR lines, the MR scan time may be reduced, for example by a factor of two or three.

[0121] However, it should be noted that the reduction in MR scan time is not a linear function of the number of receive channels, because in many MRI parallel imaging techniques, additional information is required to reconstruct the skipped MR lines, so that either the reduction in the number of MR lines is less than the number of receive channels, or an additional pre-scan is used to acquire the additional information.

[0122] In particular, there are two main classes of existing MRI parallel imaging techniques. The first class of approaches (called "SENSE", "ASSET", "RAPID" or "SPEEDER") is based on the image domain after reconstruction of MR signals from individual RF pickup coils or antennas of the receive channels (sometimes called "coils"). In this approach, the number of dropped or skipped MR scan lines may be equal to the number of receive channels. However, a separate pre-scan is used to determine the coil sensitivities (or coil sensitivity maps) of the receive channels. This is because the MR signal measured using a given receive channel during an MR scan corresponds to the volume integral of the product of the coil sensitivity of the given receive channel and the time-dependent magnetization of the sample. Furthermore, the polarizing magnetic field received by the coil or antenna of a given receive channel depends on its position and orientation, so that in general, each of the coils or antennas of the receive channels has a different coil sensitivity. By performing a pre-scan, the coil sensitivities can be determined in advance. Then, in the image domain, the characteristics of the sample (such as the spatially varying proton density) may be illustrated or presented.

[0123] Thus, in an existing MRI scanner, the first class of approaches may include the operations of generating coil sensitivity maps, acquiring partial k-space MR data, reconstructing partial field of view images from each coil, and unfolding / combining the partial field of view images using matrix inversion. Note that the first class of approaches may thus be reformulated as a linear problem and solved, in part, using Fourier and inverse Fourier transforms.

[0124] The second class of approaches (called "GRAPPA") is k-space based. This class of approaches does not use a pre-scan to determine the coil sensitivities. Instead, extra or additional MR scan lines may be acquired near k equal to zero in k-space. By exploiting the smoothness of so-called "autocalibration lines" near k equal to zero, the missing (skipped) MR scan lines may be calculated (e.g., by interpolation using the autocalibration lines).

[0125] Thus, in existing MR scanners, the second class of approaches may involve reconstructing the Fourier plane of the image from the frequency signals of each coil (i.e., reconstruction in the frequency domain). Note again that the second class of approaches may be reformulated as a linear problem and solved, in part, using Fourier and inverse Fourier transforms.

[0126] Furthermore, there are other (less common) approaches to MRI parallel imaging. In particular, the coil sensitivities and sample properties (such as the spatially varying proton density) may be determined simultaneously in a joint reconstruction (e.g., instead of using a pre-scan). For example, in principle, the coil sensitivities and the spatially varying proton density can be calculated from the MR signal by solving a nonlinear inverse or inverse problem. However, this nonlinear optimization problem is typically underspecified (e.g., has more unknowns than can be determined by the measured MR signal and is underdetermined, so no unique solution exists).

[0127] One approach to solving nonlinear optimization problems is to use an assumed regularization to constrain the optimization. For example, the coil sensitivities can be assumed to be smooth. While this constraint can sometimes produce a solution, it generally leads to very long solution times in many cases.

[0128] Another approach to solving nonlinear optimization problems is to assume that the coil sensitivities can be expressed as a linear superposition of polynomial functions. However, this assumed expansion is often ill-conditioned. In particular, it is difficult to solve nonlinear optimization problems with polynomial functions of degree higher than quadratic.

[0129] In embodiments of the disclosed computational techniques, the nonlinear optimization problem may be solved without assuming that the coil sensitivities are smooth, a linear superposition of polynomial functions, or have a predefined closed-form functional expression. Instead, the coil sensitivities may be solutions of Maxwell's equations in the field of view of the MR device at a given external magnetic field strength (i.e., they may satisfy Maxwell's equations and thus not be approximations). In addition to being physically accurate, the resulting coil sensitivities may allow the nonlinear optimization problem to be solved much more quickly than existing nonlinear optimization approaches. Separately, or in conjunction with MR line skipping, this feature may significantly reduce MR scan times.

[0130] Furthermore, because the disclosed computational technique (which may be referred to as "Maxwell parallel imaging") does not involve the use of pre-scans to determine coil sensitivity or the measurement of automatic calibration lines, Maxwell parallel imaging may be significantly faster than the first class of approaches and / or the second class of approaches previously described for MRI parallel imaging. For example, MR scan times with Maxwell parallel imaging may be, for example, at least 2-4 times faster than these existing classes of approaches. In fact, Maxwell parallel imaging may achieve the theoretical limits of possible acceleration in MR scan times for a given coil set, field of view, external magnetic field strength (or resolution), and 2D or 3D measurements.

[0131] It should be noted that Maxwell Parallel Imaging may be used to accelerate MR scan times for qualitative or quantitative MR measurements, and thus, Maxwell Parallel Imaging may be used in conjunction with MRI, MR fingerprinting, tensor field mapping, and / or other MR measurement techniques.

[0132] Typically, the solution of Maxwell's equations for the coil sensitivity is a circularly polarized magnetic field. These coil fields may be generated offline (i.e., not during the MR scan) using a numerical simulation within the field of view of the MR device. For example, the coil fields may be calculated by the distribution of currents (dipoles, etc.) on a surface surrounding the field of view of the MR device. In some embodiments, there may be tens of thousands or more random currents on the surface.

[0133] However, due to the low frequency (the precession frequency of protons in a 1.5T external magnetic field is 63.87MHz) and near-field conditions, the currents on the surface may be similar to each other. As a result, there may be a set of coil magnetic field basis vectors that encompass or contain most of the energy or power in the different coil magnetic fields. For example, singular value decomposition or eigenvalue decomposition techniques may be used on the different numerical simulation coil magnetic fields to determine the set of coil magnetic field basis vectors. A given coil magnetic field (and therefore a given coil sensitivity) may then be a linear superposition of the set of coil magnetic field basis vectors. In some embodiments, the set of coil magnetic field basis vectors may include, for example, 30 coil magnetic field basis vectors. Note again that the coil magnetic field basis vectors may each be a solution to Maxwell's equations. Alternatively, in some embodiments, the coil magnetic field basis vectors may each be an approximation of a solution to Maxwell's equations (within 85%, within 95%, within 99%, etc. of the solution to Maxwell's equations).

[0134] By using a set of coil field basis vectors, the nonlinear optimization problem is physically "normalized" and can be solved in less time. For example, if no normalization assumptions are made, the nonlinear optimization problem for a 2D MR scan with 12 coils and 256-bit Fourier transform resolution takes 256 2 +12·256 2 For example, the first unknown term corresponds to the unknown proton density, and the second unknown term corresponds to the unknown coil sensitivity. As mentioned before, this problem is ill-posed, so there is no unique solution, and existing approaches use various approximations and assumptions.

[0135] In contrast, in Maxwell parallel imaging, instead of solving for unknown coil sensitivities, a nonlinear optimization problem determines the coefficients of the different coils in a weighted linear superposition of a set of coil magnetic field basis vectors. Thus, the nonlinear optimization problem for a 2D MR scan with 12 coils, 30 coil magnetic field basis vectors, and 256-bit Fourier transform resolution is 2 +12·30 unknown parameters. Thus, Maxwell Parallel Imaging can solve for, for example, the unknown proton density and the unknown coil sensitivity much more quickly (than existing approaches) because instead of solving the unknown coil sensitivities, Maxwell Parallel Imaging simultaneously calculates the coefficients of a set of coil magnetic field basis vectors and, for example, the proton density.

[0136] It is noted that in Maxwell parallel imaging, a given coil sensitivity may be represented by or equal to a weighted superposition of a set of coil magnetic field basis vectors (i.e., a linear superposition of products of coefficients and corresponding coil magnetic field basis vectors). It is further noted that Maxwell parallel imaging may ultimately involve solving Maxwell's equations for the physical solution (set of coil magnetic field basis vectors) without assumptions, and thus may more accurately determine the coil sensitivity. Furthermore, the weighted superposition of a set of coil magnetic field basis vectors may be an approximation of the given coil sensitivity and may be a more accurate, physical representation.

[0137] In Maxwell parallel imaging, the nonlinear optimization problem may include iteratively solving (e.g., minimizing) a data fidelity term (the squared absolute value of the difference between the MR signal minus the estimated MR signal) subject to a constraint. Note that the data fidelity term may incorporate or include a contribution from the coil sensitivity (such as a weighted superposition of a set of coil magnetic field basis vectors). Note further that the constraint may include the structure of the spatial distribution of the proton or nucleus density (and more generally, MR parameters such as nucleus density, relaxation time, etc.), the total variation of the proton density (or MR parameter), and / or another suitable normalization for the proton density (or MR parameter). In general, the normalization term for the proton density (or MR parameter) may correspond to the one used in image processing. As a result, the normalization term for the proton density (or MR parameter) may avoid the L2 norm or smoothing criteria.

[0138] In some embodiments, the nonlinear optimization problem may be solved using a predefined or pretrained neural network or a predefined or pretrained machine learning model, in which the coil sensitivity may again be represented by a weighted superposition of a set of coil magnetic field basis vectors.

[0139] 7 is a flow diagram illustrating an example of a method 700 for determining coefficients in a representation of coil sensitivities and MR information associated with a sample, which may be performed by a system (such as system 100 of FIG. 1) or one or more components within a system (such as excitation source 110, measurement device 114, and / or computer 116, or more generally, a computer system including one or more computers).

[0140] During operation, the computer system may acquire MR signals from or associated with the sample (operation 710). This may include applying an external magnetic field, gradient magnetic fields, and / or one or more RF pulse sequences to the MR device and measuring the MR signals using a receiver or receiving channel. Alternatively or additionally, the computer system may access MR signals previously acquired by the MR device or a measurement device and stored in a memory. It should be noted that the MR device may be located remotely from the computer system or in close proximity to the computer system (such as in a common facility).

[0141] The computer system may then access (e.g., in memory) the predetermined set of coil magnetic field basis vectors (operation 712), and a weighted superposition of the predetermined set of coil magnetic field basis vectors may represent the coil sensitivity of the coil in the MR device. For example, the predetermined coil sensitivity may be represented by a linear superposition of products of the coefficients in the predetermined set of coil magnetic field basis vectors and the predetermined coil magnetic field basis vectors. Note that each of the predetermined coil magnetic field basis vectors may be a solution to Maxwell's equations.

[0142] The computer system may then solve a nonlinear optimization problem of the MR information associated with the sample and the coefficients using the MR signal and the predefined set of coil magnetic field basis vectors (operation 714). For example, the computer system may reduce or minimize a term corresponding to the squared absolute value of the difference between the MR signal and the estimated MR signal. This term may include or incorporate contributions from coil sensitivities of the coils in the MR device. For example, the predefined coil sensitivity may be represented by a weighted superposition of a set of predefined coil magnetic field basis vectors, where the weights may include coefficients for each of the predefined coil magnetic field basis vectors. Furthermore, the estimated MR signal may correspond to the MR information (spatial distribution of one or more MR parameters in a voxel, e.g., proton or nuclear density, relaxation time, etc.) specified by the MR signal. Furthermore, the nonlinear optimization problem may include one or more constraints for the reduction or minimization of the term, such as one or more constraints corresponding to the spatial distribution of one or more MR parameters (e.g., normalization corresponding to one or more MR parameters).

[0143] In some embodiments, the nonlinear optimization problem is solved iteratively (e.g., until a convergence criterion is achieved). However, in other embodiments, the nonlinear optimization problem is solved using a pre-trained neural network or a pre-trained machine learning model that maps the MR signal and a set of coil magnetic field basis vectors to a spatial distribution (e.g., within a voxel) and coefficients of one or more MR parameters. Thus, in some embodiments, the nonlinear optimization problem may be solved without iterations.

[0144] Furthermore, in some embodiments, the spatial distribution of one or more MR parameters specifies the spatial distribution of nuclear density in the sample (e.g., in an image). Thus, in some embodiments, the MR signal may be determined in a qualitative measurement, such as an MRI or another MR measurement technique. Thus, in these embodiments, the MR device may be an MR scanner.

[0145] Alternatively, in some embodiments, the spatial distribution of one or more MR parameters may correspond to the model parameters described above.Thus, in some embodiments, the MR signal may be determined by a quantitative measurement, such as TFM, MR fingerprinting, or another quantitative MR measurement technique.

[0146] 8 is a diagram illustrating an example of communication between components of system 100 (FIG. 1) and measurement device 114. In particular, a processor 810 within computer 116 may execute program instructions (PI) 812 stored in memory 814. When processor 810 executes program instructions 812, processor 810 may perform at least a portion of the operations in a computing technique.

[0147] During the computational techniques, the processor 810 may provide instructions 818 to an interface circuit (IC) 816. In response, the interface circuit 816 may provide instructions 818 to the measurement device 114 (such as an MR device) to acquire MR signals 820 associated with the sample and provide them to the computer 116. It should be noted that in some embodiments, the measurement device 114 may include sources, such as sources that provide an external magnetic field, gradient magnetic fields, and / or RF pulse sequences to the sample.

[0148] After receiving the MR signal 820, the interface circuit 816 may provide the MR signal 820 to the processor 810. The processor 810 may then access a predefined set of coil magnetic field basis vectors (SCMFBVs) 822 in the memory 814, where a weighted superposition of the predefined set of coil magnetic field basis vectors 822 may represent coil sensitivities of the coils in the measurement device 114, and the given predefined coil magnetic field basis vectors may be solutions of Maxwell's equations.

[0149] The processor 810 may then use the MR signals 820 and a predetermined set of coil magnetic field basis vectors 822 to solve a nonlinear optimization problem for MR information 824 and weighted superposition coefficients 826 for each voxel in the sample. Additionally, the processor 810 may perform additional operations 828. For example, the processor 810 may provide the MR information 824 and / or coefficients 826 to a user or another electronic device via the interface circuitry 816, store the MR information 824 and / or coefficients 826 in the memory 814, and / or display the MR information 824 and / or coefficients 826 on the display 830.

[0150] In some embodiments, computational techniques address the problem of MRI reconstruction with multiple MR coils and undersampled k-space measurements. By solving this problem, computational techniques may significantly reduce MR acquisition or scan times, but without compromising the quality of the restored or reconstructed images. This problem is known as "parallel imaging" or MRI parallel imaging.

[0151] Due to the limited or small number of k-space measurements and the presence of noise, the problems that computational techniques solve are ill-posed. This means that no unique solution exists, and to obtain a physically meaningful solution, it may be necessary to utilize additional prior knowledge about the properties of the underlying weighted proton density (WPD) (sometimes referred to as proton density or nuclear density in the above discussion). Furthermore, another challenge of parallel imaging is that in addition to the WPD, which is the quantity for which an accurate estimation is desired, the sensitivity of the MR coil is also unknown.

[0152] To address this issue, computational or Maxwell parallel imaging techniques may use an iterative Gauss-Newton regularization technique to solve a bilinear problem in terms of the WPD and the coil sensitivities. For example, the computational techniques may include an explicit regularization in terms of the WPD and an implicit regularization in terms of the coil sensitivities.

[0153] In some embodiments, the regularization on the WPD is a quadratic form, and the regularizer may include an identity operator, gradient, Hessian, Laplace, or non-smooth convex regularization (such as total variation or structural total variation). For quadratic regularization, the data fidelity term is also quadratic, so an iterative solution may be obtained by solving the extended Gauss-Newton normal equations. For example, the extended Gauss-Newton normal equations may be solved using a conjugate gradient method. Alternatively, if the regularization on the WPD is a non-smooth convex function, the solution at each Gauss-Newton iteration may be obtained by employing an accelerated near-gradient method (such as FISTA).

[0154] Furthermore, the implicit normalization of coil sensitivities may differ from existing approaches. In particular, the implicit normalization of coil sensitivities may enforce that the resulting coil sensitivities (which are essentially the circularly polarized magnetic fields experienced by the coils) are smooth. The implicit normalization of coil susceptibility may impose stronger, physics-based constraints. More specifically, a complete (e.g., to 85%, 95% or 99% numerical accuracy) basis of circularly polarized magnetic fields may be generated. This basis may be supported in the field of view of the MR scanner (or, more generally, the MR device) for a given set of MR coils. For example, this basis may be determined using a randomized singular value decomposition of a matrix that maps the circularly polarized magnetic fields in the field of view from a set of tens of thousands or more dipole sources on the surface that surround the field of view and are located in close proximity to the given MR coil. A full-wave electromagnetic solver using modern volume integral equation methods is used to calculate the magnetic fields due to these current sources.

[0155] As a result, the coefficients of this basis may be determined in the resulting nonlinear optimization problem instead of the actual coil sensitivities and magnetic fields. This approach may ensure that the coil sensitivities are not only smooth, but also structurally satisfy the more strongly constrained (and closer to reality) Maxwell's equations. Furthermore, because the coil sensitivities are smooth, only a few members of this basis may be necessary for high-fidelity coil sensitivity estimation. This capability may reduce the number of parameters in the associated nonlinear optimization problem by orders of magnitude. Furthermore, the Maxwell parallel imaging technique may be applied without modification to any (i.e., any) magnetic field strength of the MR scanner or MR device (e.g., from a few millitesla to external magnetic field strengths of 11 Tesla or more).

[0156] Thus, the Maxwell Parallel Imaging technique can provide an estimate of the WPD and an accurate estimate of the coil susceptibility. To further improve the quality of the WPD image or result, in some embodiments, the WPD image may be denoised by solving a constrained optimization problem. Of note is the solution that minimizes the total variation or the structural total variation, subject to the constraint that the norm of the difference between the input and the solution is less than or equal to an amount proportional to the standard deviation of the noise. Note that the standard deviation may be calculated directly from the WPD previously estimated with the Maxwell Parallel Imaging technique.

[0157] Alternatively, the estimated coil sensitivities previously determined in the Maxwell parallel imaging technique may be used to convert the original nonlinear problem into a linear problem, which may still be ill-posed due to insufficient sampling of k-space. A final estimate of the WPD image may then be obtained as a solution of a constrained convex optimization problem. In particular, the improved estimate of the WPD image may correspond to a minimizer of the total variation or structural total variation subject to multiple constraints, the number of which may be equal to the number of MR coil measurements. Each of the constraints may enforce that the norm of the difference between the coil measurements that comprise the solution and the corresponding observations or estimated models is less than or equal to an amount proportional to the standard deviation of the noise affecting the particular coil measurement. These operations may provide a parameter-free denoising technique.

[0158] Embodiments of sparsity techniques and sampling patterns are now described. Figure 9 is a flow diagram illustrating an example method 900 for performing sparsity techniques. The method may be performed by a system (such as system 100 of Figure 1) or one or more components within a system (such as computer 116, or more generally, a computer system including one or more computers).

[0159] During operation, the computer system may access or obtain information relating to non-invasive measurements performed on the individual, past non-invasive measurements, and a dictionary of pre-defined features or basis functions associated with the past non-invasive measurements (operation 910).

[0160] It should be noted that the non-invasive measurements and the previous non-invasive measurements may include or correspond to MR measurements. For example, the MR measurements may include MRI procedures. Additionally, the non-invasive measurements and the previous non-invasive measurements may include MR parameters associated with voxels within the individual. For example, the parameters may include the density of a nuclide, a longitudinal relaxation time along a direction parallel to the external magnetic field, and / or a transverse relaxation time along a direction perpendicular to the external magnetic field.

[0161] Additionally, past non-invasive measurements may be associated with an individual or a group of individuals. In some embodiments, a group of individuals may exclude individuals. For example, individuals and groups of individuals may share one or more characteristics or attributes, such as age, demographics, location, occupation, education (e.g., highest level of education), family history, ancestry, medical history (e.g., type of disease or risk of developing a type of disease), etc.

[0162] The computer system may then update the dictionary of predetermined features based at least in part on the non-invasive measurements and the past non-invasive measurements (operation 912), where the updating includes performing a minimization technique using a cost function having an L2 norm term and an L0 norm term.

[0163] The computer system may then determine weights associated with features in the updated dictionary of predetermined features based at least in part on the non-invasive measurements (operation 914). Note that determining the weights may include a gradient descent method. Additionally, the dictionary of predetermined features and the updated dictionary of predetermined features may correspond to some of the individual's anatomical features.

[0164] In some embodiments, the computer system may perform one or more optional additional operations (operation 916). For example, the non-invasive measurements include at least a component of magnetization associated with the individual, and the computer system may calculate at least a predicted component of magnetization of a voxel associated with the individual based at least in part on the measured component of magnetization, the forward model, the external magnetic field, and the RF pulse sequence, and may solve the inverse problem by iteratively modifying parameters associated with the voxel in the forward model until a difference between the predicted component of magnetization and the measured component of magnetization is less than a predefined value.

[0165] In some embodiments of methods 200 (FIG. 2), 700 (FIG. 7) and / or 900, additional or fewer operations may be performed. Additionally, the order of operations may be changed, and / or two or more operations may be combined into a single operation.

[0166] 10 is a diagram illustrating an example of communication between components of system 100 (FIG. 1) and measurement device 114. In particular, a processor 1010 within computer 116 may execute program instructions (PI) 1012 stored in memory 1014 within computer 116. When processor 1010 executes program instructions 1012, processor 1010 may perform at least a portion of the operations in an analysis technique.

[0167] During the analysis technique, the processor 1010 may provide instructions 1018 to an interface circuit (IC) 1016 in the computer 116. In response, the interface circuit 1016 may provide instructions 1018 to a measurement device 114 (such as an MR device) to acquire MR signals 1020 associated with the sample (such as an MRI scan). The measurement device 114 may then provide information 1022 to the computer 116 that identifies or corresponds to (is a function of) the MR signals 1020. It should be noted that in some embodiments, the measurement device 114 may include an excitation source, such as an excitation source that provides an external magnetic field, gradient magnetic fields, and / or RF pulse sequences to the sample. After receiving the MR signals 1020, the interface circuit 1016 may provide the information 1022 to the processor 1010.

[0168] Alternatively or additionally, the processor 1010 may access information 1022 in the memory 1014. Further, the processor 1010 may access information 1024 in the memory 1014 specifying past MR signals (such as past MRI scans) and a dictionary of predefined features or basis functions associated with the past MR signals.

[0169] The processor 1010 may then update 1026 the dictionary of predetermined features based at least in part on the MR signal 1020 and past non-invasive measurements (operation 912), where the updating includes performing a minimization technique with a cost function having an L2 norm term and an L0 norm term.

[0170] The processor 1010 may then determine weights 1028 associated with features in the updated dictionary of predetermined features based at least in part on the non-invasive measurements.

[0171] Additionally, the processor 1010 may perform one or more additional operations. For example, the processor 1010 may provide the information 1030 (such as the weights 1028 and the updated dictionary of predetermined features) to a user or another electronic device via the interface circuitry 1016, may store the information 1030 in the memory 1014, and / or may display the information 1030 on a display 1032 in or associated with the computer 116.

[0172] Although communication between components in Figures 3, 8 and / or 10 is illustrated as one-way or two-way communication (e.g., lines having a single arrow or two arrows), in general, a given communication operation may be one-way or two-way.

[0173] The analysis techniques are now further described. In the following discussion, MRI scans are used as an example of a non-invasive measurement in the analysis techniques. Longitudinal health tracking using MRI requires participants to undergo repeated scans. However, MRI was originally designed as a qualitative modality optimized for acute diagnostics. It was not designed to accurately measure and quantify longitudinal changes in anatomical features, structures, or tissue properties. The disclosed analysis techniques address these issues. In the process, the analysis techniques may also improve the accuracy of MRI measurements and reduce the measurement or scan time and / or execution time required to detect changes.

[0174] For an individual, information shared between MRI scans or examinations may accelerate and improve future MRI scans. Some existing approaches attempt to accelerate longitudinal analysis of MRI scans using past information. Such existing approaches typically require pixel-by-pixel recording and often fail to capture new or changed anatomical features. The disclosed analysis techniques leverage previous or prior MRI information in a model-based paradigm. In particular, past information may be modeled as a sparsifying base that can compress new MRI scans. In some embodiments, probabilistic protocol optimization techniques and / or self-adaptive compressed sensing reconstruction techniques are used to reconstruct images (either or both of these techniques may be referred to as "delta imaging"). More generally, delta imaging may include a collection of advanced signal acquisition and reconstruction strategies that enable ultrafast longitudinal health tracking using one or more previous MRI measurements as priors.

[0175] Delta imaging may provide a robust, incremental approach to accelerate or reduce the time required to perform longitudinal MRI studies using a robust model of the dynamics between MRI studies. In some embodiments, delta imaging may include building a dictionary of geometric features (sub-domains, e.g., with limited support) that can represent expected geometric features in a current (to-be-acquired) MRI scan. This dictionary may be developed or built from previous MRI scans of the individual and / or previous MRI scans of one or more different individuals. Additionally, delta imaging may include building or calculating a sampling pattern (which may be optimal) (in the spatial and / or frequency domain). The combination of the sampling pattern and dictionary-based reconstruction may achieve faster (or optimal) MRI scan times given a target image quality. Additionally, delta imaging may include building a digital twin (or baseline model) of the individual and building or calculating a longitudinal sampling pattern with the goal of efficiently capturing the differences (deltas) in subsequent MRI scans of this individual. Note that "efficiently" may include reducing or minimizing imaging time (or the time an individual spends in the MR scanner). For example, a whole-body MRI scan may take 15 minutes or less than 10 minutes. In some embodiments, delta imaging may be adaptable to multi-contrast settings.

[0176] Thus, in some embodiments, the analysis techniques may accelerate MRI signal acquisition based at least in part on one or more previous MRI scans of the same individual, which may have been acquired weeks, months, or years prior. At least one of the previous MRI scans may include a "slow scan" (e.g., a mildly undersampled or fully sampled acquisition). It is noted that a dictionary of geometric features may be constructed based at least in part on the previous MRI scans, which may be used as a sparsifying transform in a compressed sensing image reconstruction technique.

[0177] In some embodiments, image registration may be used to co-register a previous MRI scan with the current MRI scan. However, in other embodiments, image registration may not be necessary. Additionally, in some embodiments, data from a previous MRI scan may be used to determine an improved or optimal sampling pattern for the current MRI scan. Optimal sampling may include a set of sampling coordinates that maximizes the amount of information given a given number of samples (scan duration).

[0178] Furthermore, depending on whether the acquisition method is based at least in part on Cartesian sampling, optimizing the sampling pattern may include a combinatorial optimization problem (discrete or subset selection problem) or a continuous optimization problem. For example, in some embodiments, a two-dimensional (2D) on-grid sampling pattern in the xy plane may be optimized with the z-axis fully sampled. However, in other embodiments, a three-dimensional (3D) non-Cartesian sampling may be used for full sampling efficiency and improved image quality under very high acceleration ratios. It should be noted that the sampling pattern on the grid may be a 0-1 or classification problem. Thus, in these embodiments, the update may not utilize gradients. Compared to other subset selection problems, the evaluation cost (which is the image reconstruction quality) of a new subset (sampling pattern) in the analysis technique may be high. Furthermore, the sampling pattern may be optimized together with the reconstruction technique. In other words, a sampling pattern may be optimal for a particular reconstruction method, and different reconstruction methods may result in different sampling patterns.

[0179] In some embodiments, the prior MRI scans may be from different individuals, but from the same part of the body. Additionally, in some embodiments, N prior MRI scans, where N is a non-zero integer, may be used to train the sparging transform, where up to (N-1) MRI scans are from different individuals, and at least one is a prior MRI scan of the current individual. In these embodiments, the prior MRI scans from the current individual may be accelerated acquisitions.

[0180] Note that after the Mth MRI scan of an individual, where M is a non-zero integer, the sparse transform of the (M+1)th MRI scan may include information from some or all of the previous MRI scans. In other words, initially the dictionary is learned only from different individuals (e.g., when there are no previous MRI scans of the current individual available), and the computer system may incrementally update the individual-specific dictionary based at least in part on the initial dictionaries from different individuals each time the current individual undergoes an MRI examination.

[0181] Furthermore, in some embodiments, the program instructions executed by the computer system may adaptively learn that there is an extended or large change in the current MRI scan, and the delta scan may be discontinued and the system may use a conventional (slower) baseline MRI scan instead. In these embodiments, blind dictionary-based reconstruction may be employed, where "blind" indicates that the dictionary is learned only from the current MRI scan of the current individual. Alternatively, other MRI techniques (such as more traditional MRI techniques) may be used.

[0182] An example of the analysis technique is shown in FIG. 11, which is a flow diagram illustrating an example of a method 1100 for performing the sparsity technique. Note that the optimization of the sampling pattern (or trajectory) may be calculated at least in part based on a first MRI scan. The MRI may acquire MR signals in the frequency domain (k-space) where the constellation represents the energy distribution. Furthermore, longitudinal MRI scans on the same individual may share a similar energy distribution (in the signal domain). Furthermore, the validation set may be used to assess image quality.

[0183] The sampling pattern may be optimized at least in part based on previous MRI studies using a stochastic greedy method to improve signal sampling efficiency given a fixed acquisition time. The optimization may maximize the information content of the next sampling point given a fixed number of sampling points. In some embodiments, the stochastic greedy method may be based at least in part on Biased Accelerated Subset Selection or BASS (New York University School of Medicine, New York, NY). It is noted that BASS may include or introduce more heuristics or biases to reduce the number of iterations. In some embodiments, the hyperparameter tuning may require 100 iterations when K is equal to 200.

[0184] An improvement over BASS is the use of patch-based reconstruction instead of compressive sensing reconstruction as an image restoration technique. Furthermore, another improvement over BASS is the following expression:

number

[0185] Furthermore, reconstruction can be performed using priors. It is worth noting that MRI images (especially the changes between MRI images) are generally sparse with respect to certain transformations. Many existing compressed sensing based techniques often use fixed, heuristic transforms such as wavelets. For example, in some existing techniques for optimizing sampling patterns and reconstructions for longitudinal analysis of MRIs, optimizing the sampling pattern may not involve stochastic optimization. Instead, these existing techniques typically assume that the optimal sampling pattern is a stochastic process with a given empirical density distribution (which may be modeled as a polynomial function with a decay rate that depends on the distance from the origin of the k-space plane). Furthermore, in these existing techniques, the reconstruction usually assumes that both images are sparse in the same wavelet space. Thus, the sparsifying transform may be a standard wavelet transform (such as the discrete wavelet transform or DWT). As a result, the sparsifying transform may not adapt to the subject's anatomical structure. This assumption does not require a clear separation between static information (such as common features between two MRI scans) and dynamic information (such as new information or anatomical changes).

[0186] In the disclosed analysis technique, the analysis may adaptively learn a sparsifying transform from a previous nearly fully sampled MRI study. Unchanging / static information in subsequent MRI studies may be sparsed on this transform. Furthermore, anatomical changes may be represented by the adaptively learned sparsing transform. The disclosed two-stage compressed sensing may effectively use historical information and track dynamic information.

[0187] Next, we will describe an embodiment of model-based reconstruction. In particular, in an analytical technique, the estimated image may be modeled as a combination of two elements: historical information, which is formulated as a dictionary (and corresponding sparse codes, D1 and Z1) learned from the first Q MRI studies (Q is a non-zero integer), and dynamic information, which can be set as a blind adaptation dictionary (D2). In other words,

number

number

[0188] Equation 1 and Equation 2 describe the disclosed reconstruction. Equation 1 is an abstract representation of model-based MRI reconstruction. A is the MRI forward model. The first term in Equation 1 (data consistency) is the maximum likelihood / maximum a posteriori (ML / MAP) estimator of y since the noise in the signal domain is estimated to be Gaussian. R(x) is a regularizer and may reflect statistical image properties (such as prior density). In the disclosed analysis technique, the signal may be assumed to be sparse over two dictionaries D1 and D2 (where D2 may track changed or new anatomical features). Note that P is a patch operator that decomposes the image into local patches (which may be concatenated as columns). For example, the patch operator P may extract each 6×6 patch from the original 256×256 pixel image. The patches may overlap and each pixel may appear in 36 different (overlapping) patches. As a result, dictionaries D1 and D2 may contain sets of geometric features with support limited to the size of each patch (e.g., one element of a given dictionary represents a feature with a 6x6 support). Furthermore, each column of Z1 and Z2 may be a sparse code corresponding to an image patch. Furthermore, note that the 0-norm may count the number of non-zero elements rather than an induced 0-norm (rank).

[0189] Furthermore,

number

[0190] 12 is a diagram illustrating an example of image reconstruction from a sparse representation of MRI data according to an embodiment of the present disclosure. In particular, image 1210 may be a first MRI study, image 1212 may be a second MRI study (with compressed sensing or CS reconstruction using 2.5 times undersampling), image 1214 uses delta image reconstruction, image 1216 uses longitudinally adaptive CS (LACS), image 1218 uses L1 wavelet reconstruction, and image 1220 uses blind CS reconstruction. FIG 13 is a diagram illustrating an example of a sampling pattern used in image 1214 of FIG 12.

[0191] 14 is a diagram illustrating example images using different sampling patterns using MRI data in accordance with an embodiment of the present disclosure. In particular, image 1410 is fully sampled, image 1412 uses variable density Poisson disk sampling, and image 1414 uses an optimized sampling pattern. FIG 15 is a diagram illustrating example k-space sampling patterns including sampling pattern 1510 and sampling pattern 1512.

[0192] Next, electronic devices for performing at least some of the operations in embodiments of the computational and / or analytical techniques will be further described. Figure 16 is a block diagram illustrating an electronic device 1600 in the system 100 (Figure 1), such as the computer 116 (Figure 1) or other computer-controlled elements in the system 100, such as the excitation source 110 or the measurement device 114 (Figure 1). The electronic device includes a processing subsystem 1610, a memory subsystem 1612, and a networking subsystem 1614. The processing subsystem 1610 may include one or more devices configured to perform computational processing and control components in the system 100 (Figure 1). For example, the processing subsystem 1610 may include one or more microprocessors or central processing units (CPUs), one or more graphic processing units (GPUs), application specific integrated circuits (ASICs), microcontrollers, programmable logic devices (such as field programmable logic arrays or FPGAs), and / or one or more digital signal processors (DSPs).

[0193] The memory subsystem 1612 may include one or more devices for storing data and / or instructions for the processing subsystem 1610 and the networking subsystem 1614. For example, the memory subsystem 1612 may include dynamic random access memory (DRAM), static random access memory (SRAM), and / or other types of memory. In some embodiments, instructions for the processing subsystem 1610 in the memory subsystem 1612 include one or more program modules or sets of instructions (e.g., program instructions 1624), which may be executed by the processing subsystem 1610 in an operating environment (e.g., operating system 1622). It should be noted that one or more computer programs may constitute a computer program mechanism or program module (i.e., software). Furthermore, the instructions in the various modules in the memory subsystem 1612 may be implemented in a high-level procedural language, an object-oriented programming language, and / or an assembly or machine language. Furthermore, the programming language may be compiled or interpreted, e.g., configured or composed (these terms may be used interchangeably in this discussion), to be executed by the processing subsystem 1610.

[0194] Additionally, the memory subsystem 1612 may include mechanisms for controlling access to memory. In some embodiments, the memory subsystem 1612 includes a memory hierarchy that includes one or more caches coupled to memory within the electronic device 1600. In some of these embodiments, the one or more caches are located in the processing subsystem 1610.

[0195] In some embodiments, memory subsystem 1612 is coupled to one or more high capacity mass storage devices (not shown). For example, memory subsystem 1612 may be coupled to a magnetic or optical drive, a solid state drive, or other type of mass storage device. In these embodiments, memory subsystem 1612 may be used by electronic device 1600 as fast access storage for frequently used data, while the mass storage device may be used to store less frequently used data.

[0196] In some embodiments, the memory subsystem 1612 includes a remotely located archive device. The archive device may be a high capacity network attached mass storage device such as a network attached storage (NAS), an external hard drive, a storage server, a cluster of servers, a cloud storage provider, a cloud computing provider, a magnetic tape backup system, a medical record archive service, and / or another type of archive device. Additionally, the processing subsystem 1610 may interact with the archive device via an application programming interface to store and / or access information from the archive device. It should be noted that the memory subsystem 1612 and / or the electronic device 1600 may be compliant with the Health Insurance Portability and Accountability Act.

[0197] Examples of data stored (locally and / or remotely) in the memory subsystem 1612 are shown in Figure 17, which shows a diagram of an example data structure 1700 used by the electronic device 1600 (Figure 16). The data structure may include information such as an identifier 1710-1 of the sample 1708-1 (such as an individual), metadata 1712 (such as age, sex, biopsy results and diagnosis if one has already been made, other sample information, demographic information, family history, etc.), a timestamp 1714 when the data was acquired, the measurements 1716 received (such as the MR signal, or more generally the raw data), excitation and measurement conditions 1718 (e.g., external magnetic field, any gradients, RF pulse sequence, device specific characteristics such as the MR device, location, magnetic field inhomogeneity, RF noise, and one or more other system imperfections, signal processing techniques, registration information, synchronization between the measurements and the individual's heartbeat or breathing patterns, etc. information, etc.), and / or determined model parameters 1720 (including voxel size, velocity, resonance frequency or species, T1 and T2 relaxation times, segmentation information, classification information, etc.), environmental conditions 1722 (such as temperature, humidity, and / or air pressure in the room or chamber in which the sample 1708-1 was measured), a forward model 1724, one or more additional measurements 1726 of physical properties of the sample 1708-1 (such as weight, dimensions, images, etc.), optionally detected anomalies 1728 (which may include specific voxels associated with one or more of the detected anomalies 1728), and / or optional classifications 1730 of one or more of the detected anomalies 1728. It should be noted that the data structure 1700 may include multiple entries for different measurements.

[0198] In one embodiment, the data in data structure 1700 is encrypted using block chain or similar cryptographic hashing techniques to detect unauthorized alteration or corruption of records. Additionally, the data may be anonymized prior to storage such that the identity of an individual associated with a sample is anonymous unless the individual provides permission or authorization to access or disclose the individual's identity.

[0199] 16 , networking subsystem 1614 may include one or more devices configured to couple to and communicate with wired, optical, and / or wireless networks (i.e., one or more devices configured to perform network operations and, more generally, communications), including control logic 1616, interface circuitry 1618, one or more antennas 1620, and / or input / output (I / O) ports 1628. (Although FIG. 16 includes one or more antennas 1620, in some embodiments electronic device 1600 includes one or more nodes 1608, e.g., pads or connectors, that may be coupled to one or more antennas 1620. Thus, electronic device 1600 may or may not include one or more antennas 1620.) For example, the networking subsystem 1614 may include a Bluetooth networking system (which may include Bluetooth Low Energy, BLE, or Bluetooth LE), a cellular networking system (e.g., 3G / 4G / 5G networks such as UMTS, LTE, etc.), a Universal Serial Bus (USB) networking system, a networking system based on the standards described in IEEE 802.11 (e.g., a Wi-Fi networking system), an Ethernet networking system, and / or another networking system.

[0200] Additionally, networking subsystem 1614 may include processors, controllers, radios / antennas, sockets / plugs, and / or other devices used to couple to each supported networking system, communicate over the network, and process data and events. It should be noted that the mechanisms used to couple to the network for each network system, communicate over the network, and process data and events over the network may be collectively referred to as a "network interface" of network subsystem 1614. Additionally, in some embodiments, there is not yet a "network" between components in system 100 (FIG. 1). Thus, electronic device 1600 may use mechanisms in network subsystem 1614 to perform simple wireless communication between components, such as, for example, transmitting advertisement or beacon frames and / or scanning for advertisement frames transmitted by other components.

[0201] Within electronic device 1600, processing subsystem 1610, memory subsystem 1612, and network subsystem 1614 may be coupled using one or more interconnects, such as a bus 1626. These interconnects may include electrical, optical, and / or electro-optical connections that the subsystems can use to communicate commands and data to one another. Although only one bus 1626 is shown for clarity, different embodiments may include different numbers or configurations of electrical, optical, and / or electro-optical connections between the subsystems.

[0202] Electronic device 1600 may be (or may be) included in a wide variety of electronic devices. For example, electronic device 1600 may be included in a tablet computer, a smartphone, a smartwatch, a portable computing device, a wearable device, a test device, a digital signal processor, a cluster of computing devices, a laptop computer, a desktop computer, a server, a subnotebook / netbook, and / or another computing device.

[0203] Although electronic device 1600 has been described with particular components, in alternative embodiments, different components and / or subsystems may be present in electronic device 1600. For example, electronic device 1600 may include one or more additional processing subsystems, memory subsystems, and / or networking subsystems. Further, one or more subsystems may not be present in electronic device 1600. Furthermore, in some embodiments, electronic device 1600 may include one or more additional subsystems not shown in FIG.

[0204] 16 shows separate subsystems, in some embodiments, some or all of a given subsystem or component may be integrated into one or more of the other subsystems or components within electronic device 1600. For example, in some embodiments, program instructions 1624 are included in operating system 1622. In some embodiments, components within a given subsystem are included in different subsystems. Further, in some embodiments, electronic device 1600 is located in a single geographic location or distributed across multiple different geographic locations.

[0205] Additionally, the circuits and components within electronic device 1600 may be implemented using any combination of analog and / or digital circuits, including bipolar, PMOS, and / or NMOS gates or transistors. Additionally, the signals in these embodiments may include digital signals having approximately discrete values ​​and / or analog signals having continuous values. Additionally, the components and circuits may be single-ended or differential, and the power supplies may be unipolar or bipolar.

[0206] The integrated circuit may implement some or all of the functionality of the networking subsystem 1614 (e.g., radio), or more generally, some or all of the functionality of the electronic device 1600. Additionally, the integrated circuit may include hardware and / or software mechanisms used to transmit wireless signals from the electronic device 1600 and receive signals at the electronic device 1600 from other components within the system 100 (FIG. 1) and / or from electronic devices external to the system 100 (FIG. 1). Apart from the mechanisms described herein, radios are generally known in the art and therefore will not be described in detail. In general, the networking subsystem 1614 and / or the integrated circuit may include any number of radios. It should be noted that the radios in the embodiments having multiple radios function similarly to the radios described in the embodiments having a single radio.

[0207] Although some of the operations in the previous embodiments were implemented in hardware or software, in general, the operations in the previous embodiments may be implemented in a wide variety of configurations and architectures. Thus, some or all of the operations in the previous embodiments may be performed in hardware, software, or both.

[0208] Additionally, in some of the above embodiments, there are fewer components, there are more components, the location of the components is changed, and / or two or more components are combined.

[0209] Although the above discussion illustrates computational techniques for solving vector wave equations, in other embodiments, computational techniques may be used to solve scalar equations. For example, the acoustic wave equation may be solved in any inhomogeneous medium based on ultrasound measurements using a forward model. (Thus, in some embodiments, the excitation may be mechanical.) Note that acoustic coupling in ultrasound measurements may be operator dependent (i.e., ultrasound measurements may be pressure dependent). Nevertheless, similar approaches may be used to improve ultrasound imaging, determine 3D structure, improve presentation, etc.

[0210] In the preceding description, reference is made to "some embodiments." It should be noted that "some embodiments" describes a subset of all possible embodiments, but does not always designate the same subset of embodiments. Additionally, it should be noted that the numerical values ​​in the preceding embodiments are illustrative of some embodiments. Different numerical values ​​may be used in other embodiments of computational and / or analytical techniques.

[0211] The preceding description is intended to enable any person skilled in the art to make and use the present disclosure, and is provided in the context of a particular application and its requirements. Moreover, the foregoing descriptions of the embodiments of the present disclosure have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the present disclosure to the precise forms disclosed. Thus, many modifications and variations will be apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Moreover, the discussion of the preceding embodiments is not intended to limit the present disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

Claims

1. By the computer system, accessing information relating to non-invasive measurements performed on the individual, past non-invasive measurements, and a dictionary of pre-defined features or basis functions associated with the past non-invasive measurements; updating the dictionary of predetermined features based at least in part on the non-invasive measurements and the past non-invasive measurements, the updating including performing a minimization technique using a cost function having an L2 norm term and an L0 norm term; determining weights associated with features in the updated dictionary of predetermined features based at least in part on the non-invasive measurements; A method of performing a sparsity technique, comprising:

2. The method of claim 1 , wherein the non-invasive measurements and the previous non-invasive measurements include or correspond to magnetic resonance (MR) measurements.

3. The method of claim 2 , wherein the MR measurement comprises a magnetic resonance imaging (MRI) scan.

4. The method of claim 1 , wherein the non-invasive measurements and the past non-invasive measurements include magnetic resonance (MR) parameters associated with voxels within the individual.

5. 5. The method of claim 4, wherein the parameters include a density of nuclei, a longitudinal relaxation time along a direction parallel to an external magnetic field, and a transverse relaxation time along a direction perpendicular to the external magnetic field.

6. The non-invasive measurement includes at least a component of magnetization associated with the individual, and the method comprises: calculating at least a predicted component of the magnetization of the voxels associated with the individual based at least in part on the measured component of the magnetization, a forward model, an external magnetic field, and a radio frequency (RF) pulse sequence; solving an inverse problem by iteratively modifying the parameters associated with the voxels in the forward model until a difference between the predicted component of magnetization and the measured component of magnetization is less than a predefined value; The method of claim 1 , comprising:

7. The method of claim 1 , wherein the past non-invasive measurements are associated with the individual or group of individuals.

8. The method of claim 7 , wherein the group of individuals excludes the individual.

9. The method of claim 1 , wherein determining the weights comprises a gradient descent method.

10. The method of claim 1 , wherein the dictionary of predefined features and the updated dictionary of predefined features correspond to a portion of an anatomical structure of the individual.

11. 1. A computer system comprising: An interface circuit; a processor connected to the interface circuit; a memory coupled to the processor and storing program instructions that, when executed by the processor, cause the computer system to: accessing information relating to non-invasive measurements performed on the individual, past non-invasive measurements, and a dictionary of pre-defined features or basis functions associated with the past non-invasive measurements; updating the dictionary of predetermined features based at least in part on the non-invasive measurements and the past non-invasive measurements, the updating including performing a minimization technique using a cost function having an L2 norm term and an L0 norm term; determining weights associated with features in the updated dictionary of predetermined features based at least in part on the non-invasive measurements; a memory with program instructions for performing operations including: A computer system comprising:

12. The computer system of claim 11 , wherein the non-invasive measurements and the previous non-invasive measurements include or correspond to magnetic resonance (MR) measurements.

13. The computer system of claim 11 , wherein the non-invasive measurements and the past non-invasive measurements include magnetic resonance (MR) parameters associated with voxels within the individual.

14. 14. The computer system of claim 13, wherein the parameters include a density of nuclei, a longitudinal relaxation time along a direction parallel to an external magnetic field, and a transverse relaxation time along a direction perpendicular to the external magnetic field.

15. The non-invasive measurement includes at least a component of magnetization associated with the individual, and the operation comprises: calculating at least a predicted component of the magnetization of the voxels associated with the individual based at least in part on the measured component of the magnetization, a forward model, an external magnetic field, and a radio frequency (RF) pulse sequence; solving an inverse problem by iteratively modifying the parameters associated with the voxels in the forward model until a difference between the predicted component of magnetization and the measured component of magnetization is less than a predefined value; 12. The computer system of claim 11, comprising:

16. The past non-invasive measurements are associated with the individual or group of individuals; The computer system of claim 11 , wherein the group of individuals excludes the individual.

17. The computer system of claim 11 , wherein determining the weights comprises a gradient descent method.

18. The computer system of claim 11 , wherein the dictionary of predefined features and the updated dictionary of predefined features correspond to a portion of an anatomical structure of the individual.

19. 1. A computer-readable storage medium for use with a computer system, the computer-readable storage medium, when executed by the computer system, causing the computer system to: accessing information relating to non-invasive measurements performed on the individual, past non-invasive measurements, and a dictionary of pre-defined features or basis functions associated with the past non-invasive measurements; updating the dictionary of predetermined features based at least in part on the non-invasive measurements and the past non-invasive measurements, the updating including performing a minimization technique using a cost function having an L2 norm term and an L0 norm term; determining weights associated with features in the updated dictionary of predetermined features based at least in part on the non-invasive measurements; A computer-readable storage medium that stores program modules for executing the program.

20. the non-invasive measurement and the previous non-invasive measurement include magnetic resonance (MR) parameters associated with voxels within the individual; The parameters include the density of nuclei, the longitudinal relaxation time along a direction parallel to the external magnetic field, and the transverse relaxation time along a direction perpendicular to the external magnetic field.

20. The computer-readable storage medium of claim 19.

Citation Information

Patent Citations

  • Moving image encoder, moving image decoder, moving image encoding method, moving image decoding method, moving image encoding program and moving image decoding program

    JP2004336369A

  • System and method for acquiring and reconstructing tomographic images

    JP2012530549A

  • Magnetic resonance imaging apparatus and image processing apparatus

    JP2016123853A

  • field-invariant and quantitative magnetic resonance signature

    JP2018526657A

  • System and method for quantum processing of data

    JP2019096334A