CLC number: TP391.7
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 2015-10-21
Cited: 1
Clicked: 7159
Hao Xie, Ruo-feng Tong. Image meshing via hierarchical optimization[J]. Frontiers of Information Technology & Electronic Engineering, 2016, 17(1): 32-40.
@article{title="Image meshing via hierarchical optimization",
author="Hao Xie, Ruo-feng Tong",
journal="Frontiers of Information Technology & Electronic Engineering",
volume="17",
number="1",
pages="32-40",
year="2016",
publisher="Zhejiang University Press & Springer",
doi="10.1631/FITEE.1500171"
}
%0 Journal Article
%T Image meshing via hierarchical optimization
%A Hao Xie
%A Ruo-feng Tong
%J Frontiers of Information Technology & Electronic Engineering
%V 17
%N 1
%P 32-40
%@ 2095-9184
%D 2016
%I Zhejiang University Press & Springer
%DOI 10.1631/FITEE.1500171
TY - JOUR
T1 - Image meshing via hierarchical optimization
A1 - Hao Xie
A1 - Ruo-feng Tong
J0 - Frontiers of Information Technology & Electronic Engineering
VL - 17
IS - 1
SP - 32
EP - 40
%@ 2095-9184
Y1 - 2016
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.1500171
Abstract: Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., definition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to find a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to find a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to finer ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
This paper proposes a new approach to image meshing as a way to compactly represent images. The major new idea is to use a hierarchical optimization with the combined color and location to make the problem more tractable. The experimental results demonstrate that the method produces improved results over state of the art. Overall, it is a nice paper with soild technical contribution and interesting results.
[1]Adams, M.D., 2011. A flexible content-adaptive mesh-generation strategy for image representation. IEEE Trans. Image Process., 20(9):2414-2427.
[2]Demaret, L., Iske, A., 2004. Advances in digital image compression by adaptive thinning. Ann. MCFA, 3:105-109.
[3]Demaret, L., Dyn, N., Iske, A., 2006. Image compression by linear splines over adaptive triangulations. Signal Process., 86(7):1604-1616.
[4]Hu, S.M., Zhang, F.L., Wang, M., et al., 2013. PatchNet: a patch-based image representation for interactive library-driven image editing. ACM Trans. Graph., 32(6):196.
[5]Huynh-Thu, Q., Ghanbari, M., 2008. Scope of validity of PSNR in image/video quality assessment. Electron. Lett., 44(13):800-801.
[6]Lai, Y.K., Hu, S.M., Martin, R.R., 2009. Automatic and topology-preserving gradient mesh generation for image vectorization. ACM Trans. Graph., 28(3):85.
[7]Lecot, G., Levy, B., 2006. Ardeco: automatic region detection and conversion. 17th Eurographics Symp. on Rendering, p.349-360.
[8]Liao, Z.C., Hoppe, H., Forsyth, D., et al., 2012. A subdivision-based representation for vector image editing. IEEE Trans. Vis. Comput. Graph., 18(11):1858-1867.
[9]Liu, D.C., Nocedal, J., 1989. On the limited memory BFGS method for large-scale optimization. Math. Program., 45(3):503-528.
[10]Sieger, D., Botsch, M., 2012. Design, implementation, and evaluation of the surface_mesh data structure. Proc. 20th Int. Meshing Roundtable, p.533-550.
[11]Sun, J., Liang, L., Wen, F., et al., 2007. Image vectorization using optimized gradient meshes. ACM Trans. Graph., 26(3):11.
[12]Swaminarayan, S., Prasad, L., 2006. Rapid automated polygonal image decomposition. 35th IEEE Applied Imagery and Pattern Recognition Workshop, p.28-33.
[13]Xia, T., Liao, B.B., Yu, Y.Z., 2009. Patch-based image vectorization with automatic curvilinear feature alignment. ACM Trans. Graph., 28(5):115.
[14]Xie, H., Tong, R.F., Zhang, Y., 2014. Image meshing via alternative optimization. J. Comput. Inform. Syst., 10(19):8209-8217.
[15]Xiong, S.Y., Zhang, J.Y., Zheng, J.M., et al., 2014. Robust surface reconstruction via dictionary learning. ACM Trans. Graph., 33(6).
[16]Xu, L., Lu, C.W., Xu, Y., et al., 2011. Image smoothing via L0 gradient minimization. ACM Trans. Graph., 30(6):174.
[17]Yang, Y.Y., Wernick, M.N., Brankov, J.G., 2003. A fast approach for accurate content-adaptive mesh generation. IEEE Trans. Image Process., 12(8):866-881.
Open peer comments: Debate/Discuss/Question/Opinion
<1>