threshold function

Also found in: Dictionary.
Graphic Thesaurus  🔍
Display ON
Animation ON
  • noun

Words related to threshold function

a function that takes the value 1 if a specified function of the arguments exceeds a given threshold and 0 otherwise

References in periodicals archive ?
Coifman and Donoho used hard threshold function in wavelet domain to remove noise (1995).
The soft threshold function used in wavelet domain to filter out noise coefficients by Donoho and Johnstone (1995).
The modified threshold function is used in wavelet domain by Nasri and Nezamabadi-pour (2009), to overcome the limitations of hard and soft threshold function.
The hard threshold function used by Starck et al, (2000) for denoising in curvelet domain.
Building on the proof for threshold functions in Goles and Olivos (1981), we prove that only fixed points and periodic orbits of length 2 can occur for each possible combination of [k.
The proof builds on the arguments of the proof from Goles and Olivos (1981) for standard threshold functions (see page 43 of the appendix).
The bi-threshold functions require a more careful structural analysis of the elements of C than in the case of standard threshold functions.
This appendix section contains a condensed version of the proof from Goles and Olivos (1981) for standard threshold functions.
Then, p = -[square root of (ln n/n)] is a sharp threshold function for the property [rc.
Recall the definition of sharp threshold function in section 1.
We may establish the following result regarding the threshold function of src(G(n, p)).
The purpose is to illustrate how the particular filters we developed in Section 5, and choice of threshold function, have the effect of making the recursive quantization schemes run faster and be more effective.
where y - learning coefficient, [lambda](u) - stochastic threshold function, [a.
Eric Edgar provides new monitoring threshold functions via Point, Range and Predictive Threshold ZenPacks.
Other topics include monotone circuits for weighted threshold functions, tolerant versus intolerant testing for Boolean properties, a geometric approach to private information retrieval, the complexity of succinct zero-sum games, and the hardness of distinguishing mixed-state quantum computations.