Dissemin is shutting down on January 1st, 2025

Published in

IEEE International Conference on Image Processing 2005

DOI: 10.1109/icip.2005.1530560

Links

Tools

Export citation

Search in Google Scholar

Color by linear neighborhood embedding

Proceedings article published in 2005 by Guoping Qiu ORCID, Jian Guan
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

This paper presents a new semiautomatic method for adding colors to monochrome images. The new method, termed color by linear neighborhood embedding (CLNE) first computes the geometry of local image patches in the monochrome image and then transmits the geometry to the chrominance. Following computational methods of the locally linear embedding (LLE) algorithm, we compute the geometry of the monochrome image by solving a constrained least squares problem and embed the computed geometry in the chrominance images by solving a linearly constrained quadratic optimization problem, both in closed forms. We also show that the computed geometry of different color channels are highly correlated thus empirically supporting methods that embed the geometry of the monochrome in the chrominance for colorization.