Quadratic trigonometric B-spline for image interpolation using GA

Abstract

In this article, a new quadratic trigonometric B-spline with control parameters is constructed to address the problems related to two dimensional digital image interpolation. The newly constructed spline is then used to design an image interpolation scheme together with one of the soft computing techniques named as Genetic Algorithm (GA). The idea of GA has been formed to optimize the control parameters in the description of newly constructed spline. The Feature SIMilarity (FSIM), Structure SIMilarity (SSIM) and Multi-Scale Structure SIMilarity (MS-SSIM) indices along with traditional Peak Signal-to-Noise Ratio (PSNR) are employed as image quality metrics to analyze and compare the outcomes of approach offered in this work, with three of the present digital image interpolation schemes. The upshots show that the proposed scheme is better choice to deal with the problems associated to image interpolation.

About the Authors:

Malik Zawwar Hussain

Roles Conceptualization, Formal analysis, Investigation, Methodology, Supervision, Visualization, Writing – original draft, Writing – review & editing

* E-mail: [email protected]

Affiliation: Department of Mathematics, University of the Punjab, Lahore, Pakistan

ORCID http://orcid.org/0000-0002-9335-3117

Samreen Abbas

Roles Conceptualization, Formal analysis, Investigation, Methodology, Supervision, Visualization, Writing – original draft, Writing – review & editing

Affiliation: Department of Mathematics, University of the Punjab, Lahore, Pakistan

Misbah Irshad

Roles Conceptualization, Formal analysis, Investigation, Methodology, Supervision, Visualization, Writing – original draft, Writing – review & editing

Affiliation: Department of Mathematics, Lahore College for Women University, Lahore, Pakistan

Abstract

In this article, a new quadratic trigonometric B-spline with control parameters is constructed to address the problems related to two dimensional digital image interpolation. The newly constructed spline is then used to design an image interpolation scheme together with one of the soft computing techniques named as Genetic Algorithm (GA). The idea of GA has been formed to optimize the control parameters in the description of newly constructed spline. The Feature SIMilarity (FSIM), Structure SIMilarity (SSIM) and Multi-Scale Structure SIMilarity (MS-SSIM) indices along with traditional Peak Signal-to-Noise Ratio (PSNR) are employed as image quality metrics to analyze and compare the outcomes of approach offered in this work, with three of the present digital image interpolation schemes. The upshots show that the proposed scheme is better choice to deal with the problems associated to image interpolation.

Figures

Table 2

Table 3

Table 4

Fig 1

Fig 2

Fig 3

Fig 4

Fig 5

Fig 6

Fig 7

Fig 8

Table 1

Table 2

Table 3

Table 4

Fig 1

Fig 2

Fig 3

Citation: Hussain MZ, Abbas S, Irshad M (2017) Quadratic trigonometric B-spline for image interpolation using GA. PLoS ONE 12(6): e0179721. https://doi.org/10.1371/journal.pone.0179721

Editor: Yeng-Tseng Wang, Kaohsiung Medical University, TAIWAN

Received: February 7, 2017; Accepted: June 2, 2017; Published: June 22, 2017

Copyright: © 2017 Hussain et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Data Availability: All relevant data is within the paper.

Funding: The author(s) received no specific funding for this work.

Competing interests: The authors have declared that no competing interests exist.

1. Introduction

Trigonometric polynomials and splines have always been beneficial in multifarious research areas such as medicines, electronics [1] and computer aided geometric design [2]. Recently trigonometric polynomials have attained pronounced attention in the field of image processing in particular to investigate problems related to image compression [3]. Trigonometric splines were first introduced by Schoenberg [4] with a recurrence relation established by Lyche and Winther [5] for trigonometric B-splines of arbitrary order. Furthermore Walz [6] discussed that trigonometric B-splines of odd order form a partition of a constant in case of equidistant knots. Keeping such utilities and application potentialities of trigonometric functions in view, several new quadratic and cubic trigonometric polynomials have been introduced by researchers later on [7–9].

In early years of developments in the field of image processing a variety of spline functions with confusing naming were found. Sometimes they are referred as cubic splines [10], bicubic splines [11] or high resolution splines [12], while interpolation is named as cubic convolution interpolation [13]. Hou and Andrews [10] for the first time discussed the computational implementation of B-splines as a tool in various digital image and signal processing applications both software and hardware point of view. The work was then extended by Unser in [14]. Parker, Kenyon and Troxel [12] studied comparison of different interpolation function with B-spline interpolation to preserve the quality of digital images. Luu, Wang, Vo, et al. [15] presented an improved interpolation method to enhance quality of two dimensional digital images with family of recursive interpolation functions based on B-spline representation and its inverse gradient weighting version.

In recent year some state-of-the-art image interpolation techniques became popular among the community of image processing. Li and Orchard [16] developed an edge-directed interpolation algorithm to estimate local covariance coefficients from a low-resolution image and adapt the interpolation at a higher resolution based on the geometric duality between their covariance. Li in [17] established a patch-based image interpolation algorithm under a set theoretic framework which formed as an alternate to the projection onto two convex sets: set of observation data and the other defined by a sparsity-based nonlocal prior. Hung and Siu [18] proposed a single frame super resolution algorithm using a finite impulse response; Wiener-filter. The correlation matrices are estimated using the nonlocal means filter to form a new iterative framework which is used to improve the estimated correlation and estimated high-resolution image.

Although B-spline were constructed as convolution of certain probability distributions in early nineteenth century, Schoenberg [19] in 1946 used them for statistical data smoothness which started a new era of modern mathematical study of spline approximation. Later on Lewis [20] for the first time developed local support basis for GC² splines. Bartels and Beatty [21] constructed local basis functions for β-spline. Foley [22] developed a B-spline like basis for different weights spline such as ν-spline, β-spline and γ-spline. Sarfraz [23] established number of B-spline like local basis for the rational splines. These splines maintains the geometrical smoothness, continuity and computational simplicity achieved by other ν-spline, β-spline, γ-spline and weighted splines.

In this paper, an iterative image interpolation scheme is designed to investigate the two dimensional digital image interpolation problems. First a quadratic trigonometric B-spline with control parameters is established using a constructive approach described in [24], then an optimization technique based on Genetic Algorithm (GA) helps find the appropriate values of control parameters in the description of B-spline. The interpolation scheme is made up of several stages to achieve the resulting interpolated images. Gray scale digital images are considered as reference image into account. Moreover to analyze the quality of resulting interpolated images FSIM, SSIM, MS-SSIM indices and PSNR are utilized as standard image quality metrics. A comparison of the outcomes of proposed interpolation scheme with three of the state-of-the-art image interpolation schemes is also made.

Rest of the paper is organized as follows. Section 2 is about the construction of local support quadratic trigonometric B-spline basis with control parameters defined in its description. Section 3 is dedicated to overall methodology and proposed image interpolation scheme. Demonstration of the proposed interpolation scheme is presented in Section 4. Finally, Section 5 concludes the paper.

2. Quadratic trigonometric B-spline

A C¹ quadratic trigonometric spline is proposed here to establish new local support quadratic B-spline basis which consists of two control parameters in its depiction. Quadratic B-spline basis are attained by a transformation to piecewise defined Bernstein-Bézier form which will then be used to formulate quadratic trigonometric B-spline representation.

2.1 Quadratic trigonometric spline

Let (x_i,F_i), i = 1,2,…,n be the given set of data demarcated over the interval [a*,b*] where the partition of the data is a* = x₀ < x₁ < x₂ < ⋯ < x_n = b*. A piecewise quadratic trigonometric spline function T(x) with parameters α_i,β_i ∈ [−1,1] over each sub interval I*_i = [x_i,x_i+1]; i = 1,2…,n, is defined as:(1)where Q_l; l = 0,1,2,3, are co-efficient of interpolation which are defined as follows:with h_i = x_i+1 − x_i. D_i are the derivatives at the knots x_i which may be given or estimated using any approximation schemes; geometric mean, arithmetic mean and harmonic mean. Furthermore, the quadratic trigonometric spline function (1) has the following C¹ interpolating properties:(2)where T⁽¹⁾(x) represents the derivatives with respect to the variable x. The functions S_l,i(φ,α_i,β_i); l = 0,1,2,3 in (1) are the quadratic trigonometric basis functions defined in each sub intervals [x_i,x_i+1] as:(3)with and . From Eq (3) it can be observed that the quadratic trigonometric functions are Bernstein Bézier like basis functions which are demonstrated in Fig 1.

[Figure omitted. See PDF.]

Fig 1. Quadratic trigonometric basis function.

https://doi.org/10.1371/journal.pone.0179721.g001

Moreover these quadratic functions satisfied the following properties:

1. Nonnegative: S_l,i(φ,α_i,β_i) ≥ 0; l = 0,1,2,3, i = 1,2,…,n−1.

2. Partition of unity: .

3. Symmetry: S_l,i(φ,α_i,β_i) = S_3−l,i(φ,β_i,α_i); l = 0,1,2,3, i = 1,2,…,n−1.

4. Convex hull property: The entire segments of piecewise quadratic trigonometric spline function must lie inside the control polygon spanned by P₀,P₁,P₂ and P₃.

5. Variation Diminishing Property: It can be stated as the curve has no more intersections with any plane than does the control polygon.

Figs 2 and 3 respectively show the graphical view of convex hull property and the variation diminishing property for the proposed quadratic trigonometric spline function.

[Figure omitted. See PDF.]

Fig 2. Graphical view of convex hull property for quadratic trigonometric spline function.

https://doi.org/10.1371/journal.pone.0179721.g002

[Figure omitted. See PDF.]

Fig 3. Graphical view of variation diminishing property for quadratic trigonometric spline function.

https://doi.org/10.1371/journal.pone.0179721.g003

2.2 Local support quadratic trigonometric B-spline basis

On the way to construct local support quadratic trigonometric B-spline basis, additional knots x₋₃ < x₋₂ < x₋₁ < x₀ and x_n < x_n+1 < x_n+2 < x_n+3 will be introduced on both outsides of the interval [x₀,x_n] with control parameters α_i, β_i > 0; i = −3, −2, …, n + 3, defined on this stretched partition of [x₀,x_n]. A quadratic spline ϑ_l(x); l = −1, …, n + 3, can be defined as:(4)

Therefore, the function ϑ_l(x) will have the following quadratic form for the remaining intervals [x_i,x_i+1), i = l − 2,l − 1,l.(5)where S_l,i(φ,α_i,β_i); l = 0,1,2,3 are same as defined in Eq (3). The requirement that ϑ_l is continuous up to second order in particular at x_l−2, x_l−1, x_l and x_l+1, the quadratic trigonometric function uniquely determined the following(6)whereand

The graphical view of the quadratic trigonometric function ϑ_l(x), l = −1,0,…,n + 2, is shown in Fig 4.

[Figure omitted. See PDF.]

Fig 4. The quadratic trigonometric spline ϑ_l(x).

https://doi.org/10.1371/journal.pone.0179721.g004

Next the local support quadratic trigonometric B-spline basis is elaborated by the difference of the quadratic functions ϑ_l as:(7)Therefore, an explicit form of the quadratic trigonometric B-spline B_l(x) on any interval [x_i,x_i+1) is computed from (4)–(7) as:(8)where B_l(x_i) = B_l⁽¹⁾(x_i) = 0, for i ≠ l − 1, l, l + 1

Hence, it can be noticed that the quadratic trigonometric B-spline basis B_l(x), l = −1, −2, …, n + 1, have the following properties:

1. B_l(x) = 0, for x ∉ (x_l−2,x_l+2)

2. , for x ∈ [x₀,x_n]

3. B_l(x_l) > 0, for all x.

The graphical view of the quadratic trigonometric B-spline basis function B_l(x), l = −1,0,…,n + 1, is shown in Fig 5.

[Figure omitted. See PDF.]

Fig 5. The quadratic trigonometric B-spline B_l(x).

https://doi.org/10.1371/journal.pone.0179721.g005

2.3 1D and 2D quadratic trigonometric B-spline functions

In this section, 1D and 2D quadratic trigonometric B-spline functions are established. Both the functions are inspired by the local support basis (8). Let T*(x) be the desired 1D quadratic trigonometric B-spline interpolating function,(9)where are the co-efficient of interpolation and can be obtained from the set of discrete data defined at certain given spatial points. Furthermore from the local support properties defined in Section 2.2, Eq (9) can be rewrite as(10)

Thus by substituting the values of B_l(x) from Eq (8) in Eq (10)(11)where ,with σ_l = 2/(1 + σ_l), and ω_l = 2/(1 + β_l).

As Eq (11) represents the piecewise Bernstein-Bézier form of quadratic trigonometric B-spline so the function T*(x) can be rewritten in vector form as:(12)where X_l = [F_l V_l W_l F_l+1]^T and X_l = Y_lZ_l with

In order to extend the above 1D B-spline interpolating function to two dimensions, Eq (9) can be written as:(13)where B_l(x) are same as defined in Section 2.2 and analogously are the quadratic trigonometric B-spline basis corresponding to a set of knots . Here the control parameters also correspond to the set of knots . Hence for x ∈ [x_i,x_i+1], , the function be the required 2D quadratic trigonometric B-spline in vector form is defined as:(14)where the points can be computed from the quadratic trigonometric B-spline vertices as(15)whereand the matrix Y_l is given in (12) with a corresponding extension for .

3. Genetic algorithm approach to image interpolation

This section describes the overall process of implementation of soft computing technique genetic algorithm to image interpolation using newly constructed quadratic trigonometric B-spline. The process includes the phases of problem matching with genetic algorithm and image interpolation based on quadratic trigonometric B-spline basis. An introduction to the parameters used for genetic algorithm is also made a part to this section.

3.1 Optimization by genetic algorithm

Genetic algorithms [25] are probabilistically modeled search techniques which are used to find out global optimal solutions in an effectual way as compare to other conventional optimization techniques even in large solution spaces. Genetic algorithms represent a class of parallel adaptive search techniques whose mechanisms are based on natural selection of optimal solutions through some biological evolutionary procedure. They use multiple search points at the same time to find out an optimal solution without going through an exhaustive mechanism of searching.

Genetic algorithms start with a collection of solutions which are analogous to the chromosomes in natural systems of genetics. Each chromosome usually represents a binary bit string with individual bits 0 or 1which are named as genes. The collection of candidate solution is called population which is randomly chosen from the solution space at the beginning when the search through genetic algorithms starts. The main three genetic operators ‘selection’, ‘crossover’ and ‘mutation’ help genetic algorithms for survival in the large solution space. The crossover and the mutation operators are exemplified here in Fig 6 to illustrate the overall process of genetic algorithm for some selected chromosomes.

[Figure omitted. See PDF.]

Fig 6. Crossover and the mutation operators for genetic algorithm.

https://doi.org/10.1371/journal.pone.0179721.g006

As this work is aimed to search an optimal solution for image interpolation based on quadratic trigonometric B-spline basis with control parameters , and for i = 0,1,2,…,n − 1 and j = 0,1,2,…,m − 1. Therefore, genetic algorithm is employed here to pursue the appropriate values of control parameters. Now before starting the discussion on genetic algorithm, several terms and system parameters are needed to be defined in advance. In this work the maximum no. of iterations or generations set is 10 and the size of population taken is 20. Initially population is generated by randomly selecting chromosomes or bit strings where each single gene represents the value for control parameters , and as defined in the portrayal of quadratic trigonometric B-spline (14). Moreover a fitness or objective function is the sum square error which is defined for the image spatial data and formulated as:(16)where Im_ij and represent the original reference image and resulting interpolated images respectively. Genetic operations selection, crossover and mutation will be used to maintain the preeminence of optimal solution. The process of genetic algorithm will be stopped when the predefined number of iterations is attained.

3.2 Proposed image interpolation scheme

In this section, an image interpolation scheme is designed using quadratic trigonometric B-spline (15) and genetic algorithm. The scheme comprises of several steps which are elaborated here one by one. First of all, it finds the spatial data of a selected reference image through some image decoding schemes. Secondly, all the system parameters of GA are initialized to attain the optimal values of control parameters , and . An initial population is made randomly with possible combination of the values of parameters. Successive implementations of search operations mutation, crossover and selection to this population make a better lead to optimal values of , and such that the sum square error (16) is minimized. Thus the optimal values of , and make the whole quadratic trigonometric B-spline representation optimized and the interpolated image designed using the optimized B-spline will be called optimal interpolated image. So, finally the image data is interpolated using the optimized quadratic trigonometric B-spline. Repeated implementations of search operations for respective iterations of GA will help to contain better approximation until the best optimal resulting interpolated image is obtained. Fig 7 presents the flow diagram of the proposed scheme.

[Figure omitted. See PDF.]

Fig 7. Flow diagram of proposed image interpolation scheme.

https://doi.org/10.1371/journal.pone.0179721.g007

4. Experimental results

In this section, the proposed quadratic trigonometric image interpolation scheme with soft computing technique, genetic algorithm, defined in Section 3 is tested and compared with some representative work in the literature: the image Super Resolution algorithm based on Non-Local Means (SR-NLM) [18], Patch Based Non-Local (PB-NL) image interpolation [17] and New Edge-Directed Interpolation (NEDI) [16]. The proposed scheme is tested on three different natural images. The images are gray scaled in 512×512 resolution with eight bits per pixel and named as ‘Moon-Surface’, ‘Boat’ and ‘Truck’ respectively. The images were down-sampled first to acquire low-resolution images and then up-sampled twice using the proposed image interpolation scheme to get the resulting interpolated images. For SR-NLM, PB-NL and NEDI implementation codes are provided by the authors and available online at [26, 27].

As the original test images are known so one can easily characterized the difference between the resulting and original reference images using different existing image quality metrics. Structure SIMilarity (SSIM) index [28], Multi-Scale Structure SIMilarity (MS-SSIM) index [29] and Feature SIMilarity (FSIM) index [30] along with the traditional Peak Signal-to-Noise Ratio (PSNR) [31] are utilized here to assess the expediency of proposed optimal image interpolation scheme. PSNR is a classical objective image quality metric to measure the intensity differences of two images. It is usually measured in the unit of decibels (dB) and attains high values if an image has a high picture quality and attains a low value if an image contains a low picture quality but in some examples the resulting images may look close to the original reference images though they have low PSNR values. Whereas SSIM, MS-SSIM and FSIM indices take values in [0,1] where 1 is only reachable in the case when both the original and the resulting images are identical.

Tables 1–4 depict the PSNR, SSIM, MS-SSIM and FSIM values respectively for the proposed image interpolation scheme and the existing schemes like: SR-NLM, NEDI and PB-NL. The outcomes indicate that the proposed image interpolation scheme yields better results than the other three schemes for the test images. Moreover Fig 8 shows the subjective view of the resulting image with their SSIM maps where brightness indicates the magnitude of the SSIM index near to 1 that is if the SSIM map of an image is brighter the image has a better quality.

[Figure omitted. See PDF.]

Fig 8.

Original test images (a) ‘Moon-Surface’ (b) ‘Boat’ (c) ‘Truck’, Resulting images interpolated by using proposed Quadratic Trigonometric B-Spline representation and GA (d) ‘Moon-Surface’ (e) ‘Boat’ (f) ‘Truck’, SSIM map of interpolated images (g) ‘Moon-Surface’ (h) ‘Boat’ (i) ‘Truck’.

https://doi.org/10.1371/journal.pone.0179721.g008

[Figure omitted. See PDF.]

Table 1. Comparison of different interpolation schemes using PSNR values.

https://doi.org/10.1371/journal.pone.0179721.t001

[Figure omitted. See PDF.]

Table 2. Comparison of different interpolation schemes using SSIM values.

https://doi.org/10.1371/journal.pone.0179721.t002

[Figure omitted. See PDF.]

Table 3. Comparison of different interpolation schemes using MS-SSIM values.

https://doi.org/10.1371/journal.pone.0179721.t003

[Figure omitted. See PDF.]

Table 4. Comparison of different interpolation schemes using FSIM values.

https://doi.org/10.1371/journal.pone.0179721.t004

5. Conclusions

A newly constructed quadratic trigonometric B-spline representation and a soft computing technique genetic algorithm are combined together to design an image interpolation scheme. The image quality metrics SSIM, MS-SSIM and FSIM indices along with traditional PSNR are employed to assure the quality of resulting interpolated images. Experimental outcomes and comparison with existing image interpolation schemes show that the suggested quadratic trigonometric B-spline together with genetic algorithm is a better representation and plays a significant role for the problem related to image interpolation e.g. image magnification and geometric transformation (resizing, rotation, sharing, etc.).

Acknowledgments

Authors give special thanks to Signal and Image Processing Institute (SIPI), University of Southern California, Los Angeles, CA, for allowing use of their images freely.

Citation: Hussain MZ, Abbas S, Irshad M (2017) Quadratic trigonometric B-spline for image interpolation using GA. PLoS ONE 12(6): e0179721. https://doi.org/10.1371/journal.pone.0179721

References

1. Hoschek J, Lasser D. Fundamentals of Computer Aided Geometric Design. AK Peters, Wellesley, MA, 1993.

2. Wang G, Chen Q, Zhou M. NUAT B-spline curves. Computer Aided Geometric Design 2004; 21: 193–205.

3. Li J, Zhao DO. An Investigation on Image Compression Using the Trigonometric Bézier Curve with a Shape Parameter. Mathematical Problems in Engineering 2013; Article ID 731648: 1–8.

4. Schoenberg J. On Trigonometric Spline Interpolation. Journal of Applied Mathematics and Mechanics 1964; 13: 795–826.

5. Lyche T, Winther R. A Stable Recurrence Relation for Trigonometric B-Splines. Journal Approximation Theory 1979; 25: 266–279.

6. Walz G. Identities for Trigonometric B-Splines with an Application to Curve Design. BIT Numerical Mathematics 1997; 37(1): 189–201.

7. Han X, Ma Y, Huang X. The Cubic Trigonometric Bezier Curve with Two Shape Parameters. Applied Mathematics Letters 2009; 22(2): 226–231.

8. Han X. Cubic Trigonometric Polynomial Curves with a Shape Parameter. Computer Aided Geometric Design 2004; 21(6): 535–548.

9. Han X. Quadratic Trigonometric Polynomial Curves with a Shape Parameter. Computer Aided Geometric Design 2002; 19 (7): 479–502.

10. Hou HS and Andrews HC. Cubic Splines for Image Interpolation and Digital Filtering. IEEE Transaction Acoust Speech Signal Processing 1978; ASSP-26(6): 508–517.

11. Danielsson PE and Hammerin M. High Accuracy Rotation of Images. Department of Electrical Engineering, Link¨oping University, Sweden, Tech. Rep. LiTH-ISY-I-11521990.

12. Parker JA, Kenyon RV and Troxel DE. Comparison of Interpolating Methods for Image Resampling. IEEE Transaction on Medical Imaging 1983; MI-2: 31–39.

13. Keys RG. Cubic Convolution Interpolation for Digital Image Processing. IEEE Transaction Acoust Speech Signal Processing 1981; ASSP-29(6): 1153–1160.

14. Unser M, Aldroubi A and Eden M. B-spline signal processing: Part I & Part II. IEEE Transactions on Signal Processing 1993; 41: 821–848.

15. Luu L, Wang Z, Vo M, Hoang T and Ma J. Accuracy enhancement of digital image correlation with B-spline interpolation. Optics Letters. 2011; 36(16): 3070–3072. pmid:21847163

16. Li X, Orchard MT. New Edge-Directed Interpolation. IEEE Transactions on Image Processing 2001; 10(10): 1521–1527. pmid:18255495

17. Li X. Patch-based image interpolation: algorithms and applications. In: International Workshop on Local and Non-Local Approximation in Image Processing; 1–6, 2008.

18. Hung KW, Siu WC. Single-image super-resolution using iterative Wiener filter based on nonlocal means. Signal Processing: Image Communication 2015; 39: 26–45.

19. Schoenberg J. Spline function: Basic Theory. John Wiely. New York 1981.

20. Lewis J. B-spline Bases for Splines Order Splines, Presented at the SIAM-SIGNUM meeting, San Francisco, CA. 1975.

21. Bartels R. and Beatly J. Beta Splines with a difference, Technical Report CS-83-40, Computer Science Department, University of Waterloo, Canada 1984.

22. Foley TA. Local Control of Interval Tension using Weighted Spline. Computer Aided Geometric Design. 1986; 3, 281–294.

23. Sarfraz M. Interactive Curve Modeling with Application to Computer Graphic. Vision and Image Processing. Springer-Veriag, London 2008.

24. Sarfraz M. Designing objects with a spline. International Journal of Computer Mathematics 2010; 87(4): 797–817.

25. Holland JH. Adaptation in Natural and Artificial Systems. MIT Press, 1975.

26. http://www.csee.wvu.edu/~xinl/publications.html

27. https://sites.google.com/site/kwhung1986/publications

28. Wang Z, Bovik A, Sheikh H, Simoncelli E. Image Quality Assessment: From Error Visibility to Structural Similarity. IEEE Transaction Image Processing 2004; 3(4): 600–612.

29. Wang Z, Simoncelli EP, Bovik AC. Multi-Scale Structural Similarity for Image Quality Assessment. In: IEEE Asilomar Conference on Signal, Systems and Computers, Pacific Grove, CA, 9–12 Nov. 2003.

30. Zhang L, Mou X, Zhang D. FSIM: A Feature SIMilarity Index for Image Quality Assessment. IEEE Transaction Image Processing 2011; 20(8): 2378–2386.

31. Fevralev DV, Ponomarenko NN1, Lukin VV1, Abramov SK, Egiazarian KO, Astola JT. Efficiency Analysis of Color Image Filtering. EURASIP Journal on Advance in Signal Processing 2011; 1(44): 1–19.