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

Vector Transformation in Rotating Coordinate Systems01:16

Vector Transformation in Rotating Coordinate Systems

Consider a vector rotating about an axis with an angular velocity, such that its tip sweeps a circular path.
Curvilinear Motion: Rectangular Components01:23

Curvilinear Motion: Rectangular Components

Curvilinear motion characterizes the movement of a particle or object along a curved path, notably evident when envisioning a car navigating a winding road. If the car starts at point A, its position vector is established within a fixed frame of reference, where the ratio of the position vector to its magnitude signifies the unit vector pointing in the position vector's direction.
As the car advances, its position evolves over time. Quantifying the car's velocity involves computing the time...
Transformations of Functions III01:20

Transformations of Functions III

Transformations modify the graphical representation of a function without changing its fundamental form. One common transformation is reflection, which flips the graph across a designated axis. When the vertical coordinates of all points are multiplied by the negative one, the entire graph is mirrored over the horizontal axis. This transformation reverses the vertical orientation of peaks and troughs, akin to signal inversion in electrical systems, where a waveform is flipped, but the timing of...
Linearization and Approximation01:26

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...
Fast Fourier Transform01:10

Fast Fourier Transform

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...

You might also read

Related Articles

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

Sort by
Same author

Synthesizing breast cancer ultrasound images from healthy samples using latent diffusion models.

Journal of medical imaging (Bellingham, Wash.)·2026
Same author

Optimised Stable Lighting Strengthens Circadian Clock Gene Rhythmicity in Equine Hair Follicles.

Animals : an open access journal from MDPI·2023
Same author

On the independent significance of generalizations of the Wigner distribution function.

Journal of the Optical Society of America. A, Optics, image science, and vision·2023
Same author

A denoising framework for 3D and 2D imaging techniques based on photon detection statistics.

Scientific reports·2023
Same author

Automated filter selection for suppression of Gibbs ringing artefacts in MRI.

Magnetic resonance imaging·2022
Same author

Fast, sub-pixel accurate, displacement measurement method: optical and terahertz systems.

Optics letters·2020
Same journal

Multi-module collaborative optimization-driven fast speckle correlation imaging in variable environments.

Journal of the Optical Society of America. A, Optics, image science, and vision·2026
Same journal

Secrecy performance analysis of NOMA-UWOC systems over a vertically stratified WGG oceanic turbulence channel.

Journal of the Optical Society of America. A, Optics, image science, and vision·2026
Same journal

Backscattering of plane waves in a composite system containing a rough surface and anisotropic scatterers.

Journal of the Optical Society of America. A, Optics, image science, and vision·2026
Same journal

Aspherical surface construction methods based on extended Jacobi polynomials.

Journal of the Optical Society of America. A, Optics, image science, and vision·2026
Same journal

OCT sidelobe suppression method based on dual-path phase sinusoidal modulation and minimum value fusion.

Journal of the Optical Society of America. A, Optics, image science, and vision·2026
Same journal

Optical design concepts using wavelength-selective diffractive optics to enable miniaturized multimodal endoscopic imaging across separated spectral ranges.

Journal of the Optical Society of America. A, Optics, image science, and vision·2026
See all related articles

Related Experiment Video

Updated: Jun 17, 2026

Direct Linear Transformation for the Measurement of In-Situ Peripheral Nerve Strain During Stretching
06:26

Direct Linear Transformation for the Measurement of In-Situ Peripheral Nerve Strain During Stretching

Published on: January 12, 2024

Fast linear canonical transforms.

John J Healy1, John T Sheridan

  • 1UCD Communications and Optoelectronic Research Centre, College of Engineering, Mathematical and Physical Sciences, University College Dublin, Belfield, Dublin 4, Ireland.

Journal of the Optical Society of America. A, Optics, Image Science, and Vision
|December 26, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a new frequency-division fast linear canonical transform (LCT) algorithm for modeling paraxial propagation in quadratic phase systems. The developed algorithm offers computational efficiency comparable to the fast Fourier transform (FFT).

More Related Videos

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy (iPALM)
11:57

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy (iPALM)

Published on: December 1, 2016

Related Experiment Videos

Last Updated: Jun 17, 2026

Direct Linear Transformation for the Measurement of In-Situ Peripheral Nerve Strain During Stretching
06:26

Direct Linear Transformation for the Measurement of In-Situ Peripheral Nerve Strain During Stretching

Published on: January 12, 2024

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy (iPALM)
11:57

Three-dimensional Super Resolution Microscopy of F-actin Filaments by Interferometric PhotoActivated Localization Microscopy (iPALM)

Published on: December 1, 2016

Area of Science:

  • Optics and Photonics
  • Applied Mathematics
  • Signal Processing

Background:

  • The linear canonical transform (LCT) models paraxial propagation in quadratic phase systems.
  • Efficient numerical approximations of the LCT are crucial for computational optics and signal processing.

Purpose of the Study:

  • To review existing literature on numerical approximations of the LCT.
  • To propose a novel, efficient algorithm for computing the LCT.
  • To compare the performance of the proposed algorithm against analytic solutions.

Main Methods:

  • Literature review of LCT numerical approximation techniques (discretization, sampling, fast algorithms).
  • Development of a frequency-division fast linear canonical transform algorithm.
  • Implementation and testing of the proposed algorithm.

Main Results:

  • Identified key results in the numerical approximation of the LCT.
  • Developed a fast LCT algorithm with computational efficiency comparable to the Sande-Tukey fast Fourier transform.
  • Presented results demonstrating the algorithm's accuracy against analytic functions.

Conclusions:

  • The proposed frequency-division fast LCT algorithm is an effective method for modeling paraxial propagation.
  • The algorithm provides a computationally efficient alternative for LCT calculations.
  • Further research can explore applications in various optical systems and signal processing tasks.