• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.257-264
• /
• 2015

In this paper, Enhanced binary block matching method for Constrained one-bit transform (C1BT) based motion estimation is proposed. Binary motion estimation exploits the Number of non-matched points (NNMP) as a block matching criterion instead of the Sum of Absolute Differences (SAD) for low complex motion estimation. The motion estimation using SAD could use the smaller block for more accurate motion estimation. In this paper the enhanced binary block matching method using smaller motion estimation block for C1BT is proposed to the more accurate binary matching. Experimental results shows that the proposed algorithm has better Peak Signal to Noise Ration (PSNR) results compared with conventional binary transform algorithms.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.355-361
• /
• 2010

Video Compression is the key technology for the transmission of multi-media data. Because the Motion Estimation is the most complex module in the video compression, fast motion estimation algorithm is essential for the real-time application. In this paper, we propose an enhanced binary motion estimation algorithm based on the wavelet transform. Proposed algorithm improve the quality of coded video.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed 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 the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.647-656
• /
• 2011

Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

• Journal of Korea Multimedia Society
• /
• v.24 no.2
• /
• pp.305-311
• /
• 2021

One of the highly reliable object tracking methods is to trace objects by associating objects detected by deep learning. The detected object is represented by a rectangular box. The box has information such as location and size. Since the tracker has motion information of the object in addition to the location and size, knowing additional information about the motion of the detected box can increase the reliability of object tracking. In this paper, we present a new method of reliably estimating the moving direction of the detected object in underground parking lot. First, the frame difference image is binarized for detecting motion energy, change due to the object motion. Then, a cumulative binary image is generated that shows how the motion energy changes over time. Next, the moving direction of the detected box is estimated from the accumulated image. We use a new cost function to accurately estimate the direction of movement of the detected box. The proposed method proves its performance through comparative experiments of the existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.946-953
• /
• 2004

Fast search and conventional boolean matching motion estimation algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than Full search Algorithm(FA). This paper present new all binary block matching algorithm, called Bit Converted All Binary Block Matching(BC-ABBM). Proposed algorithm have performance closed to the FA by boolean only block matching that may be very efficiently implemented in hardware for low bit rate video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.04dB loss than FA but is about 0.6 ∼ 1.4dB gain than fast search algorithm and conventional boolean matching algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1540-1548
• /
• 1999

We propose a multi-resolution motion estimation algorithm using adaptive search region. It is constructed in wavelet domain that a binary plane which represents the potential motion areas(PMA's) based on the temporal redundancy between video frames, and motion estimation is processed in the PMA's. We reduce the PMA's gradually as the resolution level is higher, considering the distribution of the energy in subband layers and the complexity. As compared with EMRME(enhanced multi-resolution motion estimation) method[7], simulation results show that computational amount and bit rate reduced to about 33 ~46 % and 10 ~l8% respectively in active image with similar PSNR, and computational amount reduced to about 37 ~65 % in small notion image with similar PSNR and bit rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1471-1481
• /
• 1998

In this paper, we propose a new digital image stabilization scheme based on the bit-plane matching. In the proposed algorithm, the conventional motion estimation algorithms are applied to the binary images extracted from the bit-plane images. It is shown that the computational complexity of the proposed algorithm can be significantly reduced by replacing the arithmetic calculations with the binary Boolean functions, while the accuracy of motion estimation is maintained. Furthermore, an adaptive algorithm for selecting a bit-plane in consideration of changes in external illumination can provide the robustness of the proposed algorithm. We compared the proposed algorithm with existing algorithms using root mean square error (RMSE) on the basis of the brute-force method, and proved experimentally that the proposed method detects the camera motion more accurately than existing algorithms. In addition, the proposed algorithm performs digital image stabilization with less computation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.639-648
• /
• 1994

This paper presents a new block matching algorithm in estimation of motion information that is important technology in compressing interframe. In estimation of motion information, we find differential image using two successive frame image in order to find required real time processing and accurate moving vector, the binary image is made of edge and find more accurate moving vectors by application quadtree method to parts including many moving according to this activity. The computer simulation results show that increased PSNR and reduced computation time.