• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.423-429
• /
• 2001

In this paper, we propose the improved method for retrieving images with DC element of DCT that is used in image compression such as JPEG/MPEG. The existing method retrieves images with DC of fixed block size DCT. In this method, the increase in the block size results in faster retrieving speed, but it lessens the accuracy. The decrease in the block size improves the accuracy, however, it degrades the retrieving speed. In order to solve this problem, the proposed method utilizes the variable block size DCT. This method first determines the existence of object regions within each block, and then creates an image region table. Based on this table, it determines the size of each block, following a simple rule; decrease the block size in the object regions, and increase the block size in the background regions. The proposed method using variable block size DCT improves about 15% in terms of the accuracy. Additionally, when there rarely exist images of same pattern, it is able to retrieve faster only by comparing the image region patterns.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.103-110
• /
• 1996

In this paper, we propose a unified systolic array for the computation of the 2D discrete cosine transform/discrete sine transform/discrete hartley transform (DCT/DST/DHT). The unified systeolic array for the 2D DCT/DST/DHT is a generalization of the unified systolic array for the 1D DCT/DST/DHT. In order to calculate the 2D transform, we compute 1D transforms along the row, transpose them, and obtain 1D transforms along the column. When we compare the proposed systolic array with the conventional method, our architecture exhibits a lot of advantages in terms of latency, throughput, and the number of PE's. The simulation results using very high speed integrated circuit hardware description language (VHDL), international standard language for hardware description, show the functional validity of the proposed architecture.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.39-42
• /
• 2016

Since a display device such as TV or signage is getting larger, the types of media is getting changed into wider view one such as UHD, panoramic and jigsaw-like media. Especially, panoramic and jigsaw-like media is realized by stitching video clips, which are captured by different camera or devices. In order to stich those video clips, it is required to find out 2D Adjacency Matrix, which tells spatial relationships among those video clips. Discrete Cosine Transform (DCT), which is used as a compression transform method, can convert the each frame of video source from the spatial domain (2D) into frequency domain. Based on the aforementioned compressed features, 2D adjacency Matrix of images could be found that we can efficiently make the spatial map of the images by using DCT. This paper proposes a new method of generating 2D adjacency matrix by using DCT for producing a panoramic and jigsaw-like media through various individual video clips.

• Journal of Broadcast Engineering
• /
• v.6 no.2
• /
• pp.187-194
• /
• 2001

The Advanced Intra Coding(AIC) mode included in the H.263+ which is for video ceding at low bit rates, selects one prediction direction of DCT coefficients among three directions for every intra macroblock. Based ()n the selected direction, It uses a different DCT scanning order, quantization scheme, and VLC table. The use of the AIC mode brings higher compression ratio and improved PSNR than the H.263 baseline. This paper proposes a simplified submode selection method for a direction of the DCT coefficient prediction for advanced ultra coding in H.263. Compared to the conventional method the proposed simplified method can achieve a similar coding Performance at computational complexity reduced to 1/7 and with much less memory requirement. The proposed method will be useful in implementing a simplified H.263 system.

• The Journal of Korean Society for Radiation Therapy
• /
• v.28 no.2
• /
• pp.123-130
• /
• 2016

Purpose : The aim of this study was to compare the differences between the volumes acquired with four-dimensional computed tomography (4DCT)images with a reconstruction image-filtering algorithm and cone-beam computed tomography (CBCT) images with dynamic phantom. Materials and Methods : The 4DCT images were obtained from the computerized imaging reference systems (CIRS) phantom using a computed tomography (CT) simulator. We analyzed the volumes for maximum intensity projection (MIP), minimum intensity projection (MinIP) and average intensity projection (AVG) of the images obtained with the 4DCT scanner against those acquired from CBCT images with CT ranger tools. Results : Difference in volume for node of 1, 2 and 3 cm between CBCT and 4DCT was 0.54~2.33, 5.16~8.06, 9.03~20.11 ml in MIP, respectively, 0.00~1.48, 0.00~8.47, 1.42~24.85 ml in MinIP, respectively and 0.00~1.17, 0.00~2.19, 0.04~3.35 ml in AVG, respectively. Conclusion : After a comparative analysis of the volumes for each nodal size, it was apparent that the CBCT images were similar to the AVG images acquired using 4DCT.

• Journal of Intelligence and Information Systems
• /
• v.8 no.1
• /
• pp.15-25
• /
• 2002

This paper proposes a vehicle license plate recognition system, which has relatively a simple structure and is highly tolerant of noise, by using the DCT(Discrete Cosine Transform) coefficients extracted from the character region of a license plate and the LVQ(Learning Vector Quantization) neural network. The image of a license plate is taken from a captured vehicle image based on RGB color information, and the character region is derived by the histogram of the license plate and the relative position of individual characters in the plate. The feature vector obtained by the DCT of extracted character region is utilized as an input to the LVQ neural classifier fur the recognition process. In the experiment, 109 vehicle images captured under various types of circumstances were tested with the proposed method, and the relatively high extraction rate of license plates and recognition rate were achieved.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.28-38
• /
• 2000

This paper proposes a fractal compression method using the domain classification and local searching, which utilize DCT coefficient characteristic Generally, the fractal Image encoding method has a time consuming process to search a domain to be matched with range block In order to reduce computation complexity, the domain and range regions are respectively classified into 4 category by using the characteristics of DCT coefficients and each range region is encoded by a method suitable for the property of its category Since the bit amount of the compressed image depends on the number of range blocks, the matching of domain block and range block is induced on the large range block by using local search, so that compression ratio is increased by reducing the number of range block In the local search, the searching complexity is reduced by determining the direction and distance of searching using the characteristics of DCT coefficients The experimental results shows that the proposed algorithm have 1 dB higher PSNR and 0 806 higher compression ratio than previous algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1574-1585
• /
• 2011

This paper proposes a real-time algorithm for speed limit sign recognition for advanced safety vehicle system. The proposed algorithm uses Block-DCT in extracting features from a given ROI(Region Of Interest) instead of using entire pixel values as in previous works. The proposed algorithm chooses parts of the DCT coefficients according to the proposed discriminant factor, uses correlation coefficients and variances among ROIs from training samples to reduce amount of arithmetic operations without performance degradation in classification process. The algorithm recognizes the speed limit signs using the information obtained during training process by calculating LDA and Mahalanobis Distance. To increase the hit rate of recognition, it uses accumulated classification results computed for a sequence of frames. Experimental results show that the hit rate of recognition for sequential frames reaches up to 100 %. When compared with previous works, numbers of multiply and add operations are reduced by 69.3 % and 67.9 %, respectively. Start after striking space key 2 times.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.7
• /
• pp.332-338
• /
• 2001

A visually adaptive quantization method of DCT-based images based on Human Visual System(HVS) is proposed. This approach uses the spatial masking in HVS characteristics to obtain higher compression ratio with relatively small degradation in the image quality. HVS is nonsensitive to an edge area, so a high complexity area is quantized coarsely in contrast to fine quantization of the low complexity area. The complexity of an area is estimated by the variance of DCT coefficients of the image. Experimental results demonstrate the performance of the proposed method and the resulting images show little difference from the original image in the subjective perception.

• International Journal of Contents
• /
• v.11 no.3
• /
• pp.39-46
• /
• 2015

When host images are watermarked with CRT (Chinese Remainder Theorem), the watermark images are still robust in spite of the damage of the host images by maintaining the remainders in an unchanged state within some range of the changes that are incurred by the attacks. This advantage can also be attained by "zero-watermarking," which does not change the host images in any way. This paper proposes an improved zero-watermarking scheme for color images on the DCT (Discrete Cosine Transform) domain that is based on the CRT. In the scheme, RGB images are converted into YCbCr images, and one channel is used for the DCT transformation. A key is then computed from the DC and three low-frequency AC values of each DCT block using the CRT. The key finally becomes the watermark key after it is combined four times with a scrambled watermark image. When watermark images are extracted, each bit is determined by majority voting. This scheme shows that watermark images are robust against a number of common attacks such as sharpening, blurring, JPEG lossy compression, and cropping.