Related Experiment Video

Updated: May 18, 2026

Adapting Human Videofluoroscopic Swallow Study Methods to Detect and Characterize Dysphagia in Murine Disease Models
08:32

Adapting Human Videofluoroscopic Swallow Study Methods to Detect and Characterize Dysphagia in Murine Disease Models

Published on: March 1, 2015

Fast Fourier transform analysis of sounds made while swallowing various foods

Mitsuru Taniwaki1, Kaoru Kohyama

  • 1National Food Research Institute, National Agriculture and Food Research Organization, 2-1-12, Kannondai, Tsukuba, Ibaraki 305-8642, Japan.

The Journal of the Acoustical Society of America
|October 9, 2012
PubMed

More Related Videos

Coordinate Mapping of Hyolaryngeal Mechanics in Swallowing14:13

Coordinate Mapping of Hyolaryngeal Mechanics in Swallowing

Published on: May 6, 2014

Minimally Invasive Murine Laryngoscopy for Close-Up Imaging of Laryngeal Motion During Breathing and Swallowing07:45

Minimally Invasive Murine Laryngoscopy for Close-Up Imaging of Laryngeal Motion During Breathing and Swallowing

Published on: December 1, 2023

Related Concept Videos

Discrete Fourier Transform01:15

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...
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...
Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at zero. It...
Deglutition01:25

Deglutition

Swallowing, otherwise known as deglutition, facilitates the transport of food from the mouth to the stomach. It is a multifaceted process that involves both the tongue and the muscles of the throat and esophagus. Saliva and mucus aid in this process, which takes approximately 4 to 8 seconds for semi-solid or solid food and around 1 second for liquids or very soft food.
Swallowing can be divided into three stages: the voluntary phase, the pharyngeal phase, and the esophageal phase. Although the...
Physical Assessment of the Respiratory Tract IV: Auscultation01:28

Physical Assessment of the Respiratory Tract IV: Auscultation

Auscultation is a crucial component of the physical assessment of the respiratory tract. It offers valuable insights into airflow through the bronchial tree and potential lung obstructions. This process involves careful listening to breath, voice, and adventitious sounds, which can reveal a wealth of information about a patient's respiratory health.
Breath Sounds
Breath sounds are categorized into vesicular, bronchovesicular, and bronchial.
Discrete-Time Fourier Series01:20

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