Li Bing, Qin Haina, Xiong Weihua, Li Yangxi, Feng Songhe, Hu Weiming, Maybank Stephen
IEEE Trans Pattern Anal Mach Intell. 2023 Oct;45(10):12304-12320. doi: 10.1109/TPAMI.2023.3278832. Epub 2023 Sep 5.
Computational color constancy is an important component of Image Signal Processors (ISP) for white balancing in many imaging devices. Recently, deep convolutional neural networks (CNN) have been introduced for color constancy. They achieve prominent performance improvements comparing with those statistics or shallow learning-based methods. However, the need for a large number of training samples, a high computational cost and a huge model size make CNN-based methods unsuitable for deployment on low-resource ISPs for real-time applications. In order to overcome these limitations and to achieve comparable performance to CNN-based methods, an efficient method is defined for selecting the optimal simple statistics-based method (SM) for each image. To this end, we propose a novel ranking-based color constancy method (RCC) that formulates the selection of the optimal SM method as a label ranking problem. RCC designs a specific ranking loss function, and uses a low rank constraint to control the model complexity and a grouped sparse constraint for feature selection. Finally, we apply the RCC model to predict the order of the candidate SM methods for a test image, and then estimate its illumination using the predicted optimal SM method (or fusing the results estimated by the top k SM methods). Comprehensive experiment results show that the proposed RCC outperforms nearly all the shallow learning-based methods and achieves comparable performance to (sometimes even better performance than) deep CNN-based methods with only 1/2000 of the model size and training time. RCC also shows good robustness to limited training samples and good generalization crossing cameras. Furthermore, to remove the dependence on the ground truth illumination, we extend RCC to obtain a novel ranking-based method without ground truth illumination (RCC_NO) that learns the ranking model using simple partial binary preference annotations provided by untrained annotators rather than experts. RCC_NO also achieves better performance than the SM methods and most shallow learning-based methods with low costs of sample collection and illumination measurement.
计算颜色恒常性是许多成像设备中用于白平衡的图像信号处理器(ISP)的重要组成部分。最近,深度卷积神经网络(CNN)已被引入用于颜色恒常性。与基于统计或浅层学习的方法相比,它们实现了显著的性能提升。然而,对大量训练样本的需求、高计算成本和巨大的模型规模使得基于CNN的方法不适用于在低资源ISP上进行实时应用部署。为了克服这些限制并实现与基于CNN的方法相当的性能,定义了一种有效的方法来为每个图像选择最优的基于简单统计的方法(SM)。为此,我们提出了一种新颖的基于排序的颜色恒常性方法(RCC),该方法将最优SM方法的选择表述为一个标签排序问题。RCC设计了一个特定的排序损失函数,并使用低秩约束来控制模型复杂度,以及使用分组稀疏约束进行特征选择。最后,我们应用RCC模型来预测测试图像的候选SM方法的顺序,然后使用预测的最优SM方法(或融合前k个SM方法估计的结果)来估计其光照。综合实验结果表明,所提出的RCC优于几乎所有基于浅层学习的方法,并且在模型规模和训练时间仅为基于深度CNN方法的1/2000的情况下,实现了与之相当的性能(有时甚至性能更好)。RCC对有限的训练样本也表现出良好的鲁棒性,并且在跨相机时具有良好的泛化能力。此外,为了消除对真实光照的依赖,我们扩展了RCC以获得一种新颖的无真实光照的基于排序的方法(RCC_NO),该方法使用未经训练的注释者而非专家提供的简单部分二元偏好注释来学习排序模型。RCC_NO在样本收集和光照测量成本较低的情况下,也比SM方法和大多数基于浅层学习的方法表现更好。