Abstract
Images are full of information and most often, little information is desired for subsequent processing. Hence, region of interest has key importance in image processing. Quadtree image segmentation has been widely used in many image processing applications to locate the region of interest for further processing. There are also variable block-size image coding techniques to effectively reduce the number of transmitted parts. This paper presents quadtree partition technique as a pre-processing step in image processing to determine what part should be more heterogeneous than the others. It also introduces an idea to solve the problem of squared images. Finally, proposed approach is implemented and analysed. The simulation of the Matlab code of the quadtree is represented by all algorithms and the figures. Thus, achieved results are promising in the state of the art.