Abstract
A parallelized random iteration algorithm that is explicit in the iterated function system (IFS) code is proposed to speed up the decoding of fractal images. In a conventional random iteration algorithm, the fractal image is serially decoded and may generate undesirable transient points. The proposed intrinsic parallel random iteration (IPRI) algorithm determines only one initial point and can avoid the transient points. Moreover, the contractive affine transformations (CATs) denoted by the IFS code can operate in parallel and simultaneously generate subimages. The parallel capability is basically proportional to the number of CATs. Two generalized methods of the proposed IPRI algorithm are provided to solve the nonuniformity problem due to the unequal probabilities among CATs. Finally, the proposed IPRI algorithm can cooperate with a previous parallel decoding algorithm to obtain higher parallel capability. Simulation results demonstrate the validity of the proposed IPRI algorithm.
Sign-in/Register to access full text options 
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.
