An improvement of bottom-up variable-sized block matching technique for video compression

2002 ◽  
Author(s):  
Chin-Chen Chang ◽  
Lin-Li Chen ◽  
Tung-Shou Chen
Keyword(s):  
Video Compression ◽  
Block Matching ◽  
Bottom Up ◽  
Matching Technique

An improvement of bottom-up variable-sized block matching technique for video compression

1998 ◽  
Vol 44 (4) ◽  
pp. 1234-1242 ◽  
Author(s):  
Chin-Chen Chang ◽  
Lin-Li Chen ◽  
Tung-Shou Chen
Keyword(s):  
Video Compression ◽  
Block Matching ◽  
Bottom Up ◽  
Matching Technique

Adaptive Return Prediction Block Matching Algorithms for Video Coding

2011 ◽  
Vol 145 ◽  
pp. 277-281
Author(s):  
Vaci Istanda ◽  
Tsong Yi Chen ◽  
Wan Chun Lee ◽  
Yuan Chen Liu ◽  
Wen Yen Chen
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
Web Site ◽  
Motion Vector ◽  
Temporal Correlation ◽  
Block Matching ◽  
Asynchronous Learning ◽  
Learning And Teaching ◽  
Block Motion ◽  
Reconstruction Image

As the development of network learning, video compression is important for both data transmission and storage, especially in a digit channel. In this paper, we present the return prediction search (RPS) algorithm for block motion estimation. The proposed algorithm exploits the temporal correlation and characteristic of returning origin to obtain one or two predictive motion vector and selects one motion vector, which presents better result, to be the initial search center. In addition, we utilize the center-biased block matching algorithms to refine the final motion vector. Moreover, we used adaptive threshold technique to reduce the computational complexity in motion estimation. Experimental results show that RPS algorithm combined with 4SS, BBGDS, and UCBDS effectively improves the performance in terms of mean-square error measure with less average searching points. On the other hand, accelerated RPS (ARPS) algorithm takes only 38% of the searching computations than 3SS algorithm, and the reconstruction image quality of the ARPS algorithm is superior to 3SS algorithm about 0.30dB in average overall test sequences. In addition, we create an asynchronous learning environment which provides students and instructors flexibility in learning and teaching activities. The purpose of this web site is to teach and display our researchable results. Therefore, we believe this web site is one of the keys to help the modern student achieve mastery of complex Motion Estimation.

scholarly journals Bottom-up visual attention model for still image: a preliminary study

2020 ◽  
Vol 6 (1) ◽  
pp. 82
Author(s):  
Adhi Prahara ◽  
Murinto Murinto ◽  
Dewi Pramudi Ismi
Keyword(s):  
Visual Attention ◽  
Object Detection ◽  
Video Compression ◽  
Saliency Map ◽  
Bottom Up ◽  
Attention Model ◽  
Intrinsic Cues ◽  
Preliminary Study ◽  
Segmentation Image ◽  
Human Visual Attention

The philosophy of human visual attention is scientifically explained in the field of cognitive psychology and neuroscience then computationally modeled in the field of computer science and engineering. Visual attention models have been applied in computer vision systems such as object detection, object recognition, image segmentation, image and video compression, action recognition, visual tracking, and so on. This work studies bottom-up visual attention, namely human fixation prediction and salient object detection models. The preliminary study briefly covers from the biological perspective of visual attention, including visual pathway, the theory of visual attention, to the computational model of bottom-up visual attention that generates saliency map. The study compares some models at each stage and observes whether the stage is inspired by biological architecture, concept, or behavior of human visual attention. From the study, the use of low-level features, center-surround mechanism, sparse representation, and higher-level guidance with intrinsic cues dominate the bottom-up visual attention approaches. The study also highlights the correlation between bottom-up visual attention and curiosity.

High Performance Architecture of Motion Estimation Algorithm for Video Compression

2016 ◽  
Vol 25 (08) ◽  
pp. 1650083
Author(s):  
P. Muralidhar ◽  
C. B. Rama Rao
Keyword(s):  
Motion Estimation ◽  
Video Compression ◽  
High Performance ◽  
Estimation Algorithm ◽  
Block Matching ◽  
High Definition ◽  
Systolic Architecture ◽  
Hardware Architectures ◽  
Computationally Intensive ◽  
Full Search

Motion estimation (ME) is a highly computationally intensive operation in video compression. Efficient ME architectures are proposed in the literature. This paper presents an efficient low computational complexity systolic architecture for full search block matching ME (FSBME) algorithm. The proposed architecture is based on one-bit transform-based full search (FS) algorithm. The proposed ME hardware architectures perform FS ME for four macroblocks (MBs) in parallel. The proposed hardware architecture is implemented in VHDL. The FSBME hardware consumes 34% of the slices in a Xilinx Vertex XC6vlx240T FPGA device with a maximum frequency of 133[Formula: see text]MHz and is capable of processing full high definition (HD) ([Formula: see text]) frames at a rate of 60 frames per second.

Sign in / Sign up

Export Citation Format

Share Document