関連する実験動画

Updated: Sep 9, 2025

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.0K

速フーリエ回転を異常検出に導入する

Zhen Zhao1, Jiali Zhou2

  • 1College of Intelligent Manufacturing, Zhejiang Polytechnic University of Mechanical and Electrical Engineering, Hangzhou 310053, China.

Sensors (Basel, Switzerland)
|August 28, 2025
PubMed
まとめ

この研究では,グローバルコンテキストのためのフーリエ特征回転と,超一般化を防止し,優れたパフォーマンスを達成するために,フーリエ特征回転を用いた新しい異常検出フレームワークであるFFC-ADを導入します.

キーワード:
アノマリー検出ディープラーニング産業用アプリケーション

さらに関連する動画

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps08:59

Morphology-Based Distinction Between Healthy and Pathological Cells Utilizing Fourier Transforms and Self-Organizing Maps

Published on: October 28, 2018

7.2K
Cortical Source Analysis of High-Density EEG Recordings in Children09:32

Cortical Source Analysis of High-Density EEG Recordings in Children

Published on: June 30, 2014

21.5K

関連する概念動画

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...
465
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...
404
Convergence of Fourier Series01:21

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

Continuous -time Fourier Transform

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...
404
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...
578
Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
224