期刊文献+

基于位平面分解的三角形NAM图像表示 被引量:3

BPD-based Triangle NAM for Image Representation
下载PDF
导出
摘要 位平面分解是一种能够有效地降低图像的复杂性的方法,而三角形Packing问题是一类特殊的Packing问题,在许多领域里得到了广泛的应用,有着巨大理论价值和实际意义.因此,借助于位平面分解和三角形Packing问题的思想,以提高多值图像的表示效率为目标,提出了一种基于位平面分解的的三角形NAM(非对称逆布局模式表示模型)的图像表示方法.给出并实现了基于位平面分解的三角形NAM的图像表示算法,理论分析和实验结果表明:与流行的线性四元树表示方法相比,基于位平面分解的三角形NAM表示方法能更有效地减少数据存储空间,是多值图像模式的一种良好的表示方法. The binary-bit plane decomposition (BPD) is an effective method that can greatly reduce the complexity of a multivalued image. The triangle packing problem is one kind of special packing problems, which is widely applied in many fields and has a great theoretical value and practical meaning. Therefore, inspired by the concept of BPD and the triangle packing problem, aiming at improving the representation efficiency of a multi-valued image pattern, we present an image representation method of BPD-based triangle non-symmetry and anti-packing pattern representation model (NAM) in this paper. Also, an algorithm of BPD-based triangle NAM for a multi-valued image is described and implemented. The theoretical and experimental results presented in this paper show that the BPD-based triangle NAM method can reduce the data storage much more effec- tively than the popular linear quadtree method and is a better method to represent a multivalued image pattern.
出处 《小型微型计算机系统》 CSCD 北大核心 2009年第1期100-105,共6页 Journal of Chinese Computer Systems
基金 国家高技术研究发展计划"八六三"项目(2006AA04Z211)资助
关键词 位平面分解 三角形 NAM 图像表示 binary-bit plane decomposition triangular NAM image representation
  • 相关文献

参考文献15

  • 1Cline D, Egbert K P. Terrain decimation through quadtree morphing[J]. IEEE Trans. on Visualization and Computer Graphics, 2001,7(1):62-69.
  • 2Laguardia J J, Cueto E, Doblare M. A natural neighbour galerkin method with quadtree structure [J]. International Journal for Numerical Methods in Engineering, 2005, 63 (6): 789-812.
  • 3Pajarola R, Antonijuan M, Lario R. QuadTIN: quadtree based triangulated irregular networks[C]. Proceeding of IEEE Visualization, 2002, 395-402.
  • 4Minglun G, Yee-hong Y. Quadtree-based genetic algorithm and its applications to computer vision [J]. Pattern Recognition, 2004, 37 (8) : 1723-1733.
  • 5Klinger A. Data structure and pattern recognition[C]. Proceeding of IJCPR, Washington, DC, USA, 1973, 497-498.
  • 6Samet H. Region representation., quadtrees from binary arrays [J]. Computer Graphics and Image Processing, 1980, 13 (1) : 88-93.
  • 7Gargantini I. An effective way to represent quadtrees [J]. Comm. ACM, 1982, 25(12):905-910.
  • 8Manouvrier M, Rukoz M, Jomier G. Quadtree representations for storage and manipulation of clusters of images[J]. Image and Vision Computing, 2002, 20(7) :513-527.
  • 9Wang C L, Wu S C, Chang Y K. Quadtree and statistical model-based lossless binary image compression method[J]. Imaging Science Journal, 2005, 53(2): 95-103.
  • 10Laszlo M, Mukherjee S. A genetic algorithm using hyper-quadtrees for low-dimensional k-means clustering [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006, 28(4) :533-543.

二级参考文献15

  • 1黄文奇,朱虹,许向阳,宋益民.求解方格packing问题的启发式算法[J].计算机学报,1993,16(11):829-836. 被引量:14
  • 2D S Hochbaum, W Maass. Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI[J]. Journal of the ACM, 1985,23(1): 130-136.
  • 3M R Garey, D S Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness[M].New York: Freeman,1979.
  • 4RPenrose 许明贤 吴忠超译.皇帝新脑[M].长沙:湖南科学技术出版社,1992..
  • 5何大华 陈传波.关于算法和机械过程[A]..全国信息与计算科学学术研讨会论文集[C].,2002.25-28.
  • 6K A Dowsland, W B Dowsland. Packing Problems[J]. European Journal of Operational Research, 1992,56(1):2-14.
  • 7V J Milenkovic, K M Daniels, Z Li. Automatic Marker Making[A].Proc of the 3rd Canadian Conf on Computational Geometry[C].1991.243-246.
  • 8R J Fowler, M S Paterson, S L Tanimoto. Optimal Packing and Covering in the Plane Are NP-complete[J]. Information Processing Letters,1981,12(3):133-137.
  • 9Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York:Freeman, 1979
  • 10Hochbaum D S, Maass W. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 1985,32(1): 130~136

共引文献11

同被引文献17

  • 1Tanaka Y, Ikehara M, Nguyen T Q. Multiresolution image representation using combined 2-D and 1-D directional filter banks[J]. IEEE Transactions on Image Processing, 2009, 18(2): 269-280.
  • 2Yang E, Wang L. Joint optimization of run-length coding, huffman coding, and quantization table with complete baseline JPEG decoder compatibility [J]. IEEE Transactions on Image Processing, 2009, 18(1): 63-74.
  • 3Papakostas G A, Boutalis Y S, Karras D A, et al. Fast numerically stable computation of orthogonal Fourier Mellin moments[J]. lET Computer Vision, 2007, 1(1): 11-16.
  • 4Kotoulas L, Andreadis I. Fast computation of chebyshev moments[J]. IEEE Transactions on Circuits and Systems for Video Technology, 2006, 16 (7): 884- 888.
  • 5Liu J G, Liu Y Z, Wang G Y. Fast discrete W transforms via computation of moments[J]. IEEE: Transactions on Signal Processing, 2005, 53(2) : 654-659.
  • 6Gargantini I. An effective way to represent quadtrees[J]. Comm A42M, 1982, 25(12): 905-910.
  • 7Zheng Y P, Chen C B, Sarem M. A novel algorithm for triangle non symmetry and anti-packing pattern representation model of gray images[C] // Proceedings of ICIC'07. Berlin: Springer Verlag, 2007: 832-841.
  • 8夏晖,陈传波,秦培煜,吕泽华.矩形NAM图像表示及其上的连通区域标记算法[J].计算机科学,2007,34(9):209-212. 被引量:7
  • 9郑运平,陈传波.一种基于非对称逆布局模型的彩色图像表示方法[J].软件学报,2007,18(11):2932-2941. 被引量:30
  • 10陈传波,夏晖,秦培煜,吕泽华.矩形NAM图像表示及其上欧拉数计算[J].小型微型计算机系统,2007,28(12):2233-2237. 被引量:9

引证文献3

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部