Method for optimizing the k-space trajectories in the location encoding of a magnetic resonance tomography apparatus

• US 6,937,015 B2
• Filed: 04/02/2003
• Issued: 08/30/2005
• Est. Priority Date: 04/03/2002
• Status: Active Grant

• Current Assignee: Siemens Healthcare GMBH (Siemens AG)
• Original Assignee: Siemens AG
• Inventors: Heid, Oliver
• Primary Examiner(s): Shrivastav, Brij
• Assistant Examiner(s): Fetzner, Tiffany A.
• Application Number:
  US10/405,852
• Publication Number:
  US 20030191386A1
• Time in Patent Office: 881 Days
• Field of Search: 324300-322, 600/410, 600/411
• US Class Current: 324/307
• CPC Class Codes: G01R 33/54 Signal processing systems, e.g. using pulse sequences ; Generation or control of pulse sequences; Operator console
• CPC Class Codes: G01R 33/543 Control of the operation of the MR system, e.g. setting of acquisition parameters prior to or during MR data acquisition, dynamic shimming, use of one or more scout images for scan plane prescription G01R33/546 takes precedence

Abstract

In a method and apparatus for calculating the sampling path of the k-matrix under given boundary conditions for the examination of a subject by means of a magnetic resonance tomography apparatus having a gradient amplifier with appertaining gradient coils, an input-display terminal, a sequence controller and a system computer as well as an analog-to-digital converter, boundary conditions are entered into the sequence controller or into the system computer via the input-display terminal, the sampling path of the k-matrix is calculated taking the boundary conditions into consideration by the sequence controller or the system computer, and the gradient current curves are determined by the sequence controller or the system computer that lead to a sampling along the previously calculated sampling path when applied to the corresponding gradient coils with utilization of the ADC.

Claims

1. A method for calculating a sampling path of a k-matrix obtained using a magnetic resonance tomography apparatus having gradient coils operated by sequence controller and a system computer, comprising the steps of:

entering at least one boundary condition for a magnetic resonance tomography measurement into one of said sequence controller and a said system computer of said magnetic resonance tomography apparatus;

dependent on said at least one boundary condition, calculating a sampling path, having a non-predefined curve shape, for a k-matrix of said magnetic resonance tomography measurement in one of said sequence controller and said system computer by a calculus of variations calculation that includes forming a Hamilton function; and

in one of said sequence controller and said system computer, determining gradient current curves in said magnetic resonance measurement which produce the calculated sampling path when respectively applied to said gradient coils of said magnetic resonance tomography apparatus.

2. A method as claimed in claim 1 wherein said magnetic resonance tomography apparatus has a basic field magnet with a homogeneity volume and a gradient amplifier for operating one of said gradient coils, and wherein the step of entering at least one boundary condition comprises entering a boundary condition representing a maximum loadability of said gradient amplifier for arbitrary rotation of said k-matrix in said homogeneity volume of said basic field magnet.

3. A method as claimed in claim 1 wherein said magnetic resonance tomography apparatus has a basic field magnet having a homogeneity volume and a gradient amplifier for operating one of said gradient coils, and comprising storing a boundary condition in a memory representing a maximum loadability of said gradient amplifier for arbitrary rotation of said k-matrix in said homogeneity volume of said basic field magnet, and wherein the step of entering said at least one boundary condition comprises calling said maximum loadability from said memory.

4. A method as claimed in claim 1 wherein said magnetic resonance tomography measurement is conducted on an examination subject, and wherein the step of entering said at least one boundary condition comprises entering a boundary condition representing a spatial orientation of said k-matrix in said examination subject.

5. A method as claimed in claim 1 wherein said k-matrix comprises a plurality of measuring points obtained during said magnetic resonance tomography measurement, and wherein the step of entering at least one boundary condition comprises entering a boundary condition representing an arrangement of said measuring points in said k-matrix.

6. A method as claimed in claim 1 wherein the step of entering at least one boundary condition comprises entering a boundary condition representing a sequence type for sampling said k-matrix.

7. A method as claimed in claim 1 wherein said k-matrix comprises a plurality of measuring points obtained during said magnetic resonance tomography measurement, and wherein the step of entering at least one boundary condition comprises entering a boundary condition representing respective departure and arrival speeds of each of said measuring points of said k-matrix.

8. A method as claimed in claim 1 wherein said k-matrix comprises a plurality of measuring points obtained during said magnetic resonance tomography measurement, and wherein the step of entering at least one boundary condition comprises entering a boundary condition representing a sequence with which said measuring points of said k-matrix are sampled.

9. A method as claimed in claim 1 wherein said magnetic resonance tomography measurement is conducted on an examination subject, and wherein the step of entering at least one boundary condition comprises entering a boundary condition representing limit values for said gradient pulses to avoid nerve stimulation of said examination subject.

10. A method as claimed in claim 1 wherein said k-matrix is sampled using said sampling path with an associated sampling time, and wherein the step of entering at least one boundary condition comprises entering a boundary condition representing a minimization of said sampling time.

11. A method as claimed in claim 1 wherein said k-matrix is sampled using said sampling path with an associated slew rate, and wherein the step of entering said at least one boundary condition comprises entering a boundary condition representing a minimization of said slew rate.

12. A method as claimed in claim 1 wherein the step of entering at least one boundary condition comprises entering a plurality of boundary conditions, and wherein the step of calculating said sampling path comprises executing said calculus of variations calculation using all of said boundary conditions.

13. A method as claimed in claim 1 wherein the step of entering at least one boundary condition comprises entering a plurality of boundary conditions, and wherein the step of calculating said sampling path comprises executing said calculus of variations calculation using a subset of said boundary conditions.

14. A method as claimed in claim 1 wherein the step of calculating a sampling path comprises calculating a two-dimensional sampling path.

15. A method as claimed in claim 1 wherein the step of calculating a sampling path comprises calculating a three-dimensional sampling path.

16. A method as claimed in claim 12 wherein the step of calculating said sampling path by said calculus of variations calculation using all of said boundary conditions comprises defining said Hamilton function dependent on said boundary conditions, and solving a differential equation based on said Hamiltonian function using Lagrange multiplication to obtain an equation representing said sampling path.

17. A method as claimed in claim 13 wherein the step of calculating said sampling path by said calculus of variations calculation using a subset of said boundary conditions comprises defining said Hamilton function dependent on said boundary conditions, and solving a differential equation based on said Hamilton function using Lagrange multiplication to obtain an equation representing said sampling path.

18. A magnetic resonance apparatus, comprising:

a magnetic resonance scanner, having a plurality of gradient coils, for executing a magnetic resonance tomography measurement controlled by a system computer and a sequence controller;

an input unit allowing entry of at least one boundary condition for said magnetic resonance tomography measurement into one of said sequence controller and said system computer;

said one of said sequence controller and said system computer, dependent on said at least one boundary condition, calculating a sampling path, having a non-predefined curve shape, for a k-matrix of said magnetic resonance tomography measurement by a calculus of variations calculation that includes forming a Hamilton function; and

said one of said sequence controller and said system computer determining gradient current curves in said magnetic resonance tomography measurement which produce the calculated sampling path when respectively applied to said gradient coils of said magnetic resonance tomography apparatus.

19. A magnetic resonance apparatus as claimed in claim 18 comprising a basic field magnet with a homogeneity volume and a gradient amplifier for operating one of said gradient coils, and wherein said boundary condition represents a maximum loadability of said gradient amplifier for arbitrary rotation of said k-matrix in said homogeneity volume of said basic field magnet.

20. A magnetic resonance apparatus as claimed in claim 18 comprising a basic field magnet having a homogeneity volume and a gradient amplifier for operating one of said gradient coils, and a memory in which a boundary condition is stored representing a maximum loadability of said gradient amplifier for arbitrary rotation of said k-matrix in said homogeneity volume of said basic field magnet, and wherein said input unit, responsive to said entry, calls said maximum loadability from said memory.

21. A magnetic resonance apparatus as claimed in claim 18 wherein said magnetic resonance tomography examination is conducted on an examination subject, and wherein said boundary condition represents a spatial orientation of said k-matrix in said examination subject.

22. A magnetic resonance apparatus as claimed in claim 18 wherein said k-matrix comprises a plurality of measuring points obtained by said scanner during said magnetic resonance tomography examination, and wherein said boundary condition represents an arrangement of said measuring points in said k-matrix.

23. A magnetic resonance apparatus as claimed in claim 18 wherein said boundary condition represents a sequence type for sampling said k-matrix.

24. A magnetic resonance apparatus as claimed in claim 18 wherein said k-matrix comprises a plurality of measuring points obtained during said magnetic resonance tomography examination, and wherein said boundary condition represents respective departure and arrival speeds of each of said measuring points of said k-matrix.

25. A magnetic resonance apparatus as claimed in claim 18 wherein said k-matrix comprises a plurality of measuring points obtained during said magnetic resonance tomography measurement, and wherein said a boundary condition represents a sequence with which said measuring points of said k-matrix are sampled.

26. A magnetic resonance apparatus as claimed in claim 18 wherein said magnetic resonance tomography measurement is conducted on an examination subject, and wherein said a boundary condition represents limit values for said gradient pulses to avoid nerve stimulation of said examination subject.

27. A magnetic resonance apparatus as claimed in claim 18 wherein said k-matrix is sampled with a sampling time associated therewith, and wherein said boundary condition represents a minimization of said sampling time.

28. A magnetic resonance apparatus as claimed in claim 18 wherein said k-matrix is sampled with a slew rate associated therewith, and wherein said boundary condition represents a minimization of said slew rate.

29. A magnetic resonance apparatus as claimed in claim 18 wherein said input unit allows entry of a plurality of boundary conditions, and wherein said one of said sequence controller and said system computer calculates said sampling path by executing said calculus of variations calculation using all of said boundary conditions.

30. A magnetic resonance apparatus as claimed in claim 18 wherein said input unit allows entry of a plurality of boundary conditions, and wherein said one of said sequence controller and said system computer calculates said sampling path by executing said calculus of variations calculation using a subset of said boundary conditions.

31. A magnetic resonance apparatus as claimed in claim 18 wherein said one of said sequence controller and said system computer calculates a two-dimensional sampling path.

32. A magnetic resonance apparatus as claimed in claim 18 wherein said one of said sequence controller and said system computer calculates a three-dimensional sampling path.

33. A magnetic resonance apparatus as claimed in claim 29 wherein said one of said sequence controller and said system controller calculates said sampling path by said calculus of variations calculation using all of said boundary conditions by defining said Hamilton function dependent on said boundary conditions, and solving a differential equation based on said Hamilton function using LaGrange multiplication to obtain an equation representing said sampling path.

34. A magnetic resonance apparatus as claimed in claim 30 wherein said one of said sequence controller and said system controller calculates said sampling path by said calculus of variations calculation using a subset of said boundary conditions by defining a differential equation based on aid Hamilton function dependent on said boundary conditions, and solving said Hamilton equation using LaGrange multiplication to obtain an equation representing said sampling path.

35. A method for calculating a sampling path of a k-matrix obtained using a magnetic resonance tomography apparatus having gradient coils operated by sequence controller and a system computer, comprising the steps of:

entering at least one boundary condition for a magnetic resonance tomography measurement into one of said sequence controller and said system computer of said magnetic resonance tomography apparatus;

dependent on said at least one boundary condition, calculating a sampling path, unconstrained by a predefined curve shape, for a k-matrix of said magnetic resonance tomography measurement in one of said sequence controller and said system computer by a calculus of variations calculation that includes forming a Hamilton function; and

in one of said sequence controller and said system computer, determining gradient current curves in said magnetic resonance measurement which produce the calculated sampling path when respectively applied to said gradient coils of said magnetic resonance tomography apparatus.

36. A magnetic resonance apparatus, comprising:

a magnetic resonance scanner, having a plurality of gradient coils, for executing a magnetic resonance tomography measurement controlled by a system computer and a sequence controller;

an input unit allowing entry of at least one boundary condition for said magnetic resonance tomography measurement into one of said sequence controller and said system computer;

said one of said sequence controller and said system computer, dependent on said at least one boundary condition, calculating a sampling path, unconstrained by a predefined curve shape, for a k-matrix of said magnetic resonance tomography measurement by a calculus of variations calculation that includes forming a Hamilton function; and

said one of said sequence controller and said system computer determining gradient current curves in said magnetic resonance tomography measurement which produce the calculated sampling path when respectively applied to said gradient coils of said magnetic resonance tomography apparatus.