Color rendering method and device for fractal pattern
A pattern and fractal technology, applied in image analysis, image data processing, instruments, etc., can solve the problem of lack of color expression elements, achieve the effect of simple method and overcome limitations
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0046] see figure 1 , embodiment 1, a kind of color rendering method of fractal pattern, comprises the following steps:
[0047] Step S110: Get the N affine transformations ω of the IFS system through the hidden Markov chain i Composing the family of affine transformations {X; ω 1 ,ω 2 ,…,ω N}, and set up the transition probability matrix P=(p ij ) N×N ,1≤i, j≤N.
[0048] Hidden Markov chain value N affine transformation ω of IFS system i The set of states composed of {X; ω 1 ,ω 2 ,…,ω N}, the observable sequence takes the value of the affine transformation point ω i (x), the observation result of x∈X(i=1,2,…,N). Let P=(p ij ) N×N , 1≤i, j≤N is the state transition probability matrix of the hidden Markov chain, and its element p ij represents the slave state ω i transition to state ω j The transition probability of , have: pij =P(S n = ω j |S n-1 = ω i ),1≤i,j≤N, satisfy
[0049] Step S120: Set the color value matrix (c jk ) N×M and the color probabili...
Embodiment 2
[0064] see figure 2 , another embodiment 2, a color rendering method of a fractal pattern, comprising the following steps:
[0065] Step S210: Obtain N affine transformations ω of the IFS system through the hidden Markov chain i Composing the family of affine transformations {X; ω 1 ,ω 2 ,…,ω N}, and set up the transition probability matrix P=(p ij ) N×N ,1≤i, j≤N.
[0066] Step S220: From the affine transformation family {X; ω 1 ,ω 2 ,…,ω N}, select some affine transformations, and decompose step by step according to the conversion formula to obtain sub-decoding
[0067] Step S230: Set the color value matrix (c jk ) N×M and the color probability matrix (q jk ) N×M ;
[0068] Step S240: Decoding according to the fraction Build a color model for each subimage
[0069] Step S250: According to transition probability matrix P=(p ij ) N×N ,1≤i,j≤N from the color model Randomly select an affine transformation in , and calculate the coordinates of the affine...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
PatSnap Eureka turns technology decisions into work you can execute. Powered by our Innovation Knowledge Graph, it runs expert workflows across engineering, life sciences, materials and intellectual property. Get your review-ready output in minutes.
