How to find the optimal match block for a complex region block with high frequency signals more quickly and efficiently is a very difficult problem in fractal image compression.Considering of the parallel characteristic and the global seeking ability of genetic algorithm

combining with the characteristics of and the requests for match seeking

this paper proposes a compact genetic algorithm mutated by bit with holding the optimal individuals and applies the algorithm in the match seeking of high frequency regions.Analysis of the algorithm shows that this algorithm has much higher convergence ability

seeking speed

and global seeking ability than other random seeking algorithms.It can greatly improve the obtain ratio of the optimal match block and the seeking efficiency.Experimental results also show the superiority of its application in match seeking of fractal image compression.