• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.955-982
• /
• 1996

In surface compression applications, one of the main issues is how to efficiently store and calculate the computer representation of certain surfaces. This leads us to consider a nonlinear approximation by box splines with free knots since, for instance, the nonlinear method based on wavelet decomposition gives efficient compression and recovery algorithms for such surfaces (cf. [12]).

• Journal of the Korean Mathematical Society
• /
• v.36 no.6
• /
• pp.1075-1090
• /
• 1999

This paper deals with Littlewood-Paley type estimates of the Besov spaces {{{{ { B}`_{p,q } ^{$\alpha$ } }}}} on the d-dimensional unit cube for 0< p,q<$\infty$ by two certain classes. These classes are including biorthogonal wavelet systems or dual multiscale systems but not necessarily obtained as the dilates or translates of certain fixed functions. The main assumptions are local supports of both classes, sufficient smoothness for one class, and sufficiently many vanishing moments for the other class. With these estimates, we characterize the Besov spaces by coefficient norms of decompositions with respect to biorthogonal wavelet systems on the cube.

• Communications of the Korean Mathematical Society
• /
• v.12 no.2
• /
• pp.427-456
• /
• 1997

This paper concerns constructing wavelet bases on the unit interval, where a new boundary treatment is provided to overcome certain drawbacks of eariler constructions. Wavelet expansions on the unit interval usually suffer from artificial boundary effects and poor convergence at the boundaries. Many researchers have suggested a solution to the drawbacks. From a practical point of view, their solutions also have a common disadvantage. This paper provides a new solution using biorthogonality near the boundaries, that avoids the disadvantage while preserving their advantages.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.1812-1821
• /
• 2014

Wind has been a rapidly growing renewable power source for the last twenty years. Since wind behavior is chaotic in nature, its forecasting is not easy. At the same time, developing an accurate forecasting method is essential when wind farms are integrated into the power grid. In fact, wind speed forecasting tools can solve issues related to grid stability and reserve allocation. In this paper 30 hours ahead wind speed profile forecast is proposed using Adaptive Wavelet Neural Network (AWNN). The implemented AWNN uses a Mexican hat mother Wavelet, and Morlet Mother Wavelet for seven, eight and nine levels decompositions. For wind speed forecasting, the time series data on wind speed has been gathered from the National Renewable Energy Laboratory (NREL) website. In this work, hourly averaged 10-min wind speed data sets for the year 2004 in the Midwest ISO region (site number 7263) is taken for analysis. Data sets are normalized in the range of [-1, 1] to improve the training performance of forecasting models. Total 8760 samples were taken for this forecasting analysis. After the forecasting phase, statistical parameters are calculated to evaluate system accuracy, comparing different configurations.

• Journal of the Semiconductor & Display Technology
• /
• v.5 no.2 s.15
• /
• pp.19-25
• /
• 2006

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and coding unit sizes. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. The encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with certain filters performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1445-1449
• /
• 2005

The ram assembly is important equipment in fueling machine of PHWR(Pressurized Heavy Water Reactor) plant where fuel replacement is possible while the plant is in service. Troubles in the ram assembly can cause lots of difficulties in power plant operation. The ram assembly is typically composed of the B-ram, the L-Ram and the C-Ram. The B-ram is focused in this paper because it plays the most important role in the ram assembly. Among the ram fault phenomena, ram stuck phenomena are the most frequent cases in the B-ram, which has a ball screw mechanism driven by a hydraulic motor. Ram stuck phenomena are due to ball wear and damage in ball nut that increase in proportion to the number of fuel replacement. It is required to predict ram stuck phenomena before they occur. In this paper, a method is proposed for predicting ram stuck phenomena using a discrete wavelet transform. The discrete wavelet transform provides information on both the time and frequency characteristics of the input signals. The proposed method uses the frequency bandwidths of coefficients of discrete wavelet decompositions and detail coefficients of discrete wavelet transform to predict ram stuck phenomena. The signal used in this paper is a torque-related signal such as a hydraulic service outlet pressure signal in a hydraulic driving system or a current signal in a DC motor driving system. Finally, the validity of the proposed method is shown via experiment using ball nut characteristic test equipment that simulates ram stuck phenomena due to increased ball friction in ball nut.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.567-574
• /
• 2006

This paper focuses on lossy medical image compression methods for medical images that operate on three-dimensional(3-D) irreversible integer wavelet transform. We offer an application of unbalanced tree structure algorithm to medical images, using a 3-D unbalanced wavelet decomposition and a 3-D unbalanced spatial dependence tree. The wavelet decomposition is accomplished with integer wavelet filters implemented with the lifting method. We have tested our encoder on volumetric medical images using different integer filters and 16 coding unit size. The coding unit sizes of 16 slices save considerable dynamic memory(RAM) and coding delay from full sequence coding units used in previous works. If we allow the formation of trees of different lengths, then we can accomodate more transaxial scales than three. Then the encoder and decoder can then keep track of the length of the tree in which each pixel resides through the sequence of decompositions. Results show that, even with these small coding units, our algorithm with I(5,3)filter performs as well and better in lossy coding than previous coding systems using 3-D integer unbalanced wavelet transforms on volumetric medical images.

• Journal of the Korean Mathematical Society
• /
• v.41 no.6
• /
• pp.945-955
• /
• 2004

In this paper, we establish a number system in $R^n$ which arises from a Haar wavelet basis in connection with decompositions of certain Cuntz algebra representations on $L^2$( $R^n$). Number systems in $R^n$ are also of independent interest [9]. We study radix-representations of $\chi$ $\in$ $R^n$: $\chi$:$\alpha$$_{ι}$ $\alpha$$_{ι-1}$…$\alpha$$_1$$\alpha$$_{0}$ ㆍ$\alpha$$_{-1}$ $\alpha$$_{-2}$ … as $\chi$= $M^{ι}$$\alpha$$_{ι}$ $\alpha$＋…M$\alpha$$_1$＋$\alpha$$_{0}$ ＋ $M^{-1}$ $\alpha$$_{-1}$ ＋ $M^{-2}$ $\alpha$$_{-2}$ ＋… where each $\alpha$$_{k}$ $\in$ D, and D is some specified digit set. Our analysis uses iteration techniques of a number-theoretic flavor. The view-point is a dual one which we term fractals in the large vs. fractals in the small,illustrating the number theory of integral lattice points vs. fractions.s vs. fractions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.4
• /
• pp.1072-1086
• /
• 1998

Transform, subband, and wavelet transform decompositions are powerful linear transformation tools in image coding because of their decorrelating effects on image pixels, the concentration of energy in a few coefficients, their multirat/multiresolution framework, and their frequency splitting, which allows for efficient coding matched to the statistics of each frequency band and to the characteristics of the human visulal system. Thus, a growingbody of research has bee performed to extend these tools in various kinds of modified formations. Hence, in this paper, an overall survey to achieve a general view on these transformation tools have been attempted. Starting from basic tools such as orthogonal transforms, lapped transforms, QMF(quadrature mirror filter) subband filter banks, and wavelet transforms, their hierarchical extensions, vector extensions, and linear time-varying extensions are investugated in detail.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.2
• /
• pp.16-26
• /
• 2001

This paper develops the fast dynamic programming technique to construct the subband structure yielding the maximum coding gain for given filter bases and a given limit of implementation complexity. We first derive the unified coding gain which can be applied to non-orthogonal filter basis as well as orthogonal filter basis and to arbitrary subband decompositions. Then, we verify that the unified coding gains in real systems are monotonically increasing function for the implementation complexities which are proportional to the number of subbands. By using this phenomenon, the implementation complexity and the coding gain are treated in the same way as the rate and distortion function. This makes it possible to use the Lagrangian multiplier method for finding the optimal subband decomposition producing the maximum coding gain [or a given limit of implementation complexity.