摘要
针对敦煌壁画海量超大数字图像显示时打开速度慢、刷新困难等问题,提出了一种基于高斯金字塔分块分层数据组织算法。该算法在不损害图像的情况下,可以对图像中任意一块区域进行快速显示和浏览。实验表明,该算法能够实现海量超大数字图像的实时漫游,并且具有最佳分辨率及较高的平稳性。
To resolve the problems of open slowly and flush difficulty for the massive Dunhuang fresco image, this paper put forward an algorithm of blocks and layers structure based on Gaussian pyramid. This algorithm could rapid browse and process any area of image but not damaging original image. Experiment results show that the algorithm can achieve real-time massive image data roaming, and can realize the best resolution and have higher stability.
出处
《计算机应用研究》
CSCD
北大核心
2012年第3期1141-1142,共2页
Application Research of Computers
基金
国家文物局数字遗产保护基金资助项目(2009140-22/05)
