ITP Colour Space and Its Compression Performance for High Dynamic Range and Wide Colour Gamut Video Distribution

High Dynamic Range (HDR) and Wider Colour Gamut (WCG) content represents a greater range of luminance levels and a more complete reproduction of colours found in real?world scenes. The current video distribution environments deliver Standard Dynam?ic Range (SDR) signal Y′CbCr. For HDR and WCG content, it is desirable to examine if such signal format still works well for compression, and to know if the overall system performance can be further improved by exploring different signal formats. In this paper, ITP (ICTCP) colour space is presented. The paper concentrates on examining the two aspects of ITP colour space: 1) ITP characteristics in terms of signal quantization at a given bit depth; 2) ITP compression performance. The analysis and simulation results show that ITP 10 bit has better properties than Y′CbCr?PQ 10bit in colour quantization, constant luminance, hue property and chroma subsampling, and it also has good compression efficiency. Therefore it is desirable to adopt ITP colour space as a new signal format for HDR/WCG video compression.

Analytical Computation of Acoustic Bidirectional Reflectance Distribution Functions

The Room Acoustic Rendering Equation introduced in [1] formalizes a variety of room acoustics modeling algorithms. One key concept in the equation is the Acoustic Bidirectional Reflectance Distribution Function (A-BRDF) which is the term that models sound reflections. In this paper, we present a method to compute analytically the A-BRDF in cases with diffuse reflections parametrized by random variables. As an example, analytical A-BRDFs are obtained for the Vector Based Scattering Model, and are validated against numerical Monte Carlo experiments. The analytical computation of A-BRDFs can be added to a standard acoustic ray tracing engine to obtain valuable data from each ray collision thus reducing significantly the computational cost of generating impulse responses.

Sums of Five Almost Equal Prime Squares

Let Pi, 1≤i≤5, be prime numbers. It is proved that every integer N that satisfies N=5 （mod 24） can be written as N=p1^2＋p2^2＋P3^2＋p4^2 ＋p5^2, where │√N5-Pi│≤N^1/2-19/850＋∈.

Optimal choice of Reed-Solomon codes to protect against queuing losses in wireless networks

This article proposes algorithms to determine an optimal choice of the Reed-Solomon forward error correction （FEC） code parameters （n,k） to mitigate the effects of packet loss on multimedia traffic caused by buffer overflow at a wireless base station. A network model is developed that takes into account traffic arrival rates, channel loss characteristics, the capacity of the buffer at the base station, and FEC parameters. For Poisson distributed traffic, the theory of recurrent linear equations is applied to develop a new closed form solution of low complexity of the Markov model for the buffer occupancy. For constant bit rate （CBR） traffic, an iterative procedure is developed to compute the packet loss probabilities after FEC recovery.

Large sieve inequality with sparse sets of moduli applied to Goldbach conjecture

We use the large sieve inequality with sparse sets of moduli to prove a new estimate for exponential sums over primes. Subsequently, we apply this estimate to establish new results on the binary Goldbach problem where the primes are restricted to given arithmetic Drogressions.