• Title/Summary/Keyword: Overlapped Block

Search Result 81, Processing Time 0.024 seconds

Reduction of Block Overlap in Motion Estimation

  • Cho, Seongsoo;Shrestha, Bhanu;Lee, Jongsup
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.6 no.2
    • /
    • pp.10-12
    • /
    • 2014
  • This work is based on the motion estimation to handle the ill-posed nature. The algorithm used in this study that performs the motion estimation for overlapped block is used to calculate with using pixel of neighborhood block with higher correlation and present block by considering the correlation level of neighborhood block. The proposed method shows in a significant improvement in the quality of the mothion field when comparing the conventional methods.

Efficient Distributed Video Coding System and Performance Analysis Using Lapped Transform (Lapped Transform을 이용한 효율적인 분산 동영상 부호화 시스템 및 성능해석)

  • Kang, Soo-Kyung;Lee, Chang-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.9C
    • /
    • pp.564-572
    • /
    • 2011
  • Distributed video coding (DVC) system has been proposed to reduce encoder complexity by using the correlation of frames in decoders. Since the block based motion estimation operation is not performed in the encoder of DVC system, lapped transforms, in which adjacent two blocks are transformed into one block, can be efficiently used in the DVC system. In this paper, an efficient DVC system using lapped transforms is proposed. The overlapped block motion compensated interpolation is used to produce side information, and the corresponding correlation noise between original Wyner-Ziv frame and side information is modeled. Extensive computer simulations show that the proposed DVC system outperforms conventional DVC systems.

Efficient One-dimensional VLSI array using the Data reuse for Fractal Image Compression (데이터 재사용을 이용한 프랙탈 영상압축을 위한 효율적인 일차원 VLSI 어레이)

  • 이희진;이수진;우종호
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.265-268
    • /
    • 2001
  • In this paper, we designed one-dimensional VLSI array with high speed processing in Fractal image compression. fractal image compression algorithm partitions the original image into domain blocks and range blocks then compresses data using the self similarity of blocks. The image is partitioned into domain block with 50% overlapping. Domain block is reduced by averaging the original image to size of range block. VLSI array is trying to search the best matching between a range block and a large amount of domain blocks. Adjacent domain blocks are overlapped, so we can improve of each block's processing speed using the reuse of the overlapped data. In our experiment, proposed VLSI array has about 25% speed up by adding the least register, MUX, and DEMUX to the PE.

  • PDF

Frame Rate Up Conversion Method using Partition Block OBMC and Improved Adaptively Weighted Vector Median (분할 블록 OBMC와 개선된 적응 가중 중간값 필터를 이용한 프레임률 증가 기법)

  • Kim, Geun-Tae;Ko, Yun-Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.1
    • /
    • pp.1-12
    • /
    • 2019
  • This paper proposes a new motion vector smoothing and motion compensation method to increase the frame rate of videos. The proposed method reduces false motion vector smoothing by improving the weight with reflecting accuracy to overcome the limitation of the conventional motion vector smoothing using the adaptively weighted vector median. Also, to improve the interpolated image quality of the conventional OBMC(Overlapped Block Motion Compensation), a scheme that divides an original block into 4 sub-blocks and then generates the interpolated frame using the reestimated motion vector for each sub-block is proposed. The simulation results prove that the proposed method can provide much better objective and subjective image quality than the conventional method.

An Advanced Contrast Enhancement Using Partially Overlapped Sub-Block Histogram Equalization (서브블록 히스토그램 등화기법을 이용한 개선된 콘트래스트 강화 알고리즘)

  • Kim, Joung-Youn;Kim, Lee-Sup;Hwang, Seung-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.58-66
    • /
    • 1999
  • In this paper, an advanced histogram equalization algorithm for contrast enhancement is presented. Histogram equalization is the most popular algorithm. Global histogram equalization is simple and fast, but its contrast enhancement power is relatively low. Local histogram equalization, on the other hand, can enhance overall contrast more effectively, but the complexity of computation required is very high. In this paper, a low pass filter type mask is used to get a sub-block histogram equalization function to more simply produce the high contrast. The low pass filter type mask is realized by partially overlapped sub-block histogram equalization (POSHE). With the proposed method. the computation overhead is reduced by a factor of about one hundred compared to that of local histogram equalization while still achieving high contrast.

  • PDF

Characterization of Poly(ethylene oxide)-b-Poly(L-lactide) Block Copolymer by Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry

  • Jeongmin Hong;Donghyun Cho;Taihyun Chang;Shim, Woo-Sun;Lee, Doo-Sung
    • Macromolecular Research
    • /
    • v.11 no.5
    • /
    • pp.341-346
    • /
    • 2003
  • A poly(ethylene oxide)-b-poly(L-lactide) diblock copolymer (PEO-b-PLLA) is characterized by matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS) and a block length distribution map is constructed. Although the MALDI- TOF mass spectrum of PEO-b-PLLA is very complicated, most of the polymer species were identified by isolating the overlapped isotope patterns and by fitting the overlapped peaks to the Schulz-Zimm distribution function. Reconstructed MALDI-TOF MS spectrum was nearly identical to the measured spectrum and this method shows its potential to be developed as an easy and fast analysis method of low molecular weight block copolymers.

A Fast Normalized Cross Correlation-Based Block Matching Algorithm Using Multilevel Cauchy-Schwartz Inequality

  • Song, Byung-Cheol
    • ETRI Journal
    • /
    • v.33 no.3
    • /
    • pp.401-406
    • /
    • 2011
  • This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.

Modified Overlapped Block-based Motion Estimation Algorithm (개선된 중첩 블록기반 움직임 추정 알고리즘)

  • Kwak, Tong-Ill;Kim, Beom-Yong;Yun, Jong-Ho;Cho, Hwa-Hyun;Choi, Myung-Ryul
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.271-272
    • /
    • 2007
  • In this paper, we propose a modified overlapped block-based motion estimation(MOBME) algorithm for a frame rate up conversion. The proposed method performs motion estimation based on the OBME and FSME. The proposed method shows better performance in estimating the true motion than the conventional method.

  • PDF

A Context-based Fast Encoding Quad Tree Plus Binary Tree (QTBT) Block Structure Partition

  • Marzuki, Ismail;Choi, Hansol;Sim, Donggyu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2018.06a
    • /
    • pp.175-177
    • /
    • 2018
  • This paper proposes an algorithm to speed up block structure partition of quad tree plus binary tree (QTBT) in Joint Exploration Test Model (JEM) encoder. The proposed fast encoding of QTBT block partition employs three spatially neighbor coded blocks, such as left, top-left, and top of current block, to early terminate QTBT block structure pruning. The propose algorithm is organized based on statistical similarity of those spatially neighboring blocks, such as block depths and coded block types, which are coded with overlapped block motion compensation (OBMC) and adaptive multi transform (AMT). The experimental results demonstrate about 30% encoding time reduction with 1.3% BD-rate loss on average compared to the anchor JEM-7.1 software under random access configuration.

  • PDF

A Systolic Array for High-Speed Computing of Full Search Block Matching Algorithm

  • Jung, Soon-Ho;Woo, Chong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.10
    • /
    • pp.1275-1286
    • /
    • 2011
  • This paper proposes a high speed systolic array architecture for full search block matching algorithm (FBMA). The pixels of the search area for a reference block are input only one time to find the matched candidate block and reused to compute the sum of absolute difference (SAD) for the adjacent candidate blocks. Each row of designed 2-dimensional systolic array compares the reference block with the adjacent blocks of the same row in search area. The lower rows of the designed array get the pixels from the upper row and compute the SAD with reusing the overlapped pixels of the candidate blocks within same column of the search area. This designed array has no data broadcasting and global paths. The comparison with existing architectures shows that this array is superior in terms of throughput through it requires a little more hardware.