Search results
Jump to navigation
Jump to search
Page title matches
- {{Short description|Concept in information processing}} ...2–441 |last1=Beaudry |first1=Normand |title=An intuitive proof of the data processing inequality |date=2012 |doi=10.26421/QIC12.5-6-4 |arxiv=1107.0740|bibcode=20 ...3 KB (409 words) - 17:21, 22 August 2024
- ...al signal processing]] techniques may be better suited for processing such data. == Data acquisition == ...12 KB (1,825 words) - 10:29, 29 January 2023
Page text matches
- {{Short description|Concept in information processing}} ...2–441 |last1=Beaudry |first1=Normand |title=An intuitive proof of the data processing inequality |date=2012 |doi=10.26421/QIC12.5-6-4 |arxiv=1107.0740|bibcode=20 ...3 KB (409 words) - 17:21, 22 August 2024
- After performing the [[Hilbert transform]] on each signal, we can express the data in the following form: ...ld W. Schafer, "''Discrete-Time Signal Processing''," Prentice-Hall Signal Processing Series, 2 ed., 1999. ...1 KB (186 words) - 14:00, 7 January 2025
- ...ter is a [[low-pass filter]] that reduces the maximum bandwidth of sampled data by a factor of 2 (one octave). When multiple octaves of reduction are need ...93}}</ref><ref>{{cite book|last=Meyer-Baese|first=Uwe|title=Digital Signal Processing with Field Programmable Gate Arrays|url=https://archive.org/details/digital ...2 KB (306 words) - 06:11, 19 May 2024
- ...l data is sampled in more than one dimension. Examples of this are [[image processing]] and multi-sensor radar detection. Both of these examples use multiple sen ...es, m-D signals and systems can be simplified into single dimension signal processing methods, if the considered systems are separable. ...6 KB (862 words) - 20:51, 15 August 2020
- ...to create the segmented result. The technique incorporates a [[quadtree]] data structure, meaning that there is a parent-child node relationship. The tot ...all regions pass the homogeneity test<ref>{{Cite book|title=Digital Image Processing and Analysis with MATLAB and CVIPtools, Third Edition|last=E.|first=Umbaugh ...3 KB (479 words) - 02:34, 23 March 2021
- ...to detect invalid pixels, and selectively smooth only invalid pixels using data coming only from valid pixels, thus avoiding to affect other features of th ...e same interval. For instance, given a pixel <math>(x,y)</math> of invalid data, its convolution kernel <math>h</math> becomes ...3 KB (396 words) - 03:02, 16 November 2020
- ...puter system is called the maximum parallelism degree P. If a processor is processing P bits in unit time, then P is called the maximum ...ogic unit. Higher degree of parallelism indicates a highly parallel ALU or processing element. Average parallelism depends on both the hardware and the software. ...4 KB (593 words) - 10:19, 20 January 2025
- ...e-dimensional time-ordered signal processing, with two-dimensional [[image processing]] being the most common application.<ref name="pratt">{{cite journal |last= Consider a data [[vector space|vector]] <math>d</math> which is the sum of [[statistically ...4 KB (605 words) - 19:42, 27 April 2020
- {{short description|Method of analyzing large data sets}} ...'-way array, and analysis techniques can reveal patterns in the underlying data undetected by other methods.<ref name=Coppi1989> ...7 KB (963 words) - 11:23, 26 October 2023
- ...lse response is discussed and an application of the filter into real world data is shown. In digital signal processing, an [[Finite impulse response|FIR filter]] is a time-continuous filter that ...6 KB (948 words) - 15:39, 11 April 2024
- ...new signal and background. The difference of the new signal and background data is taken to yield the net signal. Finally, the net signal is plotted versus ...[[least squares]] to find a linear approximation. Given <math>n\,</math> data points <math>(x_i\,,y_i\,)</math> a best fit line parameterized as <math>y ...4 KB (634 words) - 05:53, 22 May 2021
- {{Short description|Smoothing of data points, digital filter}} ...e purpose of smoothing the data, that is, to increase the precision of the data without distorting the signal tendency. ...2 KB (281 words) - 16:31, 26 February 2025
- ...of functional blocks in [[Logic synthesis|synthesizing]] [[digital signal processing|DSP]] architecture. ...ng transforms an operation from a unit-time processing to ''N'' unit-times processing where ''N'' is called '''folding factor'''. ...8 KB (1,185 words) - 18:42, 23 May 2021
- |data=[[Array data structure|Array]] ...network]] discovered and published by Ian Parberry in 1992 in ''[[Parallel Processing Letters]]''.<ref>{{Citation ...3 KB (413 words) - 09:24, 2 February 2025
- ...e functional blocks to increase the [[throughput]] of the [[Digital signal processing|DSP]] program in such a way that preserves its functional behavior at its o ...arhi, and D.G. Messerschmitt, "Static Rate-Optimal Scheduling of Iterative Data Flow Programs via Optimum Unfolding," IEEE Trans. on Computers, Vol. 40(2), ...8 KB (1,263 words) - 12:37, 19 November 2022
- ...richlet processes based on compound Poisson processes], Neural Information Processing Systems (NIPS), 2010. </ref> The concept is named after [[Peter Gustav Leje ...invalid for modelling temporal and spatial processes in which the order of data points plays a critical role in creating meaningful [[Cluster analysis|clus ...3 KB (382 words) - 13:26, 30 June 2024
- ...sform''' is a [[recursive]] algorithm to compute successive STFTs of input data frames that are a single sample apart (hopsize − 1).<ref>{{cite j ...ding Discrete Fourier Transform with Kernel Windowing |journal=IEEE Signal Processing Magazine |date=14 November 2018 |volume=35 |issue=6 |doi=10.1109/MSP.2018.2 ...3 KB (384 words) - 09:17, 19 January 2025
- ...It was first proposed by Arruda (1992a, 1992b). It can be used to smooth data in one or more dimensions and to compute derivatives from the smoothed curv ...a (1992a) can be formulated in a very straightforward way. Given a sampled data vector ([[Signal (electronics)|signal]]) <math>x_n=x(t_n)</math>, one can w ...6 KB (928 words) - 01:39, 22 February 2024
- ...important technique used in several applications such as [[digital signal processing]] (DSP) systems, [[microprocessor]]s, etc. It originates from the idea of a ...ntage of pipelining is that it increases the throughput of the system when processing a stream of tasks. ...6 KB (1,041 words) - 02:00, 17 April 2024
- {{Short description|Underwater acoustic signal processing}} {{about|underwater acoustic signal processing|other uses|Sonar}} ...9 KB (1,443 words) - 21:15, 28 May 2024