Some Basic Algorithms of Image Processing Based on the Bintree Representation Optimized for the Hierarchical Image
基于图象分层优化二元树结构表示的图象处理基本算法

In this paper, some basic algorithms of image processing based on the bintree representation optimized for the hierarchical image is studied. These basic algorithms are: point search algorithm, neighbor region search algorithm and same grey level search algorithm. Experimental results show that the search speeds of these algorithms of the bintree representation optimized for the hierarchical image are faster than that of the algorithms of the linear quadtree representation and point quadtree representation for the hierarchical image.