• Title/Summary/Keyword: block-adaptive

Search Result 593, Processing Time 0.03 seconds

Adaptive Scanning Based on a Morphological Representation of Coefficients for H.264/AVC

  • Choi, Kang-Sun;Ko, Sung-Jea
    • ETRI Journal
    • /
    • v.31 no.5
    • /
    • pp.607-609
    • /
    • 2009
  • In this letter, an effective scanning method based on a morphological representation of quantized coefficients is proposed for intra coding in H.264. In the proposed scanning method, the scan order for each block is adaptively reconfigured by exploiting a residual correlation beyond the border of the block. An initial scan order for the current block is determined first by using the pattern of nonzero coefficients in the adjacent block. Then, a complete scan order is obtained by performing the dilation operation at each position within the initial scan order. Experimental results show that the proposed method improves the coding efficiency up to 3.7% compared to the conventional zigzag scanning method.

Adaptive Pattern Search for Fast Block-Matching Motion Estimation (고속 블록 정합 움직임 추정을 위한 적응적 패턴 탐색)

  • Kwak, Sung-Keun
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.9
    • /
    • pp.987-992
    • /
    • 2004
  • There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the improved diamond search pattern using an motion vector prediction candidate search point by the predicted motion information from the same block of the previous frame. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improves as high as high as 14~24% in terms of average number of search point per motion vector estimation and improved about 0.02~0.37dB on an average except the full search(FS) algorithm.

  • PDF

Algorithm of effective GOP structure select by Macro Block base (Macro Block 기반의 효과적인 GOP구조 선택 알고리즘)

  • Jeon Min-Jeong;Moon Young-Deuk;Chung Hee-Tae
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.05a
    • /
    • pp.470-474
    • /
    • 2005
  • There are many suggestion of methods which get good quality images by controling the GOP structure. But the existing algorithm should have not good to deal the real time adaptive processing determine the GOP structure because which check the fixed quantity of image in advance and require high capacity of frame memories and have delay time by increasing calculation quantity. This paper propose the algorithm which adapt the real time by the basic of macro block. We show the good simulation results using the proposed GOP structure based on macro block.

  • PDF

Automatic Registration between EO and IR Images of KOMPSAT-3A Using Block-based Image Matching

  • Kang, Hyungseok
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.4
    • /
    • pp.545-555
    • /
    • 2020
  • This paper focuses on automatic image registration between EO (Electro-Optical) and IR (InfraRed) satellite images with different spectral properties using block-based approach and simple preprocessing technique to enhance the performance of feature matching. If unpreprocessed EO and IR images from Kompsat-3A satellite were applied to local feature matching algorithms(Scale Invariant Feature Transform, Speed-Up Robust Feature, etc.), image registration algorithm generally failed because of few detected feature points or mismatched pairs despite of many detected feature points. In this paper, we proposed a new image registration method which improved the performance of feature matching with block-based registration process on 9-divided image and pre-processing technique based on adaptive histogram equalization. The proposed method showed better performance than without our proposed technique on visual inspection and I-RMSE. This study can be used for automatic image registration between various images acquired from different sensors.

Lost Block Recovery Using Energy Ratio (에너지 비를 이용한 손실 블록)

  • Hyun, Seung-Hwa;Eom, Il-Kyu;Kim, Yoo-Shin
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.329-330
    • /
    • 2006
  • This paper presents a recovery technique for images with block-based corruption by transmission losses. Conventional methods that do not consider edge directions can cause blocked blurring artifacts. In this paper, we present a block recovery scheme using Haar wavelet features. The adaptive selection of neighboring blocks is performed based on the energy ratio f wavelet subbands. The lost blocks are recovered by linear interpolation in the spatial domain using selected block pairs. The proposed directional recovery method is effective for the strong edge because it exploits the varying neighboring blocks adaptively according to the edges and the directional information in the image. The proposed method outperforms the previous methods that used only a predefined set of neighboring blocks.

  • PDF

Image Deblocking Scheme for JPEG Compressed Images Using an Adaptive-Weighted Bilateral Filter

  • Wang, Liping;Wang, Chengyou;Huang, Wei;Zhou, Xiao
    • Journal of Information Processing Systems
    • /
    • v.12 no.4
    • /
    • pp.631-643
    • /
    • 2016
  • Due to the block-based discrete cosine transform (BDCT), JPEG compressed images usually exhibit blocking artifacts. When the bit rates are very low, blocking artifacts will seriously affect the image's visual quality. A bilateral filter has the features for edge-preserving when it smooths images, so we propose an adaptive-weighted bilateral filter based on the features. In this paper, an image-deblocking scheme using this kind of adaptive-weighted bilateral filter is proposed to remove and reduce blocking artifacts. Two parameters of the proposed adaptive-weighted bilateral filter are adaptive-weighted so that it can avoid over-blurring unsmooth regions while eliminating blocking artifacts in smooth regions. This is achieved in two aspects: by using local entropy to control the level of filtering of each single pixel point within the image, and by using an improved blind image quality assessment (BIQA) to control the strength of filtering different images whose blocking artifacts are different. It is proved by our experimental results that our proposed image-deblocking scheme provides good performance on eliminating blocking artifacts and can avoid the over-blurring of unsmooth regions.

ABSOLUTE ESTIMATION METHOD OF MOSQUITO NOISE FOR A POST FILTERLING

  • Kashimura, Youhei;Sagara, Naoya;Sugiyama, Kenji
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.612-617
    • /
    • 2009
  • In a DCT coding, degradations called block artifact and mosquito noise are appeared in reconstructed pictures. They should be reduced in post processing after decoding without superabundant processing. However, an estimation of mosquito noise is rare because of its difficulty. To realize an estimation of mosquito noise level, we extract a block that mosquito noise will be easy to occur. Mosquito noise level is calculated at a selected side of the block. In this processing, only the sides of high probability block are used. Then, a block value is taken by averaging. Finally, the picture value is calculated by averaging of this. Estimation method is evaluated by using the MPEG-4 decoded pictures. Quantization scale of coding and the estimated mosquito noise level are compared. As the results, we recognize the proposed method gives almost reasonable mosquito block and absolute level. Father, adaptive filter is controlled by the estimated mosquito noise level. It is recognized that the high quality of decoded picture is kept and the mosquito noise is reduced effectively at the picture with degradation.

  • PDF

An Efficient Approximation method of Adaptive Support-Weight Matching in Stereo Images (스테레오 영상에서의 적응적 영역 가중치 매칭의 효율적 근사화 방법)

  • Kim, Ho-Young;Lee, Seong-Won
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.902-915
    • /
    • 2011
  • Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

Implementation of Adaptive Multi Rate (AMR) Vocoder for the Asynchronous IMT-2000 Mobile ASIC (IMT-2000 비동기식 단말기용 ASIC을 위한 적응형 다중 비트율 (AMR) 보코더의 구현)

  • 변경진;최민석;한민수;김경수
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.56-61
    • /
    • 2001
  • This paper presents the real-time implementation of an AMR (Adaptive Multi Rate) vocoder which is included in the asynchronous International Mobile Telecommunication (IMT)-2000 mobile ASIC. The implemented AMR vocoder is a multi-rate coder with 8 modes operating at bit rates from 12.2kbps down to 4.75kbps. Not only the encoder and the decoder as basic functions of the vocoder are implemented, but VAD (Voice Activity Detection), SCR (Source Controlled Rate) operation and frame structuring blocks for the system interface are also implemented in this vocoder. The DSP for AMR vocoder implementation is a 16bit fixed-point DSP which is based on the TeakLite core and consists of memory block, serial interface block, register files for the parallel interface with CPU, and interrupt control logic. Through the implementation, we reduce the maximum operating complexity to 24MIPS by efficiently managing the memory structure. The AMR vocoder is verified throughout all the test vectors provided by 3GPP, and stable operation in the real-time testing board is also proved.

  • PDF

Adaptive Sidelobe Blanker for Interference Environment (간섭 환경에 강인한 적응형 부엽차단기)

  • Yang, Eunjung;Han, Iltak;Song, Junho;Lee, Heeyoung;Yeom, Dongjin
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.26 no.3
    • /
    • pp.317-325
    • /
    • 2015
  • In an interference environment, adaptive sidelobe blanking(adaptive SLB: ASB) algorithm effectively cancels the high-duty cycle jammer and blocks the sidelobe signals without the auxiliary antenna. The adaptive SLB for the linearly constrained minimum variance (LCMV) is proposed in this paper. In the proposed scheme, the interference covariance matrix is modified to satisfy the direction constraints of LCMV and the normalized output can be obtained to block sidelobe signals. As the LCMV can be represented as a generalized sidelobe canceller(GSC) form, which is the general framework of various adaptive beamforming(ABF) algorithms, the proposed adaptive SLB can be applied to various ABF methods. The performance of the proposed method is verified through simulation and analysis.