• Journal of the Institute of Convergence Signal Processing
• /
• v.18 no.2
• /
• pp.62-67
• /
• 2017

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.338-343
• /
• 2004

In Block Matching Algorithm (BMA), a search pattern has a very important affect on the search time and the output quality. In this paper, we propose the HDS( Half Diamond Search) pattern based on the cross center-biased distribution property of a motion vector. At lust, the 4 points in the above, below, left, and right around the search center is calculated to decide the point of the MBD (Minimum Block Distortion). And an above point of the MBD is checked to calculate the SAD. If the SAD is less than the previous MBD, this process is repeated. Otherwise, the left and right points of MBD are calculated to decide the points that have the MBD between two points. These processes are repeated to the predicted direction for motion estimation. Experiments show that the speedup improvement of the proposed algorithm can be up to 23% while maintaining similar image quality.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.11-17
• /
• 2001

Fractal image coding provides many promising qualities including the high compression ratio. The coding process however suffers from the long search time of domain block pool because the size of the domain block pool is often very large. In this paper, we introduce a hybrid domain block pool search method that combines the block classification and the variance based searching. This hybrid method makes use of the fact that the variance of a block is independent of the block classification. Thus, this hybrid method enhances the search speed by up to an O(number of classes) factor over the purely variance based searching method. An experimental result shows that our method enhances the search speed by up to 17 times over the purely variance based searching method. We also propose an adjustable variance based searching method that further enhances the search speed without noticeable loss of image quality.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.10
• /
• pp.731-740
• /
• 2003

Since motion estimation remove the redundant data to employ the temporal correlations between adjacent frames in a video sequence, it plays an important role in digital video coding. And in the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the small-cross search pattern and the block-based gradient descent search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the small-cross search pattern, and then quickly finds the other motion vectors that are not close to the center of search window using the block-based gradient descent search pattern. Through experiments, compared with the block-based gradient descent search algorithm(BBGDS), the proposed search algorithm improves as high as 26-40% in terms of average number of search point per motion vector estimation.

• Journal of Advanced Navigation Technology
• /
• v.8 no.1
• /
• pp.10-18
• /
• 2004

As a technique for high-quality multimedia service in down-link, the transmit diversity schemes using a orthogonal space-time block codes were proposed. But if the number of transmit antenna is three or more, it was impossible to obtain full diversity gain because of the decline of spectral efficiency. Accordingly, the quasi-orthogonal space-time block code that not required a additional bandwidth was proposed. But using a space-time block codes, the transmit diversity schemes were verified over quasi-static and frequency non-selective channels. Therefore, in this paper, we analyze the performance of OFDM systems, which a frequency selective channel equalized a frequency non-selective channel, adapting the quasi-orthogonal space-time block code, and compare they to the conventional orthogonal space-time block coded OFDM systems.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.1048-1060
• /
• 2012

In this paper, an adaptive temporal and spatial filter (ATSF) based on mean square error (MSE) estimation is proposed. ATSF is a block based de-noising algorithm. Each noisy block is selectively filtered by a temporal filter or a spatial filter. Multi-hypothesis motion compensated filter (MHMCF) and bilateral filter are chosen as the temporal filter and the spatial filter, respectively. Although there is no original video, we mathematically derivate a formular to estimate the real MSE between a block de-noised by MHMCF and its original block and a linear model is proposed to estimate the real MSE between a block de-noised by bilateral filter and its original block. Finally, each noisy block is processed by the filter with a smaller estimated MSE. Simulation results show that our proposed algorithm achieves substantial improvements in terms of both visual quality and PSNR as compared with the conventional de-noising algorithms.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.33 no.2
• /
• pp.187-199
• /
• 2009

Recently, the quality and design of the children's wear is being improved remarkably. Following the trend, the need for the research on the pattern making of children's wear is growing. At first, we tried to find out how the industry is doing the pattern making job through interview. Results are as follows. The target age ranges from 5 to 11 years old. For the sample size of pattern making, 7 years of age is preferred. It is not usual to develop the design pattern from the bodice block pattern. Instead, they use middle block pattern for each item, such as blouse, shirt, pants, skirt or jacket. Starting from these middle block pattern, they prepare individual designs. With the results, the aim of the research became to develop one of most frequently used middle block pattern. The blouse block pattern was selected for that purpose. To look into the existing patterns, we selected 4 methods, i.e. NM-method, T-method, O-method, E-methods. Theses patterns were compared through wearing test for the evaluation of comfort and fit using trial garments. The results indicated the NM-method was best among them. Specially waist line position, shoulder shape and size allowance was adequate. Alteration and adjustment of pattern draft was made onto the NM-method. Allowances for the bust circumference, across chest, across back and depth of arm was adjusted for better comfort as well as fine fit. Sidelines of the bodice and the underarm seam of the sleeves were curved for styling. After another wearing test, the final pattern was suggested as a blouse block pattern for 7 years old girl.

• Journal of the Korea Institute of Building Construction
• /
• v.22 no.6
• /
• pp.607-618
• /
• 2022

This study involves the development of a Hwangto permeable block for rainwater storage tanks. The permeable products that form continuous voids between Hwangto binders and aggregates are fine milled slag powder, which is an industrial by-product generated during the production of Hwangto and iron, and ferro nickel slag. The properties of Hwangto permeable blocks were studied using recycled resource aggregates. The target quality is based on KSF 2394. The Hwangto permeable block for a rainwater storage tank is made of water-permeable material, and the permeability of the Hwangto permeable block itself is 0.1mm/sec or higher, with a physical performance of over 5.0MPa in flexural strength and over 20.0MPa in compressive strength. The physical properties of Hwangto permeable block for rainwater storage tanks were researched and developed. In order to prevent flooding due to heavy rain in summer and the urban heat island phenomenon due to depletion of ground water, continuous pores are formed in the block to secure a permeability function to prevent rainwater from accumulating in the pavement of the floor, and to prevent slippage for comfortable and safe storage.

• The KIPS Transactions:PartB
• /
• v.18B no.6
• /
• pp.355-364
• /
• 2011

In most applications requiring high-confidential images, reversible watermarking is an effective way to ensure the integrity of images. Many watermarking researches which have been adapted to authenticate contents cannot recover the original image after authentication. However, reversible watermarking inserts the watermark signal into digital contents in such a way that the original contents can be restored without any quality loss while preserving visual quality. To detect malicious tampering, this paper presents a new block-based image authentication algorithm using differential histogram-based reversible watermarking. To generate an authentication code, the DCT-based authentication feature from each image block is extracted and combined with user-specific code. Then, the authentication code is embedded into image itself with reversible watermarking. The image can be authenticated by comparing the extracted code and the newly generated code and restored into the original image. Through experiments using multiple images, we prove that the presented algorithm has achieved over 97% authentication rate with high visual quality and complete reversibility.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.99-108
• /
• 2008

For video compression, we have to consider two performance factors that are the search speed and coded video's quality. In this paper, we propose an enhanced fast block matching algorithm using the spatial correlation of the video sequence and the center-biased characteristic of motion vectors(MV). The proposed algorithm first finds a predicted motion vector from the adjacent macro blocks of the current frame and determines an exact motion vector using the cross pattern and a flat hexagon search pattern. From the performance evaluations, we can see that our algorithm outperforms both the hexagon-based search(HEXBS) and the cross-hexagon search(CHS) algorithms in terms of the search speed and coded video's quality. Using our algorithm, we can improve the search speed by up to 31%, and also increase the PSNR(Peak Signal Noise Ratio) by at most 0.5 dB, thereby improving the video quality.