Abstract
In order to solve the problems of the criminisi algorithm in inpainting thangka image, such as the mistake matching phenomenon, image structure information inconsistent and the inaccurate matching standards, the new image inpainting algorithm based on thangka image structure information is proposed in this paper. The following three steps are the keys of this method. (1) The correlation of repaired block and its neighborhood block is introduced and the priority of formula is improved; (2) The exemplar-based size selection is improved, the adaptive patch size is automatically adjusted according to the exemplar-based information changes; (3) In order to solve mistake matching problem, the structure information of thangka image and color of Euclidean distance are combined as the new matching criterion. The experimental results show that the mistake matching phenomenon by the proposed method for thangka image is significantly reduced, the structure of thangka image is more fluent and smooth than them in comparative literature.
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.
