Ruimin Hu
Abstract
The computation efficiency of quadtree-based algorithm can be improved greatly compared with the pixel-based one,for example,the perimeter calculation in binary image.But the general way can't work correctly when there are holes in image.A new approach is purposed in this paper,which is originated from image boundary track.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The computation efficiency of quadtree-based algorithm can be improved greatly compared with the pixel-based one,for example,the perimeter calculation in binary image.But the general way can't work correctly when there are holes in image.A new approach is purposed in this paper,which is originated from image boundary track.
Key concepts: Quadtree, Computer science, Perimeter, Binary image, Image (mathematics), Computation, Pixel, Binary number