KEYWORDS: Diffusion, Semantics, Design and modelling, Deep learning, Data modeling, Image processing, Denoising, Image sharpness, Education and training
With the improvement of people's living standards, people have higher clothing safety and artistry requirements. Plant dyeing artworks use plant sap to dye natural and woven fabrics, thus creating a print close to nature, gorgeous in style, and free from the harmful components of chemical dyeing, which is recognized and widely used by highly knowledgeable people. However, the type and the design of plant dyeing artworks need to incorporate the artist's creative inspiration, which is limited by human work efficiency. It constrains the creation of plant-dyeing artworks and limits the speed of innovation. Deep learning has made significant progress in the field of artistic creation. In this paper, we propose to combine the disco diffusion model with the creation of plant-dyeing artworks. The high-quality image generation capability of the diffusion model and multi-modal content description is utilized to design and generate plant dyeing artworks. The original style is firstly modeled after photographs of the original plant dyeing artwork. The style type is further expanded using text descriptions. The disco diffusion model is then used to create the final plant-dyeing piece of art. The experiment results show that generating plant dyeing paintings based on the disco diffusion model achieves better visual results. Through the controlled generation process and high-quality work generation results, the stylized plant dyeing design works is obtained automatically. It provides strong support for the creation of plant dyeing art.
With the improvement of image processing tools and the flexibility of digital image editing, automatic image inpainting has found important applications in computer vision and has also become an important and challenging topic of research in image processing. Through the analysis of the exemplar-based image inpainting method, we found the calculation of priority of image patches to fill is beneficial to the textures than the geometric structure, while the geometric structure is more important to the filling than the textures, resulting in the problem of texture extension or the discontinuity of the geometric structure in the image. The image decomposition model is applied to decompose the image to in paint into two components: texture and cartoon, which are then filled respectively. We improve the calculation of the priority of the texture component and the cartoon component, which make it suitable to the image character. In order to solve the mismatch problem, we propose a measurement based on global structure information of the target patch and the candidate patch in this paper. The mean and variance of the pixels in the image patch representing the global structure of image patches added to the measurement formula can improve the accuracy of the best matching patch to fill the missing region. We compared our model with the Criminisi algorithm and its improved one, through applying the algorithm to the synthetic images and the natural image. We also compute the PNSF and SSIM values between the original images and the inpainted images to verify the effectiveness of the proposed algorithm. The experimental results show that the proposed algorithm can get more perceptually aware in painted results than the Criminisi algorithm and its improved algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.