High-Radix Taylor-Optimized Tone Mapping Processor for Adaptive 4K HDR Video at 30 FPS

Xianglong Wang1, Zhiyong Lai1, Lei Chen1

  • 1School of Microelectronics, Southern University of Science and Technology, Shenzhen 518055, China.

PubMed
Summary

This study introduces an efficient adaptive High Dynamic Range (HDR) tone mapping processor for real-time visual applications. The novel design enhances image quality and processing speed, overcoming limitations of current Low Dynamic Range (LDR) systems.

Related Concept Videos

Upsampling01:22

Upsampling

Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
319
Downsampling01:20

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
257
Aliasing01:18

Aliasing

Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
234
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
478
Differential Leveling01:12

Differential Leveling

Differential leveling is a precise method in surveying used to determine the elevation difference between two points. Its primary goal is to establish accurate vertical measurements to create level surfaces or grade lines critical for designing and constructing infrastructures such as roads, bridges, and buildings.The procedure for differential leveling begins with setting up and leveling the instrument at a point where the benchmark can be seen. The level rod is held on the benchmark (BM), and...
319