Research and improvement of method for vector data compression based on dynamic programming

Hua Song · Journal of Computer Applications · 2009

The application of dynamic programming to vector data compression is a very effective method of optimized compression.The error of the result compressed by this method is minimal.But it can lead to local distortion.Aiming at this disadvantage,an improved algorithm was proposed.The improved algorithm prevents from local distortion by setting threshold to limit the maximum displacement in the process of executing and corrects the problem existing in the formula of dynamic programming in the scheme presented by A.KOLESNIKOV et al.The experimental results show that the improved algorithm can deal well with the problem of local distortion while maintaining the advantage of the dynamic programming algorithm.

Read the paper · More papers on PaperTik