Research on image processing algorithms on hexagonal grid
Yan Ye · Jisuanji gongcheng yu sheji · 2001
Many studies have shown that the best disposition of a discrete set of points on the plane can be re- ached if the points are on a hexagonal grid. This paper first discusses character of the hexagonal grid. A plane can be overlaid with hexagon. Each pixel is corresponding with a hexagon. Then the advantages of hexagonal grid over the square grid in view of displaying graphics and images processing have been given. Straight lines and curves that are displayed don't have feeling of gap, which make straight lines and curves smoother and better looking. Each pixel and all of their adjacency pixels have unique connection. This provides simple ap- proach for many applications of images processing and improves the efficiencies of algorithms. Moreover, the resolution of display can be increased by using hexagonal grid. Then the technique of digitizing on a hexa- gonal grid is proposed. Because quantization on the hexagonal grid is similar to that on rectangle grid, we em- phases on sampling problem. At last, an algorithm about correction of geometric distortion for image restoration and reconstruction is presented. This algorithm have shown that the calculation can be decreased under the same precision.