J4

• Original Articles • Previous Articles     Next Articles

Fast method for Delaunay triangulation mesh generation in image representation

JIAO Wei-dong;LU Zhao-yang;HUANG Jin
  

  1. (State Key Lab. of Integrated Service Networks, Xidian Univ., Xi′an 710071, China)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-20 Published:2007-06-20

Abstract: Considering the failure of real time coding application in the DT model-based image coding scheme, a fast method to generate the Delaunay Triangulation mesh for image representation based on the MV or MD criterion is proposed by using the idea of multi-resolution searching. It searches the mesh nodes with gradual subtle step length in generation of the mesh by which the total of searching points is reduced one by one,so time can be saved and the computational efficiency improved. Simulation result shows that the proposed method saves almost one half time while keeping finely reconstructed image quality compared with the general method based on the MV or MD criterion, and that it still can get more accurate image representation under the same mesh generation time compared with the other existing methods.

Key words: Delaunay traingulation mesh, multi-resolution searching, image representation

CLC Number: 

  • TP391