• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.31-41
• /
• 2000

This paper proposes a block-based motion detection algorithm for digital video surveillance system which adaptively decides the threshold according to the kinds of images We first compute the features of a block after dividing each Image into small sub-block regions, and analyze performance of the motion detection algorithm based on statistic features by using the proposed threshold-decision method. Motion vectors are used to analyze motion degree and adaptively determine the threshold The simulation results show the performances of motion detection algorithms according to sub-block size, statistic features, noise, and threshold.

• ETRI Journal
• /
• v.30 no.4
• /
• pp.506-515
• /
• 2008

The H.264/AVC standard has adopted new coding tools such as intra-prediction, variable block size, motion estimation with quarter-pixel-accuracy, loop filter, and so on. The adoption of these tools enables an H.264/AVC-coded bitstream to have more information than was possible with previous standards. In this paper, we propose an effective spatial error concealment method with low complexity in H.264/AVC intra-frame. From information included in an H.264/AVC-coded bitstream, we use prediction modes of intra-blocks to recover a damaged block. This is because the prediction direction in each prediction mode is highly correlated to the edge direction. We first estimate the edge direction of a damaged block using the prediction modes of the intra-blocks adjacent to a damaged block and classify the area inside the damaged block into edge and flat areas. Our method then recovers pixel values in the edge area using edge-directed interpolation, and recovers pixel values in the flat area using weighted interpolation. Simulation results show that the proposed method yields better video quality than conventional approaches.

• 전자공학회논문지 IE
• /
• v.47 no.2
• /
• pp.54-59
• /
• 2010

This paper suggests a new data link protocol with an adaptive frame length control scheme for wireless data networks which is subject to errors that occur with time variance. We analyze the proposed scheme under a two-state markov block interference(BI) model. Numerical results show that the proposed scheme can achieve high throughput performance for both dense and diffuse burst noise channels.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.357-360
• /
• 1991

In this paper, we have introduced a network and showed how this can be realised as an adaptive equalizer. The walsh equlizer is built from a set of Walsh-Block pulse functions and LMS algorithms with the optimal convergence factor(C.F.). The convergence and the adaptation speed of this algorithms depends on the proper choice of a design factor $\mu$ called the C.F.. Conventional adaptation techniques use the fixed time constant C.F. by the method of trial and error. In this paper, we propose to adaptive C.F. which are optimally tailored to adapt C.F. in real time so that their values are kept optimum for a new set of input variables.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.327-329
• /
• 1992

This Paper presents an algorithm for improvement of convergence in Adaptive Filter. The proposed algorithm employes the time-varying Convergence Factor to Block LMS adaptation algorithm. Computer simulation for Adaptive Modeling of time-invarying and time-varying unknown systems has been performed. Performance comparisons between LMS, BLMS algorithms which have fixed Convergence factors obtained by trial and error and the proposed algorithm which has time-varying Convergence Factor show that the proposed algorithm is superior to LMS and BLMS algorithm with respect to speed and accuracy of adaptation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.2
• /
• pp.420-423
• /
• 2007

In this paper, an efficient nonlinear echo cancellation method is proposed, whereby the fast block exact Gauss-Seidel pseudo affine projection (FBEGS-PAP) is further utilized for adaptive Volterra filtering. In particular, the proposed nonlinear echo cancellation approach requires lower computational complexity as in the conventional linear adaptive echo cancellation methods based on NLMS and GS-PAP, and still provides nonlinear echo cancellation performance similar to the GS-PAP method. Finally, echo cancellation performance of the proposed approach is demonstrated by providing some simulation results.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.53-61
• /
• 2011

This research presents an adaptive fast motion estimation (ME) computation on the stage of uneven multi-hexagon grid search (UMHGS) algorithm included in an unsymmetrical-cross multi-hexagon-grid search (UMHexagonS) in H.264 standard. The proposed adaptive method is based on statistical analysis and previously obtained motion vectors to reduce the computational complexity of ME. For this purpose, the algorithm is decomposed into three processes: skipping, terminating, and reducing search areas. Skipping and terminating are determined by the statistical analysis of the collected minimum SAD (sum of absolute difference) and the search area is constrained by the slope of previously obtained motion vectors. Simulation results show that 13%-23% of ME time can be reduced compared with UMHexagonS, while still maintaining a reasonable PSNR (peak signal-to-noise ratio) and average bitrates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4375-4388
• /
• 2018

To solve the problem of transmission errors in stereoscopic images, this paper proposes a novel error concealment (EC) method using superpixel segmentation and adaptive disparity selection (SSADS). Our algorithm consists of two steps. The first step is disparity estimation for each pixel in a reference image. In this step, the numbers of superpixel segmentation labels of stereoscopic images are used as a new constraint for disparity matching to reduce the effect of mismatching. The second step is disparity selection for a lost block. In this step, a strategy based on boundary smoothness is proposed to adaptively select the optimal disparity which is used for error concealment. Experimental results demonstrate that compared with other methods, the proposed method has significant advantages in both objective and subjective quality assessment.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.668-671
• /
• 2006

In this letter, an adaptive scanning that improves intra coding efficiency in the H.264/AVC standard is proposed. The proposed adaptive scanning utilizes the prediction directions (modes) that include the horizontal and vertical edge information in a block. Depending on the prediction directions, the proposed method uses three scanning methods: zigzag scanning, horizontal scanning, and vertical scanning. In the proposed method, horizontal and vertical scanning are used in vertical and horizontal prediction modes, respectively, and the normal zigzag scanning in the H.264 standard is used in all other intra prediction modes. The proposed method reduces the bit rate by approximately 2.5% compared with H.264/AVC, without the degradation of video quality.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.129-136
• /
• 1994

In this paper an adaptive moving method of the search region tracking the motion is proposed. The search region in BMA is determined by the capability of hardware implementation and the degree of motion. But once determined nothing can be changed during coding procedure. In this paper we predict the level of motion of the current block using motion vectors of previous frames without overhead information and change the location of the search region according to the level of the motion predicted. In short the proposed method can be archieved the dsirable effect such that the size of search region gets large when the motion is large. Results of experiments show that prediction efficiency has been improved by using adaptive moving method resulting in reduced prediction error in the blocks with large motion.