Abstract
This paper presents a method of the colorization for a black and white imagery by propagating seed pixels. Although the colorization is an ill-posed problem, in this paper, the problem is solved based on local Markov property on images. At first, a user plants some color pixels as seeds on a grayscale image. Then, colors are propagated from the seed pixels by minimizing the color difference among connected 4-pixels. In this paper, a basic propagating algorithm is proposed and modified algorithms, which can stop the propagation at edge parts by setting partitions, are introduced. By comparing with a previous algorithm, the proposed algorithm works very well for both quality and speed.
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.
