• Title/Summary/Keyword: Reference block

Search Result 426, Processing Time 0.03 seconds

Adaptive Shot Change Detection using Mean of Feature Value on Variable Reference Blocks and Implementation on PMP

  • Kim, Jong-Nam;Kim, Won-Hee
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.229-232
    • /
    • 2009
  • Shot change detection is an important technique for effective management of video data, so detection scheme requires adaptive detection techniques to be used actually in various video. In this paper, we propose an adaptive shot change detection algorithm using the mean of feature value on variable reference blocks. Our algorithm determines shot change detection by defining adaptive threshold values with the feature value extracted from video frames and comparing the feature value and the threshold value. We obtained better detection ratio than the conventional methods maximally by 15% in the experiment with the same test sequence. We also had good detection ratio for other several methods of feature extraction and could see real-time operation of shot change detection in the hardware platform with low performance was possible by implementing it in TVUS model of HOMECAST Company. Thus, our algorithm in the paper can be useful in PMP or other portable players.

  • PDF

Change of Electrical Characteristics of ZnO Arrester Blocks by Lightning Impulse Current (뇌충격전류에 의한 산화아연형 피뢰기 소자의 전기적 특성변화)

  • Gil, Gyeong-Seok;Han, Ju-Seop;Park, Yeong-Ho
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.48 no.7
    • /
    • pp.550-555
    • /
    • 1999
  • This paper deals with the effect of lightning impulse current on electrical characteristics of ZnO blocks used in distribution lightning arrester. The electrical characteristics of ZnO blocks are degraded by overtime impulse current, and the degraded ZnO block is brought to a thermal runaway and finally destroyed. It is therefore important to estimate the change of electrical characteristics of ZnO blocks. In this study, an impulse current generator which can produce 8/20$[\mus]$, 3[㎄] and 4/10$[\mus]$, 5[㎄] waveform is designed and fabricated to simulate the lightning impulse current of power systems. Total energy applied to the ZnO blocks at each time is 739[J] in 8/20$[\mus]$, and 523[J] in 4/10$[\mus]$, impulse current, respectively. From the experimental results, the 3rd harmonic of the leakage current increases continuously with the number of applied impulse current, but no significant changes in residual voltage and in reference voltage are observed until the ZnO block is destroyed. Also, it is confirmed that the main factor on degradation of ZnO blocks is rather the total energy applied to ZnO blocks than the peak value of the impulse current.

  • PDF

Ultrasonic Image of the Side Drilled Holes in SS Reference Block as Combining Bases of Support for Spatial Frequency Response

  • Koo, Kil-Mo;Song, Chul-Hwa;Beak, Won-Pil;Kang, Hee-Young
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.322-326
    • /
    • 2008
  • In this paper, we have studied the images which have been reconstructed by using combination of images acquired by the variation of operating frequency. When inner images have been reconstructed, they have been superposed by the surface state effect. In this case, the images of the phase object can be enhanced by the contrast of inner images. There is a kind of specimen, one is a reference block having 1/4T, 1/2T, 3/4T side drilled holes as main run piping material of the steam generator in nuclear power plants. It has been shown that the two results of defect shapes have better than before in this processing and phase contrast grow about twice. And we have constructed the acoustic microscope by using a quadrature detector that enables to acquire the amplitude and phase of the reflected signal simultaneously. Further more we have studied the reconstruction method of the amplitude and phase images, the enhancement method of the defect images' contrast.

  • PDF

A Novel Spiral-Type Motion Estimation Architecture for H.264/AVC

  • Hirai, Naoyuki;Song, Tian;Liu, Yizhong;Shimamoto, Takashi
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.10 no.1
    • /
    • pp.37-44
    • /
    • 2010
  • New features of motion compensation, such as variable block size and multiple reference frames are introduced in H.264/AVC. However, these new features induce significant implementation complexity increases. In this paper, an efficient architecture for spiral-type motion estimation is proposed. First, we propose a hardware-friendly spiral search order. Then, an efficient processing element (PE) architecture for ME is proposed to achieve the proposed search order. The improved PE enables one-pixel-move of the reference pixel data to top, bottom, right, and left by four ports for input and output. Moreover, the parallel calculation architecture to calculate all block size with the SAD of 4x4 is introduced in the proposed architecture. As the result of hardware implementation, the hardware cost is about 145k gates. Maximum clock frequency is 134 MHz in the case of FPGA (Xilinx Vertex5) implementation.

Intra Prediction Offset Compensation for Improving Video Coding Efficiency (영상 부호화 효율 향상을 위한 화면내 예측 오프셋 보상)

  • Lim, Sung-Chang;Lee, Ha-Hyun;Choi, Hae-Chul;Jeong, Se-Yoon;Kim, Jong-Ho;Choi, Jin-Soo
    • Journal of Broadcast Engineering
    • /
    • v.14 no.6
    • /
    • pp.749-768
    • /
    • 2009
  • In this paper, an intra prediction offset compensation method is proposed to improve intra prediction in H.264/AVC. In H.264/AVC, intra prediction based on various directions improves the coding efficiency by removing spatial correlation between neighboring blocks. In details, neighboring pixels in reconstructed block can be used as intra reference block for the current block to be coded when intra prediction method is used. In order to reduce further the prediction error of the intra reference block, the proposed method introduces an intra prediction offset which is determined in the sense of the rate-distortion optimization and is added to the conventional intra prediction block. Besides the intra prediction offset compensation, the coefficient thresholding method which is used for inter coding in JM 11.0, is used for chroma component in intra block, which leads the improvement of the luma coding efficiency of the proposed method. In experiments, we show that the proposed method achieves average 2.45% in High Profile condition and maximum 4.41% of bitrate reduction relative to JM 11.0.

An Intra Prediction Method and Fast Intra Prediction Method in Inter Frames using Block Content and Dependency Probabilities on neighboring Block Modes in H.264|AVC (영상 내용 특성과 주위 블록 모드 상관성을 이용한 H.264|AVC 화면 간 프레임에서의 화면 내 예측 부호화 결정 방법과 화면 내 예측 고속화 방법)

  • Na, Tae-Young;Lee, Bum-Shik;Hahm, Sang-Jin;Park, Chang-Seob;Park, Keun-Soo;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.12 no.6
    • /
    • pp.611-623
    • /
    • 2007
  • The H.264|AVC standard incorporates an intra prediction tool into inter frame coding. However, this leads to excessive amount of increase in encoding time, thus resulting in the difficulty in real-time implementation of software encoders. In this paper, we first propose an early decision on intra prediction coding and a fast intra prediction method using the characteristics of block contents and the context of neighboring block modes for the intra prediction in the inter frame coding of H.264/AVC. Basically, the proposed methods determine a skip condition on whether the $4{\times}4$ intra prediction is to be used in the inter frame coding by considering the content characteristics of each block to be encoded and the context of its neighboring blocks. The performance of our proposed methods is compared with the Joint Model reference software version 11.0 of H.264|AVC. The experimental results show that our proposed methods allow for 41.63% reduction in the total encoding time with negligible amounts of PSNR drops and bitrate increases, compared to the original Joint Model reference software version 11.0.

Enhanced Block Matching Scheme for Denoising Images Based on Bit-Plane Decomposition of Images (영상의 이진화평면 분해에 기반한 확장된 블록매칭 잡음제거)

  • Pok, Gouchol
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.3
    • /
    • pp.321-326
    • /
    • 2019
  • Image denoising methods based on block matching are founded on the experimental observations that neighboring patches or blocks in images retain similar features with each other, and have been proved to show superior performance in denoising different kinds of noise. The methods, however, take into account only neighboring blocks in searching for similar blocks, and ignore the characteristic features of the reference block itself. Consequently, denoising performance is negatively affected when outliers of the Gaussian distribution are included in the reference block which is to be denoised. In this paper, we propose an expanded block matching method in which noisy images are first decomposed into a number of bit-planes, then the range of true signals are estimated based on the distribution of pixels on the bit-planes, and finally outliers are replaced by the neighboring pixels belonging to the estimated range. In this way, the advantages of the conventional Gaussian filter can be added to the blocking matching method. We tested the proposed method through extensive experiments with well known test-bed images, and observed that performance gain can be achieved by the proposed method.

Block-based Adaptive Bit Allocation for Reference Memory Reduction (효율적인 참조 메모리 사용을 위한 블록기반 적응적 비트할당 알고리즘)

  • Park, Sea-Nae;Nam, Jung-Hak;Sim, Dong-Gy;Joo, Young-Hun;Kim, Yong-Serk;Kim, Hyun-Mun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.3
    • /
    • pp.68-74
    • /
    • 2009
  • In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm can obtain around 1.7% BD-bitrate gain and 0.03dB BD-PSNR gain, compared with the conventional fixed-bit min-max algorithm with 37.5% memory saving.

A Selective Motion Estimation Algorithm with Variable Block Sizes (다양한 블록 크기 기반 선택적 움직임 추정 알고리즘)

  • 최웅일;전병우
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.317-326
    • /
    • 2002
  • The adaptive coding schemes in H.264 standardization provide a significant ceding efficiency and some additional features like error resilience and network friendliness. The variable block size motion compensation using multiple reference frames is one of the key H.264 coding elements to provide main performance gain, but also the main culprit that increases the overall computational complexity. For this reason, this paper proposes a selective motion estimation algorithm based on variable block size for fast motion estimation in H.264. After we find the SAD(Sum of Absolute Difference) at initial points using diamond search, we decide whether to perform additional motion search in each block. Simulation results show that the proposed method is five times faster than the conventional full search in case of search range $\pm$32.

Wear Leveling Technique using Bit Array and Bit Set Threshold for Flash Memory

  • Kim, Seon Hwan;Kwak, Jong Wook;Park, Chang-Hyeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.11
    • /
    • pp.1-8
    • /
    • 2015
  • Flash memory has advantages in that it is fast access speed, low-power, and low-price. Therefore, they are widely used in electronics industry sectors. However, the flash memory has weak points, which are the limited number of erase operations and non-in-place update problem. To overcome the limited number of erase operations, many wear leveling techniques are studied. They use many tables storing information such as erase count of blocks, hot and cold block indicators, reference count of pages, and so on. These tables occupy some space of main memory for the wear leveling techniques. Accordingly, they are not appropriate for low-power devices limited main memory. In order to resolve it, a wear leveling technique using bit array and Bit Set Threshold (BST) for flash memory. The proposing technique reduces the used space of main memory using a bit array table, which saves the history of block erase operations. To enhance accuracy of cold block information, we use BST, which is calculated by using the number of invalid pages of the blocks in a one-to-many mode, where one bit is related to many blocks. The performance results illustrate that the proposed wear leveling technique improve life time of flash memory to about 6%, compared with previous wear leveling techniques using a bit array table in our experiment.