Abstract
In order to convert a color image into a monochrome one, the lightness components of pixels have to date been used as gray-levels for the representation of the monochrome image. However, saliencies of an image embedded only in the chrominance components are eliminated in such conversion. To cope with this problem, “Color2Gray” algorithm, which excels in the color removal of digital images, has been proposed by Gooch et al. [ACM Trans. Graphics 24 (2005) 634]. In this paper, the algorithm is first analyzed and its mathematical property is revealed. Then a fast Color2Gray algorithm is proposed by using the mathematical property. Finally, the validity and the effectiveness of the proposed algorithm are proven by some experiments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
