# US 2017/0286798 A1 · Objective assessment method for color image quality based on online manifold learning

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0286798 A1
- Document ID: US20170286798A1
- Status: Published application
- Kind: A1
- Application number: 15/197,604
- Filed: 2016-06-29
- Published: 2017-10-05
- Earliest claimed: 2016-03-31
- Assignees: Ningbo University
- Applicants: Ningbo University
- Inventors: Gangyi Jiang; Meiling He; Fen Chen; Yang Song
- Web page: https://patentgrep.com/patent/US20170286798A1

## CPC

- G06T 7/0002: {Inspection of images, e.g. flaw detection}
- G06F 18/2135: based on approximation criteria, e.g. principal component analysis
- G06F 18/22: Matching criteria, e.g. proximity measures
- G06F 18/23213: with fixed number of clusters, e.g. K-means clustering
- G06V 10/50: by performing operations within image blocks; by using histograms, e.g. histogram of oriented gradients [HoG]; by summing image-intensity values; Projection analysis
- G06V 10/56: relating to colour
- G06V 10/763: {Non-hierarchical techniques, e.g. based on statistics of modelling distributions}
- G06V 10/7715: {Feature extraction, e.g. by transforming the feature space, e.g. multi-dimensional scaling [MDS]; Mappings, e.g. subspace methods}
- G06V 10/993: {Evaluation of the quality of the acquired pattern}
- G06V 40/172: {Classification, e.g. identification}
- G06T 2207/20021: Dividing image into blocks, subimages or windows
- G06T 2207/20081: Training; Learning
- G06T 2207/30168: Image quality inspection
- G06V 10/513: {Sparse representations}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

An objective assessment method for a color image quality based on online manifold learning considers a relationship between a saliency and an image quality objective assessment. Through a visual saliency detection algorithm, saliency maps of a reference image and a distorted image are obtained for further obtaining a maximum fusion saliency map. Based on maximum saliencies of image blocks in the maximum fusion saliency map, a saliency difference between each reference image block and a corresponding distorted image block is measured through an absolute difference, and thus reference visual important image blocks and distorted visual important image blocks are screened and extracted. Through manifold eigenvectors of the reference visual important image blocks and the distorted visual important image blocks, an objective quality assessment value of the distorted image is calculated. The method has an increased assessment effect and a higher correlation between an objective assessment result and a subjective perception.

## Claims

### Claim 1

An objective assessment method for a color image quality based on online manifold learning, comprising steps of:
{circle around (1)} representing an undistorted reference image having a width W and a height H by IR; and representing a distorted image to be assessed, which is corresponding to the IR, by ID;
{circle around (2)} through a visual saliency detection algorithm, respectively obtaining saliency maps of the IR and the ID, correspondingly denoted as MR and MD; then, according to the MR and the MD, calculating a maximum fusion saliency map, denoted as MF; and denoting a pixel value of a pixel having coordinates of (x, y) in the MF as MF(x, y), MF(x, y)=max (MR(x, y), MD(x, y)), wherein: 1≦x≦W, 1≦y≦H; the max( ) is a function to find a maximum; the MR(x, y) represents a pixel value of a pixel having coordinates of (x, y) in the MR; and the MD(x, y) represents a pixel value of a pixel having coordinates of (x, y) in the MD;
{circle around (3)} respectively dividing the IR, the ID, the MR, the MD, and the MF into
W
×
H
8
×
8
image blocks, which are not overlapping mutually and have a size of 8×8;
vectorizing color values of R, G, and B channels of all pixels in each image block of the IR and the ID; denoting a color vector obtained through vectorizing the color values of the R, the G, and the B channels of all the pixels in a jth image block of the IR as XjR; denoting a color vector obtained through vectorizing the color values of the R, the G, and the B channels of all the pixels in a jth image block of the ID as XjD; wherein: the j has an initial value of 1,
1
≤
j
≤
W
×
H
8
×
8
;
both of the XjR and the XjD have a dimensionality of 192×1; values of a 1st element to a 64th element in the XjR respectively correspond to the color value of the R channel of each pixel in the jth image block of the IR in a line-by-line scanning manner; values of a 65th element to a 128th element in the XjR respectively correspond to the color value of the G channel of each pixel in the jth image block of the IR in the line-by-line scanning manner; values of a 129th element to a 192nd element in the XjR respectively correspond to the color value of the B channel of each pixel in the jth image block of the IR in the line-by-line scanning manner; values of a 1st element to a 64th element in the XjD respectively correspond to the color value of the R channel of each pixel in the jth image block of the ID in the line-by-line scanning manner; values of a 65th element to a 128th element in the XjD respectively correspond to the color value of the G channel of each pixel in the jth image block of the ID in the line-by-line scanning manner; and values of a 129th element to a 192nd element in the XjD respectively correspond to the color value of the B channel of each pixel in the jth image block of the ID in the line-by-line scanning manner; and
vectorizing pixel values of all pixels in each image block of the MR, the MD, and the MF; denoting a pixel value vector obtained through vectorizing the pixel values of all the pixels in a jth image block of the MR as SjR; denoting a pixel value vector obtained through vectorizing the pixel values of all the pixels in a jth image block of the MD as SjD; and denoting a pixel value vector obtained through vectorizing the pixel values of all the pixels in a jth image block of the MF as SjF; wherein: the SjR, the SjD, and the SjF all have a dimensionality of 64×1; values of a 1st element to a 64th element in the SjR respectively correspond to the pixel value of each pixel in the jth image block of the MR in the line-by-line scanning manner; values of a 1st element to a 64th element in the SjD respectively correspond to the pixel value of each pixel in the jth image block of the MD in the line-by-line scanning manner; and values of a 1st element to a 64th element in the SjF respectively correspond to the pixel value of each pixel in the jth image block of the MF in the line-by-line scanning manner;
{circle around (4)} calculating a saliency of each image block in the MF; and denoting the saliency of the jth image block in the MF as dj,
d
j
=
∑
i
=
1
64

S
j
F

(
i
)
,
wherein: 1≦i≦64 and the SjF(i) represents a value of an ith element in the SjF;
orderly arranging the saliencies of all the image blocks in the MF, from the biggest to the smallest; and, after arranging, determining sequence numbers of the image blocks corresponding to former t1 saliencies, wherein:
t
1
=
λ
1
×
W
×
H
8
×
8
;
the λ1 represents an image block selection proportionality coefficient; and λ1ε(0,1]; and
finding the image blocks in the IR, which are corresponding to the determined t1 sequence numbers, and defining as reference image blocks; finding the image blocks in the ID, which are corresponding to the determined t1 sequence numbers, and defining as distorted image blocks; finding the image blocks in the MR, which are corresponding to the determined t1 sequence numbers, and defining as reference saliency image blocks; finding the image blocks in the MD, which are corresponding to the determined t1 sequence numbers, and defining as distorted saliency image blocks;
{circle around (5)} measuring a saliency difference between each reference image block in the IR and a corresponding distorted image block in the ID through an absolute difference; and denoting a saliency difference between a t′th reference image block in the IR and a t′th distorted image block in the ID as et′,
e
t
′
=
1
64

∑
i
=
1
64


S
~
t
′
R

(
i
)
-
S
~
t
′
D

(
i
)

,
wherein: the t′ has an initial value of 1, 1≦t′≦t1; the symbol “∥” is an absolute value symbol; the {tilde over (S)}t′R(i) represents a value of an ith element in a pixel value vector {tilde over (S)}t′R corresponding to a t′th reference saliency image block in the MR; and the {tilde over (S)}t′D(i) represents a value of an ith element in a pixel value vector {tilde over (S)}t′D corresponding to a t′th distorted saliency image block in the MD; and
orderly arranging the measured t1 saliency differences, from the biggest to the smallest; after arranging, determining the reference image blocks and the distorted image blocks corresponding to former t2 saliency differences; defining the determined t2 reference image blocks as reference visual important image blocks, and adopting a matrix formed by color vectors corresponding to all the reference visual important image blocks as a reference visual important image block matrix, denoted as YR; defining the determined t2 distorted image blocks as distorted visual important image blocks, and adopting a matrix formed by color vectors corresponding to all the distorted visual important image blocks as a distorted visual important image block matrix, denoted as YD; wherein: t2=λ2×t1, the λ2 represents a selection proportionality coefficient of the reference image blocks and the distorted image blocks, and λ2ε(0,1]; the YR and the YD have a dimensionality of 192×t2; a t″th column vector in the YR is a color vector corresponding to a determined t″th reference visual important image block; a t″th column vector in the YD is a color vector corresponding to a determined t″th distorted visual important image block; and the t″ has an initial value of 1, 1≦t″≦t2;
{circle around (6)} centralizing the YR through subtracting a mean value of values of all elements in each column vector from a value of each element in the same column vector of the YR; and denoting an obtained centralized matrix as Y, wherein the Y has a dimensionality of 192×t2; and
processing the Y with dimensionality reduction and whitening through a principal component analysis; and, denoting an obtained matrix after the dimensionality reduction and the whitening as Yw, Yw=W×Y; wherein: the Yw has a dimensionality of M×t2; the W represents a whitened matrix and has a dimensionality of M×192, 1<M<<192; and the symbol “<<” is a much-less-than symbol;
{circle around (7)} online training the Yw through an orthogonal locality preserving projection algorithm; and obtaining a characteristic basis matrix of the Yw, denoted as D, wherein the D has a dimensionality of M×192;
{circle around (8)} according to the YR and the D, calculating a manifold eigenvector of each reference visual important image block; denoting the manifold eigenvector of a t″th reference visual important image block as ut″, ut″=D×yt″R, wherein: the ut″ has a dimensionality of M×1, and the yt″R is the t″th column vector in the YR; according to the YD and the D, calculating a manifold eigenvector of each distorted visual important image block; and denoting the manifold eigenvector of a t″th distorted visual important image block as vt″, vt″=D×yt″D, wherein: the vt″ has a dimensionality of M×1, and the yt″D is the t″th column vector in the YD; and
{circle around (9)} according to the manifold eigenvectors of all the reference visual important image blocks and the manifold eigenvectors of all the distorted visual important image blocks, calculating an objective quality assessment value of the ID, denoted as Score,
Score
=
1
t
2
×
M

∑
t
″
=
1
t
2

∑
m
=
1
M

2
×
u
t
″

(
m
)
×
v
t
″

(
m
)
+
c
(
u
t
″

(
m
)
)
2
+
(
v
t
″

(
m
)
)
2
+
c
,
wherein: 1≦m≦M; the ut″(m) represents a value of an mth element in the ut″; the vt″(m) represents a value of an mth element in the vt″; and the c is a small constant for guaranteeing a result stability.

### Claim 2 (depends on 1)

The objective assessment method for the color image quality based on the online manifold learning, as recited in claim 1, wherein the Yw in the step {circle around (6)} is obtained through following steps of:
{circle around (6)}_1, representing a covariance matrix of the Y by C,
C
=
1
t
2

(
Y
×
Y
T
)
,
wherein: the C has a dimensionality of 192×192, and the YT is a transposition of the Y;
{circle around (6)}_2, processing the C with eigenvalue decomposition, and obtaining all maximum eigenvalues and corresponding eigenvectors, wherein the eigenvectors have a dimensionality of 192×1;
{circle around (6)}_3, choosing M maximum eigenvalues and corresponding M eigenvectors;
{circle around (6)}_4, according to the chosen M maximum eigenvalues and the corresponding M eigenvectors, calculating the whitened matrix W, W=Ψ−1/2×ET, wherein: the Ψ has a dimensionality of M×M, Ψ=diag(ψ1, . . . , ψM), Ψ−1/2=diag(1/√{square root over (ψ1)}, . . . , 1/√{square root over (ψM)}); the E has a dimensionality of 192×M, E=[e1, . . . , eM]; the diag( ) is a main-diagonal matrix representation; the ψ1, . . . , ψM correspondingly represent a 1st to a Mth chosen maximum eigenvalue; and, the e1, . . . , eM correspondingly represent a 1st to a Mth chosen eigenvector; and
{circle around (6)}_5, according to the W, processing the Y with the whitening, and obtaining the Yw after the dimensionality reduction and the whitening, Yw=W×Y.

### Claim 3 (depends on 1)

The objective assessment method for the color image quality based on the online manifold learning, as recited in claim 1, wherein: in the step {circle around (4)}, λ1=0.7.

### Claim 4 (depends on 1)

The objective assessment method for the color image quality based on the online manifold learning, as recited in claim 1, wherein: in the {circle around (5)}, λ2=0.6.

### Claim 5 (depends on 1)

The objective assessment method for the color image quality based on the online manifold learning, as recited in claim 1, wherein: in the step {circle around (9)}, c=0.04.
