mlsanityData to 7 Oct 2026

Spatially Varying Exposure with 2-by-2 Multiplexing: Optimality and Universality

arXiv 2306.17367 ↗First posted 30 Jun 2023eess.IV cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

The advancement of new digital image sensors has enabled the design of exposure multiplexing schemes where a single image capture can have multiple exposures and conversion gains in an interlaced format, similar to that of a Bayer color filter array. In this paper, we ask the question of how to design such multiplexing schemes for adaptive high-dynamic range (HDR) imaging where the multiplexing scheme can be updated according to the scenes. We present two new findings. (i) We address the problem of design optimality. We show that given a multiplex pattern, the conventional optimality criteria based on the input/output-referred signal-to-noise ratio (SNR) of the independently measured pixels can lead to flawed decisions because it cannot encapsulate the location of the saturated pixels. We overcome the issue by proposing a new concept known as the spatially varying exposure risk (SVE-Risk) which is a pseudo-idealistic quantification of the amount of recoverable pixels. We present an efficient enumeration algorithm to select the optimal multiplex patterns. (ii) We report a design universality observation that the design of the multiplex pattern can be decoupled from the image reconstruction algorithm. This is a significant departure from the recent literature that the multiplex pattern should be jointly optimized with the reconstruction algorithm. Our finding suggests that in the context of exposure multiplexing, an end-to-end training may not be necessary.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 23 of its 64 references that are in the map. First posted on arXiv 30 Jun 2023.

Builds on

23 of 64 references.

References · 23

  1. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
  2. 2021Restormer: Efficient Transformer for High-Resolution Image Restorationcited by 1,618
  3. 2016Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoisingcited by 1,352
  4. 2021Multi-Stage Progressive Image Restorationcited by 813
  5. 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 411
  6. 2016Plug-and-Play ADMM for Image Restoration: Fixed Point Convergence and Applicationscited by 244
  7. 2021Deep Equilibrium Architectures for Inverse Problems in Imagingcited by 126
  8. 2019Attention-guided Network for Ghost-free High Dynamic Range Imagingcited by 116
  9. 2017Deep High Dynamic Range Imaging with Large Foreground Motionscited by 98
  10. 2021NTIRE 2021 Challenge on High Dynamic Range Imaging: Dataset, Methods and Resultscited by 36
  11. 2016Learning Sensor Multiplexing Design through Back-propagationcited by 28
  12. 2020Dynamic Low-light Imaging with Quanta Image Sensorscited by 16
11 more
  1. 2021Passive Inter-Photon Imagingcited by 16
  2. 2021HDR Video Reconstruction with Tri-Exposure Quad-Bayer Sensorscited by 13
  3. 2022Learning Spatially Varying Pixel Exposures for Motion Deblurringcited by 12
  4. 2022What Does a One-Bit Quanta Image Sensor Offer?cited by 10
  5. 2020HDR Imaging with Quanta Image Sensors: Theoretical Limits and Optimal Reconstructioncited by 9
  6. 2023HDR Imaging with Spatially Varying Signal-to-Noise Ratioscited by 8
  7. 2020Learning a Reinforced Agent for Flexible Exposure Bracketing Selectioncited by 6
  8. 2022Physics vs. Learned Priors: Rethinking Camera and Algorithm Design for Task-Specific Imagingcited by 6
  9. 2021Exposure-Referred Signal-to-Noise Ratio for Digital Image Sensorscited by 4
  10. 2022HDRfeat: A Feature-Rich Network for High Dynamic Range Image Reconstructioncited by 2
  11. 2022On the Insensitivity of Bit Density to Read Noise in One-bit Quanta Image Sensorscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 1; 2026: 2.

6 papers.