Abstract：For redusing the region boundary extraction algorithm complexity

in this study

Z-map model to binary image with value-range is transformed

then region problem is extracted from binary image. Via scanning Row and run

right and left node of run is connected by its relationship between Row，then the loop is constructed by foregoing connection and extract region boundary. According to the relationship of the run’s connection

resume the region boundary information is resumed completely. The time complexity of extraction algorithm is O(n)

while n is the number of run. At last

the relation between the time consuming of the algorithm and the number of run

row and column were provided

while comparison of this arithmetic and before was also given.