Pith

open record

sign in

arxiv: 1611.07596 · v3 · pith:VNVUY4M4 · submitted 2016-11-23 · cs.CV

Fast Fourier Color Constancy

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VNVUY4M4record.jsonopen to challenge →

classification cs.CV
keywords ffcccolorconstancyalgorithmerrorfastfourierilluminant
0
0 comments X
read the original abstract

We present Fast Fourier Color Constancy (FFCC), a color constancy algorithm which solves illuminant estimation by reducing it to a spatial localization task on a torus. By operating in the frequency domain, FFCC produces lower error rates than the previous state-of-the-art by 13-20% while being 250-3000 times faster. This unconventional approach introduces challenges regarding aliasing, directional statistics, and preconditioning, which we address. By producing a complete posterior distribution over illuminants instead of a single illuminant estimate, FFCC enables better training techniques, an effective temporal smoothing technique, and richer methods for error analysis. Our implementation of FFCC runs at ~700 frames per second on a mobile device, allowing it to be used as an accurate, real-time, temporally-coherent automatic white balance algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.