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

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

Distance Problem

Distance Problem

When an object's velocity changes over time, the total distance traveled can be determined by summing small displacement intervals over short increments. This approach approximates the true distance through numerical summation and the use of integral calculus. An estimate of the total displacement can be obtained by measuring velocity at regular intervals and multiplying each value by the corresponding time step.If a runner accelerates over the first three seconds of a race, speed measurements...

Properties of DTFT I

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...

Relation of DFT to z-Transform

Relation of DFT to z-Transform

The Discrete Fourier Transform (DFT) is a crucial tool for analyzing the frequency content of discrete-time signals. It converts a sequence of N samples from the time domain into its corresponding sequence in the frequency domain, where each sample represents a specific frequency component.
To understand how the DFT works, it's helpful to consider the z-transform, which is a method for representing discrete sequences in the complex frequency domain. The z-transform involves summing the...

Discrete-Time Fourier Series

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...

Discrete Fourier Transform

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...

You might also read

Related Articles

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

Sort by

Same author

Incremental prognostic value of immune cell densities beyond clinical parameters in non-small cell lung cancer.

Lung cancer (Amsterdam, Netherlands)·2026

Same author

UpStory: the uppsala storytelling dataset.

Frontiers in robotics and AI·2025

Same author

Let it shine: Autofluorescence of Papanicolaou-stain improves AI-based cytological oral cancer detection.

Computers in biology and medicine·2024

Same author

Cross-modality sub-image retrieval using contrastive multimodal image representations.

Scientific reports·2024

Same author

Deep multiple instance learning versus conventional deep single instance learning for interpretable oral cancer detection.

PloS one·2024

Same author

Early Detection of Oral Potentially Malignant Disorders: A Review on Prospective Screening Methods with Regard to Global Challenges.

Journal of maxillofacial and oral surgery·2024

Search research articles

Related Experiment Video

Updated: May 6, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

Linear time distances between fuzzy sets with applications to pattern matching and classification.

Joakim Lindblad, Nataša Sladoje

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

|October 26, 2013

Summary

New fuzzy image analysis methods introduce novel point-to-set and set-to-set distances. These image processing tools excel in pattern detection, template matching, and classification tasks, including handwritten digit recognition.

Related Experiment Videos

Last Updated: May 6, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

Area of Science:

Image processing and computer vision
Fuzzy set theory and applications
Pattern recognition and machine learning

Background:

Traditional image analysis often struggles with the inherent ambiguity and imprecision in real-world image data.
Existing distance metrics may not adequately capture both shape and intensity information for fuzzy or gray-level images.
There is a need for robust distance measures applicable to fuzzy segmented objects and raw gray-level images.

Purpose of the Study:

To introduce four novel point-to-set distance measures for fuzzy or gray-level image data.
To integrate these novel measures into existing set-to-set distance definitions, creating new fuzzy set distances.
To evaluate the theoretical properties and practical performance of these new image analysis tools.

Main Methods:

Development of four novel point-to-set distances: two based on integration over alpha-cuts and two using the fuzzy distance transform.
Extension of point-to-set distances to set-to-set distances by incorporating them into definitions like the Hausdorff distance.
Application and performance evaluation on real-world image processing tasks, including template matching and object classification.

Main Results:

The proposed distance measures effectively integrate both shape and intensity/membership information of image entities.
Demonstrated excellent performance in template matching and object classification tasks for both fuzzy segmented and gray-level images.
Achieved state-of-the-art results on the MNIST handwritten digit classification task using k-nearest neighbors (kNN) and rigid transformations.

Conclusions:

The novel fuzzy set distances offer a powerful and versatile tool for advanced image processing and analysis.
These methods provide a significant improvement over existing techniques, particularly for tasks involving ambiguous image data.
The demonstrated success in digit recognition highlights the potential of these distances for complex pattern recognition problems.