Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Protein Networks02:26

Protein Networks

4.5K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
4.5K
Protein Networks02:26

Protein Networks

2.8K
2.8K
Network Covalent Solids02:18

Network Covalent Solids

16.1K
Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
16.1K
Fast Fourier Transform01:10

Fast Fourier Transform

930
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
930
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

8.0K
The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.0K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.5K
3.5K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Efficient Fenton-like degradation of tetracycline by superoxide radical-dominated metallized Salen-covalent organic framework in high-salt environments.

Journal of colloid and interface science·2026
Same author

Overall Water-Splitting Enabled by Bifunctional NiPd/Pd Heterodimer Fabricated via In Situ Etching-Growth Route.

Inorganic chemistry·2026
Same author

Gold-Functionalized Multilayer Heterojunction Microarchitectures Enable High-Fidelity Serum Metabolite Profiling for Skin Cancer Subtype Classification.

Small methods·2026
Same author

Substitutional value of METS-IR for biochemical components of life's essential 8 in predicting incident mild cognitive impairment: A longitudinal cohort study.

Medicine·2026
Same author

Intramolecular internal electric field and activated n-π* electronic transition co-promoted photocatalysis activity of carbon nitride: Mechanism and toxicity evaluation.

Journal of environmental sciences (China)·2026
Same author

Molecular imprinting photocatalysis: A promising union for water pollution preferential remediation.

Journal of environmental sciences (China)·2026

Related Experiment Video

Updated: Jan 24, 2026

Image-guided, Laser-based Fabrication of Vascular-derived Microfluidic Networks
10:53

Image-guided, Laser-based Fabrication of Vascular-derived Microfluidic Networks

Published on: January 3, 2017

10.3K

A supervised network for fast image-guided radiotherapy (IGRT) registration.

Zhixin Yao1,2, Hansheng Feng3,4, Yuntao Song1,2

  • 1Institute of Plasma Physics, Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei, 230031, China.

Journal of Medical Systems
|May 23, 2019
PubMed
Summary

This study introduces a novel 3D/3D image registration method for image-guided radiation therapy (IGRT). The technique combines deep learning and intensity-based registration for accurate and rapid alignment of Computed Tomography (CT) and Cone Beam CT (CBCT) images.

Keywords:
CBCTCNNsIGRTImage registrationIntensity-based registration

More Related Videos

Voluntary Breath-hold Technique for Reducing Heart Dose in Left Breast Radiotherapy
11:38

Voluntary Breath-hold Technique for Reducing Heart Dose in Left Breast Radiotherapy

Published on: July 3, 2014

47.4K
Analyzing Mitochondrial Morphology Through Simulation Supervised Learning
12:06

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning

Published on: March 3, 2023

4.7K

Related Experiment Videos

Last Updated: Jan 24, 2026

Image-guided, Laser-based Fabrication of Vascular-derived Microfluidic Networks
10:53

Image-guided, Laser-based Fabrication of Vascular-derived Microfluidic Networks

Published on: January 3, 2017

10.3K
Voluntary Breath-hold Technique for Reducing Heart Dose in Left Breast Radiotherapy
11:38

Voluntary Breath-hold Technique for Reducing Heart Dose in Left Breast Radiotherapy

Published on: July 3, 2014

47.4K
Analyzing Mitochondrial Morphology Through Simulation Supervised Learning
12:06

Analyzing Mitochondrial Morphology Through Simulation Supervised Learning

Published on: March 3, 2023

4.7K

Area of Science:

  • Medical Imaging
  • Radiation Oncology
  • Computational Anatomy

Background:

  • 3D/3D image registration is crucial for Image-Guided Radiation Therapy (IGRT).
  • Accurate alignment of planning Computed Tomography (CT) and on-board Cone Beam CT (CBCT) images remains challenging due to computational costs and complex anatomy.
  • Existing methods often struggle with speed and precision.

Purpose of the Study:

  • To develop a novel, efficient, and accurate 3D/3D image registration method for IGRT.
  • To overcome the limitations of high computational cost and complex anatomical structures in medical image registration.
  • To improve the speed and accuracy of aligning CT and CBCT image sets.

Main Methods:

  • A two-stage registration approach: coarse registration using supervised regression Convolutional Neural Networks (CNNs) and fine registration using intensity-based methods.
  • CNNs optimize spatial variation by minimizing loss during CT and CBCT image combination.
  • Intensity-based registration refines spatial differences for high accuracy.

Main Results:

  • Coarse registration achieves approximate alignment in under 0.5 seconds with a wide capture range.
  • The combined method achieves accurate registration in a reasonable time, tested on an RSD-111 T chest phantom.
  • Set-up errors were calculated in under 10 seconds, with residual errors reduced to sub-millimeter levels (±0.5 mm translation, ±0.2° rotation).

Conclusions:

  • The proposed two-stage registration method significantly enhances the speed and accuracy of 3D/3D image registration for IGRT.
  • This approach effectively addresses the computational challenges and anatomical complexities in medical image alignment.
  • The method demonstrates potential for real-time clinical application in radiation oncology, improving treatment precision.