Pith. sign in

REVIEW 4 major objections 7 minor 48 references

Integral Fast Fourier Color Constancy

T0 review · 4 major / 7 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that a local extension of FFCC, built on an integral UV histogram and parallel FFT convolution, performs multi-illuminant white balance with accuracy matching pixel-level neural networks at over 400x fewer parameters and…

desk verdict Solid integral-histogram extension of FFCC with honest math, but the paper overclaims accuracy and speed relative to its own LSMI tables. read the letter →

arxiv 2502.03494 v1 pith:RGN5CAK7 submitted 2025-02-05 eess.IV

Wenjun Wei , Yanlin Qian , Huaian Chen , Junkang Dai , Yi Jin This is my paper · ORCID
classification eess.IV
keywords integralhistogramfastFouriercolorconstancymulti-illuminantautowhitebalancelocalilluminationestimationguidedfilteringlog-chromaticityreal-timeimagesignalprocessing
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proposes a modification of the Fast Fourier Color Constancy (FFCC) algorithm so that it can handle scenes with several light sources at once. Instead of building a fresh histogram for every image region, IFFCC precomputes one integral UV histogram over the whole image in log-chromaticity space, then reads out any window's histogram with a few arithmetic operations. Illumination for all windows is estimated in parallel by fast Fourier convolution and circular-mean statistics, then interpolated and edge-preserved by guided filtering. The claim is that this reaches the accuracy of pixel-level neural networks on the LSMI and Shadow benchmarks with about 400x fewer parameters and 20-100x faster runtime. If correct, the result is a practical local auto white balance for real-time capture on CPUs and mobile devices.

What carries the argument

The load-bearing object is the integral UV histogram: a recursive prefix-sum over log-chroma bins, written in Eq. 8, that turns any rectangular window's histogram into three vector additions and one subtraction. Around it, the method runs a parallelized fast Fourier convolution (Eq. 10), a softmax over the toroidal likelihood, and a parallel circular-mean step (Eq. 12) for each window's Bivariate von Mises estimate. This combination removes the repeated per-region histogram extraction that made direct FFCC extension slow and lets many local illuminant hypotheses be produced in a single inference pass.

What would settle it

On a synthetic two-illuminant image with a straight, sharp boundary and well-separated chromaticities, inspect each window's predicted illuminant against the two known ground-truth lights: if the per-window circular mean (Eq. 12) repeatedly falls between the two true chromaticities rather than near one of them, or if the reconstructed map's angular error on the boundary strip stays well above pixel-level networks, then the local-estimate assumption is the limiting factor.

Watch

Extended reading notes

Core claim

The central claim is that local multi-illuminant white balance does not need a pixel-level neural network: the same log-chroma histogram that FFCC uses globally can be made local and fast. The paper's integral UV histogram (Eq. 8) lets any rectangular region's histogram be computed from three previously scanned histograms, so a whole overlapping grid of windows is nearly free. Fourier-based convolution in the log-chroma torus and the Bivariate von Mises circular means are evaluated for all windows in one parallel pass, giving one illuminant estimate per window. After linear interpolation and guided filtering, those estimates become a spatially smooth but edge-preserving illumination map that can be directly applied to correct the image. On the Multi and Mixed splits of LSMI, IFFCC reports mean angular errors of 2.48/2.30/2.48 and 1.98/2.11/1.93 across Galaxy/Nikon/Sony cameras, in the same range as the pixel-level AID model, while using roughly 0.012M parameters and 0.03s on CPU.

Load-bearing premise

The estimate for each window is a single circular mean of that window's filtered histogram, so any window containing two or more clearly distinct lights is represented by one blended point; if that mean falls between the true chromaticities, sharp light boundaries in the final map are inherently blurred.

Editorial extensions

If this is right

  • A 64x48 preview image can be white-balanced in 5.8 ms on a CPU, which is inside the 10 ms budget typical of real-time preview pipelines.
  • With about 0.012M parameters versus 6.4M for AID, IFFCC fits in a footprint where a pixel-level network would not, making local AWB feasible on embedded camera hardware.
  • Because the features are log-chroma histograms rather than camera-specific learned filters, the same trained model transfers across Canon, Nikon, Sony, and other cameras without per-device fine-tuning, as the Shadow dataset results show.
  • Spatial smoothing by interpolation and guided filtering gives a continuous illumination map, not per-patch blocks, so video frames avoid abrupt white-balance jumps while light edges remain sharp.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The single-circular-mean estimator (Eq. 12) makes a window with two distinct lights collapse to one blended point; a natural test is whether replacing it with a mixture of von Mises components on each window histogram recovers the two chromaticities and improves boundary-region accuracy.
  • The integral-histogram trick is not specific to chroma bins: the same prefix-sum construction could accelerate other local ISP statistics, such as local exposure or local contrast histograms, in the same linear-time regime.
  • The current window/overlap trade-off means accuracy and boundary sharpness pull in opposite directions; an adaptive window that shrinks near detected illumination edges could combine the low error of large windows with the edge clarity of small ones.
  • If the CPU timing transfers to mobile DSPs with memory-bandwidth constraints, local AWB could become part of the default viewfinder path; whether it holds under hardware quantization is not tested in the paper.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 7 minor

Summary. The paper proposes IFFCC, a multi-illuminant extension of FFCC. It builds an integral UV histogram so that the log-chroma histogram of any rectangular window can be obtained by a few additions and subtractions, then applies FFT-based filtering to all window histograms in parallel. Per-window illuminants are recovered as circular means (Eq. 12), and the resulting coarse map is interpolated and guided-filtered. Experiments on the Shadow and LSMI datasets report angular errors, parameter counts, and CPU runtimes. The paper claims accuracy on par with or better than pixel-level neural networks, with over 400x fewer parameters and 20-100x less processing time.

Significance. The integral-histogram formulation is exact, and the reported CPU-only runtime (0.03 s on 256x256 images, 0.012M parameters) would be useful for embedded AWB if the accuracy claims were accurate. The Shadow dataset results are competitive, and the ablation study gives informative window-size trade-offs. However, the two headline claims (accuracy parity with pixel-level networks and 20-100x speedups) are not supported by the reported numbers: AID is consistently better on LSMI, and speedups over the listed network baselines range from about 9x to 33x, with FFCC-vs-IFFCC speedups of only 3-17x in Table 5. The contribution is still publishable after the claims are revised.

major comments (4)
  1. [Abstract, Conclusion, Tables 3 and 4] The claim that IFFCC achieves accuracy 'on par with or surpasses that of pixel-level neural networks' is contradicted by the paper's own experiments. On both LSMI subsets and for every camera, AID reports a lower mean angular error than IFFCC (e.g., Multi/Galaxy: IFFCC 2.48 vs AID 2.03; Mixed/Galaxy: IFFCC 1.98 vs AID 1.63), and the median is also better for AID in all six camera columns. The text should either add a comparison that actually supports the claim or replace it with a more modest statement such as 'competitive with, though not surpassing, leading pixel-level methods.'
  2. [Abstract, Conclusion, Tables 3-5] The '20-100x faster' speed claim is not supported by the reported runtimes. On LSMI, IFFCC's 0.03 s gives about 9x over LSMI-H (0.28 s), 16x over Pix2Pix (0.48 s), 17x over LSMI-U (0.51 s), and only vs AID (>1 s) is the speedup above 20x. In Table 5, the measured speedups over FFCC for the six window/overlap settings are about 3-17x, not 20-100x. Please qualify the speed claim by baseline and input size, or correct the numbers.
  3. [Section 3.3, Eq. (12); Section 4.1] Representing each window's filtered histogram by a single circular mean creates a structural ceiling for boundary accuracy. With the default window size 128 and overlap 64 on 256x256 test images, there are only 3x3 raw estimates; interpolation and guided filtering (Section 3.4) can smooth or align those estimates but cannot recover a hard illumination boundary that is absent from that coarse grid. Training against the blended illumination inside each window makes the model predict an average rather than resolve multi-modal windows. This is the likely reason AID, a pixel-level method, consistently outperforms IFFCC on LSMI, and it should be discussed as a limitation.
  4. [Section 3.3, Eq. (10)] The equation sums over the window index k inside the inverse FFT, which would collapse all window histograms into a single output; Eq. (13) then refers to P^k, which is only defined if Eq. (10) is interpreted per window. This is inconsistent as written and should be clarified (e.g., by writing the operation as a batched FFT without a sum over k, or by making the summation index another quantity). The current text makes the parallel-prediction recipe ambiguous and difficult to reproduce.
minor comments (7)
  1. [Section 3.1, Eqs. (5) and (7)] The union symbol is not the correct operation for accumulating histogram bin counts; these equations should use bin-wise addition, as Eq. (8) does.
  2. [Section 3.3, Eqs. (12)-(13)] The method computes independent circular means of the row and column marginals rather than the Bivariate von Mises mean discussed earlier in the section; the text should state this explicitly and justify the independence assumption.
  3. [Section 4.1] The training loss and optimizer hyperparameters are not specified; 'training runs for 64 iterations' is insufficient for reproduction.
  4. [Section 3.4] The guided-filter window radius and regularization parameter (epsilon) are not reported, although they affect the final illumination map.
  5. [References] References [9] and [10] are duplicate citations of Buchsbaum (1980) with different titles; the list should be deduplicated.
  6. [Tables 3 and 4] The caption says the time is for 256x256 images on a CPU, but it is not clear whether the timed 0.03 s includes interpolation and guided filtering; please specify the exact timing scope.
  7. [Equation (9)] The constants 217, 274, and 11(68+4B2) are unexplained; please provide a derivation or remove the formula if it is not used further.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: IFFCC's components are externally cited and its local estimates are standard supervised regressions, not fits renamed as predictions.

full rationale

I find no circular step in the derivation chain. The method builds on FFCC [3], BVM [38], and Porikli's integral histogram [40], all external prior work. Equation 8 is the standard integral-histogram recurrence, an exact algebraic identity for summing region histograms, not a fitted parameter or an ansatz disguised as a derivation. Equation 12 computes the circular mean of each window's filtered histogram, and the maps B, M, and F_s are learned by regression against the blended illumination inside each window (Section 4.1). This is ordinary supervised learning: the training target comes from the dataset's ground-truth illumination maps, not from the model's own outputs. The paper's self-citations [41-43] appear only in lists of related global methods and are not load-bearing for the IFFCC formulation or its conclusions. No uniqueness theorem is imported from the authors' own prior work. The skepticism that a single circular mean per window collapses multi-illuminant regions is a valid representational limitation, and the LSMI tables indeed show AID outperforming IFFCC on pixel-level error; but that is a correctness/benchmarking concern, not circularity. The abstract's 'on par or surpasses' claim is weaker than the paper's own tables suggest, but that discrepancy does not make any prediction equivalent to an input by construction. The integral-histogram acceleration is exact and externally benchmarked, and the local illuminant estimates are not defined in terms of the quantities they purport to predict. Therefore the paper is self-contained against external baselines and receives a circularity score of 0.

Assumptions & free parameters 4 free parameters · 5 assumptions · 0 invented entities

The method inherits the multiplicative illuminant model and log-chroma formulation from CCC/FFCC, adds the integral-histogram acceleration from Porikli, and makes a new simplifying assumption that a single circular mean per window can represent the local illuminant mixture. No new physical entities are introduced. The main free parameters are the window/overlap sizes and the number of histogram bins, which materially affect accuracy.

free parameters (4)
  • window_size = 128x128 (default)
    Chosen via ablation on the Shadow dataset; larger windows improve mean angular error but blur boundaries, so it directly affects the claimed accuracy.
  • overlap_size = 64 (default)
    Set to half the window size; influences the number of regions and the smoothness of the final map.
  • histogram_bins = 64x64
    Number of log-chroma bins, inherited from FFCC defaults; affects the resolution of the illuminant estimates.
  • learnable_parameters = 0.012M
    The convolution filters, gain map, and bias from Eq. 4 are trained on LSMI and Shadow; this is the model's parameter count, which is the basis of the efficiency claim.
assumptions (5)
  • domain assumption Pixel RGB is the product of albedo and uniform illumination: I = W * L (multiplicative illumination model).
    Stated in Section 3 under FFCC foundation; ignores shadows, dichromatic reflection, and spatial variation within each window.
  • domain assumption The illuminant is unit-norm in log-chroma space, enabling recovery via Eq. 2.
    Section 3, Eq. 2; standard in CCC and FFCC, and needed to map from the two log-chroma coordinates back to RGB.
  • domain assumption The histogram of log-chroma values, convolved with learned filters, yields a toroidal PDF whose circular mean gives the illuminant (gray light de-aliasing and BVM).
    Inherited from FFCC [3]; invoked in Sections 3 and 3.3 for both global and per-window estimation.
  • standard math The integral histogram inclusion-exclusion formula (Eq. 8) is valid for modular binning in log-chroma space.
    Follows from Porikli [40]; the paper states it without proof, and it is the computational basis for fast region histogram extraction.
  • ad hoc to paper A single circular mean per window is sufficient to represent the local illuminant even when multiple light sources are present.
    This is the key simplifying assumption of IFFCC; the authors partially compensate by training with blended ground truth, but it limits accuracy on sharp light boundaries.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Integral Fast Fourier Color Constancy." pith.science (2026). https://pith.science/paper/RGN5CAK7

@misc{pith2026250203494,
  author       = {Pith},
  title        = {Pith review of: Integral Fast Fourier Color Constancy},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/RGN5CAK7}},
  note         = {Machine review of arXiv:2502.03494}
}
abstract

Traditional auto white balance (AWB) algorithms typically assume a single global illuminant source, which leads to color distortions in multi-illuminant scenes. While recent neural network-based methods have shown excellent accuracy in such scenarios, their high parameter count and computational demands limit their practicality for real-time video applications. The Fast Fourier Color Constancy (FFCC) algorithm was proposed for single-illuminant-source scenes, predicting a global illuminant source with high efficiency. However, it cannot be directly applied to multi-illuminant scenarios unless specifically modified. To address this, we propose Integral Fast Fourier Color Constancy (IFFCC), an extension of FFCC tailored for multi-illuminant scenes. IFFCC leverages the proposed integral UV histogram to accelerate histogram computations across all possible regions in Cartesian space and parallelizes Fourier-based convolution operations, resulting in a spatially-smooth illumination map. This approach enables high-accuracy, real-time AWB in multi-illuminant scenes. Extensive experiments show that IFFCC achieves accuracy that is on par with or surpasses that of pixel-level neural networks, while reducing the parameter count by over $400\times$ and processing speed by 20 - $100\times$ faster than network-based approaches.

Figures

Figures reproduced from arXiv: 2502.03494 by the authors.

Figure 1
Figure 1. Frameworks comparison between IFFCC and FFCC [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Overview of the IFFCC process for predicting multi-illuminant scenes. We precompute the integral UV histogram of the input [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Visualization of the comparison results on the LSMI dataset. For IFFCC, the window size is set to 128 with an overlap of 64. In [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Visualization of illumination comparison for different patch-based methods. The window size is 32, with an overlap size of 16. [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: (a)-(d) show illumination maps generated with different [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

48 extracted references · 47 canonical work pages

  1. [1]

    A comparison of computational color constancy algo- rithms

    Kobus Barnard, Vlad Cardei, and Brian Funt. A comparison of computational color constancy algo- rithms. i: Methodology and experiments with synthe- sized data. IEEE transactions on Image Processing , 11(9):972–984, 2002. 2

    work page 2002

  2. [2]

    Convolutional color constancy

    Jonathan T Barron. Convolutional color constancy. In Proceedings of the IEEE International Conference on Computer Vision, pages 379–387, 2015. 2, 3

    work page 2015

  3. [3]

    Fast fourier color constancy

    Jonathan T Barron and Yun-Ta Tsai. Fast fourier color constancy. In Proceedings of the IEEE conference on computer vision and pattern recognition , pages 886– 894, 2017. 1, 2, 3, 6

    work page 2017

  4. [4]

    Multi-illuminant estimation with conditional random fields

    Shida Beigpour, Christian Riess, Joost Van De Weijer, and Elli Angelopoulou. Multi-illuminant estimation with conditional random fields. IEEE Transactions on Image Processing, 23(1):83–96, 2013. 2, 6

    work page 2013

  5. [5]

    Adap- tive color constancy using faces

    Simone Bianco and Raimondo Schettini. Adap- tive color constancy using faces. IEEE transactions on pattern analysis and machine intelligence , 36(8): 1505–1518, 2014. 2

    work page 2014

  6. [6]

    Color constancy using cnns

    Simone Bianco, Claudio Cusano, and Raimondo Schettini. Color constancy using cnns. In Proceed- ings of the IEEE conference on computer vision and pattern recognition workshops, pages 81–89, 2015. 2

    work page 2015

  7. [7]

    Single and multiple illuminant estimation using convolutional neural networks

    Simone Bianco, Claudio Cusano, and Raimondo Schettini. Single and multiple illuminant estimation using convolutional neural networks. IEEE Transac- tions on Image Processing, 26(9):4347–4362, 2017. 2, 6, 8

    work page 2017

  8. [8]

    Color constancy and non-uniform illu- mination: Can existing algorithms work? In 2011 IEEE international conference on computer vision workshops (ICCV Workshops), pages 774–781

    Michael Bleier, Christian Riess, Shida Beigpour, Eva Eibenberger, Elli Angelopoulou, Tobias Tr ¨oger, and Andr´e Kaup. Color constancy and non-uniform illu- mination: Can existing algorithms work? In 2011 IEEE international conference on computer vision workshops (ICCV Workshops), pages 774–781. IEEE,

    work page 2011

Show all 48 references
  1. [9]

    A spatial processor model for object colour perception

    Gershon Buchsbaum. A spatial processor model for object colour perception. Journal of the Franklin in- stitute, 310(1):1–26, 1980. 2

    1980

  2. [10]

    A spatial processor model for object colour perception

    Gershon Buchsbaum. A spatial processor model for object colour perception. Journal of the Franklin in- stitute, 310(1):1–26, 1980. 1, 2

    1980

  3. [11]

    Illuminant estimation for color constancy: why spatial-domain methods work and the role of the color distribution

    Dongliang Cheng, Dilip K Prasad, and Michael S Brown. Illuminant estimation for color constancy: why spatial-domain methods work and the role of the color distribution. JOSA A, 31(5):1049–1058, 2014. 1, 2

    2014

  4. [12]

    Outdoor daytime multi-illuminant color constancy

    Ilija Domislovi ´c, Donik Vrsnak, Marko Suba ˇsi´c, and Sven Lon ˇcari´c. Outdoor daytime multi-illuminant color constancy. In 2021 12th International Sympo- sium on Image and Signal Processing and Analysis (ISPA), pages 270–275. IEEE, 2021. 6

    2021

  5. [13]

    Shadows & lumination: Two- illuminant multiple cameras color constancy dataset

    Ilija Domislovi ´c, Donik Vr ˇsnak, Marko Suba ˇsi´c, and Sven Lon ˇcari´c. Shadows & lumination: Two- illuminant multiple cameras color constancy dataset. Expert systems with applications , 224:120045, 2023. 5

    2023

  6. [14]

    Color constancy for non-uniform il- lumination estimation with variable number of illumi- nants

    Ilija Domislovi ´c, Donik Vrˇsnjak, Marko Subaˇsi´c, and Sven Lon ˇcari´c. Color constancy for non-uniform il- lumination estimation with variable number of illumi- nants. Neural Computing and Applications , 35(20): 14825–14835, 2023. 2

    2023

  7. [15]

    Color constancy at a pixel

    Graham D Finlayson and Steven D Hordley. Color constancy at a pixel. JOSA A, 18(2):253–264, 2001. 3

    2001

  8. [16]

    Shades of gray and colour constancy

    Graham D Finlayson and Elisabetta Trezzi. Shades of gray and colour constancy. In Color and Imaging Conference, pages 37–41. Society of Imaging Science and Technology, 2004. 2

    2004

  9. [17]

    Finlayson, Steven D

    Graham D. Finlayson, Steven D. Hordley, and Paul M. Hubel. Color by correlation: A simple, unifying framework for color constancy. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11): 1209–1221, 2001. 2

    2001

  10. [18]

    A novel algorithm for color con- stancy

    David A Forsyth. A novel algorithm for color con- stancy. International Journal of Computer Vision , 5 (1):5–35, 1990. 1, 2

    1990

  11. [19]

    Color constancy

    David H Foster. Color constancy. Vision research, 51 (7):674–700, 2011. 1

    2011

  12. [20]

    Efficient color constancy with lo- cal surface reflectance statistics

    Shaobing Gao, Wangwang Han, Kaifu Yang, Chaoyi Li, and Yongjie Li. Efficient color constancy with lo- cal surface reflectance statistics. In Computer Vision– ECCV 2014: 13th European Conference, Zurich, Switzerland, September 6-12, 2014, Proceedings, Part II 13, pages 158–173....

    2014

  13. [21]

    Generalized gamut mapping using image deriva- tive structures for color constancy.International Jour- nal of Computer Vision, 86:127–139, 2010

    Arjan Gijsenij, Theo Gevers, and Joost Van De Wei- jer. Generalized gamut mapping using image deriva- tive structures for color constancy.International Jour- nal of Computer Vision, 86:127–139, 2010. 1, 2

    2010

  14. [22]

    Computational color constancy: Survey and ex- periments

    Arjan Gijsenij, Theo Gevers, and Joost Van De Wei- jer. Computational color constancy: Survey and ex- periments. IEEE transactions on image processing , 20(9):2475–2489, 2011. 1

    2011

  15. [23]

    Improving color constancy by photometric edge weighting

    Arjan Gijsenij, Theo Gevers, and Joost Van De Wei- jer. Improving color constancy by photometric edge weighting. IEEE Transactions on Pattern Analysis and Machine Intelligence , 34(5):918–929, 2011. 1, 2, 8

    2011

  16. [24]

    Color con- stancy for multiple light sources

    Arjan Gijsenij, Rui Lu, and Theo Gevers. Color con- stancy for multiple light sources. IEEE Transactions on image processing, 21(2):697–707, 2011. 2, 6

    2011

  17. [25]

    Guided im- age filtering

    Kaiming He, Jian Sun, and Xiaoou Tang. Guided im- age filtering. IEEE transactions on pattern analysis and machine intelligence, 35(6):1397–1409, 2012. 5

    2012

  18. [26]

    Light mixture estimation for spatially varying white balance

    Eugene Hsu, Tom Mertens, Sylvain Paris, Shai Avi- dan, and Fr ´edo Durand. Light mixture estimation for spatially varying white balance. In ACM SIGGRAPH 2008 papers, pages 1–7. 2008. 2

    2008

  19. [27]

    Fc4: Fully convolutional color constancy with confidence- weighted pooling

    Yuanming Hu, Baoyuan Wang, and Stephen Lin. Fc4: Fully convolutional color constancy with confidence- weighted pooling. In Proceedings of the IEEE con- ference on computer vision and pattern recognition , pages 4085–4094, 2017. 1, 2

    2017

  20. [28]

    White balance un- der mixed illumination using flash photography

    Zhuo Hui, Aswin C Sankaranarayanan, Kalyan Sunkavalli, and Sunil Hadap. White balance un- der mixed illumination using flash photography. In 2016 IEEE International Conference on Computa- tional Photography (ICCP), pages 1–10. IEEE, 2016. 2

    2016

  21. [29]

    Color constancy algorithm for mixed-illuminant scene im- ages

    Md Akmol Hussain and Akbar Sheikh Akbari. Color constancy algorithm for mixed-illuminant scene im- ages. IEEE Access, 6:8964–8976, 2018. 6

    2018

  22. [30]

    Image-to-image translation with conditional adversarial networks

    Phillip Isola, Jun-Yan Zhu, Tinghui Zhou, and Alexei A Efros. Image-to-image translation with conditional adversarial networks. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 1125–1134, 2017. 8

    2017

  23. [31]

    Large scale multi-illuminant (lsmi) dataset for developing white balance algorithm under mixed illumination

    Dongyoung Kim, Jinwoo Kim, Seonghyeon Nam, Dongwoo Lee, Yeonkyung Lee, Nahyup Kang, Hyong-Euk Lee, ByungIn Yoo, Jae-Joon Han, and Seon Joo Kim. Large scale multi-illuminant (lsmi) dataset for developing white balance algorithm under mixed illumination. In Proceedings of the IE...

    2021

  24. [32]

    Attentive illumination decomposition model for multi-illuminant white balancing

    Dongyoung Kim, Jinwoo Kim, Junsang Yu, and Seon Joo Kim. Attentive illumination decomposition model for multi-illuminant white balancing. In Pro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 25512–25521,

  25. [33]

    The retinex theory of color vision

    Edwin H Land. The retinex theory of color vision. In Proceedings of the Royal Institution of Great Britain , page 23, 1974. 1, 2

    1974

  26. [34]

    Transcc: Transformer-based multiple illuminant color constancy using multitask learning

    Shuwei Li, Jikai Wang, Michael S Brown, and Robby T Tan. Transcc: Transformer-based multiple illuminant color constancy using multitask learning. arXiv preprint arXiv:2211.08772, 1(2):3, 2022. 1

    2022 arXiv

  27. [35]

    Self-adaptive single and multi-illuminant estimation framework based on deep learning

    Yongjie Liu and Sijie Shen. Self-adaptive single and multi-illuminant estimation framework based on deep learning. arXiv preprint arXiv:1902.04705, 2019. 2

    1902 arXiv

  28. [36]

    Clcc: Contrastive learning for color con- stancy

    Yi-Chen Lo, Chia-Che Chang, Hsuan-Chao Chiu, Yu- Hao Huang, Chia-Ping Chen, Yu-Lin Chang, and Kevin Jou. Clcc: Contrastive learning for color con- stancy. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages 8053–8063, 2021. 2

    2021

  29. [37]

    Object-centric learning with slot attention

    Francesco Locatello, Dirk Weissenborn, Thomas Un- terthiner, Aravindh Mahendran, Georg Heigold, Jakob Uszkoreit, Alexey Dosovitskiy, and Thomas Kipf. Object-centric learning with slot attention. Advances in neural information processing systems , 33:11525– 11538, 2020. 2

    2020

  30. [38]

    Statistics of directional data

    Kantilal Varichand Mardia. Statistics of directional data. Journal of the Royal Statistical Society Series B: Statistical Methodology, 37(3):349–371, 1975. 3

    1975

  31. [39]

    A dataset of multi-illumination images in the wild

    Lukas Murmann, Michael Gharbi, Miika Aittala, and Fredo Durand. A dataset of multi-illumination images in the wild. In Proceedings of the IEEE/CVF Interna- tional Conference on Computer Vision , pages 4080– 4089, 2019. 2

    2019

  32. [40]

    Integral histogram: A fast way to extract histograms in cartesian spaces

    Fatih Porikli. Integral histogram: A fast way to extract histograms in cartesian spaces. In 2005 IEEE Com- puter Society Conference on Computer Vision and Pat- tern Recognition (CVPR’05) , pages 829–836. IEEE,

    2005

  33. [41]

    Recurrent color con- stancy

    Yanlin Qian, Ke Chen, Jarno Nikkanen, Joni-Kristian Kamarainen, and Jiri Matas. Recurrent color con- stancy. In Proceedings of the IEEE international con- ference on computer vision , pages 5458–5466, 2017. 2

    2017

  34. [42]

    On finding gray pixels

    Yanlin Qian, Joni-Kristian Kamarainen, Jarno Nikka- nen, and Jiri Matas. On finding gray pixels. In CVPR,

  35. [43]

    A benchmark for burst color constancy

    Yanlin Qian, Jani K ¨apyl¨a, Joni-Kristian K ¨am¨ar¨ainen, Samu Koskinen, and Jiri Matas. A benchmark for burst color constancy. In ECCVW, 2020. 2

    2020

  36. [44]

    Deep specialized network for illuminant estimation

    Wu Shi, Chen Change Loy, and Xiaoou Tang. Deep specialized network for illuminant estimation. In Computer Vision–ECCV 2016: 14th European Con- ference, Amsterdam, The Netherlands, October 11– 14, 2016, Proceedings, Part IV 14 , pages 371–387. Springer, 2016. 6

    2016

  37. [45]

    Oleksii Sidorov. Conditional gans for multi-illuminant color constancy: Revolution or yet another approach? In Proceedings of the IEEE/CVF conference on com- puter vision and pattern recognition workshops, pages 0–0, 2019. 1

    2019

  38. [46]

    Oleksii Sidorov. Conditional gans for multi-illuminant color constancy: Revolution or yet another approach? In Proceedings of the IEEE/CVF conference on com- puter vision and pattern recognition workshops, pages 0–0, 2019. 2

    2019

  39. [47]

    Edge-based color constancy

    Joost Van De Weijer, Theo Gevers, and Arjan Gijsenij. Edge-based color constancy. IEEE Transactions on image processing, 16(9):2207–2214, 2007. 2

    2007

  40. [48]

    End-to-end illuminant estimation based on deep metric learning

    Bolei Xu, Jingxin Liu, Xianxu Hou, Bozhi Liu, and Guoping Qiu. End-to-end illuminant estimation based on deep metric learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition, pages 3616–3625, 2020. 2

    2020

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.