Wikipedia Article of the Day
Randomly selected articles from my personal browsing history
In mathematics (in particular, functional analysis), convolution is a mathematical operation on two functions ( f {\displaystyle f} and g {\displaystyle g} ) that produces a third function ( f ∗ g {\displaystyle f*g} ). The term convolution refers to both the result function and to the process of computing it. It is defined as the integral of the product of the two functions after one is reflected about the y-axis and shifted. The integral is evaluated for all values of shift, producing the convolution function. The choice of which function is reflected and shifted before the integral does not change the integral result (see commutativity). Graphically, it expresses how the 'shape' of one function is modified by the other. Some features of convolution are similar to cross-correlation: for real-valued functions, of a continuous or discrete variable, convolution ( f ∗ g {\displaystyle f*g} ) differs from cross-correlation ( f ⋆ g {\displaystyle f\star g} ) only in that either f ( x ) {\displaystyle f(x)} or g ( x ) {\displaystyle g(x)} is reflected about the y-axis in convolution; thus it is a cross-correlation of g ( − x ) {\displaystyle g(-x)} and f ( x ) {\displaystyle f(x)} , or f ( − x ) {\displaystyle f(-x)} and g ( x ) {\displaystyle g(x)} . For complex-valued functions, the cross-correlation operator is the adjoint of the convolution operator. Convolution has applications that include probability, statistics, acoustics, spectroscopy, signal processing and image processing, geophysics, engineering, physics, computer vision and differential equations. The convolution can be defined for functions on Euclidean space and other groups (as algebraic structures). For example, periodic functions, such as the discrete-time Fourier transform, can be defined on a circle and convolved by periodic convolution. (See row 18 at DTFT § Properties.) A discrete convolution can be defined for functions on the set of integers. Generalizations of convolution have applications in the field of numerical analysis and numerical linear algebra, and in the design and implementation of finite impulse response filters in signal processing. Computing the inverse of the convolution operation is known as deconvolution.
History
Sep 18
Double-entry bookkeeping
Sep 17
Relativistic electromagnetism
Sep 16
97 (number)
Sep 15
Binomial distribution
Sep 14
Analemma
Sep 13
Marvin Heemeyer
Sep 12
Karatsuba algorithm
Sep 11
Ramer–Douglas–Peucker algorithm
Sep 10
Cross-site scripting
Sep 9
Happy Hacking Keyboard
Sep 8
Salted Challenge Response Authentication Mechanism
Sep 7
KHive
Sep 6
Interplanetary Internet
Sep 5
KHive
Sep 4
The Memory Police
Sep 3
Disjoint-set data structure
Sep 2
Systems engineering
Sep 1
12ft
Aug 31
Speculative fiction
Aug 30
Lace card
Aug 29
40 Eridani
Aug 28
Weird fiction
Aug 27
Dark forest hypothesis
Aug 26
Pointing and calling
Aug 25
The Maybe Man
Aug 24
Sean Astin
Aug 23
Planet of the Apes
Aug 22
Shamir's secret sharing
Aug 21
Application binary interface
Aug 20
Key encapsulation mechanism