<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The regression model for the procedure of correction of photos damaged by backlighting</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>A V Goncharova</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>I V Safonov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>I A Romanov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Research Nuclear University MEPhI (Moscow Engineering Physics Institute)</institution>
          ,
          <addr-line>Kashirskoe Shosse, 31, Moscow, Russia, 115409</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <fpage>326</fpage>
      <lpage>333</lpage>
      <abstract>
        <p>In the paper, we propose an approach for selection a correction parameter for images damaged by backlighting. We consider the photos containing underexposed areas due to backlit conditions. Such areas are dark and have poorly discernible details. The correction parameter controls the level of amplification of local contrast in shadow tones. Besides, the correction parameter can be considered as a quality estimation factor for such photos. For an automatic selection of the correction parameter, we apply regression by supervised machine learning. We propose new features calculated from the co-occurrence matrix for the training of the regression model. We compare the performance of the following techniques: the least square method, support vector machine, random forest, CART, random forest, two shallow neural networks as well as blending and staking of several models. We apply two-stage approach for the collection of a big dataset for training: initial model is trained on a manually labeled dataset containing about two hundred of photos, after that we use the initial model for searching for photos damaged by backlit in social networks having public API. Such approach allowed to collect about 1000 photos in conjunction with their preliminary quality assessments that were corrected by experts if it was necessary. In addition, we investigate an application of several well-known blind quality metrics for the estimation of photos affected by backlit.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        A lot of photos are affected by various defects and need to be enhanced in an automatic manner to be
more pleasant for observers. The most noticeable defects are the following: various issues with
brightness and contrast, color misbalance, blurring and shaking, compression artifacts, high noise
level, red eyes and other artifacts due to flash, color fringing, and geometrical distortions [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. There
are numerous methods for noise suppression (e.g. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]), red-eye correction (e.g. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]), and image
sharpening (e.g. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]), but there are just a few publications devoted to correction photos damaged by
backlit. Photos taken in backlighting conditions has high global contrast, but local contrast in areas of
shadow tones is quite low. Figure 1 demonstrates the photo affected by backlighting. One can see
poorly distinguishable details in shadows. It is important to develop a method for enhancement of such
images.
      </p>
      <p>
        Paper [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] describes the technique for the correction of photos damaged by backlit. That method is
based on a contrast stretching and alpha-blending of brightness of the initial image and an estimated
reflectance. In the majority cases, the technique provides good visual outcomes, nevertheless, it has
shortcomings. The most important parameter of the method is factor ks, which controls the
amplification of local contrast in shadows. This factor is calculated by means of decision tree based on
features that originated from brightness histogram. The decision tree allows to obtain for ks just five
discrete values. Sometimes it leads to significant changes in correction power due to insignificant
alterations in an image. Such effect is undesirable. Also, that decision tree was created based on
several heuristic assumptions and was not verified on the big number of sample photos. Is that solution
general for plenty of photos affected by backlit?
      </p>
      <p>
        The aim of our paper is overcoming of disadvantages of the method from [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] by the development
of a regression model for the estimation of ks based on machine learning techniques. It is worth to
note, also factor ks can be treated as blind metrics for assessment of the visual quality of photos
damaged by backlighting. In the paper, we discuss three subjects: an approach for collection of a
representative dataset; a selection of method for creation of regression model; algorithms for
calculation and selection of informative features for the model.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Collection of a dataset</title>
      <p>
        In the best of our knowledge, there is no publicly available dataset containing photos deteriorated by
backlighting. Moreover, a collection of a big dataset is a tiresome task because a relatively small
number of such photos are in the Internet and social networks, so, manual search requires many efforts
and a long time. We employ a concept of semi-supervised learning and self-training [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for the
Image Processing and Earth Remote Sensing
collection of the representative dataset. An initial dataset containing about two hundred of photos was
collected and labeled manually. We trained the initial regression model using the initial dataset and
random forest technique [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Nowadays many social networks provide an application interface for
downloading of photos. We made a software tool for download of photos from flickr.com and vk.com
[
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The initial regression model estimates the downloaded photos and collects photos having required
ks to provide uniform distribution of images by the correction factor. Evidently, the initial model is
not ideal, so, an expert checks outcome and makes re-labeling if it is necessary. Further, we add
validated photos to the main dataset. Photos from the initial dataset are added to the main dataset as
well. In this way, we collected about 1000 labeled images. The final model was trained on the main
dataset. Figure 2 illustrates our approach for the dataset collection.
3. Analysis of methods for creation of a regression model
We have analyzed the application of the following methods for creation of regression model:
• blending [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
• stacking [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
• linear least squares (LLS);
• support vector machine for regression (SVR) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ];
• k-nearest neighborhoods for regression (k-NN) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ];
• classification and regression tree (CART) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ];
• random forest [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ];
• feedforward neural network [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ];
• single-layer neural network [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ];
• averaging of outcomes of enumerated above methods;
• averaging of several outcomes of blending;
(1)
(2)
(3)
(4)
      </p>
      <p>There are several measures to evaluate the performance of the regression models. We calculated
the following five measures that evaluate conformance of outcomes of the regression model with
experts’ judgments.</p>
      <p>1. Mean absolute error (MAE):
2. Mean squared error (MSE):
where  is the number of elements,   is the predicted value, and   is the true value.
3. Median absolute error (MedAE):
4. Pearson correlation coefficient (r):

( ,  ) =</p>
      <p>(| 1 −  1|, . . , |  −   |).
 ( ,  ) = 1 −</p>
      <p>∑=1 (  −  )   −  ̅

∑=1 (  −  )2</p>
      <p>∑=1   −  ̅
2
.
where  =

1 
∑=1   ,  ̅ =

1</p>
      <p>
        ∑=1   .
5. Normalized area under regression error characteristic curve (AUC REC) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>
        We used 5-fold cross-validation with stratification. All models were trained using the features from
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Table 1 contains the performance measures of different regression models. For MAE, MSE and
MedAE smaller is better. For r and AUC REC larger is better. Random forest and SVR have the
highest performance measures. However, the distribution of residuals of the regression model via
random forest looks normal in comparison with residuals by SVR. In addition, random forest has a
relatively small number of parameters for model adjustment. Thus, we have selected random forest for
the creation of regression model for the estimation of amplification factor ks.
      </p>
      <p>
        LLS
SVR
k-NN
CART
Random forest
Feedforward neural network
Single-layer neural network
Averaging of methods
Blending
Averaging of several blendings
Stacking
4. Features for the description of photos damaged by backlit
In the paper [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] feature set for estimation of amplification factor ks is described. Those features are
calculated from brightness histogram H. Typical histogram of a photo damaged by backlighting has
relatively high peaks in shadow and/or highlights, but a gap in middle tones. Besides, the histogram in
dark tones is asymmetric. To characterize such shape of histogram the following features were
proposed: parts of the tones in the shadow and middle tones; parts of tones in the first and second
halves of dark tones; the ratios of the histogram maxima in shadows, middle, and highlight tones per
the global histogram maximum; locations of the histogram maxima in shadows and highlights. The
entire dynamic range was divided uniformly on shadow, middle tones, and highlights.
      </p>
      <p>
        However, there are high-quality images that have values of those features close to values for photos
affected by backlit. Sometimes normal images have a histogram that has peaks near the boundaries of
dynamic range and a valley between them. Figure 3 shows an example of such pristine photo and its
histogram of brightness. The method from [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] makes dark areas in the photo a lighter. It is necessary
to prevent the modification of dark tones in normal images. To overcome the undesirable correction of
high-quality photos, we propose to use another set of features. We modify histogram-based features
from [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and introduce new features originated from the co-occurrence matrix.
      </p>
      <p>
        In figure 3 one can see that peaks in the left and right parts of the histogram are shifted towards to
middle tones. We propose to treat as shadow tones a quarter of the leftmost part of the dynamic range
instead of one third. Highlight tones are a quarter of the rightmost part of the dynamic range. Middle
tones occupy half of the range. Solid lines in histogram in figure 3 demonstrate this division for dark,
middle and light tones. Dashed lines show a similar differentiation in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This simple alteration of
sub-ranges for shadow, highlights, and middle tones allows to decrease considerably the number of
falsely corrected pristine images even by usage similar to [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] features.
      </p>
      <p>One more opportunity is a division of range on more than three sub-ranges and the calculation of
features for each range. We propose to employ nine evenly distributed sub-ranges.</p>
      <p>We argue that extraction of features from the co-occurrence matrix is a prospective approach for
the description of photos affected by backlit. Neighboring pixels of natural images have close values,
and non-zero elements locate along the main diagonal of the co-occurrence matrix, as a rule. For
photos damaged by backlighting, the co-occurrence matrix has the highest concentrations of elements
in left-top or right-bottom corners as well as gaps in the central part of the main diagonal. Figure 4
shows the co-occurrence matrices for undistorted and damages by backlighting photos.</p>
      <p>We propose to divide the co-occurrence matrix into three parts orthogonally to the main diagonal
similar to shadow, middle tones and highlights sub-ranges in a histogram. It is possible to divide the
main diagonal in three equal parts (see dashed lines in figure 4), but it is preferable to set range of
middle tones twice larger than for dark and bright tones (see solid lines in figure 4). The following
features are calculated from the co-occurrence matrix G, where pixels situated in distance 3 pixels in
column is considered. Fractions of G in dark, light, and middle tones:
127 127−
 1 =</p>
      <p>( ,  )/( ×  )
=0 =0
 2 = 1 − ( 1 +  3),</p>
      <p>255 255
 3 =</p>
      <p>( ,  )/( ×  )
63 63−
 11 =</p>
      <p>( ,  )/( ×  )
= 128 = 383−
where М is the number of rows and N is the number of columns of the image.</p>
      <p>Fractions of G in sub-regions of dark tones:
=0 =0
 12 =  1 −  11.</p>
      <p>Ratios of maxima in dark tones and maxima in bright tones to global maxima:
 1 =
= 0…127,
= 0…127−</p>
      <p>( ( ,  )),
 3 = = 1 28…255, ( ( ,  )) =  0…255,( ( ,  )).</p>
      <p>= 383− …255 = 0…255
Locations of the matrix G maxima in the left and in the right parts:
 1 =  ( ( ,  )),
= 0…127,
= 0…127−</p>
      <p>= 128…255,
= 383− …255
 3 =
( ( ,  )).
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)</p>
      <p>The following features are the number of elements of co-occurrence matrix G, which are the
greater than the threshold which equals to the average value of G:
ℎ  ( ,  0) = 10||   ≥ &lt;  00 , (14)
 0 =  × ( − 3)/2562, (15)</p>
      <p>127 127−
 2 =
127</p>
      <p>255</p>
    </sec>
    <sec id="sec-3">
      <title>5. Enrichment of feature set</title>
      <p>To enrich our feature set we applied a combination of features with the following feature selection.
The idea of combining features is based on the assumption that some of the combinations, for
example, sum, product, ratio of different features and their squaring, can provide an improvement to
the regression model. Therefore, it is advisable to try as many such combinations as possible.</p>
      <p>In an ideal case, features should be informative that is they should have a high correlation with
amplification factor   from the ground truth. Obviously, informativeness of various features is very
different. A use of non-informative features can lead to the worsening of the regression model. It is
necessary to select “good” features and drop “bad” ones. For feature selection, we employed a greedy
addition of features to random forest regression model. If the addition of a feature to model leads to
decreasing of MAD, then we remain the feature, otherwise, we drop it.</p>
    </sec>
    <sec id="sec-4">
      <title>6. Results</title>
      <p>We tested and compared to each other all feature sets described above. In the paper, we do not show
intermediate outcomes, because they have a huge size. The best result demonstrates model which uses
features  3,  11,  1,  3,  1,  3,  2,  3,  1 and ratio  12⁄ 1, where the features are calculated for whole
image as well as its fragments.</p>
      <p>
        As was mentioned, the amplification factor for dark tones   can be treated as blind quality factor
for images damaged by backlit. At present, a sufficient number of blind image quality metrics have
been proposed. Such metrics make possible to evaluate the quality based on the image only without
the reference. Part of the metrics is developed to assess the single factor affecting the quality, for
example, the blurriness level [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Other ones claim to be universal. We compared the correlation
coefficient r between experts’ judgments about   and several measures for quality assessment.
      </p>
      <p>
        The following existing algorithms for non-reference quality assessment were analyzed. Blind
Image Quality Index (BIQI) [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] implements a two-step approach to assess the quality of photographs.
This method is based on usage of features originated from natural scene statistics (NSS) in the wavelet
domain and assumptions that photos of natural scenes have determined statistic characteristics, these
characteristics are changed due to distortions, and type and strength of distortion can be predicted. The
first stage of BIQI is a classification type of defect. The second one is a numerical quality assessment
by means of the regression model. Support vector machine (SVM) is applied for training classification
and regression models. Blind/Referenceless Image Spatial Quality Evaluator (BRISQUE) [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] uses
features from NSS in the spatial domain. One regression model for all distortions is trained by SVM.
Oriented Gradients Image Quality Assessment (OG-IQA) method [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] analyzes the correlation of
oriented gradients in the spatial domain. It was speculated, orientations of local gradients change
predictably for distorted images of natural scenes. One regression model for all distortions is trained
via Adaptive Boosting for decision trees. Natural Image Quality Evaluator (NIQE) [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] does not use
distorted images for training. In this method, multivariate Gaussian (MVG) model based on NSS
features in the spatial domain is calculated for pristine photos only. The quality of the estimated image
is estimated as the distance between its MVG and pre-calculated MVG of several undistorted images.
Integrated Local Natural Image Quality Evaluator (IL-NIQE) [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] algorithm exploits the same idea as
NIQE, but IL-NIQE operates with color channels of photo in salient local patches.
      </p>
    </sec>
    <sec id="sec-5">
      <title>7. Conclusion</title>
      <p>Photos taken by backlighting conditions need to be enhanced to improve their pleasantness. There is a
technique for the correction of dark tones. The automatic adjustment of the parameter for
amplification of dark tones is needed for that method. For this purpose, we propose a feature set,
extracted from the co-occurrence matrix, and regression model via random forest. For the collection of
training dataset, we employed semi-supervised paradigm for obtaining of required photos from social
networks. The regression model developed outperforms the baseline method. In addition, our model
produces smooth continuous values of amplification factor rather than step-wise discrete values in the
existing method. The proposed algorithm is intended for photo enhancement software.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Safonov</surname>
            <given-names>I V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kurilin</surname>
            <given-names>I V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rychagov M N and Tolstaya E V 2018 Adaptive Image</surname>
          </string-name>
          <article-title>Processing Algorithms for Printing</article-title>
          (Singapore: Springer Nature)
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Thang P C and Kopylov A V 2018</surname>
          </string-name>
          <article-title>Tree-serial parametric dynamic programming with flexible prior model for image denoising</article-title>
          <source>Computer Optics</source>
          <volume>42</volume>
          (
          <issue>5</issue>
          )
          <fpage>838</fpage>
          -
          <lpage>845</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179- 2018-42-5-
          <fpage>838</fpage>
          -845
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Safonov</surname>
            <given-names>I V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rychagov</surname>
            <given-names>M N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kim S H 2008</surname>
          </string-name>
          <article-title>Automatic red eye correction and its quality metric Proc</article-title>
          .
          <source>of SPIE 6807 68070W</source>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Safonov</surname>
            <given-names>I V</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rychagov</surname>
            <given-names>M N</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kang</surname>
            <given-names>K</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kim S H 2008</surname>
          </string-name>
          <article-title>Adaptive sharpening of photos Proc</article-title>
          .
          <source>of SPIE 6807 68070U</source>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Safonov</surname>
            <given-names>I V</given-names>
          </string-name>
          <year>2006</year>
          <article-title>Automatic correction of amateur photos damaged by backlighting Proc</article-title>
          .
          <source>of GraphiCon 80-89</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Triguero</surname>
            <given-names>I</given-names>
          </string-name>
          ,
          <string-name>
            <surname>García</surname>
            <given-names>S</given-names>
          </string-name>
          and
          <string-name>
            <surname>Herrera</surname>
            <given-names>F 2015</given-names>
          </string-name>
          <article-title>Self-labeled techniques for semi-supervised learning: taxonomy, software and empirical study Knowledge and Information systems 42(2</article-title>
          )
          <fpage>245</fpage>
          -
          <lpage>284</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Breiman</surname>
            <given-names>L 2001</given-names>
          </string-name>
          <article-title>Random forests Machine learning 45(</article-title>
          <issue>1</issue>
          )
          <fpage>5</fpage>
          -
          <lpage>32</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Goncharova</surname>
            <given-names>A V</given-names>
          </string-name>
          <year>2018</year>
          <article-title>No-reference metrics for the quality of images damaged by backlighting Proc</article-title>
          .
          <source>of DSPA</source>
          <volume>2</volume>
          <fpage>568</fpage>
          -
          <lpage>572</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Drucker</surname>
            <given-names>H</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burges</surname>
            <given-names>C J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaufman</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smola</surname>
            <given-names>A J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Vapnik</surname>
            <given-names>V 1997</given-names>
          </string-name>
          <article-title>Support vector regression machines Proc</article-title>
          .
          <source>of NIPS 155-161</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Altman</surname>
            <given-names>N S</given-names>
          </string-name>
          <year>1992</year>
          <article-title>An introduction to kernel and nearest-neighbor nonparametric regression</article-title>
          <source>The American Statistician</source>
          <volume>46</volume>
          (
          <issue>3</issue>
          )
          <fpage>175</fpage>
          -
          <lpage>185</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Breiman</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Friedman</surname>
            <given-names>J</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stone</surname>
            <given-names>C J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Olshen R A 1984</surname>
          </string-name>
          <article-title>Classification and regression trees (Boca Raton:</article-title>
          CRC Press)
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>MATLAB feedforwardnet</surname>
            <given-names>URL</given-names>
          </string-name>
          : https://www.mathworks.com/help/deeplearning/ref/ feedforwardnet.html (
          <volume>01</volume>
          .
          <fpage>04</fpage>
          .
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>MATLAB linearlayer</surname>
            <given-names>URL</given-names>
          </string-name>
          : https://www.mathworks.com/help/deeplearning/ref/linearlayer.html (
          <volume>01</volume>
          .
          <fpage>04</fpage>
          .
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Jahrer</surname>
            <given-names>M</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Töscher</surname>
            <given-names>A</given-names>
          </string-name>
          and
          <string-name>
            <surname>Legenstein</surname>
            <given-names>R 2010</given-names>
          </string-name>
          <article-title>Combining predictions for accurate recommender systems</article-title>
          <source>Proc. of ACM SIGKDD 693-702</source>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Wolpert</surname>
            <given-names>D H</given-names>
          </string-name>
          <year>1992</year>
          <article-title>Stacked generalization Neural networks 5(2</article-title>
          )
          <fpage>241</fpage>
          -
          <lpage>259</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Bi</surname>
            <given-names>J</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bennett K P 2003</surname>
          </string-name>
          <article-title>Regression error characteristic curves Proc</article-title>
          .
          <source>of ICML 43-50</source>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Asatryan</surname>
            <given-names>D G</given-names>
          </string-name>
          <year>2017</year>
          <article-title>Image blur estimation using gradient field analysis</article-title>
          <source>Computer Optics</source>
          <volume>41</volume>
          (
          <issue>6</issue>
          )
          <fpage>957</fpage>
          -
          <lpage>962</lpage>
          DOI: 10.18287/
          <fpage>2412</fpage>
          -6179-2017-41-6-
          <fpage>957</fpage>
          -962
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Moorthy A K and Bovik A C 2010</surname>
          </string-name>
          <article-title>A two-step framework for constructing blind image quality indices IEEE</article-title>
          <source>Signal processing letters</source>
          <volume>17</volume>
          (
          <issue>5</issue>
          )
          <fpage>513</fpage>
          -
          <lpage>516</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Mittal</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moorthy A K and Bovik A C 2012</surname>
          </string-name>
          <article-title>No-reference image quality assessment in the spatial domain</article-title>
          <source>IEEE Transactions on Image Processing</source>
          <volume>21</volume>
          (
          <issue>12</issue>
          )
          <fpage>4695</fpage>
          -
          <lpage>4708</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Mittal</surname>
            <given-names>A</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Soundararajan</surname>
            <given-names>R</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bovik A C 2013</surname>
          </string-name>
          <article-title>Making a “completely blind” image quality analyzer</article-title>
          <source>IEEE Signal Processing Letters</source>
          <volume>20</volume>
          (
          <issue>3</issue>
          )
          <fpage>209</fpage>
          -
          <lpage>212</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Zhang</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            <given-names>L</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bovik A C 2015</surname>
          </string-name>
          <article-title>A feature-enriched completely blind image quality evaluator</article-title>
          <source>IEEE Transactions on Image Processing</source>
          <volume>24</volume>
          (
          <issue>8</issue>
          )
          <fpage>2579</fpage>
          -
          <lpage>2591</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Liu</surname>
            <given-names>L</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hua</surname>
            <given-names>Y</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            <given-names>Q</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            <given-names>H</given-names>
          </string-name>
          and
          <string-name>
            <surname>Bovik A C 2016</surname>
          </string-name>
          <article-title>Blind image quality assessment by relative gradient statistics and adaboosting neural network</article-title>
          <source>Signal Processing: Image Communication</source>
          <volume>40</volume>
          <fpage>1</fpage>
          -
          <lpage>15</lpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>