• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.12-14
• /
• 2006

This paper presents a novel scene change detection method using intra prediction mode and edge direction in H.264/AVC. When scene change occurs, there are less temporal correlation between frames, most of macro-blocks encoded in intra mode. Using this property, the method calculates the percentage of intra mode blocks in each predictive frame in order to get candidates of scene change frame. To further find scene change, we obtain edge histogram of each candidates by using eight prediction direction of intra prediction mode in H.264/AVC. We detect scene change frames with $\iota^1$-norm of edge histograms. The experimental results show that the method is efficient and robust.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.766-768
• /
• 2003

Selectivity estimation for spatial query is curial in Spatial Database Management Systems(SDBMS). Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count arising from properties of spatial dataset, they can not get such effects in little memory space.* Therefore, we need to compress spatial dataset into little memory. In this paper, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results. Our method is based on two techniques:(a)MinSkew partitioning algorithm which deal with skewed spatial datasets. efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. The experimental result shows that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.346-349
• /
• 2013

화질향상에 큰 영향을 주는 요소 중의 하나는 명암대비 향상이다. 영상의 명암대비를 향상시키는 대표적인 방법으로 히스토그램 평활화(Histogram Equalization) 방법이 있으며, 히스토그램 평활화의 변형된 방법에 대한 다양한 연구가 이루어지고 있다. 그러나 기존의 방법들은 평균 밝기의 급격한 변화로 인하여 부자연스러운 결과영상을 얻거나, 대비 향상 효과가 낮은 결과를 얻는 단점이 종종 발생한다. 본 논문에서는 히스토그램 압축방법을 통해서 개선된 명암대비 향상 기법을 제안한다. 제안한 방법은 과도한 명암대비 증가로 인한 과포화 현상을 억제하기 위하여 히스토그램의 빈도수에 따라 히스토그램을 차등 압축시키도록 설계되어 있다. 실험결과 제안방법은 기존 방법에 비해 과포화 현상 없이 좋은 명암대비 향상 효과를 보였다.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.768-782
• /
• 2010

Because of the different shooting position between multi-view cameras and the imperfect camera calibration, Illumination mismatches of multi-view video can happen. This variation can bring about the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be applied to recompensate these inconsistencies in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However the histogram distribution can be different not only between neighboring views but also between sequential views on account of movements of camera angle and some objects, especially human. Therefore the histogram matching algorithm which references all frames in chose view is not appropriate for compensating the illumination differences of these sequence. Thus we propose new algorithms both the image classification algorithm which is applied two criteria to improve the correlation between inter-view frames and the histogram matching which references and matches with a group of pictures(GOP) as a unit to advance the correlation between successive frames. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.651-660
• /
• 2010

In this paper, we implement an efficient histogram-based prefiltering to compensate the illumination mismatches in regions between neighboring views. In multi-view video, such illumination disharmony can primarily occur on account of different camera location and orientation and an imperfect camera calibration. This discrepancy can cause the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be exploited to make up for these differences in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However general frames of multi-view video sequence are composed of several regions with different color composition and their histogram distribution which are mutually independent of each other. In addition, the location and depth of these objects from sequeuces captured from different cameras can be different with different frames. Thus we propose a new algorithm which classify a image into several subpartitions by its depth information first and then histogram matching is performed for each region individually. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional image-based algorithms.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.219-222
• /
• 2002

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. We use horizontal and vertical difference of LL components to select watermark insertion location, because increment or decrement of successive components is rarely changed in LL band. A pseudo-random sequence is used as a watermark. Experimental results show that the proposed method is robust to various kinds of attacks such as JPEG lossy compression, averaging, median filtering, resizing, histogram equalization, and additive Gaussian noise.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.12 no.4
• /
• pp.115-121
• /
• 2016

Recently, it has become an important problem to extract semantic objects from videos, which are useful for improving the performance of video compression and video retrieval. In this thesis, an automatic extraction method of moving objects of interest in video is suggested. We define that an moving object of interest should be relatively large in a frame image and should occur frequently in a scene. The moving object of interest should have different motion from camera motion. Moving object of interest are determined through spatial continuity by the AMOS method and moving histogram. Through experiments with diverse scenes, we found that the proposed method extracted almost all of the objects of interest selected by the user but its precision was 69% because of over-extraction.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.127-136
• /
• 2010

In multi-view video, illumination disharmony between neighboring views can occur on account of different location of each camera and imperfect camera calibration, and so on. Such discrepancy can be the cause of the performance decrease of multi-view video coding by mismatch of inter-view prediction which refer to the pictures obtained from the neighboring views at the same time. In this paper, we propose an efficient histogram-based prefiltering algorithm to compensate mismatches between the luminance and chrominance components in multi-view video for improving its coding efficiency. To compensate illumination variation efficiently, all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching. A Cosited filter that is used for chroma subsampling in many video encoding schemes is applied to each color component prior to histogram matching to improve its performance. The histogram matching is carried out in the RGB color space after color space converting from YCbCr color space. The effective color conversion skill that has respect to direction of edge and range of pixel value in an image is employed in the process. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with other methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.51-57
• /
• 2010

In this paper, It propose methods compressing BTC image utilizing data hiding technique. BTC is used to compress general digital image into binary image and applied into application such as printer. Additional information, transferred with binary image, is as big as the size of binary image. Therefore, we wish to reduce the total transmission bandwidth by decreasing the additional information with sustaining the small image degradation. Because typical BTC image doesn't have enough space for data hiding, we adopt Adaptive AMBTC (Absolute Moment BTC) algorithm to produce the binary image, and calculate virtual histogram from created binary image and modify this histogram for reducing the additional information. The proposed algorithm can reduce about 6-11 % of the image file size, compared with the existing BTC algorithm, without making perceptible image degradation.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.4
• /
• pp.87-94
• /
• 2007

Imbalances in focus, luminance and color between stereo Pairs could cause disparity vector estimation error and increment of transmission data. If the distribution of errors in residual image is large, it may influence to lowering of compression performance. Therefore, in this paper, we propose an efficient balancing method between stereo pairs to reduce the effect. For this, we registrated stereo images using a FFT based method to consider the pixels in the occluded region, we eliminated the pixels of blocks which has large error of disparity vector estimation in balancing function estimation. The balancing function has estimated using histogram specification, local information of target image and residual image between stereo images. Experiments show that the proposed method is effective in error distribution, PSNR and disparity vector estimation. We expect that our method can be improving compression efficiency in stereo coding system.