Authors: S. Anuvelavan; M. Ganesh; P. Ganesan
Addresses: Department of Computer Science and Engineering, University College of Engineering, BIT Campus, Anna University, Trichirappalli, India ' Department of Computer Science and Engineering, Shadan College of Engineering, Peerancheru, Himayath Sagar Road, India Hyderabad, India ' Department of Electronics and Communication Engineering, Vidya Jyothi Institute of Technology, Hyderabad, India
Abstract: In this work, a new patch-based texture synthesis scheme with orthogonal polynomials model coefficients is presented. The proposed scheme has four phases. In the first phase, a block matching technique that identifies a best match, to synthesis in the output image of bigger size is designed in terms of ordered orthogonal polynomials model coefficients. In case of successful match of block, called patch-hit, the proposed scheme finds candidate blocks with triangular search, in the next phase. In the patch selection phase, the proposed scheme considers a subset of orthogonal polynomials model coefficients among the blocks, for the purpose of synthesis which consumes less memory and time. This synthesised output is smoothened in the final phase, by preserving the low level contents between the synthesised patches. The performance of the proposed scheme is measured with energy, contrast, correlation, homogeneity and entropy between the original and synthesised images and is also compared with existing texture synthesis schemes. The results are encouraging.
Keywords: texture synthesis; orthogonal polynomials; patch-hit; candidate block; patch selection.
International Journal of Business Intelligence and Data Mining, 2020 Vol.17 No.4, pp.428 - 443
Received: 08 Aug 2017
Accepted: 15 Jan 2018
Published online: 28 Apr 2020 *