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

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

Linear Approximation in Frequency Domain

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.

Parseval's Theorem for Fourier transform

Parseval's Theorem for Fourier transform

Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a signal's...

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

Convergence of Fourier Series

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...

Association Areas of the Cortex

Association Areas of the Cortex

Association areas are regions of the cerebral cortex that do not have a specific sensory or motor function. Instead, they integrate and interpret information from various sources to enable higher cognitive processes such as memory, learning, and decision-making. Some key association areas include the following:
Prefrontal Association Area: This area is located in the frontal lobe and is involved in planning, decision-making, and moderating social behavior. It connects with primary motor areas,...

You might also read

Related Articles

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

Sort by

Same author

Use of Multispectral Microscopy in the Prediction of Coated Halftone Reflectance.

Journal of imaging·2022

Same author

Angular reflectance model for ridged specular surfaces, with comprehensive calculation of inter-reflections and polarization.

Journal of the Optical Society of America. A, Optics, image science, and vision·2019

Same author

Measurement of the diffusion of light within paper.

Journal of the Optical Society of America. A, Optics, image science, and vision·2019

Same author

Numerical modeling of nominal and stray waves in birefringent interferometers: application to large-field-of-view imaging Fourier transform spectrometers.

Applied optics·2018

Same author

Halo and subsurface scattering in the transparent coating on top of a diffusing material.

Journal of the Optical Society of America. A, Optics, image science, and vision·2018

Same author

Revisited Yule-Nielsen model without fitting of the n parameter.

Journal of the Optical Society of America. A, Optics, image science, and vision·2018

Search research articles

Related Experiment Video

Updated: May 27, 2026

Motion-Acuity Test for Visual Field Acuity Measurement with Motion-Defined Shapes

Motion-Acuity Test for Visual Field Acuity Measurement with Motion-Defined Shapes

Published on: February 23, 2024

Fourier-based automatic alignment for improved Visual Cryptography schemes.

Jacques Machizaud¹, Pierre Chavel, Thierry Fournel

¹Universite de Lyon, F-42023, Saint-Etienne, France. jacques.machizaud@univ-st-etienne.fr

|November 24, 2011

Summary

This summary is machine-generated.

This study introduces a new method for digital registration of visual cryptography shadow images using Fourier techniques. This speeds up secret message recovery, even with complex image setups.

More Related Videos

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Related Experiment Videos

Last Updated: May 27, 2026

Motion-Acuity Test for Visual Field Acuity Measurement with Motion-Defined Shapes

Motion-Acuity Test for Visual Field Acuity Measurement with Motion-Defined Shapes

Published on: February 23, 2024

A Multimodal Wide-Field Fourier-Transform Raman Microscope

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

Area of Science:

Computer Science
Image Processing
Cryptography

Background:

Visual Cryptography (VC) involves overlapping shadow images to reveal a secret message.
Digital registration of printed and digital shadow images is challenging, especially with non-identical image supports.

Purpose of the Study:

To develop a method for digitally registering a printed shadow image with a digital one.
To enhance the speed and practicality of visual cryptography security checks.

Main Methods:

Utilizing Fourier techniques derived from Fourier Optics.
Exploiting the quasi-periodicity of shadow images composed of random black and white patterns on a grid.

Main Results:

Successful digital registration of printed and digital shadow images.
Demonstrated acceleration of security control and message access times.
Validation of the method's effectiveness even with non-identical mathematical supports for shadow images.

Conclusions:

The proposed Fourier-based method enables efficient and practical digital registration for visual cryptography.
This technique enhances the security and usability of visual cryptography systems, particularly for large or high-resolution images.