Imaging Components, Systems, and Processing

Constrained low-rank gamut completion for robust illumination estimation

[+] Author Affiliations
Jianshen Zhou

Capital Normal University, Beijing Advanced Innovation Center for Imaging Technology, Beijing, China

Jiazheng Yuan

Beijing Union University, Beijing Key Laboratory of Information Service Engineering, Beijing, China

Computer Technology Institute of Beijing Union University, Beijing, China

Hongzhe Liu

Beijing Union University, Beijing Key Laboratory of Information Service Engineering, Beijing, China

Opt. Eng. 56(2), 023102 (Feb 08, 2017). doi:10.1117/1.OE.56.2.023102
History: Received July 12, 2016; Accepted January 5, 2017
Text Size: A A A

Abstract.  Illumination estimation is an important component of color constancy and automatic white balancing. According to recent survey and evaluation work, the supervised methods with a learning phase are competitive for illumination estimation. However, the robustness and performance of any supervised algorithm suffer from an incomplete gamut in training image sets because of limited reflectance surfaces in a scene. In order to address this problem, we present a constrained low-rank gamut completion algorithm, which can replenish gamut from limited surfaces in an image, for robust illumination estimation. In the proposed algorithm, we first discuss why the gamut completion is actually a low-rank matrix completion problem. Then a constrained low-rank matrix completion framework is proposed by adding illumination similarities among the training images as an additional constraint. An optimization algorithm is also given out by extending the augmented Lagrange multipliers. Finally, the completed gamut based on the proposed algorithm is fed into the support vector regression (SVR)-based illumination estimation method to evaluate the effect of gamut completion. The experimental results on both synthetic and real-world image sets show that the proposed gamut completion model not only can effectively improve the performance of the original SVR method but is also robust to the surface insufficiency in training samples.

Figures in this Article
© 2017 Society of Photo-Optical Instrumentation Engineers

Topics

Matrices ; Algorithms

Citation

Jianshen Zhou ; Jiazheng Yuan and Hongzhe Liu
"Constrained low-rank gamut completion for robust illumination estimation", Opt. Eng. 56(2), 023102 (Feb 08, 2017). ; http://dx.doi.org/10.1117/1.OE.56.2.023102


Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging & repositioning the boxes below.

Related Book Chapters

Topic Collections

PubMed Articles
Advertisement
  • Don't have an account?
  • Subscribe to the SPIE Digital Library
  • Create a FREE account to sign up for Digital Library content alerts and gain access to institutional subscriptions remotely.
Access This Article
Sign in or Create a personal account to Buy this article ($20 for members, $25 for non-members).
Access This Proceeding
Sign in or Create a personal account to Buy this article ($15 for members, $18 for non-members).
Access This Chapter

Access to SPIE eBooks is limited to subscribing institutions and is not available as part of a personal subscription. Print or electronic versions of individual SPIE books may be purchased via SPIE.org.