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

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

434
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....
434
Fast Fourier Transform01:10

Fast Fourier Transform

1.2K
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...
1.2K
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

1.4K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
1.4K
Discrete Fourier Transform01:15

Discrete Fourier Transform

1.1K
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...
1.1K
Parseval's Theorem for Fourier transform01:15

Parseval's Theorem for Fourier transform

2.5K
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...
2.5K
Continuous -time Fourier Transform01:11

Continuous -time Fourier Transform

1.2K
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
1.2K

You might also read

Related Articles

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

Sort by
Same author

Bismuth incorporation in NiFe hydroxide ultrathin nanosheets boosts methanol electro-upgrading for formate production.

Chemical communications (Cambridge, England)·2026
Same author

A model for drug transport across two membranes of Gram-negative bacteria by an MFS tripartite assembly.

Nature communications·2026
Same author

Fourier hybrid neural bathymetry network for active-passive fusion shallow water depth inversion.

Applied optics·2026
Same author

High-Entropy Hydroxyl Carbonate With Zn, Co, Ni, Cu, and In as an Efficient Catalyst for Benzyl Alcohol Upgrading.

Chemistry (Weinheim an der Bergstrasse, Germany)·2026
Same author

Recent progresses on electro-oxidative lignin depolymerization for production of value-added chemicals.

Chemical communications (Cambridge, England)·2026
Same author

The FOXC2-LAMA4 Axis Orchestrates Vasculogenic Mimicry and Immunosuppressive Niche Formation to Drive Metastatic Cascade in Renal Cell Carcinoma.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same journal

MT-MRI for detection of renal interstitial fibrosis in renovascular disease.

Scientific reports·2026
Same journal

Detection of underground objects from GPR data using a lightweight YOLO-based approach.

Scientific reports·2026
Same journal

Early systemic inflammatory-metabolic trajectory phenotypes are associated with survival outcomes in metastatic renal cell carcinoma treated with nivolumab.

Scientific reports·2026
Same journal

Water balance components in a dry-seeded rice-wheat system: Untangling the effects of tillage and mulching practices.

Scientific reports·2026
Same journal

Topological approaches to quantum tensor train compression via ZX-calculus and SVD.

Scientific reports·2026
Same journal

determinants of flood impacts and adaptive capacity among market vendors in Walukuba-Masese, Jinja city, Uganda.

Scientific reports·2026
See all related articles

Related Experiment Video

Updated: Apr 8, 2026

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

3.0K

Fourier transform-based single domain generalization for crowd counting.

Lei Song1,2, Tong Li1, Zhaoyu Cai1

  • 1College of Mathematics and Computer, Guangdong Ocean University, Zhanjiang, 524088, China.

Scientific Reports
|April 6, 2026
PubMed
Summary
This summary is machine-generated.

This study introduces SinCount, a crowd counting framework that tackles domain shift for better generalization to new environments. It aligns task frequencies to improve accuracy in unseen scenarios.

Keywords:
Crowd countingDensity map estimationFast fourier transformationFrequency-aware attentionSingle domain generalization

More Related Videos

Cereal Crop Ear Counting in Field Conditions Using Zenithal RGB Images
11:49

Cereal Crop Ear Counting in Field Conditions Using Zenithal RGB Images

Published on: February 2, 2019

10.0K
Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles
11:54

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles

Published on: March 13, 2017

9.9K

Related Experiment Videos

Last Updated: Apr 8, 2026

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures
07:05

Area-based Image Analysis Algorithm for Quantification of Macrophage-fibroblast Cocultures

Published on: February 15, 2022

3.0K
Cereal Crop Ear Counting in Field Conditions Using Zenithal RGB Images
11:49

Cereal Crop Ear Counting in Field Conditions Using Zenithal RGB Images

Published on: February 2, 2019

10.0K
Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles
11:54

Microfluidic Platform with Multiplexed Electronic Detection for Spatial Tracking of Particles

Published on: March 13, 2017

9.9K

Area of Science:

  • Computer Vision
  • Machine Learning
  • Artificial Intelligence

Background:

  • Accurate crowd counting is vital for real-world applications.
  • Domain shift, the discrepancy between training and target data, hinders model deployment.
  • Existing methods struggle with generalizing crowd counting models to unseen domains.

Purpose of the Study:

  • To propose SinCount, a novel framework for Single-source Domain Generalization (SDG) in crowd counting.
  • To mitigate domain shift by aligning task-frequency cues for improved generalization.
  • To enhance the robustness and accuracy of crowd counting models in diverse, unseen environments.

Main Methods:

  • Developed a task-frequency alignment mechanism to separate high-frequency (density regression) and low-frequency (region classification) cues.
  • Implemented a frequency-specific feature extraction module to isolate distinct feature types.
  • Utilized a dual-attention strategy (spatial and channel attention) for targeted feature embedding and modulation.
  • Incorporated an instance normalization mask and attention consistency loss to reduce domain-specific noise and stabilize learning.

Main Results:

  • SinCount demonstrates competitive performance against state-of-the-art SDG approaches on multiple benchmark datasets.
  • The proposed task-frequency alignment effectively mitigates domain shift.
  • The dual-attention mechanism and regularization techniques contribute to improved generalization capabilities.

Conclusions:

  • SinCount offers a robust solution for crowd counting in the challenging SDG setting.
  • The method successfully generalizes to unseen domains by intelligently handling frequency-specific features.
  • This work advances the field of domain generalization for crowd counting applications.