• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.06a
• /
• pp.174-182
• /
• 1997

The technology of Semi-Solid Forging (SSF) has been actively developed to fabricate near-net-shape products using light and hardly formable materials. Generally, the SSF process is composed of slug heating, forming, compression -holding and ejecting step. After forming step in SSF, the slug is compressed during a certain holding time in order to be completely filled in the die cavity and be accelerated in solidification rate. The compression holding time that can affect microstructural characteristics and shape of products is important to make decision, where it is necessary to find overall heat transfer coefficient properly which has large effect on heat transfer between slug and die. This paper presents the procedure to predict compression holding time of obtaining the final shaped part with information of temperature and solid fraction for a cylindrical slug at compression holding step in closed-die compression process using heat transfer analysis considering latent heat by means of finite element method. The influence of the predicted compression holding time on microstructural characteristics of products is finally investigated by experiment.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.6
• /
• pp.543-547
• /
• 2008

In the paper, we develop the ultrasonic bonding technique for LCD driver chips having small size and high pin-density. In general, the mounting technology for LCD driver ICs is a thermo-compression method utilizing the ACF (An-isotropic Conductive Film). The major drawback of the conventional approach is the long process time. It will be shown that the conventional ACF method based on thermo-compression can be remarkably enhanced by employing the ultrasonic bonding technique in terms of bonding time. The proposed approach is to apply the ultrasonic energy together with the thermo-compression methodology for the ACF bonding process. To this end, we design a bonding head that enables pre-heating, pressure and ultrasonic excitation. Through the bonding experiments mainly with LCD driver ICs, we present the procedures to select the best combination of process parameters with analysis. We investigate the effects of bonding pressure, bonding time, pre-heating temperature before bonding, and the power level of ultrasonic energy. The addition of ultrasonic excitation to the thermo-compression method reduces the pre-heating temperature and the bonding process time while keeping the quality bonding between the LCD pad and the driver IC. The proposed concept will be verified and demonstrated with experimental results.

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.4
• /
• pp.369-378
• /
• 2000

Conventional fractal image compression methods have many problems in searching time for matching domain block. Proposed method is an improved method of Fisher's Quadtree Decomposition in terms of time, compression ratio, and PSNR. This method determines range block in advance using QR algorithm. First, input image is partitioned to $4{\times}4$ range block and then recomposition is performed from bottom level to specified level. As a result, this proposed method achieves high encoding and decoding speed, high compression ratio, and high PSNR than Fisher's Quadtree Decomposition method.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.11
• /
• pp.786-792
• /
• 2004

A wavelet based ECG data compression has become an attractive and efficient method in many mobile tele-cardiology applications. But large data size required for high compression performance leads a serious delay. In this paper, new wavelet compression method with minimum delay is proposed. It is based on deciding the type and compression ratio(CR) of block organically according to the standard deviation of input ECG data with minimum block size. Compression performances of the proposed algorithm for different MIT ECG Records were analyzed comparing other ECG compression algorithm. In addition to the processing delay measurement, compression efficiency and reconstruction sensitivity to error were also evaluated via random noise simulation models. The results show that the proposed algorithm has both lower PRD than other algorithm on same CR and minimum time in the data acquisition, processing and transmission.

• Journal of the Korean Wood Science and Technology
• /
• v.44 no.2
• /
• pp.172-183
• /
• 2016

Densification of the inner part of oil palm trunk (OPT) by the close system compression (CSC) method was performed in this study. The effects of the compression temperature and time on the anatomical, physical and mechanical properties of OPT were evaluated. The inner part of OPT with an initial average density of $0.3g/cm^3$ was used as samples. Oven-dried samples were immersed in water and vacuumed until fully saturated and then compressed by CSC at 120, 140, 160 or $180^{\circ}C$ for 10, 20, 30 or 40 min. The anatomical characteristics of transverse and radial sections before and after compression were compared by optical microscopy. The physical and mechanical properties, including the density, recovery of set (RS), modulus of elasticity (MOE), modulus of rupture (MOR), and compression parallel to grain were examined. It was observed that the anatomical characteristic of the inner part of OPT (i.e., vascular bundles, vessels, and parenchyma tissue) became flattened, fractured, and collapsed after compression by CSC. The RS decreased with increasing compression temperature and time. The lower RS indicated high dimensional stability. The physical and mechanical properties (i.e., density, MOR, MOE, and compressive strength) of the inner part of OPT increased with increasing compression temperature and time. Compression by the CSC method at $160^{\circ}C$ for 40 min was the optimum treatment.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1737-1744
• /
• 2004

In the compression methods widely used today, the image compression by VQ is the most popular and shows a good data compression ratio. Almost all the methods by VQ use the LBG algorithm that reads the entire image several times and moves code vectors into optimal position in each step. This complexity of algorithm requires considerable amount of time to execute. To overcome this time consuming constraint, we propose an enhanced self-organizing neural network for color images. VQ is an image coding technique that shows high data compression ratio. In this study, we improved the competitive learning method by employing three methods for the generation of codebook. The results demonstrated that compression ratio by the proposed method was improved to a greater degree compared to the SOM in neural networks.

• Journal of Biomedical Engineering Research
• /
• v.40 no.5
• /
• pp.179-188
• /
• 2019

In ultrasound telemedicine, it is important to reduce the size of the data by compressing the ultrasound image when sending it. Ultrasound images can be divided into image context and other information consisting of patient ID, date, and several letters. Between them, ultrasound context is very important information for diagnosis and should be securely preserved as much as possible. In several previous papers, ultrasound compression methods were proposed to compress ultrasound context and other information into different compression parameters. This ultrasound compression method minimized the loss of ultrasound context while greatly compressing other information. This paper proposed the method of automatic segmentation of ultrasound context to overcome the limitation of the previously described ultrasound compression method. This algorithm was designed to robust for various ultrasound device and to enable real-time operation to maintain the benefits of ultrasound imaging machine. The operation time of extracting ultrasound context through the proposed segmentation method was measured, and it took 311.11 ms. In order to optimize the algorithm, the ultrasound context was segmented with down sampled input image. When the resolution of the input image was reduced by half, the computational time was 126.84 ms. When the resolution was reduced by one-third, it took 45.83 ms to segment the ultrasound context. As a result, we verified through experiments that the proposed method works in real time.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.64-69
• /
• 2000

This paper proposes a novel fractal coding method for fast encoding and high compression to shorten time to take on fractal encoding by using limited search area. First. the original image is contracted respectively by half and by quarter with the scaling method and bit-plane method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image qualify than Jacquin's method.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.9-17
• /
• 2009

A face database has contained a large amount of facial information data since face recognition was widely used. With the increase of facial information data, the face recognition based on distributed processing method has been noticed as a major topic. In existing studies, there were lack of discussion about the transferring method for large data. So, we proposed a fuzzy logic-based bit compression rate selection method for distributed face recognition. The proposed method selects an effective bit compression rate by fuzzy inference based on face recognition rate, processing time for recognition, and transferred bit length. And, we compared the facial recognition rate and the recognition time of the proposed method to those of facial information data with no compression and fixed bit compression rates. Experimental results demonstrates that the proposed method can reduce processing time for face recognition with a reasonable recognition rate.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.525-534
• /
• 2001

Generally, compression and encryption procedures are performed independently in lossless image compression and encryption. When compression is followed by encryption, the compressed-stream should have the property of randomness because its entropy is decreased during the compression. However, when full data is compressed using image compression methods and then encrypted by encryption algorithms, real-time processing is unrealistic due to the time delay involved. In this paper, we propose to combine compression and encryption to reduce the overall processing time. It is method decomposing gray-scale image by means of quadtree compression algorithms and encrypting the structural part. Moreover, the lossless compression ratio can be increased using a transform that provides an decorrelated image and homogeneous region, and the encryption security can be improved using a reconstruction of the unencrypted quadtree data at each level. We confirmed the increased compression ratio, improved encryption security, and real-time processing by using computer simulations.