Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Group

Signal Processing and Transforms

This group gathers numerical algorithms that transform or analyze a signal or image, including the fast Fourier transform, the CORDIC algorithm for computing trigonometric functions in hardware, image processing filters such as the Sobel operator, Canny edge detection, Gaussian blur, the median and bilateral filters, optical flow methods such as Lucas-Kanade and Horn-Schunck, the Pan-Tompkins algorithm for detecting heartbeats in an electrocardiogram, and fast approximation methods for magnitude and square root such as the alpha max plus beta min algorithm and fast inverse square root. Their shared work is converting a signal, image or waveform from one representation to another or extracting a feature from it, as distinct from solving a general system of linear equations, which belongs to Linear Algebra and Matrix Decomposition.

Facts
Comparison
Era of Emergence
1948 1
Browse By
Signal Processing and Transforms
Filter Results24 entries
Sources
1. Wikipedia: Signal processing
Wikimedia FoundationSignal processing, History section, Shannon 1948 sentence
Quote, Signal processing, History section, Shannon 1948 sentence
In 1948, Claude Shannon wrote the influential paper "A Mathematical Theory of Communication" which was published in the Bell System Technical Journal.
View the Source
Mu-law algorithm (Wikipedia)
Has Member: Mu-law algorithm, Lead section
Quote, Has Member: Mu-law algorithm, Lead section
is a companding algorithm, primarily used in eight-bit PCM digital telecommunications systems in North America and Japan.
View the Source
Structural similarity index measure (Wikipedia)
Has Member: Structural similarity index measure, Lead
Quote, Has Member: Structural similarity index measure, Lead
the structural similarity index measure (SSIM) is a method for predicting the perceived quality of digital video and images, or for measuring the similarity between two images.
View the Source
A-law algorithm (Wikipedia)
Has Member: A-law algorithm, Introduction
Quote, Has Member: A-law algorithm, Introduction
An A-law algorithm is a standard companding algorithm
View the Source
Lanczos resampling (Wikipedia)
Has Member: Lanczos resampling, Lead section
Quote, Has Member: Lanczos resampling, Lead section
used to smoothly interpolate the value of a digital signal between its samples
View the Source
Welch's method (Wikipedia)
Has Member: Welch's method, Lead section
Quote, Has Member: Welch's method, Lead section
is an approach for spectral density estimation
View the Source
Non-local means (Wikipedia)
Has Member: Non-local means, Lead
Quote, Has Member: Non-local means, Lead
Non-local means is an algorithm in image processing for image denoising.
View the Source
Anisotropic diffusion (Wikipedia)
Has Member: Anisotropic diffusion, Lead
Quote, Has Member: Anisotropic diffusion, Lead
anisotropic diffusion, also called Perona-Malik diffusion, is a technique aiming at reducing image noise
View the Source
Bruun's FFT algorithm (Wikipedia)
Has Member: Bruun's FFT algorithm, Lead paragraph
Quote, Has Member: Bruun's FFT algorithm, Lead paragraph
Bruun's algorithm is a fast Fourier transform (FFT) algorithm
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.