• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.347-356
• /
• 2003

The OCT algorithm needs efficient hardware architecture to compute inner product. The conventional methods have large hardware complexity. Because of this reason. a computation sharing multiplier was proposed for implementing inner product. However, the existing multiplier has inefficient hardware architecture in precomputer and select units. Therefore it degrades the performance of the multiplier. In this paper, we proposed a new efficient computation sharing multiplier and applied it to implementation of 1-D DCT processor. The comparison results show that the new multiplier is more efficient than an old one when hardware architectures and logic synthesis results were compared. The designed 1-D DCT processor by using the proposed multiplier is more high performance than typical design methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.79-85
• /
• 2013

In this paper, we discussed the traditional methods of generating digital halftoning image and DCT transform. Then we propose a new and simple halftoning algorithm that is based on DCT transformation. We do the feasibility test to verify the proposed algorithm. So we assessed several images generated by adjusting weights of DCT coefficients. As a result, we got the better result for weights of the ramp function type than for weights of the step function type through experiment. As a simple application, we can apply our algorithm to the MPEG video for generating the halftoning video.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.21-27
• /
• 2019

The video compression standard required a processing technique for a high resoluion image and increased the coding size to increase the resolution of the image. Accurate motion estimation and increased coding size provide high accuracy and compression rate, but there is a problem of increased computational complexity. In this paper, we use DCT - based motion estimation in the frequency domain to reduce complexity. However, we found that the DCT and quantization process used in a general video encoder are applied to the frequency domain encoder, resulting in problems caused by the scaling process. Therfore, in this paper, we extract the scaling matrix that can be applied in the DCT step and resolve the, and improve the performance of motion estimation using increased coding size.

• The KIPS Transactions:PartD
• /
• v.17D no.6
• /
• pp.463-470
• /
• 2010

We presented a very fast and robust method of text line segmentation based on the DCT blocks of color image without decompression and binary transformation processes. Using DC and another three primary AC coefficients from block DCT we created a gray-scale image having reduced size by 8x8. In order to detect and locate white strips between text lines we analyzed horizontal and vertical projection profiles of the image and we applied a direct markov model to recover the missing white strips by estimating hidden periodicity. We presented performance results. The results showed that our method was 40 - 100 times faster than traditional method.

• Progress in Medical Physics
• /
• v.25 no.1
• /
• pp.53-63
• /
• 2014

The objective of this study is to investigate the difference of ITV lengths and ITVs between 4DCT and Slow-CT images according to respiratory patterns using a respiratory motion phantom. The respiratory periods 1~4 s and target motion 1~3 cm were applied on each respiratory pattern. 4DCT and Slow-CT images were acquired for 3 times. 4DCT and Slow-CT ITVs were measured with contouring the target in the Eclipse RTP system. The measured ITV lenghts and ITVs in 4DCT and Slow-CT images were compared to the known values. For the ITV lengths and ITVs in the 4DCT, the difference of them were reduced as the respiratory period is longer and target motion is shorter. For the Slow-CT, there was same tendency with change in 4DCT ITV lengths and ITVs about target motion. However, the difference of ITV lengths and ITVs for the respiratory periods were the lowest in respiratory period 1 second and different slightly within respiratory period 2-4 seconds. According to the respiratory patterns, pattern A had the highest reproducibility. Pattern B, C and D were showed the difference similar to each other. However, for pattern E, the reproducibility was the lowest compared with other four patterns. The difference of ITV lengths and ITVs between Slow-CT and 4DCT was increased by increasing the respiratory periods and target motion for all respiratory patterns. When the difference of Slow-CT ITV lengths and ITVs were compared with that of 4DCT ITV lengths and ITVs, Slow-CT ITV lengths and ITVs were approximately 22 % smaller than 4DCT, and the representations of target were different in each pattern. In case of pattern A, B and C, length difference was 3 mm at S (superior) and I (inferior) direction, and the length difference of pattern D was 1.45 cm at only "I" direction whereas the length difference of pattern E was 5 mm longer in "S" direction than "I" direction. Therefore, the margin in SI directions should be determined by considering the respiratory patterns when the margin of Slow-CT is compensated for 4DCT ITV lengths. Afterward, we think that the result of this study will be useful to analyze the ITV lengths and ITVs from the CT images on the basis of the patient respiratory signals.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.464-473
• /
• 2001

Since DCT algorithm divides an image into blocks uniformly in both the spatial domain and the frequency domain, it has a weak point that it can not reflect HVS(Human Visual System) efficiently To avoid this problem, we propose a new algorithm, which combines only the merits of DCT and wavelet transform. The proposed algorithm uses the high compaction efficiency of DCT, and applies wavelet transform mode to DCT coefficients, so that the algorithm can utilize interband and intraband correlations of wavelet simultaneously After that, the proposed algorithm quantizes each coefficient based on the characteristic of each coefficient's band. In terms of coding method, the quantized coefficients of important DCT coefficients have symmetrical distribution, the bigger that value Is, the smaller occurrence probability is. Using the characteristic, we propose a new still image coding algorithm of symmetric and bidirectional tree structure with simple algorithm and fast decoding time. Comparing the proposed method with JPEG, the proposed method yields better image quality both objectively and subjectively at the same bit rate.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.2
• /
• pp.267-272
• /
• 2007

This paper proposes a new approach fur the detection of facial feature regions using the characteristic of DCT(discrete cosine transformation) thatconcentrates the energy of an image into lower frequency coefficients. Since the facial features are pertained to relatively high frequency in a face image, the inverse DCT after removing the DCT's coefficients corresponding to the lower frequencies generates the image where the facial feature regions are emphasized. Thus the facial regions can be easily segmented from the inversed image using any differential operator. In the segmented region, facial features can be found using face template. The proposed algorithm has been tested with the image MIT's CBCL DB and the Yale facedatabase B. The experimental results have shown superior performance under the variations of image size and lighting condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2407-2414
• /
• 1999

This paper introduces the concept of warped discrete cosine transform (WDCT) and an image compression algorithm based on the WDCT. The proposed WDCT is a cascade connection of a conventional DCT and all-pass filters whose parameters can be adjusted to provide frequency warping. In the proposed image compression scheme, the frequency response of the all-pass filter is controlled by a set of parameters with each parameter for a specified frequency range. For each image block, the best parameter is chosen from the set and is sent to the decoder as a side information along with the result of corresponding WDCT computation. For actual implementation, the combination of the all-pass IIR filters and the DCT can be viewed as a cascade of a warping matrix and the DCT matrix, or as a filter bank which is obtained by warping the frequency response of the DCT filter bank. Hence, the WDCT can be implemented by a single matrix computation like the DCT. The WDCT based compression, outperforms the DCT based compression, for high bit rate applications and for images with high frequency components.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.61-71
• /
• 2011

In this paper, we proposed the method for detecting text region on image using DCT-coefficient and transition-map analysis. The detecting rate of traditional method for detecting text region using DCT-coefficient analysis is high, but false positive detecting rate also is high and the method using transition-map often reject true text region in step of verification because of sticky threshold. To overcome these problems, we generated PTRmap(Promising Text Region map) through DCT-coefficient analysis and applied PTRmap to method for detecting text region using transition map. As the result, the false positive detecting rate decreased as compared with the method using DCT-coefficient analysis, and the detecting rate increased as compared with the method using transition map.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.97-103
• /
• 2008

In this paper, $256{\times}256$ input image is classified into a validity block and an edge block of $8{\times}8$ block for image compression. DCT(Discrete Cosine Transform) is executed only for the DC coefficient that is validity coefficients for a validity block. Predict the position where a quantization coefficient becomes 0 for an edge block, I propose new algorithm to execute DCT in the reduced region. Not only this algorithm that I proposed reduces computational complexity of FDCT(Forward DCT) and IDCT(Inverse DCT) and decreases encoding time and decoding time. I let compressibility increase by accomplishing other stability verticality zigzag scan by the block size that was classified for each block at the time of huffman encoding each. In addition, the algorithm that I suggested reduces Run-Length by accomplishing the level verticality zigzag scan that is good for a classified block characteristic and, I offer the compressibility that improved thereby.