• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.69-74
• /
• 2023

In this paper we review techniques for building and analyzing wavelets on irregular point sets in one and two dimensions. In particular we focus on subdivision schemes and commutation. Subdivision means the skill that approximates the initial lines or mesh into a tender curve or a curved surface by continuous partitioning operation. The key to generalizing wavelet constructions to non-traditional settings is the use of generalized subdivision. The first generation setting is already connected with subdivision schemes, but they become even more important in the construction of second generation wavelets. Subdivision schemes provide fast algorithms, create a natural multi-resolution structure, and yield the underlying scaling functions and wavelets we seek.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.621-632
• /
• 2004

Recent measurement studies of real teletraffic data in modern telecommunication networks have shown that self-similar (or fractal) processes may provide better models of teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to inaccurate conclusions about performance of telecommunication networks. Thus, an important requirement for conducting simulation studies of telecommunication networks is the ability to generate long synthetic stochastic self-similar sequences. A new generator of pseu-do-random self-similar sequences, based on the fractional Gaussian nois and a wavelet transform, is proposed and analysed in this paper. Specifically, this generator uses Daubechies wavelets. The motivation behind this selection of wavelets is that Daubechies wavelets lead to more accurate results by better matching the self-similar structure of long range dependent processes, than other types of wavelets. The statistical accuracy and time required to produce sequences of a given (long) length are experimentally studied. This generator shows a high level of accuracy of the output data (in the sense of the Hurst parameter) and is fast. Its theoretical algorithmic complexity is 0(n).

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.276-279
• /
• 2005

As the Ubiquitous generation approaches, the importance of the sensor data processing is growing. The data approximation scheme, one of the data processing methods, can be the key of sensor data processing, for it is related not only to the lifetime of sensors but also to the size of the storage. In this paper, we propose the Harmonic Wavelet transform which can minimize the relative error for given sensor data. Harmonic Wavelets use the harmonic mean as a representative which is the minimum point of the maximum relative error between two data values. In addition, Harmonic Wavelets retain the relative errors as wavelet coefficients so we can select proper wavelet coefficients that reduce the relative error more easily. We also adapt the greedy algorithm for local optimization to reduce the time complexity. Experimental results show the performance and the scalability of Harmonic Wavelets for sensor data.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.657-666
• /
• 2002

ThE Gibbs' phenomenon in the classical Fourier series is well-known. It is closely related with the kernel of the partial sum of the series. In fact, the Dirichlet kernel of the courier series is not positive. The poisson kernel of Cesaro summability is positive. As the consequence of the positiveness, the partial sum of Cesaro summability does not exhibit the Gibbs' phenomenon. Most kernels associated with wavelet expansions are not positive. So wavelet series is not free from the Gibbs' phenomenon. Because of the excessive oscillation of wavelets, we can not follow the techniques of the courier series to get rid of the unwanted quirk. Here we make a positive kernel For Meyer wavelets and as the result the associated summability method does not exhibit Gibbs' phenomenon for the corresponding series .

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.126-132
• /
• 2000

This paper presents a facial expression recognition based on Gabor wavelets that uses a fuzzy C-means(FCM) clustering algorithm and neural network. Features of facial expressions are extracted to two steps. In the first step, Gabor wavelet representation can provide edges extraction of major face components using the average value of the image's 2-D Gabor wavelet coefficient histogram. In the next step, we extract sparse features of facial expressions from the extracted edge information using FCM clustering algorithm. The result of facial expression recognition is compared with dimensional values of internal stated derived from semantic ratings of words related to emotion. The dimensional model can recognize not only six facial expressions related to Ekman's basic emotions, but also expressions of various internal states.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.8 s.179
• /
• pp.2091-2099
• /
• 2000

The object of the present study is to present an adaptive wavelet-Galerkin method for the analysis of thin-walled box beam. Due to good localization properties of wavelets, wavelet methods emerge as alternative efficient solution methods to finite element methods. Most structural applications of wavelets thus far are limited in fixed-scale, non-adaptive frameworks, but this is not an appropriate use of wavelets. On the other hand, the present work appears the first attempt of an adaptive wavelet-based Galerkin method in structural problems. To handle boundary conditions, a fictitous domain method with penalty terms is employed. The limitation of the fictitious domain method is also addressed.

• Korean Journal of Mathematics
• /
• v.24 no.2
• /
• pp.235-271
• /
• 2016

By using the Heckman-Opdam theory on ${\mathbb{R}}^d$ given in [20], we define and study in this paper, the generalized wavelets on ${\mathbb{R}}^d$ and the generalized wavelet transform on ${\mathbb{R}}^d$, and we establish their properties. Next, we prove for the generalized wavelet transform Plancherel and inversion formulas.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.3
• /
• pp.251-258
• /
• 2004

Since the multiscale wavelet-based numerical methods allow effective adaptive analysis, they have become new analysis tools. However, the main applications of these methods have been mainly on elliptic problems, they are rarely used for eigenvalue analysis. The objective of this paper is to develop a new multiscale wavelet-based adaptive Galerkin method for eigenvalue analysis. To this end, we employ the hat interpolation wavelets as the basis functions of the finite-dimensional trial function space and formulate a multiresolution analysis approach using the multiscale wavelet-Galerkin method. It is then shown that this multiresolution formulation makes iterative eigensolvers very efficient. The intrinsic difference-checking nature of wavelets is shown to play a critical role in the adaptive analysis. The effectiveness of the present approach will be examined in terms of the total numbers of required nodes and CPU times.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.12
• /
• pp.1608-1615
• /
• 2004

CFD data compression methods based on Full-3D and Quasi-1D supercompact multiwavelets are presented. Supercompact wavelets method provide advantageous benefit that it allows higher order accurate representation with compact support. Therefore it avoids unnecessary interaction with remotely located data across singularities such as shock. Full-3D wavelets entails appropriate cross-derivative scaling function & wavelets, hence it can allow highly accurate multi-spatial data representation. Quasi-1D method adopt 1D multiresolution by alternating the directions rather than solving huge transformation matrix in Full-3D method. Hence efficient and relatively handy data processing can be conducted. Several numerical tests show swift data processing as well as high data compression ratio for CFD simulation data.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1291-1296
• /
• 2003

The objective of the present research is to develop a wavelet-based multiscale adaptive Galerkin method for membrane eigenvalue analysis. Since approximate eigensolutions at a certain resolution level can be good guesses, which play an important role in typical iterative solvers, at the next resolution level, the multiresolution iterative solution approach by wavelets can improve the solutionconvergence rate substantially. The intrinsic difference checking nature of wavelets can be also utilized effectively to develop an adaptive strategy. The present wavelet-based approach will be implemented for the simplest vector iteration method, but some important aspects, such as convergence speedup, and the reduction in the number of nodes can be clearly demonstrated.