• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.56-58
• /
• 2014

본 논문에서는 압축 도메인에서 고속으로 움직임을 검출하고 해당 구간을 저장 하는 알고리즘을 제안한다. 제안하는 알고리즘은 H.264/AVC 기반의 압축 비트스트림에서 움직임 벡터와 참조프레임을 이용하여 움직임이 있는 프레임을 검출하고 움직임 유무에 따라 GOP 단위로 저장하는 과정을 수행한다. 압축도메인에서 움직임 검출과 구간 저장을 수행함으로써 복잡도를 낮추고 비디오 저장을 위한 공간을 절약해 실시간 다채널 영상 처리에 최적화 된 성능을 제공한다. 제안하는 움직임 검출 및 저장 시스템은 single thread 환경에서 실시간으로 평균 2957 프레임을 처리 가능하며, Multi thread의 경우 30 fps 영상 98개 채널을 실시간으로 처리 가능하다.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.409-418
• /
• 1999

The fractal image compression is based on the self-similarity that some area in an image exhibits a very similar shape with other areas. This compression technique has very long encoding time although it has high compression ratio and fast decompression. To cut-off the encoding time, most researches have restricted the search of domain blocks for a range block. These researches have been mainly focused on the coherence between a domain block and a range block, while they have not utilized the coherence among range blocks well. Therefore, we give an analysis on the coherence among range blocks in order to develope an efficient fractal Image compression algorithm. We analysis the range blocks according to not only measures for defining the range block coherence but also threshold of each measure. If these results are joined in a prior work of other fractal compression algorithms, it will give a great effectiveness in encoding time.

• Journal of the Korean Society of Radiology
• /
• v.11 no.4
• /
• pp.241-246
• /
• 2017

The existing fractal compression method is effective in generating an artificial shape by approximating its partial regions to a domain block by re-dividing the whole image into a domain region and dividing it into several domain blocks, but it is difficult to implement a computer. In this study, it is difficult to approximate a complex block such as a large-sized block and an affine transformation because a large amount of calculation is required in searching for a combination of similar blocks through a transformation, so a large amount of coding time is required.

• Journal of the Korean Society of Radiology
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same compression rate.

• Journal of Digital Contents Society
• /
• v.17 no.5
• /
• pp.433-439
• /
• 2016

In this paper, we propose a optimized steganography how to improve the image degradation of the existing data hiding techniques. This method operates in the compressed domain(JPEG) of an image. Most of the current information concealment methods generally change the coefficients to hide information. And several methods have tried to improve the performance of a typical steganography method such as F5 including a matrix encoding. Those papers achieved the object of reducing the distortion which is generated as hiding data in coefficients of compressed domain. In the proposed paper we analyzed the effect of the quantization table for hiding the data in the compressed domain. As a result, it found that can decrease the distortion that occur in the application of steganography techniques. This paper provides a little (Maximum: approximately 6.5%) further improved results in terms of image quality in a data hiding on compressed domain. Developed algorithm help improve the data hiding performance of compressed image other than the JPEG.

• Journal of the Korean Society of Radiology
• /
• v.13 no.4
• /
• pp.509-516
• /
• 2019

In the linear transformation method, the original image is divided into a plurality of range blocks, and a partial transform system for finding an optimal domain block existing in the image for each range block is used to adjust the performance of the compression ratio and the picture quality, The nonlinear transformation method uses only the rotation transformation among eight shuffle transforms. Since the search is performed only in the limited domain block, the coding time is faster than the linear transformation method of searching the domain block for any block in the image, Since the optimal domain block for the range block can not be selected in the image, the performance may be lower than other methods. Therefore, the nonlinear transformation method improves the performance by increasing the approximation degree of the brightness coefficient conversion instead of selecting the optimal domain block, The smaller the size of the block, the higher the PSNR value, The higher the compression ratio is increased groups were quadtree block divided to encode the image at best.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.180-181
• /
• 2018

JPEG is a most widely used standard image compression technology. This research introduces the JPEG image compression algorithm and describes each step in the compression and decompression. Image compression is the application of data compression on digital images. The DCT (discrete cosine transform) is a technique for converting a time domain to a frequency domain. First, the image is divided into 8 by 8 pixel blocks. Second, working from top to bottom left to right, the DCT is applied to each block. Third, each block is compressed through quantization. Fourth, the array of compressed blocks that make up the image is stored in a greatly reduced amount of space. Finally if desired, the image is reconstructed through decompression, a process using IDCT (inverse discrete cosine transform).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.107-110
• /
• 2018

Image compression is the application of Data compression on digital images. The (DCT) discrete cosine transform is a technique for converting a time domain to a frequency domain. It is widely used in image compression. First, the image is divided into 8x8 pixel blocks. Apply the DCT to each block while processing from top to bottom from left to right. Each block is compressed through quantization. The space of the compressed block array constituting the image is greatly reduced. Reconstruct the image through the IDCT. The purpose of this research is to understand compression/decompression of images using the DCT method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.429-434
• /
• 1997

영상 평활화(Image Smoothing) 작업은 영상 신호 표본화, 정량화, 통신 이동과 같은 과정을 거치면서 잡음 등의 불필요한 신호가 포함된 디지털 영상의 잡음을 감소키는데 많이 이용되고 있다. 이와 같은 영상 평활화 작업에는 대부분 전역적인 공간 영역 혹은 주파수 영역의 전역적인 필터링 기법이 이용되고 있다. 그러나, 기존의 방법들은 왜곡된 잡음 픽셀들의 정보를 그대로 반영하기 때문에 잡음 제거 결과 복원 영상의 선명도는 크게 저해된다. 본 논문에서는 특히나 양자화 과정을 통해 잡음 정보의 변형이 극대화되어지는 압축 영상을 대상으로 하여 적절한 잡음제거 기법을 제안하고자 한다. 특히, 압축 영상의 잡음 추출은 1차 복호화 후의 공간 도메인에서, 추출된 잡음 제거는 주파수 도메인에서 수행함으로써 2차 복호화 후의 잡음제거 결과 영상은 압축 영상의 잡음 제거에 따른 본질적인 문제를 해결하였으며, 실험 결과 역시 다른 기존의 방법에 비해 우수한 성능을 발휘하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.11a
• /
• pp.160-162
• /
• 2018

본 논문에서는 압축 영역에서 열 영상을 이용한 딥러닝 기반의 객체 검출 방법을 제안한다. 비디오 압축 표준인 High Efficiency Video Coding(HEVC)를 이용하여 부보화된 비트스트림으로부터 Intra Prediction Mode(IPM), Prediction Unit Size(PUS), Transform Unit Size(TUS)를 추출하고 3 채널 영상으로 변환하고 객체 검출 네트워크인 YOLO 에 입력으로 넣어주어 최종적으로 객체의 위치 및 객체의 종류를 예측한다. 실험결과로써 복원된 열 영상과 검출된 결과를 주관적으로 보여줌으로써 압축영역에서 열영상을 이용한 객체 검출이 가능함을 보인다.