This paper presents a modi.ed version of the classical split and merge algorithm. Instead of performing a regular decomposition of the image, it relies on a split at an optimal position that does a good interregion separation. The implementation of the algorithm uses an initial image preprocessing to speed-up computation. Experimental results show that number of regions generated by the split phase is largely reduced and that the distorsion of segmented image is smaller, while the execution time is slightly increased.