• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.948-955
• /
• 2006

In this paper, we propose motion estimation and compensation using Low-Band-Shift(LBS) with Integer Lifting Shift property. To overcome shift-variant property on wavelet coefficients, the LBS was previously proposed. This method which is applied to reference frame in video coding technique has superior performance in terms of rate-distortion characteristic. However, this method needs more memory and computational complexity. For the enhancement of those disadvantages, we propose motion estimation using Low-Band-Shift with Integer Lifting. The Integer Lifting implementation gives us good efficiency of calculation and storage.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.447-456
• /
• 2015

In this paper we show that some operators defined on the Banach space with an unconditional basis and $L^1({\mu})$ into a Banach space with the RNP have liftable operators.

• Kyungpook Mathematical Journal
• /
• v.46 no.1
• /
• pp.11-18
• /
• 2006

Let R be a ring with identity and let $M=M_1{\bigoplus}M_2$ be an amply supplemented R-module. Then it is proved that $M_i$ has ($D_1$) and is $M_j-^*ojective$ for $i{\neq}j$, i = 1, 2, if and only if for any coclosed submodule X of M, there exist $M\acute{_1}{\leq}M_1$ and $M\acute{_2}{\leq}M_2$ such that $M=X{\bigoplus}M\acute{_1}{\bigoplus}M\acute{_2}$.

• Communications of the Korean Mathematical Society
• /
• v.11 no.3
• /
• pp.547-555
• /
• 1996

In this paper, we shall study the generalized covering group which plays a role for Schur multiplier. We discuss the lifting property over covering group and product of covering groups.

• Journal of Broadcast Engineering
• /
• v.11 no.2 s.31
• /
• pp.164-173
• /
• 2006

The data structure of the concentric mosaic can be regarded as a video sequence with a slowly panning camera. We take a concentric mosaic with match or alignment of video sequences. Also the concentric mosaic required for huge memory. Thus, compressing is essential in order to use the concentric mosaic. Therefore we need the algorithm that compressed data structure was maintained and the scene was decoded. In this paper, we used 3D lifting transform to compress concentric mosaic. Lifting transform has a merit of wavelet transform and reduces computation quantities and memory. Because each frame has high correlation, the complexity which a scene is detected form 3D transformed bitstream is increased. Thus, in order to have higher performance and decrease the complexity of detecting of a scene we executed 3D lifting and then transformed data set was sequently compressed with each frame unit. Each frame has a flexible bit rate. Also, we proposed the algorithm that compressed data structure was maintained and the scene was decoded by using property of lifting structure.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.4
• /
• pp.261-270
• /
• 2009

We can save a lot of efforts and time to perform various kinds of multibody system dynamics simulations if the equations of motion of the multibody system can be formulated automatically. In general, the equations of motion are formulated based on Newton's $2^{nd}$law. And they can be transformed into the equations composed of independent variables by using velocity transformation matrix. In this paper the velocity transformation matrix is derived based on a topological modeling approach which considers the topology and the joint property of the multibody system. This approach is, then, used to formulate the equations of motion automatically and to implement a multibody system dynamics simulation program. To verify the the efficiency and convenience of the program, it is applied to the lifting simulation of a floating crane.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.344-354
• /
• 2005

In this paper, we proposed a new lifting architecture for JPEG2000 and implemented to ASIC. We proposed a new cell to execute unit calculation of lifting using the property of lifting which is the repetitious arithmetic with same structure, and then recomposed the whole lifting by expanding it. After the operational sequence of lifting arithmetic was analyzed in detail and the causality was imposed for implementation to hardware, the unit cell was optimized. A new lifting kernel was organized by expanding simply the unit cell, and a lifting processor was implemented for Motion JPEG2000 using it. The implemented lifting kernel can accommodate the tile size of $1024{\times}1024$, and support both lossy compression using the (9,7) filter and lossless compression using (5,3) filter. Also, it has the same output rate as input rate, and can continuously output the wavelet coefficients of 4 types(LL, LH, HL, HH) at the same time. The implemented lifting processor completed a course of ASIC using $0.35{\mu}m$ CMOS library of SAMSUNG. It occupied about 90,000 gates, and stably operated in about 150MHz though difference from the used macro cell for the multiplier. Finally, the improved operated in about 150MHz though difference from the used macro cell for the multiplier. Finally, the performance can be identified in comparison with the previous researches and commercial IPs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7C
• /
• pp.647-657
• /
• 2005

In this paper, we proposed a new lifting architecture for JPEG2000 and implemented to ASIC. We proposed a new cell to execute unit calculation of lifting using the property of lifting which is the repetitious arithmetic with same structure, and then recomposed the whole lifting by expanding it. After the operational sequence of lifting arithmetic was analyzed in detail and the causality was imposed for implementation to hardware, the unit cell was optimized. A new lifting kernel was organized by expanding simply the unit cell, and a lifting processor was implemented for Motion JPEG2000 using it. The implemented lifting kernel can accommodate the tile size of 1024$\times$1024, and support both lossy compression using the (9,7) filter and lossless compression using (5,3) filter. Also, it has the same output rate as input rate, and can continuously output the wavelet coefficients of 4 types(LL, LH, HL, HH) at the same time. The implemented lifting processor completed a course of ASIC using 0.35$\mu$m CMOS library of SAMSUNG. It occupied about 90,000 gates, and stably operated in about 150MHz though difference from the used macro cell for the multiplier. Finally, the improved operated in about 150MHz though difference from the used macro cell for the multiplier. Finally, the performance can be identified in comparison with the previous researches and commercial IPs.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.6 s.312
• /
• pp.76-82
• /
• 2006

In this paper, the biomedical signal compression method, which is combined with the multi-stage vector quantization and wavelet lifting scheme, is proposed. It utilizes the property of wavelet coefficients that give emphasis on approximation coefficients. The transmitted codebook index consists of the code vectors obtained by wavelet lifting coefficients of ECG and error signals from the 1024 block length, respectively. Each codebook is adaptively updated by the method comparing to the distance of input codevectors with candidate codevectors by using an pre-defined threshold value. The proposed compression method showed blow 3% in term of PRD and 276.62 bits/sec in term of CDR.

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

The wavelet theory is relatively a new development and now acquires popularity and much interest in many areas including mathematics and engineering. This work presents an adaptive wavelet method for a numerical solution of partial differential equations in a collocation sense. Due to the multi-resolution nature of wavelets, an adaptive strategy can be easily realized it is easy to add or delete the wavelet coefficients as resolution levels progress. Typical wavelet-collocation methods use interpolating wavelets having no vanishing moment, but we propose a new wavelet-collocation method on modified interpolating wavelets having 2 vanishing moments. The use of the modified interpolating wavelets obtained by the lifting scheme requires a smaller number of wavelet coefficients as well as a smaller condition number of system matrices. The latter property makes a preconditioned conjugate gradient solver more useful for efficient analysis.