• Korean Chemical Engineering Research
• /
• v.49 no.4
• /
• pp.460-464
• /
• 2011

Poly(ether-block-amide)(PEBA, $PEBAX^{TM}$) resin is a thermoplastic elastomer combining linear chains of hard-rigid polyamide block interspaced soft-flexible polyether block. It was believed that the hard polyamide block provides the mechanical strength and permeation selectivity, whereas gas transport occurs primarily through the soft polyether block. The objective of this work was to investigate the gas permeation properties of carbon dioxide and methane for $PEBAX^{TM}$-1657 membrane and compare with those obtained for other grade of $PEBAX^{TM}$, $PEBAX^{TM}$-2533. And the organic/inorganic hybrid membranes were prepared using $PEBAX^{TM}$ and TEOS(tetraethoxysilane) by sol-gel process, and gas permeation properties were studied. $PEBAX^{TM}$-2533 membrane exhibited higher gas permeability coefficients than $PEBAX^{TM}$-1657 membrane. This was explained by the increase of chain mobility. The permeability coefficients for $PEBAX^{TM}$/TEOS hybrid membranes were higher than pure $PEBAX^{TM}$ membranes. This results were explained by the reduction of crystallinity of polyamide block by the introduction of TEOS. Ideal separation factor of hybrid membranes does not change much. This might be due to the increase of solubility selectivity.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.13-19
• /
• 2001

The conventional fractal decoding was required a vast amount computational complexity, since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested that each range block was classified to iterated and non-iterated regions. Non-iterated regions is called data dependency region, and if data dependency region extended, IFS regions are contractive. In this paper, a searched region of the domain is limited to the range regions that is similar with the domain blocks, and the domain region is more overlapped. As a result, data dependency region has maximum region, that is IFS regions can be minimum region. The minimizing method of domain region is defined to minimum domain(MD) which is minimum IFS region. Using the minimizing method of domain region, there is not influence PSNR(peak signal-to-noise ratio). And it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.643-651
• /
• 2017

Steganography is one of information hiding technologies and discriminated from cryptography in that it focuses on avoiding the existence the hidden information from being detected by third parties, rather than protecting it from being decoded. In this paper, as an image steganography method which uses images as media, we propose a new block matching method that embeds information into the discrete wavelet transform (DWT) domain. The proposed method, based on a statistical analysis, reduces loss of embedding capacity due to inequable use of candidate blocks. It works in such a way that computes the variance of each candidate block, preserves candidate blocks with high frequency components while reducing candidate blocks with low frequency components by compressing them exploiting the k-means clustering algorithm. Compared with the previous block matching method, the proposed method can reconstruct secret images with similar PSNRs while embedding higher-capacity information.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.745-752
• /
• 2002

The purpose of the paper is to enable a format transcoding between a heterogeneous compression format in a real time, and to enhance the compression ratio using characteristics of the compressed frame. In this paper, for the heterogeneous format transcoding, we tried to transcode from MPEG2 having a lower compression ratio to H.263 having a higher compression ratio. After analyzing MPEG 2 bit stream and H.263 bit stream of the same original video, we found that the number of intra coded macro blocks in MPEG 2 data is much higher than the number of the intra coded macro blocks in H.263 data. In the process of P frame generation, a intra coded macro block is generated when a motion estimation value representing the similarity between the previous frame and current frame does not meet a threshold. Especially the intra coded macro block has a great impact on the compression ratio. Hence the paper, we tried to minimize the number of intra coded macro blocks in H.263 data stream which is transcoded from MPEG 2 in a compressed domain. For the purpose, we propose a guided search method for transcoding the INTRA coded block into INTER coded block using the information about motion vectors surrounding the intra macro block in order to minimize the complexity of the motion estimation process. The experimental results show that the transcoding of MPEG 2 into H.263 can be done in a real time successfully.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.95-102
• /
• 2005

When images compressed with block-based compression techniques are transmitted over a noisy channel, unexpected block losses occur. In this paper, we present a post-processing-based block recovery scheme using Haar wavelet features. No consideration of the edge-direction, when recover the lost blocks, can cause block-blurring effects. The proposed directional recovery method in this paper is effective for the strong edge because exploit the varying neighboring blocks adaptively according to the edges and the directional information in the image. First, the adaptive selection of neighbor blocks is performed based on the energy of wavelet subbands (EWS) and difference of DC values (DDC). The lost blocks are recovered by the linear interpolation in the spatial domain using selected blocks. The method using only EWS performs well for horizontal and vertical edges, but not as well for diagonal edges. Conversely, only using DDC performs well diagonal edges with the exception of line- or roof-type edge profiles. Therefore, we combined EWS and DDC for better results. The proposed methods out performed the previous methods using fixed blocks.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.57-67
• /
• 2006

Intellectual property rights are gathering strength theses days. Because digital contents are easily reproduced and distributed by advanced computers and networks. Digital watermarking is one of the best solutions for this problem. Generally, frequency-domain watermarking algorithms are preferred since they are more robust than spatial-domain algorithms. However, coefficients in the frequency domain are floating-point numbers. Thus, it is not easy to manipulate those floating-point coefficients and frequency-domain watermarking algorithms have some limitations in their applications. In order to overcome this difficulty, we employ an integer transform in this paper. In addition, our proposed algerian can extract the watermark from both the spatial and frequency domains. We embed the watermark into a specific bit-plane of mid-frequency coefficients. This is equivalent to the differential energy watermarking (DEW) in the spatial domain. Our simulation results show that the proposed algorithm is imperceptible, good for the watermark payload, and robustness against various attacks. Moreover, it is more efficient than any other algorithm working in only one domain.

• The Journal of the Acoustical Society of Korea
• /
• v.7 no.4
• /
• pp.31-53
• /
• 1988

In this work we study extensively the structures and performance characteristics of the block least mean-square (BLMS) adaptive digital filters (ADF's) that can be realized efficiently using the fast Fourier transform (FFT). The weights of a BLMS ADF realized using the FFT can be adjusted either in the time domain or in the frequency domain, leading to the time-domain BLMS(TBLMS) algorithm or the frequency-domain BLMS (FBLMS) algorithm, respectively. In Part Ⅰof the paper, we first present new results on the overlap-add realization and the number-theoretic transform realization of the FBLMS ADF's. Then, we study how we can incorporate the concept of different frequency-weighting on the error signals and the self-orthogonalization of weight adjustment in the FBLMS ADF's , and also in the TBLMS ADF's. As a result, we show that the TBLMS ADF can also be made to have the same fast convergence speed as that of the self-orthogonalizing FBLMS ADF. Next, based on the properties of the sectioning operations in weight adjustment, we discuss unconstrained FBLMS algorithms that can reduce two FFT operations both for the overlap-save and overlap-add realizations. Finally, we investigate by computer simulation the effects of different parameter values and different algorithms on the convergence behaviors of the FBLMS and TBLMS ADF's. In Part Ⅱ of the paper, we will analyze the convergence characteristics of the TBLMS and FBLMS ADF's.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.358-360
• /
• 2004

The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.3
• /
• pp.354-362
• /
• 2008

This paper presents the new method of power system transient stability simulation, which combines the desirable features of both the time domain technique based on OOP(Object-oriented Programming) and the direct method of transient stability analysis using detailed generator model. OOP is an alternative to overcome the problems associated with the development, maintenance and update of large software by electrical utilities. Several papers have already evaluated this approach for power system applications in areas such as load flow, security assessment and graphical interface. This paper applied the object-oriented approach to the problem of power system dynamics simulation. The modeling method is that each block of dynamic system block diagram is implemented as an object and connected each other. In the transient energy method, the detailed synchronous generator model is so-called two-axis model. For the excitation model, IEEE type1 model is used. The developed mothed was successfully applied to New England Test System.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1999.11b
• /
• pp.21-25
• /
• 1999

Wavelet transform decomposes a video frame into a set of subframes with different resolutions corresponding to different frequency bands. The block size of highest layer subframe is too small to estimate correct motion. To decrease this aperture problem in the approximation frame, multiresolution motion estimation (MRME) using hierarchical block matching is presented in this paper. In the multiresolution motion estimation approach, motion vectors in the subframes are estimated by the motion vectors in the approximation frame and are refined at each subframe. It reduces computational time in motion estimation. It is shown that our MRME approach has a superior performance than traditional MRME approaches.