• Applied Chemistry for Engineering
• /
• v.24 no.6
• /
• pp.593-598
• /
• 2013

In this study, we have evaluated the water absorption phenomenon of photoresist dry film, which is commonly used to build circuits on PCB (Printed Circuit Board) by photolithography, by using ATR-FTIR (Attenuated Total Reflectance-Fourier Transform Infrared). We have firstly observed significant change in fracture mode of dry film with respect to temperature and humidity, which we assumed the material transition from ductile to brittle. Secondly, we have established the process of absorption test for determining the diffusion coefficients of water into the dry film both with gravimeter and ATR-FTIR. We have successfully calculated the diffusion coefficients for each environmental conditions from the results which we achieved by gravimeter and ATR-FTIR. Compared to the gravimeter which is a conventional method for absorption test, the ATR-FTIR method in this study has been found to be very easy to use and have the same accuracy as gravimeter. Moreover, we are expecting to use the ATR-FTIR as an appropriate method to study the absorption phenomena related to any kinds of solvent and polymer system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.880-894
• /
• 1997

In this paper,we propose a new algorithm to perform DCT(Discrete Cosine Transform) withn the area reduced by prdeicting position of quantization coefficients to be zero.This proposed algorithm not only decreases the enoding time and the decoding time by reducing computation amount of FDCT(Forward DCT)and IDCT(Inverse DCT) but also increases comprossion ratio by performing each diffirent horizontal- vereical zig-zag scan assording to the calssified block size for each block on the huffiman coeing.Traditional image coding method performs the samd DCT computation and zig-zag scan over all blocks,however this proposed algorthm reduces FDCT computation time by setting to zero insted of computing DCT for quantization codfficients outside classfified block size on the encoding.Also,the algorithm reduces IDCT computation the by performing IDCT for only dequantization coefficients within calssified block size on the decoding.In addition, the algorithm reduces Run-Length by carrying out horizontal-vertical zig-zag scan approriate to the slassified block chraateristics,thus providing the improverment of the compression ratio,On the on ther hand,this proposed algorithm can be applied to 16*16 block processing in which the compression ratio and the image resolution are optimal but the encoding time and the decoding time take long.Also,the algorithm can be extended to motion image coding requirng real time processing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.771-782
• /
• 2000

In this paper, an H.263 video codec is implemented by adopting the concept of hardware and software co-design. Each module of the codec is investigated to find which approach between hardware and software is better to achieve real-time processing speed as well as flexibility. The hardware portion includes motion-related engines, such as motion estimation and compensation, and a memory control part. The remaining portion of theH.263 video codec is implemented in software using a RISC processor. This paper also introduces efficient design methods for hardware and software modules. In hardware, an area-efficient architecture for the motion estimator of a multi-resolution block matching algorithm using multiple candidates and spatial correlation in motion vector fields (MRMCS), is suggested to reduce the chip size. Software optimization techniques are also explored by using the statistics of transformed coefficients and the minimum sum of absolute difference (SAD)obtained from the motion estimator.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.89-95
• /
• 2009

H.264/AVC is the state-of-the-art video compression standard which achieves high coding efficiency compared with the previous standards. H.264/AVC adopts zig-zag scanning in order to encode quantized transform coefficients in a block. However, its performance is not satisfactory because all blocks are scanned in the fixed order without considering the characteristics of blocks. This paper presents an adaptive coefficient scanning method for improving inter coding efficiency in H.264/AVC. In the proposed method, the coefficient scanning order for each prediction mode is adaptively controlled based on the information of previously-coded blocks. The experimental results show that the proposed coefficient scanning method improves the coding efficiency about 2.29% for high-quality HD sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.11-19
• /
• 2006

The recent video coding standard H.264 employs the rate-distortion optimization (RDO) method for choosing the best coding mode; however, it causes a large amount of encoding time. Thus, in order to reduce the encoding time, we need a fast mode decision algorithm. In this paper, we propose a fast inter mode decision algorithm considering quantization parameter (QP). The occurrence of best modes depends on QP. In order to reflect these characteristics, we consider the coded block pattern (CBP) which has 0 value when all quantized discrete cosine transform (DCT) coefficients are zero. We also use the early SKIP mode decision and early $16{\times}16$ mode decision methods. By computer simulations, we have verified that the proposed algorithm requires less encoding time than the fast inter mode decision method of the H.264 reference software for the Baseline and Main profiles by 19.6% and 18.8%, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.42-53
• /
• 2000

Efficient implementation of pre-filtering has been an important issue in video sequence coding, because it can remove camera noise and improve coding efficiency dramatically This paper introduces a novel pre-filtering scheme that is performed inside a video encoder The proposed pre-filtering is based on the approximated generalized Wiener filtering and two-dimensional discrete cosine transform (DCT) factorization. and is achieved by scaling the DCT coefficients of original image blocks for intra block coding and those of motion-compensated error blocks for inter block coding, respectively Even though the pre-filtering operation is embedded in a video encoder, its additional computational complexity is marginal compared to the encoding process, and the overall architecture of the conventional video encoder is maintained In spite of its simplicity, the proposed pre-filtering scheme provides good filtering and coding performance for noisy video sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.602-611
• /
• 2002

Recent advances in technology have resulted in rapid growth in mobile communication. With this explosive growth, reliable transmission and error resilient technique become increasingly necessary to offer high quality multimedia service. The success of error resilient techniques at decoder sensitively depends on error detection performance. Therefore, this paper proposes a computationally very simple and efficient error detection technique using fragile watermark for real-time video communication. To balance between image quality degradation and error detection efficiency, fragile watermark is embedded only in least significant bits of selected transform coefficients. The proposed method is workable without additional bit in video bitstream and can be implemented very efficiently. This method will be useful in video communication in error prone environment such as wireless channel.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.718-723
• /
• 2008

Bearing is one of the important mechanical elements used in various industrial equipments. Most of failures occurred during the equipment operation result from bearing defects and breakages. Therefore, monitoring of bearings is essential in preventing equipment breakdowns and reducing unexpected loss. The purpose of this paper is to present an online monitoring method to predict bearing states using vibration signals. Bearing vibrations, which are collected as a form of profile signal, are first analyzed by a discrete wavelet transform. Next, some statistical features are obtained from the resultant wavelet coefficients. In order to select significant ones among them, analysis of variance (ANOVA) is employed in this paper. Statistical features screened in this way are used as input variables to support vector machine (SVM). An hierarchical SVM tree is proposed for dealing with multi-class problems. The result of numerical experiments shows that the proposed SVM tree has a competent performance for classifying bearing fault states.

• Journal of the Korean Society of Groundwater Environment
• /
• v.1 no.2
• /
• pp.113-120
• /
• 1994

One of the delicate problems in aquifer management is the identification of the spatial distribution of tile hydrological parameters. The observed data are insufficient to identify the distribution of transmissivities in LAN aquifer. To determine the distribution of the transmissivity in LAN aquifer, it would be required to transform the observed heads at the pilot points into transmissivities. Therefore, three procedures wire tackled for the identification of the spatial distribution of the hydrological parameters; geostatistical estimate of the parameter field on the basis of known well point, heads reconstructed by a numerical model, and modification of the values at pilot points by a minimization algorithm. The variogram of Kriging has been applied to a total of 258 transmissivity value in attempt to quantify their distribution of LAN aquifer. Variogram of the observed and optimized transmissivities at pilot points are adapted to the exponential form. So, it is fitted by theoretical one with coefficients of w=0.623, a=2.743. Values of head obtained through numerical analysis are adjusted to the observed values so that heads have been transformed completely into the transmissivities at the observation wells. The procedure represented contour map of the estimated transmissivities and the calculated head.

• Korean Journal of Cognitive Science
• /
• v.11 no.2
• /
• pp.79-87
• /
• 2000

In this paper we present a face recognition and face detection algorithm in MPEG compressed video. The proposed method consists three stage of processing steps. The first step is to produce a spatially reduced DC image form MPEG compressed video for processing. And the second step is face detection on reduced DC image. Finally, the last step is face recognition on partially extracted compressed frames which contain the detected faces. The spatially reduced DC image is produced from two dimensional inverse DCT of the DC coefficient and the first two AC coefficients. The face detection is performed on DC image and face recognition is performed on one extracted frame per GOP by using the K-L transform. In order to evaluate the proposed method, we carried out experiments on video database. The experiment results show the proposed method is very efficient and helpful for target tasks.