Image Approximation on Capacity-Constrained Power Diagram
Author:
Affiliation:

Fund Project:

National Natural Science Foundation of China (61472332, 61100105); Natural Science Foundation of Fujian Province of China (2015J01273); Fundamental Research Funds for the Central Universities (20720140520, 20720150002)

  • Article
  • | |
  • Metrics
  • |
  • Reference [26]
  • |
  • Related [20]
  • | | |
  • Comments
    Abstract:

    This paper proposes a novel method for piecewise polynomial image approximation based on the capacity-constrained power diagram. By associating the weights of a power diagram with the image color information, an efficient image approximation algorithm is designed which alternately optimizes the positions and the weights of a capacity-constrained power diagram. This method defines the density function by using error feedbacks and the saliency information of the original image, which guides the generation of the initial point distributions in the optimization. It solves the color image approximation problem by constructing the optimal power diagram. A capacity-constrained energy function is defined to measure the approximate error based on power diagram, and the explicit formulas are given for computation of the gradients of the energy function. The optimization of the energy function is converted into two sub-problems, which are tackled by alternately moving the point positions and updating the weights of the points of the power diagram. Experimental results show the correctness and efficiency of the method above.

    Reference
    [1] Chen ZG, Xiao YY, Cao J. Approximation by piecewise polynomials on Voronoi tessellation. Graphical Models, 2014,76(5):522-531.
    [2] Gregory L, Bruno L. Ardeco automatic region detection and conversion. In:Proc. of the 17th Eurographics Conf. on Rendering Techniques, 2006. 349-360.
    [3] Gan T, He YM, Zhu WL. Fast algorithm for image approximation based on cross-correlation estimation. Chinese Journal of Electronics, 2008,36(5):1019-1023(in Chinese with English abstract).
    [4] Peng Z, Tang LB, Zhao BJ, Zhou G. Image sparse approximation based on Tetrolet transform. Journal of Systems Engineering and Electronics, 2011,33(11):2536-2539(in Chinese with English abstract).
    [5] Nira D, David L, Samuel R. Data dependent triangulations for piecewise linear interpolation. IMA Journal of Numerical Analysis, 1990,10(1):18.
    [6] Oliver K, Bernd H. On simulated annealing and the construction of linear spline. IEEE Trans. on Visualization and Computer Graphics, 2001,7(1):17-31.
    [7] Dan S, Philip W. Image interpolation by pixel-level data-dependent triangulation. Computer Graphics Forum, 2004,23(2):189-201.
    [8] Ping L, Michael DA. A tuned mesh-generation strategy for image representation based on data-dependent triangulation. Trans. on Image Processing, 2013,22(5):2004-2018.
    [9] Xiao YY, Tu JC, Chen ZG. Aproximation by piecewise function based on generalized barycentric coordinates and voronoi tessellation. Journal of Computer Graphics, 2014,36(3):51-59(in Chinese with English abstract).
    [10] Aurenhammer F. Power diagram-properties algorithms and applications. SIAM Journal on Computing, 1987,16(1):78-96.
    [11] Dunavant DA. High degree efficient symmetrical Gaussian quadrature rules for the triangle. Int'l Journal for Numerical Methods in Engineering, 1985,21(6):1129-1148.
    [12] Rene R, Stanislav T, Eric M. Weight-Proportional space partitioning using adaptive Voronoi diagrams. Geoinformatica, 2007,11(3):383-405.
    [13] Lawson CL. Software for c1 surface interpolation. New York:Academic Press, 1977. 161-194.
    [14] Andreas F. CGAL-The computational geometry algorithm library. In:Proc. of the 10th Int'l Meshing Roundtable. 2001. 137-142.
    [15] Nivoliers V, Lévy B. Approximating functions on a mesh with restricted Voronoi diagrams. Computer Graphics Forum, 2013,32(5):83-92.
    [16] Patrick M, Pooran M, Fernando DG, Mathieu D. Hodge optimized triangulations. 2011,30(4):103:101-103:112.
    [17] Fernando DG, Katherine B, Victor O, Mathieu D. Blue noise through optimal transport. Trans. on Graphics, 2012,31(6):171.
    [18] Michael B, Daniel H. Capacity-Constrained Voronoi diagrams in finite spaces. Int'l Symp. on Voronoi Diagrams in Science and Engineering, 2008,33:13.
    [19] Henry K, Seungyong L, Charles K. Coherent line drawing. In:Proc. of the ACM Symp. on Non-Photorealistic Animation and Rendering. 2007. 43-50.
    [20] Pierre S. Morphological Image Analysis:Principles and Applications. 2nd ed., Berlin:Springer-Verlag, 2004,(5):49-53.
    [21] Radhakrishna A, Sheila H, Francisco E, Sabine S. Frequency-Tuned salient region detection. In:Proc. of the IEEE Int'l Conf. on Computer Vision and Pattern Recognition, 2009. 1597-1604.
    [22] Ming-Ming C, Guo XZ, Niloy JM, Huang XL, Hu SM. Global contrast based salient region detection. In:Proc. of the IEEE Int'l Conf. on Computer Vision and Pattern Recognition, 2011. 409-416.
    附中文参考文献:
    [3] 甘涛,何艳敏,朱维乐.基于互相关估计的快速图像逼近算法.中国电子学报,2008,36(5):1019-1023.
    [4] 彭洲,唐林波,赵保军,周刚.基于Tetrolet变换的图像稀疏逼近算法.系统工程与电子学报,20011,33(11):2536-2539.
    [9] 肖艳阳,涂锦灿,陈中贵.结合广义重心坐标与Voronoi剖分的函数分片逼近.图学学报,2014,36(3):51-59.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

刘红伟,曹娟,陈中贵.基于容积约束Power图的图像分片逼近.软件学报,2016,27(S2):184-196

Copy
Share
Article Metrics
  • Abstract:1749
  • PDF: 4041
  • HTML: 0
  • Cited by: 0
History
  • Received:May 10,2016
  • Revised:September 07,2016
  • Online: January 10,2017
You are the first2038304Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063