• Title/Summary/Keyword: Reference block

Search Result 425, Processing Time 0.029 seconds

An Efficient Inter-Prediction Hardware Design for the H.264/AVC Decoder (H.264/AVC 디코더를 위한 효율적인 인터 예측 하드웨어 구조 설계)

  • Jin, Xianzhe;Ryoo, Kwangki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.112-115
    • /
    • 2009
  • Inter-Prediction is always the main bottleneck in H.264/AVC Baseline Profile. This paper describes an efficient Inter-Prediction hardware architecture design. H.264/AVC decoder supports various block types such as $16{\times}16$, $16{\times}8$, $8{\times}16$, $8{\times}8$, $8{\times}4$, $4{\times}8$, $4{\times}4$ block types. Reference Software(JM) only considers the $4{\times}4$ block type when the reference block is being fetched. This causes duplicated pixels which needs extra fetch cycles. In order to eliminate some of the duplicated pixels, the $8{\times}8$ and $4{\times}4$ block types were considered in the previous design. If the block size is larger than or equal to the $8{\times}8$ block type, it will be separated into several $8{\times}8$ block types and if the block size is smaller than the $8{\times}8$ block type it will be separated into several $4{\times}4$ blocks. For further reduction of the fetch cycles, the various block types are considered in this paper. As a result, the maximum cycle reduction percentage is 18.6% comparing with the previous design.

  • PDF

A Stable Model Reference Adaptive Control with a Generalized Adaptive Law (일반화된 적응법칙을 사용한 안정한 기준모델 적응제어)

  • 이호진;최계근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.8
    • /
    • pp.1167-1177
    • /
    • 1989
  • In this paper, a generalized adaptive law is proposed which uses a rational function type operator for parameter adjustment. To satisfy the passivity condition of the adaptation block, we introduce a constant feedback gain into the adaptation block. This adaptation scheme is applied to the model reference adaptive control of a continuous-time, linear time-invariant, minimum-phase system whose relative degree is 1. We prove the asymptotic stability of the output error of this adaptive system by hyperstability method. It is shown that by digital computer simulations this law can give a better output error transient response in some cases than the conventional gradient adaptive law. And the output error responses for the several types of the proposed adaptation law are examined in the presence of a kind of unmodeled dynamics.

  • PDF

Multi-Hypothesis Error Concealment Algorithm for H.26L Video (H.26L을 위한 다차원 에러 은닉 기법)

  • 박영오;김창수;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11C
    • /
    • pp.1130-1139
    • /
    • 2003
  • In this work, we propose a multi-hypothesis error concealment algorithm, which replaces a lost block with a weighted superposition of more than two reference blocks in previous frames. Three methods are developed to find the set of reference blocks and determine the weighting coefficients. These methods are implemented based on H.26L standard, and their performances are evaluated. It is shown that the proposed multi-hypothesis algorithm provides up to 1.5㏈ better PSNR performance than the conventional single-hypothesis concealment algorithm.

Dynamic Cache Partitioning Strategy for Efficient Buffer Cache Management (효율적인 버퍼 캐시 관리를 위한 동적 캐시 분할 블록교체 기법)

  • 진재선;허의남;추현승
    • Journal of the Korea Society for Simulation
    • /
    • v.12 no.2
    • /
    • pp.35-44
    • /
    • 2003
  • The effectiveness of buffer cache replacement algorithms is critical to the performance of I/O systems. In this paper, we propose the degree of inter-reference gap (DIG) based block replacement scheme that retains merits of the least recently used (LRU) such as simple implementation and good cache hit ratio (CHR) for general patterns of references, and improves CHR further. In the proposed scheme, cache blocks with low DIGs are distinguished from blocks with high DIGs and the replacement block is selected among high DIGs blocks as done in the low inter-reference recency set (LIRS) scheme. Thus, by having the effect of the partitioning the cache memory dynamically based on DIGs, CHR is improved. Trace-driven simulation is employed to verified the superiority of the DIG based scheme and shows that the performance improves up to about 175% compared to the LRU scheme and 3% compared to the LIRS scheme for the same traces.

  • PDF

The Study on the Effect of Vision Training System (시기능 훈련 시스템을 이용한 훈련 효과에 관한 연구)

  • Lee, Chang-Seon;Son, Jeong-Sik;Kim, In-Su;Kang, Sung Soo;Lee, Dong-Hee;Kim, Ki-Hong
    • Journal of Korean Ophthalmic Optics Society
    • /
    • v.14 no.1
    • /
    • pp.81-86
    • /
    • 2009
  • Purpose: We developed the MYSTERY CIRCLE vision training program which was suitable for Korean people. We compared it with the established programs, Block string and Anaglyphs in aspect of functional, sensory, and symptomatical changes of binocular vision. Mehtods: The vision training observation group included 75 clients (male=40, female=35) who had binocular vision disorders without opthalmic diseases or vertical phoria. Results: According to the results, all training methods showed improvement of binocular vision function, sensation and symptoms. But the Block String had low participation, reference rate of subjects and success rate and showed the different degree of improvement depending on individuals. Anaglyphs method showed high participation and improvement. But it had a low degree of success rate and preference rate. Conclusions: MYSTERY CIRCLE method showed the highest participation, reference rate of subjects, success rate, and high degree of improvement. Therefore we suggest that MYSTERY CIRCLE is an effective and alternative method for binocular vision disorder therapy.

  • PDF

Behavior of lightweight aggregate concrete voided slabs

  • Adel A. Al-Azzawi;Ali O, AL-Khaleel
    • Computers and Concrete
    • /
    • v.32 no.4
    • /
    • pp.351-363
    • /
    • 2023
  • Reducing the self-weight of reinforced concrete structures problem is discussed in this paper by using two types of self-weight reduction, the first is by using lightweight coarse aggregate (crushed brick) and the second is by using styropor block. Experimental and Numerical studies are conducted on (LWAC) lightweight aggregate reinforced concrete slabs, having styropor blocks with various sizes of blocks and the ratio of shear span to the effective depth (a/d). The experimental part included testing eleven lightweight concrete one-way simply supported slabs, comprising three as reference slabs (solid slabs) and eight as styropor block slabs (SBS) with a total reduction in cross-sectional area of (43.3% and 49.7%) were considered. The holes were formed by placing styropor at the ineffective concrete zones in resisting the tensile stresses. The length, width, and thickness of specimen dimensions were 1.1 m, 0.6 m, and 0.12 m respectively, except one specimen had a depth of 85 mm (which has a cross-sectional area equal to styropor block slab with a weight reduction of 49.7%). Two shear spans to effective depth ratios (a/d) of (3.125) for load case (A) and (a/d) of (2) for load case (B), (two-line monotonic loads) are considered. The test results showed under loading cases A and B (using minimum shear reinforcement and the reduction in cross-sectional area of styropor block slab by 29.1%) caused an increase in strength capacity by 60.4% and 54.6 % compared to the lightweight reference slab. Also, the best percentage of reduction in cross-sectional area is found to be 49.7%. Numerically, the computer program named (ANSYS) was used to study the behavior of these reinforced concrete slabs by using the finite element method. The results show acceptable agreement with the experimental test results. The average difference between experimental and numerical results is found to be (11.06%) in ultimate strength and (5.33%) in ultimate deflection.

A Boundary Matching and Post-processing Method for the Temporal Error Concealment in H.264/AVC (H.264/AVC의 시간적 오류 은닉을 위한 경계 정합과 후처리 방법)

  • Lee, Jun-Woo;Na, Sang-Il;Won, In-Su;Lim, Dae-Kyu;Jeong, Dong-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1563-1571
    • /
    • 2009
  • In this paper, we propose a new boundary matching method for the temporal error concealment and a post processing algorithm for perceptual quality improvement of the concealed frame. Temporal error concealment is a method that substitutes error blocks with similar blocks from the reference frame. In conventional H.264/AVC standard, it compares outside pixels of erroneous block with inside pixels of reference block to find the most similar block. However, it is very possible that the conventional method substitutes erroneous block with the wrong one because it compares only narrow spatial range of pixels. In this paper, for substituting erroneous blocks with more correct blocks, we propose enhanced boundary matching method by comparing inside and outside pixels of reference block with outside pixels of erroneous block and setting up additional candidate motion vector in the fixed search range based on maximum and minimum value of candidate motion vectors. Furthermore, we propose a post processing method to smooth edges between concealed and decoded blocks without error by using the modified deblocking filter. We identified that the proposed method shows quality improvement of about 0.9dB over the conventional boundary matching methods.

  • PDF

Moving Object Detection Algorithm for Surveillance System (무인 감시 시스템을 위한 이동물체 검출 알고리즘)

  • Lim Kang-mo;Lee Joo-shin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.44-53
    • /
    • 2005
  • In this paper, a improved moving object detection algorithm for stable performance of surveillance system in case of iterative moving in limited area and rapidly illuminance change in background scene is proposed. The proposed algorithm is that background scenes are sampled for initializing background image then the sampled fames are divided by block and sum of graylevel value for each block pixel was calculated, respectively. The initialization of background image is that background frame is respectively reconstructed with selecting only the maximum graylevel value and the minimum graylevel value of blocks located at same position between adjacent frames, then reference images of background are set by the reconstructed background images. Moving object detecting is that the current image frame is divided by block then sum of graylevel value for each block pixel is calculated. If the calculated value is out of graylevel range of the initialized two reference images, it is decided with moving objects block, otherwise it is decided background. The evaluated results is that the error rate of the proposed method is less than the error rate of the existing methods from $0.01{\%}$ to $20.33{\%}$ and the detection rate of the proposed method is better than the existing methods from $0.17{\%}\;to\;22.83{\%}$.

Fast Quadtree Based Normalized Cross Correlation Method for Fractal Video Compression using FFT

  • Chaudhari, R.E.;Dhok, S.B.
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.519-528
    • /
    • 2016
  • In order to achieve fast computational speed with good visual quality of output video, we propose a frequency domain based new fractal video compression scheme. Normalized cross correlation is used to find the structural self similar domain block for the input range block. To increase the searching speed, cross correlation is implemented in the frequency domain using FFT with one computational operation for all the domain blocks instead of individual block wise calculations. The encoding time is further minimized by applying rotation and reflection DFT properties to the IFFT of zero padded range blocks. The energy of overlap small size domain blocks is pre-computed for the entire reference frame and retaining the energies of the overlapped search window portion of previous adjacent block. Quadtree decompositions are obtained by using domain block motion compensated prediction error as a threshold to control the further partitions of the block. It provides a better level of adaption to the scene contents than fixed block size approach. The result shows that, on average, the proposed method can raise the encoding speed by 48.8 % and 90 % higher than NHEXS and CPM/NCIM algorithms respectively. The compression ratio and PSNR of the proposed method is increased by 15.41 and 0.89 dB higher than that of NHEXS on average. For low bit rate videos, the proposed algorithm achieve the high compression ratio above 120 with more than 31 dB PSNR.

A Dual-compensated Charge Pump for Reducing the Reference Spurs of a Phase Locked Loop (위상 고정 루프의 기준 스퍼를 감소시키기 위한 이중 보상 방식 전하 펌프)

  • Lee, Dong-Keon;Lee, Jeong-Kwang;Jeong, Hang-Geun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.2
    • /
    • pp.465-470
    • /
    • 2010
  • The charge pump in a phase-locked loop is a key block in determining reference spurs of the VCO output signal. To reduce reference spurs, the current mismatch in the charge pump must be minimized. This paper presents a dual compensation method to reduce the current mismatch. The proposed charge pump and PLL were realized in a $0.18{\mu}m$ CMOS process. Measured current matching characteristics were achieved with less than 1.4% difference and with the current variation of 3.8% in the pump current over the charge pump output voltage range of 0.35-1.35V at 1.8V. The reference spur of the PLL based on the proposed charge pump was measured to be -71dBc.