Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Transformations of Functions II

Transformations of Functions II

Transformations in mathematics alter the position or orientation of a function’s graph while preserving its fundamental shape. One important type of transformation is the horizontal shift, which involves modifying the input variable within a function’s equation. This operation affects where outputs occur along the horizontal axis but does not alter the function’s overall structure.A horizontal shift is achieved by replacing the input variable x with either x + c or x - c, where c is a constant.

The Distance Formula

The Distance Formula

In geometry, measuring the direct distance between two points on a plane is essential in various practical and theoretical applications. Whether in navigation, engineering, or computer graphics, determining the shortest path between two locations involves using the distance formula. This formula is derived from the Pythagorean Theorem, which relates the lengths of the sides of a right triangle. On a coordinate plane, the horizontal and vertical distances between two points serve as the legs of...

Transformations of Functions III

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

Fast Fourier Transform

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

Relative Velocity in Two Dimensions

Relative Velocity in Two Dimensions

Relative velocity is the velocity of an object as observed from a particular reference frame, or the velocity of one reference frame with respect to another reference frame. The concept of relative velocity can be used to describe motion in two dimensions. Consider a particle P and two reference frames S and S′. The position of the origin of S′ as measured in S is , the position of P as measured in S′ is , and the position of P as measured in S is , which can be evaluated by utilizing vector...

Transformations of Functions I

Transformations of Functions I

A function's graph can be modified by changing its position or size without altering its overall shape. These transformations allow the graph to be moved across the coordinate plane while preserving its pattern and structure. One of the most common transformations is shifting, which repositions the graph without distorting it.When the output of a function is adjusted by adding or subtracting a constant, the graph shifts vertically. A positive value moves the graph upward, while a negative value...

You might also read

Related Articles

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

Sort by

Same author

EnergiQ: A Prescriptive Large Language Model-Driven Intelligent Platform for Interpreting Appliance Energy Consumption Patterns.

Sensors (Basel, Switzerland)·2025

Same author

Enhancing Three-Dimensional Reconstruction Through Intelligent Colormap Selection.

Sensors (Basel, Switzerland)·2025

Same author

Hierarchical Resources Management System for Internet of Things-Enabled Smart Cities.

Sensors (Basel, Switzerland)·2025

Same author

Sensors and Advanced Sensing Techniques for Computer Vision Applications.

Sensors (Basel, Switzerland)·2025

Same author

A cascading model for nudging employees towards energy-efficient behaviour in tertiary buildings.

PloS one·2024

Same author

LP-OPTIMA: A Framework for Prescriptive Maintenance and Optimization of IoT Resources for Low-Power Embedded Systems.

Sensors (Basel, Switzerland)·2024

Search research articles

Related Experiment Video

Updated: May 27, 2026

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

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

Published on: January 12, 2024

Fast 2-D distance transformations.

Stelios Krinidis¹

¹Department of Information Management, Technological Institute of Kavala, Kavala, Greece. stelios.krinidis@mycosmos.gr

IEEE Transactions on Image Processing : a Publication of the IEEE Signal Processing Society

|November 23, 2011

Summary

This summary is machine-generated.

A new distance transformation (DT) algorithm offers accurate and efficient image processing. This fast, simple, and error-free method achieves optimal results in constant time without iteration.

More Related Videos

Quantifying Intermembrane Distances with Serial Image Dilations

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Related Experiment Videos

Last Updated: May 27, 2026

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

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

Published on: January 12, 2024

Quantifying Intermembrane Distances with Serial Image Dilations

Quantifying Intermembrane Distances with Serial Image Dilations

Published on: September 28, 2018

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

High-resolution, High-speed, Three-dimensional Video Imaging with Digital Fringe Projection Techniques

Published on: December 3, 2013

Area of Science:

Computer Vision
Image Processing
Algorithms

Background:

Many image processing techniques rely on accurate distance transformations (DT).
Existing fast DT methods often lack accuracy.
Accurate DT algorithms are typically slow.

Purpose of the Study:

To introduce a novel distance transformation algorithm.
To achieve a DT process that is fast, simple, and error-free.
To develop a generalizable DT method applicable to various distance functions.

Main Methods:

Developed a novel DT algorithm by recording relative x and y coordinates of image pixels.
The algorithm operates in constant time without requiring iteration.
The method is designed to be general for any distance function.

Main Results:

The proposed algorithm provides accurate image distance transformations.
Achieved efficient and correct DT in constant time.
Demonstrated the algorithm's generality across different distance functions.

Conclusions:

The presented DT algorithm is a significant improvement over existing methods.
It offers a fast, simple, and accurate solution for image processing.
The method's generalizability ensures broad applicability in scientific image analysis.