• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.272-279
• /
• 2008

Shot change detection is an important technique for effective management of video data, so detection scheme requires adaptive detection techniques to be used actually in various video. In this paper, we propose an adaptive shot change detection algorithm using the mean of feature value on variable reference blocks. Our algorithm determines shot change detection by defining adaptive threshold values with the feature value extracted from video frames and comparing the feature value and the threshold value. We obtained better detection ratio than the conventional methods maximally by 15% in the experiment with the same test sequence. We also had good detection ratio for other several methods of feature extraction and could see realtime operation of shot change detection in the hardware platform with low performance was possible by implementing it in TVUS model of HOMECAST company. Thus, our algerian in the paper can be useful in PMP(portable multimedia player) or other portable players.

• The KIPS Transactions:PartB
• /
• v.9B no.2
• /
• pp.199-204
• /
• 2002

Since motion estimation and motion compensation methods remove the redundant data to employ the temporal redundancy in images, it plays an important role in digital video compression. Because of its high computational complexity, however, it is difficult to apply to high-resolution applications in real time environments. If we have information about the motion of an image block before the motion estimation, the location of a better starting point for the search of an exact motion vector can be determined to expedite the searching process. In this paper, we present an adaptive motion estimation approach bated on temporal correlations of consecutive image frames that defines the search pattern and determines the location of the initial search point adaptively. Through experiments, compared with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(dB) better than DS in terms of PSNR(Peak Signal to Noise Ratio) and improves as high as 50% compared with DS in terms of average number of search point per motion vector estimation.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.223-232
• /
• 2005

In this paper, we propose a novel post-filtering algorithm with low computational complexity that improves the visual quality of decoded images using block boundary classification and simple adaptive filter (SAF). At first, each block boundary is classified into smooth or complex sub-region. And for smooth-smooth sub-regions, the existence of blocking artifacts is determined using blocky strength. And simple adaptive filtering is processed in each block boundary area. The proposed method processes adaptively, that is, a nonlinear 1-D 8-tap filter is applied to smooth-smooth sub-regions with blocking artifacts, and for smooth-complex or complex-smooth sub-regions, a nonlinear 1-D variant filter is applied to block boundary pixels so as to reduce the blocking and ringing artifacts. And for complex-complex sub-regions, a nonlinear 1-D 2-tap filter is only applied to adjust two block boundary pixels so as to preserve the image details. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjective and objective viewpoints.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.8
• /
• pp.3697-3705
• /
• 2011

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose a new prediction search algorithm for block matching using the temporal and spatial correlation of the video sequence and local statistics of neighboring motion vectors. The proposed ANBA(Adaptive Neighboring-Block Search Algorithm) determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and use a previous motion vector. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06dB as depend on the video sequences and improved about 0.01~0.64dB over MVFAST and PMVFAST.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.108-117
• /
• 2015

If typical contrast enhancement algorithms for natural images are applied to X-ray images, they may cause artifacts such as overshooting or produce unnatural visual quality because they do not consider inherent characteristics of X-ray images. In order to overcome such problems, we propose a locally adaptive block-based contrast enhancement algorithm for X-ray images. After we derive a weighted cumulative distribution function for each block, we apply it to each block for contrast enhancement. Then, we obtain images that are removed from block effect by adopting block-based overlapping. In post-processing, we obtain the final image by emphasizing high frequency components. Experimental results show that the proposed block-based contrast enhancement algorithm provides at maximum 5-times higher visual quality than the exiting algorithm in terms of quantitative contrast metric.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.347-350
• /
• 2003

In this paper, a new automated defects detection method for a TFT-LCD panel is presented. An input image is preprocessed to lessen small abnormal noises and non-uniformity of the image. The adaptive multi-thresholds are used to detect Muras, which are the major defects occurred on TFT-LCD panels. Those are determined adaptively depending on the brightness and the brightness distribution of a local block. For the synthetic images and real Mura images, the proposed algorithm can effectively detect Muras in a reasonable time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.85-91
• /
• 2015

This paper presents a novel frame rate up-conversion (FRUC) algorithm. Existing algorithms, in general, employ rectangular blocks for motion estimation and arbitrary shape of an actual object region cannot be precisely represented. On the other hand, the proposed wedge-shaped block partitioning algorithm partitions a rectangular block into two wedge-shaped blocks using the texture information, which makes better approximation for an actual object region. The wedge-shaped block partitioning algorithm as well as the adaptive motion vector prediction algorithm is used to reliably estimate the actual motion. Experimental results show that the proposed FRUC algorithm is superior to existing algorithms up to 1.988dB in PSNR and 0.0167 in SSIM comparisons.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.57-64
• /
• 2006

Motion estimation plays an important role for the compression of video signals. The proposed method utilizes an adaptive threshold and characteristics of a distribution of SAD (sum of absolute difference). Generally, the more complex the SAD distribution is, the larger SAD value tends to be. This proposed algorithm tries to reduce the search points in a simple distribution but increase them in a complex distribution to avoid local minima. A macro block is divided into 9 areas. One of them chosen using spatio-temporal correlation is called the primary area and the others are called the secondary area that will be searched to avoid local minima. The proposed algorithm decides if just one area (the primary area or the secondary area) will be enough to be searched or both areas should be searched, using adaptive threshold. Compared with famous motion estimation algorithms, the simulation result shows that the searching points per macro block and MSE decreases about 16.4% and 32.83 respectively on the average.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4603-4624
• /
• 2016

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9B
• /
• pp.1292-1298
• /
• 2001

본 논문에서는 공간 영역에서의 블록 분류 (block classification)와 순방향 신경망 필터(feedforward neural network filter)를 이용한 블록 기반 부호화에서의 적응적 블록화 현상 제거 알고리듬을 제안하였다. 제안한 방법에서는 각 블록 경계를 인접 블록간의 통계적 특성을 이용하여 평탄 영역과 에지 영역으로 분류한 후, 각 영역에 대하여 블록화 현상이 발생하였다고 분류된 클래스에 대하여 적응적인 블록간 필터링을 수행한다. 즉, 평탄 영역으로 분류된 영역 중 블록화 현상이 발생한 영역은 오류 역전파 학습 알고리듬 (error backpropagation learning algorithm)에 의하여 학습된 2계층 (2-layer) 신경망 필터를 이용하여 블록화 현상을 제거하고, 복잡한 영역으로 분류된 영역 중 블록화 현상이 발생한 영역은 에지 성분을 보존하기 위하여 선형 내삽을 이용하여 블록간 인접 화소의 밝기 값만을 조정함으로써 블록화 현상을 제거한다. 모의 실험 결과를 통하여 제안한 방법이 객관적 화질 및 주관적 화질 측면에서 기존의 방법보다 그 성능이 우수함을 확인하였다.