Results 181 to 190 of about 311,920 (239)
Some of the next articles are maybe not open access.
Volumendekorrelation durch 3D-Haar-Wavelets
2020Der Haar-Kern ist der wohl einfachste Reprasentant eines Kerns mit lokalem Trager, der durch einen Parameter τ > 0 bestimmt wird. Er wurde in die mathematische Literatur durch A. Haar (1910) im eindimensionalen Euklidischen Raum eingefuhrt.
Willi Freeden, Mathias Bauer
openaire +1 more source
Haar-Like Wavelets on Hierarchical Trees
Journal of Scientific ComputingzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rick Archibald, Ben Whitney
openaire +2 more sources
Fingerprint verification using haar wavelet
2010 2nd International Conference on Computer Engineering and Technology, 2010This paper deals with a new image based approach for fingerprint verification using Haar Wavelet Transform. Haar wavelet is used for decomposition of the fingerprint image. Haar wavelet transformation is carried out directly on the gray-scaled fingerprint image without any preprocessing steps. Decomposition of the fingerprint image is carried out up to
Priti S. Sanjekar, Priyadarshan S. Dhabe
openaire +1 more source
1999
This chapter explains the nature of the simplest wavelets and an algorithm to compute a fast wavelet transform. Such wavelets have been called “Haar’s wavelets” since Haar’s publication in 1910 (reference [19] in the bibliography). To analyze and synthesize a signal—which can be any array of data—in terms of simple wavelets, this chapter employs shifts
openaire +1 more source
This chapter explains the nature of the simplest wavelets and an algorithm to compute a fast wavelet transform. Such wavelets have been called “Haar’s wavelets” since Haar’s publication in 1910 (reference [19] in the bibliography). To analyze and synthesize a signal—which can be any array of data—in terms of simple wavelets, this chapter employs shifts
openaire +1 more source
WEIGHTED HAAR WAVELETS ON THE SPHERE
International Journal of Wavelets, Multiresolution and Information Processing, 2007Starting from the one-dimensional Haar wavelets on the interval [0,1], we construct spherical Haar wavelets which are orthogonal with respect to a given scalar product. This scalar product induces a norm which is equivalent to the usual ‖ · ‖2norm of L2(𝕊2).
openaire +1 more source
1998
The Haar basis is known since 1910. Here we consider the Haar basis on the real line IR and describe some of its properties which are useful for the construction of general wavelet systems. Let L2 (IR) be the space of all complex valued functions f on IR such that their L2-norm is finite: $$ \left\| {f\left\| {2 = \left( {\int_{ - \infty }^\infty {\
Wolfgang Härdle +3 more
openaire +1 more source
The Haar basis is known since 1910. Here we consider the Haar basis on the real line IR and describe some of its properties which are useful for the construction of general wavelet systems. Let L2 (IR) be the space of all complex valued functions f on IR such that their L2-norm is finite: $$ \left\| {f\left\| {2 = \left( {\int_{ - \infty }^\infty {\
Wolfgang Härdle +3 more
openaire +1 more source
Haar wavelet method for solving Fisher’s equation
Applied Mathematics and Computation, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hariharan, G., Kannan, K., Sharma, K. R.
openaire +1 more source
Generalized Haar wavelets and frames
SPIE Proceedings, 2000Generalized Haar wavelets were introduced in connection with the problem of detecting specific periodic components in noisy signals. We showed that the non-normalized continuous wavelet transform of a periodic function taken with respect to a generalized Haar wavelet is periodic in time as well as in scale, and that generalized Haar wavelets are the ...
openaire +2 more sources
Haar wavelet approach to linear stiff systems
Mathematics and Computers in Simulation, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Selective Crypting with Haar-Wavelets
2000The coefficients of a wavelet—decomposition form into different levels according to the size of the described details. This can be utilized to crypt only a part of the given data while keeping the rest unchanged so that critical information is filtered out.
openaire +1 more source