Estimation of Camera Response Function using Prediction Consistency and Gradual Refinement with an Extension to Deep Learning

• URL: http://arxiv.org/abs/2010.04009v2
• Date: Tue, 23 Feb 2021 03:05:56 GMT
• Title: Estimation of Camera Response Function using Prediction Consistency and Gradual Refinement with an Extension to Deep Learning
• Authors: Aashish Sharma, Robby T. Tan, and Loong-Fah Cheong
• Abstract summary: Most existing methods for CRF estimation from a single image fail to handle general real images. We introduce a non-deep-learning method using prediction consistency and gradual refinement. Our method outperforms the existing single-image methods for daytime and nighttime real images.
• Score: 42.70498574189067
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most existing methods for CRF estimation from a single image fail to handle general real images. For instance, EdgeCRF based on colour patches extracted from edges works effectively only when the presence of noise is insignificant, which is not the case for many real images; and, CRFNet, a recent method based on fully supervised deep learning works only for the CRFs that are in the training data, and hence fail to deal with other possible CRFs beyond the training data. To address these problems, we introduce a non-deep-learning method using prediction consistency and gradual refinement. First, we rely more on the patches of the input image that provide more consistent predictions. If the predictions from a patch are more consistent, it means that the patch is likely to be less affected by noise or any inferior colour combinations, and hence, it can be more reliable for CRF estimation. Second, we employ a gradual refinement scheme in which we start from a simple CRF model to generate a result which is more robust to noise but less accurate, and then we gradually increase the model's complexity to improve the result. This is because a simple model, while being less accurate, overfits less to noise than a complex model does. Our experiments show that our method outperforms the existing single-image methods for daytime and nighttime real images. We further propose a more efficient deep learning extension that performs test-time training (based on unsupervised losses) on the test input image. This provides our method better generalization performance than CRFNet making it more practically applicable for CRF estimation for general real images.

Related papers

• Robust Representation Consistency Model via Contrastive Denoising [83.47584074390842]
  randomized smoothing provides theoretical guarantees for certifying robustness against adversarial perturbations. diffusion models have been successfully employed for randomized smoothing to purify noise-perturbed samples. We reformulate the generative modeling task along the diffusion trajectories in pixel space as a discriminative task in the latent space.
  arXiv  Detail & Related papers  (2025-01-22T18:52:06Z)
• Fast constrained sampling in pre-trained diffusion models [77.21486516041391]
  Diffusion models have dominated the field of large, generative image models. We propose an algorithm for fast-constrained sampling in large pre-trained diffusion models.
  arXiv  Detail & Related papers  (2024-10-24T14:52:38Z)
• LeRF: Learning Resampling Function for Adaptive and Efficient Image Interpolation [64.34935748707673]
  Recent deep neural networks (DNNs) have made impressive progress in performance by introducing learned data priors. We propose a novel method of Learning Resampling (termed LeRF) which takes advantage of both the structural priors learned by DNNs and the locally continuous assumption. LeRF assigns spatially varying resampling functions to input image pixels and learns to predict the shapes of these resampling functions with a neural network.
  arXiv  Detail & Related papers  (2024-07-13T16:09:45Z)
• Using Neural Networks for Fast SAR Roughness Estimation of High Resolution Images [2.6107298043931197]
  We propose a neural network-based estimation framework that learns how to predict underlying parameters of $G_I0$ samples. We show that this approach leads to an estimator that is quicker, yields less estimation error and is less prone to failures.
  arXiv  Detail & Related papers  (2023-09-06T20:24:13Z)
• ExposureDiffusion: Learning to Expose for Low-light Image Enhancement [87.08496758469835]
  This work addresses the issue by seamlessly integrating a diffusion model with a physics-based exposure model. Our method obtains significantly improved performance and reduced inference time compared with vanilla diffusion models. The proposed framework can work with both real-paired datasets, SOTA noise models, and different backbone networks.
  arXiv  Detail & Related papers  (2023-07-15T04:48:35Z)
• Linear Combinations of Patches are Unreasonably Effective for Single-Image Denoising [5.893124686141782]
  Deep neural networks have revolutionized image denoising in achieving significant accuracy improvements. To alleviate the requirement to learn image priors externally, single-image methods perform denoising solely based on the analysis of the input noisy image. This work investigates the effectiveness of linear combinations of patches for denoising under this constraint.
  arXiv  Detail & Related papers  (2022-12-01T10:52:03Z)
• Pure Noise to the Rescue of Insufficient Data: Improving Imbalanced Classification by Training on Random Noise Images [12.91269560135337]
  We present a surprisingly simple yet highly effective method to mitigate this limitation. Unlike the common use of additive noise or adversarial noise for data augmentation, we propose directly training on pure random noise images. We present a new Distribution-Aware Routing Batch Normalization layer (DAR-BN), which enables training on pure noise images in addition to natural images within the same network.
  arXiv  Detail & Related papers  (2021-12-16T11:51:35Z)
• Fidelity Estimation Improves Noisy-Image Classification with Pretrained Networks [12.814135905559992]
  We propose a method that can be applied on a pretrained classifier. Our method exploits a fidelity map estimate that is fused into the internal representations of the feature extractor. We show that when using our oracle fidelity map we even outperform the fully retrained methods, whether trained on noisy or restored images.
  arXiv  Detail & Related papers  (2021-06-01T17:58:32Z)
• RAIN: A Simple Approach for Robust and Accurate Image Classification Networks [156.09526491791772]
  It has been shown that the majority of existing adversarial defense methods achieve robustness at the cost of sacrificing prediction accuracy. This paper proposes a novel preprocessing framework, which we term Robust and Accurate Image classificatioN(RAIN) RAIN applies randomization over inputs to break the ties between the model forward prediction path and the backward gradient path, thus improving the model robustness. We conduct extensive experiments on the STL10 and ImageNet datasets to verify the effectiveness of RAIN against various types of adversarial attacks.
  arXiv  Detail & Related papers  (2020-04-24T02:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.