This article proposes a new approach based on linear programming optimization to solve the problem of determining the color of a complex fractal carpet pattern.The principle is aimed at finding suitable dyes for mixin...This article proposes a new approach based on linear programming optimization to solve the problem of determining the color of a complex fractal carpet pattern.The principle is aimed at finding suitable dyes for mixing and their exact concentrations,which,when applied correctly,gives the desired color.The objective function and all constraints of the model are expressed linearly according to the solution variables.Carpet design has become an emerging technological field known for its creativity,science and technology.Many carpet design concepts have been analyzed in terms of color,contrast,brightness,as well as other mathematical concepts such as geometric changes and formulas.These concepts represent a common process in the carpet industry.This article discusses the use of complex fractal images in carpet design and simplex optimization in color selection.展开更多
There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The i...There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The invariant measures arising from IFSP (Iterate Function System with Probability) using the probabilistic algorithm are also known as chaos games. The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis. The conventional choice of probability associated with each set /S/ to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.展开更多
Finding the optimal algorithm between an efficient encoding process and therate distortion is the main research in fractal image compression theory. A new method has beenproposed based on the optimization of the Least...Finding the optimal algorithm between an efficient encoding process and therate distortion is the main research in fractal image compression theory. A new method has beenproposed based on the optimization of the Least-Square Error and the orthogonal projection. A largenumber of domain blocks can be eliminated in order to speed-up fractal image compression. Moreover,since the rate-distortion performance of most fractal image coders is not satisfactory, an efficientbit allocation algorithm to improve the rate distortion is also proposed. The implementation andcomparison have been done with the feature extraction method to prove the efficiency of the proposedmethod.展开更多
Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches...Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches. The total encoding time is the sum of the timerequired to perform each match. In order to make this method more efficient in practical use, thefuzzy theory based on feature extraction of the projection and normalized codebook method has beenprovided to optimize the encoding time, based on the c-means clustering approach. The results of theimplementation of Rate Mean Square (RMS), Peak signal noise ratio (PSNR) and the encoding time ofthis proposed method have been compared to other methods like the Feature Extraction andSelf-orgarnization methods to show its efficiency.展开更多
文摘This article proposes a new approach based on linear programming optimization to solve the problem of determining the color of a complex fractal carpet pattern.The principle is aimed at finding suitable dyes for mixing and their exact concentrations,which,when applied correctly,gives the desired color.The objective function and all constraints of the model are expressed linearly according to the solution variables.Carpet design has become an emerging technological field known for its creativity,science and technology.Many carpet design concepts have been analyzed in terms of color,contrast,brightness,as well as other mathematical concepts such as geometric changes and formulas.These concepts represent a common process in the carpet industry.This article discusses the use of complex fractal images in carpet design and simplex optimization in color selection.
文摘There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency rendering algorithms. The invariant measures arising from IFSP (Iterate Function System with Probability) using the probabilistic algorithm are also known as chaos games. The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis. The conventional choice of probability associated with each set /S/ to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.
文摘Finding the optimal algorithm between an efficient encoding process and therate distortion is the main research in fractal image compression theory. A new method has beenproposed based on the optimization of the Least-Square Error and the orthogonal projection. A largenumber of domain blocks can be eliminated in order to speed-up fractal image compression. Moreover,since the rate-distortion performance of most fractal image coders is not satisfactory, an efficientbit allocation algorithm to improve the rate distortion is also proposed. The implementation andcomparison have been done with the feature extraction method to prove the efficiency of the proposedmethod.
文摘Though progress has been made in fractal compression techniques, the longencoding times still remain the main drawback of this technique, which results from the need ofperforming a large number of range-domain matches. The total encoding time is the sum of the timerequired to perform each match. In order to make this method more efficient in practical use, thefuzzy theory based on feature extraction of the projection and normalized codebook method has beenprovided to optimize the encoding time, based on the c-means clustering approach. The results of theimplementation of Rate Mean Square (RMS), Peak signal noise ratio (PSNR) and the encoding time ofthis proposed method have been compared to other methods like the Feature Extraction andSelf-orgarnization methods to show its efficiency.
