A Double Random Matrix Design Model for Fractal Art Patterns Based on Visual Characteristics. (31st August 2022)

• Record Type: Journal Article
• Authors: Xing, Qiang; Chen, Jie; Liu, Jieyu; Song, Baifeng
• Other Names: Cao Ning Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2022(2022)
• Publication Date: 2022-08-31
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2022/5376587
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : This paper adopts the method of visual characteristics of the double random matrix to conduct in-depth research and analysis on the design of fractal art patterns. For the practical application needs in fractal graphic design, a method is proposed to automatically extract the core base pattern based on fractal graphic content and generate a four-sided continuous pattern. The method first uses the Canny operator for edge detection to analyze the area of the main pattern. Then, it uses a grayscale cogeneration matrix to extract and analyze the graphic texture features, based on which the best splicing method is selected to splice the extracted pattern, and then, it achieves two splicing methods of flat row and staggered four-sided continuous pattern. The method has good practicality with low complexity and high versatility under the premise of ensuring the beauty of the generated four-sided continuous pattern. It can assist designers to design patterns, improve efficiency, and save design costs. In this paper, we improve the existing image segmentation methods, adopt two segmentation methods, namely quadratic tree segmentation and HV segmentation, propose a new local codebook selection strategy, and study the degree of self-adaptation of different methods to images in terms of segmentation methods and local codebook selection strategies. It makes the network unable to train efficiently on long text prediction problems. Finally, the improved algorithm of this paper is tested on the standard and living image libraries, and the experimental results show that the use of local codebooks makes the image coding speed significantly improved compared with the fixed fractal. In the face of the image to be retrieved, it is only necessary to perform the coding operation to obtain the fractal code to perform similarity matching, which can meet the requirement of real-time retrieval. Applying the improved distance formula, the search accuracy obtained on the test gallery is significantly better than that of the grayscale histogram algorithm.