convolution


Also found in: Dictionary, Thesaurus, Legal, Encyclopedia, Wikipedia.
Related to convolution: Fourier transform, Convolution theorem

convolution

 [kon″vo-lu´shun]
a tortuous irregularity or elevation caused by the infolding of a structure upon itself.

con·vo·lu·tion

(kon'vō-lū'shŭn),
1. A coiling or rolling of an organ.
2. Specifically, a gyrus of the cerebral cotex or folia of the cerebellar cortex.
[L. convolutio]

convolution

/con·vo·lu·tion/ (-loo´shun) a tortuous irregularity or elevation caused by the infolding of a structure upon itself.
Broca's convolution  the inferior frontal gyrus of the left hemisphere of the cerebrum.
Heschl's convolutions  transverse temporal gyri; see temporal gyrus, under gyrus.

convolution

(kŏn′və-lo͞o′shən)
n.
1. A form or part that is folded or coiled.
2. One of the convex folds of the surface of the brain.

con′vo·lu′tion·al adj.

convolution

[kon′vəlo̅o̅′shən]
Etymology: L, convolutus, rolled together
a tortuous irregularity or elevation caused by a structure being infolded on itself, such as the gyri of the cerebrum. See also gyrus.

convolution

(1) A redundancy or folding of tissue native to an organ. 
(2) Gyrus, brain.

convolution

An elevation on the surface of a structure and an infolding of the tissue upon itself

con·vo·lu·tion

(kon-vŏ-lū'shŭn)
1. A coiling or rolling of an organ.
2. Specifically, a gyrus of the cerebral or cerebellar cortex.
[L. convolutio]

convolution

a tortuous irregularity or elevation caused by the infolding of a structure upon itself.
References in periodicals archive ?
The most widely used approximation model for simulating artistic media is line integral convolution (LIC) [9], which was originally devised to visualize flow embedded in an image.
Number of intersection was defined as any convolution value which is above three.
Firstly, once the convolution signal is '0' the input file that is in element format can enter the filter and hold on within the memory.
As shown in Figure 1, the structure of DC-ELM consists of an input layer, an output layer, and several hidden layers which are arranged alternately as one convolution layer followed by one pooling layer.
A sequential algorithm for performing convolution is an iterative procedure that repeats the kernel item for each new data element.
First, we obtain the commutant of a cyclic convolution operator on the Hardy space.
In the last part of the text the convolution is used for the definition of discontinuous bases of the space of square integrable functions L 2(I ) close to a classical orthonormal system if desired.
The convolution maximum was found on the 1025 of pixel row.
The circular convolution can be considered also for sequences of different lengths, by right completion with 0, such that the two sequences to be of the same length.
In order to circumvent this constraint, which limits dramatically the resolution that can be imposed when solving numerically the inclusion problem, many authors [9, 10, 12, 14] employed spectral methods, based on the convolution theorem.