ArticleslgStudy

computer science

HARP (algorithm)

HARP (algorithm) is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand HARP (algorithm) rather than just read about it. In short: Harmonic phase (HARP) algorithm is a medical image analysis technique capable of extracting and processing motion information from tagged magnetic resonance image (MRI) sequences. It was initially developed by N.

HARP (algorithm) — main illustration
HARP (algorithm) — illustration

Key takeaways

  • HARP (algorithm) belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect HARP (algorithm) to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of HARP (algorithm) from memory before moving on to harder problems.

Reference excerpt

Harmonic phase (HARP) algorithm is a medical image analysis technique capable of extracting and processing motion information from tagged magnetic resonance image (MRI) sequences. It was initially developed by N. F. Osman and J. L. Prince at the Image Analysis and Communications Laboratory at Johns Hopkins University. The method uses spectral peaks in the Fourier domain of tagged MRI, calculating the phase images of their inverse Fourier transforms, which are called harmonic phase (HARP) images. The motion of material points through time is then tracked, under the assumption that the HARP value of a fixed material point is time-invariant. The method is fast and accurate, and has been accepted as one of the most popular tagged MRI analysis methods in medical image processing.

Background In cardiac magnetic resonance imaging, tagging techniques make it possible to capture and store the motion information of myocardium in vivo. MR tagging uses a special pulse sequence to create temporary features – tags in the myocardium. Tags deform together with the myocardium as the heart beats and are captured by MR imaging. Analysis of the motion of the tag features in many images taken from different orientations and at different times can be used to track material points in the myocardium. Tagged MRI is widely used to develop and refine models of normal and abnormal myocardial motion to better understand the correlation of coronary artery disease with myocardial motion abnormalities and the effects of treatment after myocardial infarction. However, suffered from long imaging and post-processing times, tagged MRI was slow in entering into routine clinical use until the HARP algorithm was developed and published in 1999.

Description

HARP processing

A tagged MRI showing motion of a human heart is shown in the image (a). The effect of tagging can be described as a multiplication of the underlying image by a sinusoid tag pattern having a certain fundamental frequency, causing an amplitude modulation of the underlying image and replicating its Fourier transform into the pattern shown in (b). HARP processing uses a bandpass filter to isolate one of the spectral peaks. For example, the circle drawn in (b) is the -3 dB isocontour of the bandpass filter used to process this data. Selection of the filters for optimal performance is discussed in this paper. The inverse Fourier transform of the filtered image yields a complex harmonic image I k ( y , t ) {\displaystyle I_{k}(\mathbf {y} ,t)} at image coordinates y = [ y 1 , y 2 ] T {\displaystyle \mathbf {y} =[y_{1},y_{2}]^{T}} and time t {\displaystyle t} :

I k ( y , t ) = D k ( y , t ) e j ϕ k ( y , t ) {\displaystyle I_{k}(\mathbf {y} ,t)=D_{k}(\mathbf {y} ,t)e^{j\phi _{k}(\mathbf {y} ,t)}}

where D k {\displaystyle D_{k}} is called the harmonic magnitude image and ϕ k {\displaystyle \phi _{k}} is called the harmonic phase image. The harmonic magnitude image in (c) extracted from a using the filter in (b) shows the geometry of the heart. And the harmonic phase image in (d) contains the motion of the myocardium in horizontal direction. In practice, tagged images from two directions (both horizontal and vertical, i.e., k {\displaystyle k} is 1 and 2) are processed to provide a 2D motion map in the image plane. Notice that the harmonic phase images are computed by taking the inverse tangent of the imaginary part divided by the real part of I k ( y , t ) {\displaystyle I_{k}(\mathbf {y} ,t)} , such that the range of this computation is only in [ − π , + π ) {\displaystyle [-\pi ,+\pi )} . In other words, d is only the wrapped value of the actual phase. We denote this principle value by a k ( y , t ) {\displaystyle a_{k}(\mathbf {y} ,t)} ; it is mathematically related to the true phase by:

a k ( y , t ) = m o d ( ϕ k ( y , t ) + π , 2 π ) − π {\displaystyle a_{k}(\mathbf {y} ,t)=mod(\phi _{k}(\mathbf {y} ,t)+\pi ,2\pi )-\pi }

Either ϕ k {\displaystyle \phi _{k}} or a k {\displaystyle a_{k}} might be called a harmonic phase (HARP) image, but only a k {\displaystyle a_{k}} can be directly calculated and visualized. It is the basis for HARP tracking.

HARP tracking

… excerpt ends here. Continue reading the full article.

Illustrations

HARP (algorithm): Result of HARP tracking of a tagged cardiac MRI slice
Result of HARP tracking of a tagged cardiac MRI slice

Worked examples

Example 1 — a first encounter with HARP (algorithm)

Start with the simplest possible case. Write down what HARP (algorithm) claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to HARP (algorithm) before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about HARP (algorithm) ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of HARP (algorithm)

In research
HARP (algorithm) appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses HARP (algorithm) in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
HARP (algorithm) is common in secondary-school and first-year university syllabi. It links to neighbouring topics Cardiac imaging, Magnetic resonance imaging, Medical imaging, so understanding it makes those chapters shorter.
In everyday life
Look for HARP (algorithm) outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “HARP (algorithm)” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study HARP (algorithm) in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what HARP (algorithm) means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain HARP (algorithm) out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is HARP (algorithm) in simple terms?

Harmonic phase (HARP) algorithm is a medical image analysis technique capable of extracting and processing motion information from tagged magnetic resonance image (MRI) sequences. It was initially developed by N.

Why does HARP (algorithm) matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study HARP (algorithm)?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on HARP (algorithm).

Tags

  • Cardiac imaging
  • Magnetic resonance imaging
  • Medical imaging

Keep exploring