• Title/Summary/Keyword: peak signal to noise ratio

Search Result 493, Processing Time 0.031 seconds

Influence of Atmospheric Turbulence Channel on a Ghost-imaging Transmission System

  • Wang, Kaimin;Wang, Zhaorui;Zhang, Leihong;Kang, Yi;Ye, Hualong;Hu, Jiafeng;Xu, Jiaming
    • Current Optics and Photonics
    • /
    • v.4 no.1
    • /
    • pp.1-8
    • /
    • 2020
  • We research a system of compressed-sensing computational ghost imaging (CSCGI) based on the intensity fluctuation brought by turbulence. In this system, we used the gamma-gamma intensity-fluctuation model, which is commonly used in transmission systems, to simulate the CSCGI system. By setting proper values of the parameters such as transmission distance, refractive-index structure parameter, and sampling rates, the peak signal-to-noise ratio (PSNR) performance and bit-error rate (BER) performance are obtained to evaluate the imaging quality, which provides a theoretical model to further research the ghost-imaging algorithm.

A Fast Block Matching Algorithm using Unit-Diamond and Flat-Hexagonal Search Patterns (단위 다이아몬드와 납작한 육각패턴을 이용한 고속 블록 정합 알고리즘)

  • 남현우;위영철;김하진
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.57-65
    • /
    • 2004
  • In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

Hybrid Down-Sampling Method of Depth Map Based on Moving Objects (움직임 객체 기반의 하이브리드 깊이 맵 다운샘플링 기법)

  • Kim, Tae-Woo;Kim, Jung Hun;Park, Myung Woo;Shin, Jitae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.11
    • /
    • pp.918-926
    • /
    • 2012
  • In 3D video transmission, a depth map being used for depth image based rendering (DIBR) is generally compressed by reducing resolution for coding efficiency. Errors in resolution reduction are recovered by an appropriate up-sampling method after decoding. However, most previous works only focus on up-sampling techniques to reduce errors. In this paper, we propose a novel down-sampling technique of depth map that applies different down-sampling rates on moving objects and background in order to enhance human perceptual quality. Experimental results demonstrate that the proposed scheme provides both higher visual quality and peak signal-to-noise ratio (PSNR). Also, our method is compatible with other up-sampling techniques.

A Block Matching Algorithm using Motion Vector Predictor Candidates and Adaptive Search Pattern (움직임 벡터 예측 후보들과 적응적인 탐색 패턴을 이용하는 블록 정합 알고리즘)

  • Kwak, Sung-Keun;Wee, Young-Cheul;Kim, Ha-JIne
    • The KIPS Transactions:PartB
    • /
    • v.11B no.3
    • /
    • pp.247-256
    • /
    • 2004
  • In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.

Fast mode decision by skipping variable block-based motion estimation and spatial predictive coding in H.264 (H.264의 가변 블록 크기 움직임 추정 및 공간 예측 부호화 생략에 의한 고속 모드 결정법)

  • 한기훈;이영렬
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.5
    • /
    • pp.417-425
    • /
    • 2003
  • H.264, which is the latest video coding standard of both ITU-T(International Telecommunication Union-Telecommunication standardization sector) and MPEG(Moving Picture Experts Group), adopts new video coding tools such as variable block size motion estimation, multiple reference frames, quarter-pel motion estimation/compensation(ME/MC), 4${\times}$4 Integer DCT(Discrete Cosine Transform), and Rate-Distortion Optimization, etc. These new video coding tools provide good coding of efficiency compared with existing video coding standards as H.263, MPEG-4, etc. However, these new coding tools require the increase of encoder complexity. Therefore, in order to apply H.264 to many real applications, fast algorithms are required for H.264 coding tools. In this paper, when encoder MacroBlock(MB) mode is decided by rate-distortion optimization tool, fast mode decision algorithm by skipping variable block size ME/MC and spatial-predictive coding, which occupies most encoder complexity, is proposed. In terms of computational complexity, the proposed method runs about 4 times as far as JM(Joint Model) 42 encoder of H.264, while the PSNR(peak signal-to-noise ratio)s of the decoded images are maintained.

Fast Mode Decision using Global Disparity Vector for Multi-view Video Coding (다시점 영상 부호화에서 전역 변이 벡터를 이용한 고속 모드 결정)

  • Han, Dong-Hoon;Cho, Suk-Hee;Hur, Nam-Ho;Lee, Yung-Lyul
    • Journal of Broadcast Engineering
    • /
    • v.13 no.3
    • /
    • pp.328-338
    • /
    • 2008
  • Multi-view video coding (MVC) based on H.264/AVC encodes multiple views efficiently by using a prediction scheme that exploits inter-view correlation among multiple views. However, with the increase of the number of views and use of inter-view prediction among views, total encoding time will be increased in multiview video coding. In this paper, we propose a fast mode decision using both MB(Macroblock)-based region segmentation information corresponding to each view in multiple views and global disparity vector among views in order to reduce encoding time. The proposed method achieves on average 40% reduction of total encoding time with the objective video quality degradation of about 0.04 dB peak signal-to-noise ratio (PSNR) by using joint multi-view video model (JMVM) 4.0 that is the reference software of the multiview video coding standard.

Adaptive De-interlacing Algorithm using Method Selection based on Degree of Local Complexity (지역 복잡도 기반 방법 선택을 이용한 적응적 디인터레이싱 알고리듬)

  • Hong, Sung-Min;Park, Sang-Jun;Jeong, Je-Chang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4C
    • /
    • pp.217-225
    • /
    • 2011
  • In this paper, we propose an adaptive de-interlacing algorithm that is based on the degree of local complexity. The conventional intra field de-interlacing algorithms show the different performance according to the ways which find the edge direction. Furthermore, FDD (Fine Directional De-interlacing) algorithm has the better performance than other algorithms but the computational complexity of FDD algorithm is too high. In order to alleviate these problems, the proposed algorithm selects the most efficient de-interacing algorithm among LA (Line Average), MELA (Modified Edge-based Line Average), and LCID (Low-Complexity Interpolation Method for De-interlacing) algorithms which have low complexity and good performance. The proposed algorithm is trained by the DoLC (Degree of Local Complexity) for selection of the algorithms mentioned above. Simulation results show that the proposed algorithm not only has the low complexity but also performs better objective and subjective image quality performances compared with the conventional intra-field methods.

Screen Content Coding Analysis to Improve Coding Efficiency for Immersive Video (몰입형 비디오 압축을 위한 스크린 콘텐츠 코딩 성능 분석)

  • Lee, Soonbin;Jeong, Jong-Beom;Kim, Inae;Lee, Sangsoon;Ryu, Eun-Seok
    • Journal of Broadcast Engineering
    • /
    • v.25 no.6
    • /
    • pp.911-921
    • /
    • 2020
  • Recently, MPEG-I (Immersive) has been exploring compression performance through standardization projects for immersive video. The MPEG Immersion Video (MIV) standard technology is intended to provide limited 6DoF based on depth map-based image rendering (DIBR). MIV is a model that processes the Basic View and the residual information into an Additional View, which is a collection of patches. Atlases have the unique characteristics depending on the kind of the view they are included, requiring consideration of the compression efficiency. In this paper, the performance comparison analysis of screen content coding tools such as intra block copy (IBC) is conducted, based on the pattern of various views and patches repetition. It is demonstrated that the proposed method improves coding performance around -15.74% BD-rate reduction in the MIV.

A Prediction Search Algorithm in Video Coding by using Neighboring-Block Motion Vectors (비디오 코딩을 위한 인접블록 움직임 벡터를 이용한 예측 탐색 알고리즘)

  • Kwak, Sung-Keun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3697-3705
    • /
    • 2011
  • 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 a new prediction search algorithm for block matching using the temporal and spatial correlation of the video sequence and local statistics of neighboring motion vectors. The proposed ANBA(Adaptive Neighboring-Block Search Algorithm) determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and use a previous motion vector. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06dB as depend on the video sequences and improved about 0.01~0.64dB over MVFAST and PMVFAST.

An effective quality improvement scheme of magnified image using the surface characteristics in image (영상의 곡면 특성을 활용한 효과적인 확대영상의 화질 향상 기법)

  • Jung, Soo-Mok;On, Byung-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.8
    • /
    • pp.45-54
    • /
    • 2014
  • In this paper, we proposed an effective quality improvement scheme of magnified image using the surface characteristics in image. If the surface in image is estimated as simple convex surface or simple concave surface, the interpolated value can be calculated to have the surface characteristics by using the other method in the proposed scheme. The calculated value becomes the interpolated pixel value inmagnified image. So, themagnified image reflects the surface characteristics of the real image. If the surface is not estimated as simple convex surface or simple concave surface, the interpolated value is calculated more accurately than bilinear interpolation by using the method of the proposed scheme. The PSNR values of the magnified images using the proposed schemes are greater than those of the magnified images using the previous interpolation schemes.