Defect detection for patterned fabric images based on GHOG and low-rank decomposition
Chunlei Li(1)
Guangshuai Gao(1)
Zhoufeng Liu(1)
Di Huang(2)
Sheng Liu(1)
Miao Yu(1) \IEEEauthorblockA{(1) School of Electronic and Information Engineering
Zhongyuan University of Technology
ZhengZhou 450007
China
....lastname \thanks{...
In order to accurately detect defects in patterned fabric images, a novel detection algorithm based on Gabor-HOG (GHOG) and low-rank decomposition is proposed in this paper. Defect-free pattern fabric images have the specified direction, while defects damage their regularity of direction. Therefore, a direction-aware descriptor is designed, denoted as GHOG, a combination of Gabor and HOG, which is extremely valuable for localizing the defect region. Upon devising a powerful directional descriptor, an efficient low-rank decomposition model is constructed to divide the matrix generated by the directional feature extracted from image blocks into a low-rank matrix (background information) and a sparse matrix (defect information). A nonconvex log det($\cdot$) as a smooth surrogate function for the rank instead of the nuclear norm is also exploited to improve the efficiency of the low-rank model. Moreover, the computational efficiency is further improved by utilizing the alternative direction method of multipliers (ADMM). Thereafter, the saliency map generated by the sparse matrix is segmented via the optimal threshold algorithm to locate the defect regions. Experimental results show that the proposed method can effectively detect patterned fabric defects and outperform the state-of-the-art methods.
bare_jrnl.tex

%% bare_jrnl.tex
%% V1.4b
%% 2015/08/26
%% by Michael Shell
%% see http://www.michaelshell.org/
%% for current contact information.
%%
%% This is a skeleton file demonstrating the use of IEEEtran.cls
%% (requires IEEEtran.cls version 1.8b or later) with an IEEE
%% journal paper.
%%
%% Support sites:
%% http://www.michaelshell.org/tex/ieeetran/
%% http://www.ctan.org/pkg/ieeetran
%% and
%% http://www.ieee.org/

%%*************************************************************************
%% Legal Notice:
%% This code is offered as-is without any warranty either expressed or
%% implied; without even the implied warranty of MERCHANTABILITY or
%% FITNESS FOR A PARTICULAR PURPOSE!
%% User assumes all risk.
%% In no event shall the IEEE or any contributor to this code be liable for
%% any damages or losses, including, but not limited to, incidental,
%% consequential, or any other damages, resulting from the use or misuse
%% of any information contained here.
%%
%% All comments are the opinions of their respective authors and are not
%% necessarily endorsed by the IEEE.
%%
%% This work is distributed under the LaTeX Project Public License (LPPL)
%% ( http://www.latex-project.org/ ) version 1.3, and may be freely used,
%% distributed and modified. A copy of the LPPL, version 1.3, is included
%% in the base LaTeX documentation of all distributions of LaTeX released
%% 2003/12/01 or later.
%% Retain all contribution notices and credits.
%% ** Modified files should be clearly indicated as such, including  **
%% ** renaming them and changing author support contact information. **
%%*************************************************************************


% *** Authors should verify (and, if needed, correct) their LaTeX system  ***
% *** with the testflow diagnostic prior to trusting their LaTeX platform ***
% *** with production work. The IEEE's font choices and paper sizes can   ***
% *** trigger bugs that do not appear when using other class files.       ***                          ***
% The testflow support page is at:
% http://www.michaelshell.org/tex/testflow/


%\documentclass[journal]{IEEEtran}
\documentclass{IEEEtran}

%\documentclass[draftclsnofoot,onecolumn]{IEEEtran}


\usepackage{graphicx}
\usepackage{amsmath}
\usepackage{multirow}
\usepackage{booktabs}
\usepackage{url}
\usepackage{subfigure}
\usepackage{xcolor}
\usepackage{slashbox}
\usepackage{array}
\usepackage{bm}
%
% If IEEEtran.cls has not been installed into the LaTeX system files,
% manually specify the path to it like:
% \documentclass[journal]{../sty/IEEEtran}





% Some very useful LaTeX packages include:
% (uncomment the ones you want to load)


% *** MISC UTILITY PACKAGES ***
%
%\usepackage{ifpdf}
% Heiko Oberdiek's ifpdf.sty is very useful if you need conditional
% compilation based on whether the output is pdf or dvi.
% usage:
% \ifpdf
%   % pdf code
% \else
%   % dvi code
% \fi
% The latest version of ifpdf.sty can be obtained from:
% http://www.ctan.org/pkg/ifpdf
% Also, note that IEEEtran.cls V1.7 and later provides a builtin
% \ifCLASSINFOpdf conditional that works the same way.
% When switching from latex to pdflatex and vice-versa, the compiler may
% have to be run twice to clear warning/error messages.






% *** CITATION PACKAGES ***
%
%\usepackage{cite}
% cite.sty was written by Donald Arseneau
% V1.6 and later of IEEEtran pre-defines the format of the cite.sty package
% \cite{} output to follow that of the IEEE. Loading the cite package will
% result in citation numbers being automatically sorted and properly
% "compressed/ranged". e.g., [1], [9], [2], [7], [5], [6] without using
% cite.sty will become [1], [2], [5]--[7], [9] using cite.sty. cite.sty's
% \cite will automatically add leading space, if needed. Use cite.sty's
% noadjust option (cite.sty V3.8 and later) if you want to turn this off
% such as if a citation ever needs to be enclosed in parenthesis.
% cite.sty is already installed on most LaTeX systems. Be sure and use
% version 5.0 (2009-03-20) and later if using hyperref.sty.
% The latest version can be obtained at:
% http://www.ctan.org/pkg/cite
% The documentation is contained in the cite.sty file itself.






% *** GRAPHICS RELATED PACKAGES ***
%
\ifCLASSINFOpdf
  % \usepackage[pdftex]{graphicx}
  % declare the path(s) where your graphic files are
  % \graphicspath{{../pdf/}{../jpeg/}}
  % and their extensions so you won't have to specify these with
  % every instance of \includegraphics
  % \DeclareGraphicsExtensions{.pdf,.jpeg,.png}
\else
  % or other class option (dvipsone, dvipdf, if not using dvips). graphicx
  % will default to the driver specified in the system graphics.cfg if no
  % driver is specified.
  % \usepackage[dvips]{graphicx}
  % declare the path(s) where your graphic files are
  % \graphicspath{{../eps/}}
  % and their extensions so you won't have to specify these with
  % every instance of \includegraphics
  % \DeclareGraphicsExtensions{.eps}
\fi
% graphicx was written by David Carlisle and Sebastian Rahtz. It is
% required if you want graphics, photos, etc. graphicx.sty is already
% installed on most LaTeX systems. The latest version and documentation
% can be obtained at:
% http://www.ctan.org/pkg/graphicx
% Another good source of documentation is "Using Imported Graphics in
% LaTeX2e" by Keith Reckdahl which can be found at:
% http://www.ctan.org/pkg/epslatex
%
% latex, and pdflatex in dvi mode, support graphics in encapsulated
% postscript (.eps) format. pdflatex in pdf mode supports graphics
% in .pdf, .jpeg, .png and .mps (metapost) formats. Users should ensure
% that all non-photo figures use a vector format (.eps, .pdf, .mps) and
% not a bitmapped formats (.jpeg, .png). The IEEE frowns on bitmapped formats
% which can result in "jaggedy"/blurry rendering of lines and letters as
% well as large increases in file sizes.
%
% You can find documentation about the pdfTeX application at:
% http://www.tug.org/applications/pdftex





% *** MATH PACKAGES ***
%
%\usepackage{amsmath}
% A popular package from the American Mathematical Society that provides
% many useful and powerful commands for dealing with mathematics.
%
% Note that the amsmath package sets \interdisplaylinepenalty to 10000
% thus preventing page breaks from occurring within multiline equations. Use:
%\interdisplaylinepenalty=2500
% after loading amsmath to restore such page breaks as IEEEtran.cls normally
% does. amsmath.sty is already installed on most LaTeX systems. The latest
% version and documentation can be obtained at:
% http://www.ctan.org/pkg/amsmath





% *** SPECIALIZED LIST PACKAGES ***
%
%\usepackage{algorithmic}
% algorithmic.sty was written by Peter Williams and Rogerio Brito.
% This package provides an algorithmic environment fo describing algorithms.
% You can use the algorithmic environment in-text or within a figure
% environment to provide for a floating algorithm. Do NOT use the algorithm
% floating environment provided by algorithm.sty (by the same authors) or
% algorithm2e.sty (by Christophe Fiorio) as the IEEE does not use dedicated
% algorithm float types and packages that provide these will not provide
% correct IEEE style captions. The latest version and documentation of
% algorithmic.sty can be obtained at:
% http://www.ctan.org/pkg/algorithms
% Also of interest may be the (relatively newer and more customizable)
% algorithmicx.sty package by Szasz Janos:
% http://www.ctan.org/pkg/algorithmicx




% *** ALIGNMENT PACKAGES ***
%
%\usepackage{array}
% Frank Mittelbach's and David Carlisle's array.sty patches and improves
% the standard LaTeX2e array and tabular environments to provide better
% appearance and additional user controls. As the default LaTeX2e table
% generation code is lacking to the point of almost being broken with
% respect to the quality of the end results, all users are strongly
% advised to use an enhanced (at the very least that provided by array.sty)
% set of table tools. array.sty is already installed on most systems. The
% latest version and documentation can be obtained at:
% http://www.ctan.org/pkg/array


% IEEEtran contains the IEEEeqnarray family of commands that can be used to
% generate multiline equations as well as matrices, tables, etc., of high
% quality.




% *** SUBFIGURE PACKAGES ***
%\ifCLASSOPTIONcompsoc
%  \usepackage[caption=false,font=normalsize,labelfont=sf,textfont=sf]{subfig}
%\else
%  \usepackage[caption=false,font=footnotesize]{subfig}
%\fi
% subfig.sty, written by Steven Douglas Cochran, is the modern replacement
% for subfigure.sty, the latter of which is no longer maintained and is
% incompatible with some LaTeX packages including fixltx2e. However,
% subfig.sty requires and automatically loads Axel Sommerfeldt's caption.sty
% which will override IEEEtran.cls' handling of captions and this will result
% in non-IEEE style figure/table captions. To prevent this problem, be sure
% and invoke subfig.sty's "caption=false" package option (available since
% subfig.sty version 1.3, 2005/06/28) as this is will preserve IEEEtran.cls
% handling of captions.
% Note that the Computer Society format requires a larger sans serif font
% than the serif footnote size font used in traditional IEEE formatting
% and thus the need to invoke different subfig.sty package options depending
% on whether compsoc mode has been enabled.
%
% The latest version and documentation of subfig.sty can be obtained at:
% http://www.ctan.org/pkg/subfig




% *** FLOAT PACKAGES ***
%
%\usepackage{fixltx2e}
% fixltx2e, the successor to the earlier fix2col.sty, was written by
% Frank Mittelbach and David Carlisle. This package corrects a few problems
% in the LaTeX2e kernel, the most notable of which is that in current
% LaTeX2e releases, the ordering of single and double column floats is not
% guaranteed to be preserved. Thus, an unpatched LaTeX2e can allow a
% single column figure to be placed prior to an earlier double column
% figure.
% Be aware that LaTeX2e kernels dated 2015 and later have fixltx2e.sty's
% corrections already built into the system in which case a warning will
% be issued if an attempt is made to load fixltx2e.sty as it is no longer
% needed.
% The latest version and documentation can be found at:
% http://www.ctan.org/pkg/fixltx2e


%\usepackage{stfloats}
% stfloats.sty was written by Sigitas Tolusis. This package gives LaTeX2e
% the ability to do double column floats at the bottom of the page as well
% as the top. (e.g., "\begin{figure*}[!b]" is not normally possible in
% LaTeX2e). It also provides a command:
%\fnbelowfloat
% to enable the placement of footnotes below bottom floats (the standard
% LaTeX2e kernel puts them above bottom floats). This is an invasive package
% which rewrites many portions of the LaTeX2e float routines. It may not work
% with other packages that modify the LaTeX2e float routines. The latest
% version and documentation can be obtained at:
% http://www.ctan.org/pkg/stfloats
% Do not use the stfloats baselinefloat ability as the IEEE does not allow
% \baselineskip to stretch. Authors submitting work to the IEEE should note
% that the IEEE rarely uses double column equations and that authors should try
% to avoid such use. Do not be tempted to use the cuted.sty or midfloat.sty
% packages (also by Sigitas Tolusis) as the IEEE does not format its papers in
% such ways.
% Do not attempt to use stfloats with fixltx2e as they are incompatible.
% Instead, use Morten Hogholm'a dblfloatfix which combines the features
% of both fixltx2e and stfloats:
%
% \usepackage{dblfloatfix}
% The latest version can be found at:
% http://www.ctan.org/pkg/dblfloatfix




%\ifCLASSOPTIONcaptionsoff
%  \usepackage[nomarkers]{endfloat}
% \let\MYoriglatexcaption\caption
% \renewcommand{\caption}[2][\relax]{\MYoriglatexcaption[#2]{#2}}
%\fi
% endfloat.sty was written by James Darrell McCauley, Jeff Goldberg and
% Axel Sommerfeldt. This package may be useful when used in conjunction with
% IEEEtran.cls'  captionsoff option. Some IEEE journals/societies require that
% submissions have lists of figures/tables at the end of the paper and that
% figures/tables without any captions are placed on a page by themselves at
% the end of the document. If needed, the draftcls IEEEtran class option or
% \CLASSINPUTbaselinestretch interface can be used to increase the line
% spacing as well. Be sure and use the nomarkers option of endfloat to
% prevent endfloat from "marking" where the figures would have been placed
% in the text. The two hack lines of code above are a slight modification of
% that suggested by in the endfloat docs (section 8.4.1) to ensure that
% the full captions always appear in the list of figures/tables - even if
% the user used the short optional argument of \caption[]{}.
% IEEE papers do not typically make use of \caption[]'s optional argument,
% so this should not be an issue. A similar trick can be used to disable
% captions of packages such as subfig.sty that lack options to turn off
% the subcaptions:
% For subfig.sty:
% \let\MYorigsubfloat\subfloat
% \renewcommand{\subfloat}[2][\relax]{\MYorigsubfloat[]{#2}}
% However, the above trick will not work if both optional arguments of
% the \subfloat command are used. Furthermore, there needs to be a
% description of each subfigure *somewhere* and endfloat does not add
% subfigure captions to its list of figures. Thus, the best approach is to
% avoid the use of subfigure captions (many IEEE journals avoid them anyway)
% and instead reference/explain all the subfigures within the main caption.
% The latest version of endfloat.sty and its documentation can obtained at:
% http://www.ctan.org/pkg/endfloat
%
% The IEEEtran \ifCLASSOPTIONcaptionsoff conditional can also be used
% later in the document, say, to conditionally put the References on a
% page by themselves.




% *** PDF, URL AND HYPERLINK PACKAGES ***
%
%\usepackage{url}
% url.sty was written by Donald Arseneau. It provides better support for
% handling and breaking URLs. url.sty is already installed on most LaTeX
% systems. The latest version and documentation can be obtained at:
% http://www.ctan.org/pkg/url
% Basically, \url{my_url_here}.




% *** Do not adjust lengths that control margins, column widths, etc. ***
% *** Do not use packages that alter fonts (such as pslatex).         ***
% There should be no need to do such things with IEEEtran.cls V1.6 and later.
% (Unless specifically asked to do so by the journal or conference you plan
% to submit to, of course. )


% correct bad hyphenation here
\hyphenation{}


\begin{document}
%
% paper title
% Titles are generally capitalized except for words such as a, an, and, as,
% at, but, by, for, in, nor, of, on, or, the, to and up, which are usually
% not capitalized unless they are the first or last word of the title.
% Linebreaks \\ can be used within to get better formatting as desired.
% Do not put math or special symbols in the title.
\title{Defect detection for patterned fabric images based on GHOG and low-rank decomposition}
%
%
% author names and IEEE memberships
% note positions of commas and nonbreaking spaces ( ~ ) LaTeX will not break
% a structure at a ~ so this keeps an author's name from being broken across
% two lines.
% use \thanks{} to gain access to the first footnote area
% a separate \thanks must be used for each paragraph as LaTeX2e's \thanks
% was not built to handle multiple paragraphs
%

\author{Chunlei Li(1),
        Guangshuai Gao(1),
        Zhoufeng Liu(1),
        Di Huang(2),
        Sheng Liu(1),
        Miao Yu(1)

        \IEEEauthorblockA{(1) School of Electronic and Information Engineering, Zhongyuan University of Technology,
ZhengZhou 450007, China\\}
 \IEEEauthorblockA{(2) School of Computer Science and Engineering, Beihang University, BeiJing, 100191, China}
}
%\thanks{M. Shell was with the Department
%of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta,
%GA, 30332 USA e-mail: (see http://www.michaelshell.org/contact.html).}% <-this % stops a space
%\thanks{J. Doe and J. Doe are with Anonymous University.}% <-this % stops a space
%\thanks{Manuscript received July 19, 2016}}

% note the % following the last \IEEEmembership and also \thanks -
% these prevent an unwanted space from occurring between the last author name
% and the end of the author line. i.e., if you had this:
%
% \author{....lastname \thanks{...} \thanks{...} }
%                     ^------------^------------^----Do not want these spaces!
%
% a space would be appended to the last name and could cause every name on that
% line to be shifted left slightly. This is one of those "LaTeX things". For
% instance, "\textbf{A} \textbf{B}" will typeset as "A B" not "AB". To get
% "AB" then you have to do: "\textbf{A}\textbf{B}"
% \thanks is no different in this regard, so shield the last } of each \thanks
% that ends a line with a % and do not let a space in before the next \thanks.
% Spaces after \IEEEmembership other than the last one are OK (and needed) as
% you are supposed to have spaces between the names. For what it is worth,
% this is a minor point as most people would not even notice if the said evil
% space somehow managed to creep in.



% The paper headers
\markboth{}%
{Shell \MakeLowercase{\textit{et al.}}: Bare Demo of IEEEtran.cls for IEEE Journals}
% The only time the second header will appear is for the odd numbered pages
% after the title page when using the twoside option.
%
% *** Note that you probably will NOT want to include the author's ***
% *** name in the headers of peer review papers.                   ***
% You can use \ifCLASSOPTIONpeerreview for conditional compilation here if
% you desire.




% If you want to put a publisher's ID mark on the page you can do it like
% this:
%\IEEEpubid{0000--0000/00\$00.00~\copyright~2015 IEEE}
% Remember, if you use this you must call \IEEEpubidadjcol in the second
% column for its text to clear the IEEEpubid mark.



% use for special paper notices
%\IEEEspecialpapernotice{(Invited Paper)}






% make the title area
\maketitle

% As a general rule, do not put math, special symbols or citations
% in the abstract or keywords.
\begin{abstract}
In order to accurately detect defects in patterned fabric images, a novel detection algorithm based on Gabor-HOG (GHOG) and low-rank decomposition is proposed in this paper. Defect-free pattern fabric images have the specified direction, while defects damage their regularity of direction. Therefore, a direction-aware descriptor is designed, denoted as GHOG, a combination of Gabor and HOG, which is extremely valuable for localizing the defect region. Upon devising a powerful directional descriptor, an efficient low-rank decomposition model is constructed to divide the matrix generated by the directional feature extracted from image blocks into a low-rank matrix (background information) and a sparse matrix (defect information). A nonconvex log det($\cdot$) as a smooth surrogate function for the rank instead of the nuclear norm is also exploited to improve the efficiency of the low-rank model. Moreover, the computational efficiency is further improved by utilizing the alternative direction method of multipliers (ADMM). Thereafter, the saliency map generated by the sparse matrix is segmented via the optimal threshold algorithm to locate the defect regions. Experimental results show that the proposed method can effectively detect patterned fabric defects and outperform the state-of-the-art methods.
\end{abstract}

% Note that keywords are not normally used for peerreview papers.
\begin{IEEEkeywords}
patterned fabric, defect detection, GHOG, low-rank decomposition, ADMM.
\end{IEEEkeywords}






% For peer review papers, you can put extra information on the cover
% page as needed:
% \ifCLASSOPTIONpeerreview
% \begin{center} \bfseries EDICS Category: 3-BBND \end{center}
% \fi
%
% For peerreview papers, this IEEEtran command inserts a page break and
% creates the second title. It will be ignored for other modes.
\IEEEpeerreviewmaketitle



\section{Introduction}
Fabric defect detection always plays a key role in the quality control of textile industry. Currently, it is mainly performed visually by skilled workers. However, its reliability is restricted by eye fatigue and human errors. An automated detection system based on machine vision can provide a promising solution that not only minimizes labor costs, but will also improve accuracy and efficiency. Moreover, an automated system is better equipped to deal with different kinds of fabric patterns, from the non-motif pattern (plain and twill fabrics, as shown in Fig.1 (a)) to the motif pattern (star-, box-, and dot-patterned fabrics, as shown in Fig.1 (b-d)).

Most existing defect detection methods focus on simple plain and twill fabrics, which can be classified into four categories: statistical method [1], frequency analysis method [2], model method [3], and dictionary learning method [4].

The aforementioned defect detection methods achieve high detection accuracy. However, because of the complexity and sophisticated design on patterned fabric, these proposed methods cannot be extended to detect patterned fabric defects. Moreover, few studies have been conducted on patterned fabric so far. In this paper, our research is focused on defect detection in patterned fabric.


\begin{figure}[ht]
\centering
\subfigure[]{\includegraphics[width= 0.1\textwidth]{Fig1a.eps}}\
\subfigure[]{\includegraphics[width= 0.1\textwidth]{Fig1b.eps}}\
\subfigure[]{\includegraphics[width= 0.1\textwidth]{Fig1c.eps}}\
\subfigure[]{\includegraphics[width= 0.1\textwidth]{Fig1d.eps}}\
    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
  \caption{(a) Plain and twill. (b) Star-patterned fabric.(c) Box-patterned fabric. (d) Dot-patterned fabric.}
\end{figure}

The patterned fabrics are defined as fabrics with repetitive patterned units in their designs. Even within the same class of 'patterned' fabrics, there are still many categories, and the pattern sizes are different. Therefore, patterned fabric defect detection is a challenging task. Traditional methods cannot efficiently recognize the normal pattern; furthermore, they fail to localize the defect region. Some methods devised for pattern fabric defect detection, such as the ELO rating (ER) method [31], and wavelet-preprocessing golden image subtraction (WGIS) [21], et al.,which are performed in a supervised approach, require non-defective samples; moreover, the detection accuracy of these methods depends on precise alignment and choosing a suitable template.

Visual attention mechanism can enable machine and biological vision systems to quickly find the most salient regions or objects from a scene [5]. Generally, pattern fabric images always exhibit a high periodic texture among sub-patterns. However, the defect will disrupt their periodicity (regularity), resulting in the defects outstanding from homogeneous background. Therefore, visual saliency models provide a promising method for pattern fabric defect detection.

Many saliency models have been proposed to detect salient objects [5]. A representative series of papers are based on the low-rank matrix decomposition (LR) theory [6,7]. The background usually lies in a low-dimensional subspace, while the objects that are different from the background can be considered as noises or errors. Therefore, these methods divide an image into a low-rank matrix plus a sparse matrix in a learned feature space, where the low-rank matrix represents the background regions, and the sparse matrix indicates the salient object regions.

For different kinds of patterned fabrics, the background of the fabric has a visually homogeneous texture, and any defects stand out from the background. Compared with object detection in a natural scene, patterned fabric defect detection better fits the low-rank decomposition model.

However, using low-rank decomposition directly in a color space or in some other feature space of images does not deal with the task of pattern fabric defect detection with any sort of efficiency. This is because sub-parts have different colors or other features locally, but globally they belong to the normal texture. Therefore, a new powerful descriptor should be proposed to efficiently characterize the fabric texture, and should be required to possess the following attributes: (1) defect regions should have a totally different feature descriptor compared with the background; (2) the background should have a similar feature descriptor (that can be easily regarded as the low-rank part).

Defect-free pattern fabric images have a specified direction, while defects damage their regularity of direction. Therefore, a direction-aware descriptor can better represent the fabric feature, which is extremely valuable for separating a salient defect from a non-salient background.

Therefore, in this paper, a direction-aware descriptor, denoted as GHOG, is designed to be a combination of Gabor and HOG. Upon devising a powerful directional descriptor, an efficient low-rank decomposition model is constructed to divide the matrix generated by the directional feature extracted from image blocks into a low-rank matrix (background information) and a sparse matrix (defect information). Moreover, we also propose the use of a non-convex log det(��) as a smooth surrogate function for the rank as opposed to the nuclear norm in order to improve the model's efficiency. Finally, the saliency map generated by the sparse matrix is segmented to locate the defect regions.

The reminder of this paper is organized as follows. Section 2 introduces the related works of fabric defect detection. In Section 3, we focus on the proposed algorithm and its specific procedures. Section 4 evaluates the performance of the proposed algorithm and compares it with other state-of-the-art methods. Finally, we conclude the paper in Section 5.


\section{Related works}
Defect detection plays an important role in the fabric quality control process. Many different fabric defect detection methods have been proposed to solve this problem, and are generally used to detect defects in plain and twill fabrics. These methods are divided into the following categories: spatial statistical analysis, spectral analysis, model-based methods, and dictionary learning. Spatial statistical methods detect defects by calculating gray values contrasted with their surroundings, including histogram character analysis [8], morphology [9], local contrast enhancement [10], and the fractal method [11]. The detection results of these methods depend largely on the size of a selected window and its discrimination threshold; it is difficult to detect smaller sizes defects for them. Additionally, these methods cannot effectively exploit the image's global information, and are always influenced by noise.

Spectral analysis methods transform the image to the spectral domain by choosing a suitable orthogonal basis, which can make better use of the image's global information detect defects. These methods include the Fourier transform (FT) [12], the Gabor transform [13] and the orthogonal wavelet transform [14]. However, these methods always have high computational complexity and poor detection performance for the complex texture fabric images.

Model-based methods first extract image texture features through modeling and parameter estimation techniques. Defect detection is realized by discriminating whether the test image conforms with the normal texture model. Existing methods include the Gaussian-Markov random field (GMRF) [15], and the Gaussian mixture model (GMM) [16, 17]. These methods have obtained satisfactory detection performance; however, they usually share a high computational complexity, and these methods cannot efficiently detect smaller size defects.

Dictionary learning-based methods learn a dictionary of training images or test images, and then reconstruct the defect-free fabric image; thereafter, defect detection can be realized by subtracting the recovered image from the test image [18, 19]. In a different way, dictionary learning based methods also reduce the dimension of an image block by projecting the image block into a dictionary learning from reference image, then the SVDD is adopted to discriminate whether an image block is a defect block [20]. However, these methods are unable to achieve ideal detection performance because the reconstructed image by the dictionary learning from themselves may exist some defects, or the self-adaptability of these methods are reduced if the dictionary learns from the reference images.

Regarding complicated patterned fabrics, several methods have been recently published, such as the wavelet-preprocessing golden image subtraction method (WGIS) [21], the Bollinger band method (BB) [22], the regular band method (RB) [23], template matching for discrepancy measures (TMPM) [24], the pattern matching and subtraction approach [25-28], the Hash function method [29], and the regularity and local orientation (RLO) method [30].

The WGIS method utilized a golden image to perform a moving subtraction of each pixel along each row of every wavelet-pre-processed tested image. The BB and RB methods, designed by different combination of moving averages and standard deviations, utilized the regularity property of a patterned texture to carry out on dot-, box-and star-patterned fabrics. The TMPM method used a golden image-like approach to exploit a discrepancy measure as a fitness function to detect defectson patterned textures. The patterned matching and subtraction method performs a point-to-point comparison, which is inherently sensitive to image noise, misalignment and distortion. The hash function method utilizes the offset properties between defect-free and regular patterns to detect the defects; it is fast but is also sensitive to noise and unable to show the shape of any defects after segmentation. The ELO rating (ER) method [31], is a method in which the detection of fabric defects is similar to carrying out fair matches in the spirit of good sportsmanship. However, this method depends on partition size, the number of randomly located partitions, $w$-variable and constant $K$.

The above pattern fabric defect detection methods adopt traditional approaches to characterize the fabric texture, such as wavelet transform, Gabor transform, average value, standard deviation and regular bands. They devised the feature descriptors, but did not consider the characteristics of the pattern fabric image. On the other hand, most of the complicated pattern fabric defect detection methods adopted template-matching technology to localize the defect; they are performed in a supervised approach. The detection accuracy depends on precise alignment and choosing a suitable template. Therefore, in this paper, a powerful direction-aware descriptor was designed, denoted as GHOG. The descriptor considers the characteristic of the patterned fabric image, and a low-rank decomposition model that can better fit the defect detection problem is adopted to separate the salient defect from the non-salient background.


\section{The proposed algorithm}
Defect-free pattern fabric images have a specified direction, while defects damage their regularity of direction. Moreover, compared with the object detection in a natural scene, patterned fabric defect detection can better fit a low-rank decomposition model. Therefore, our paper proposes a novel method of patterned fabric defect detection, based on GHOG and low-rank decomposition, and it includes the following four steps: 1) GHOG feature extraction; 2) low-rank decomposition model construction; 3) optimal solution of the model; 4) the generation and segmentation of the saliency map.

\begin{figure*}
  \centering
  \includegraphics[width=0.9\textwidth]{Fig2.eps}\\
  \caption{Construction process of the proposed GHOG descriptor}
\end{figure*}

\subsection{ GHOG feature extraction}
Highly effective fabric defect detection algorithms should resort to meaningful and powerful feature descriptors to facilitate uniqueness measurements and warrant sufficiently discriminative capabilities. Defect-free patterned fabric images have a specified direction, while defects damage their regularity of direction. Therefore, a direction-aware descriptor can better represent the fabric feature.

Due to the outstanding mathematical properties of the Gabor filter and its analogy to human visual mechanisms, the two-dimensional (2D) Gabor filter has been widely applied in the texture analysis. In this paper, a bank of Gabor directional filters have been adopted to extract directional information, and generate the directional Gabor filtered maps.

In addition, the gradient space of an image provides a measure of change in intensity over the pixels, as opposed to the absolute values of the pixels' intensity values. Although the existence of defects destroys the regularity of a patterned texture, it will have a more enhanced effect in gradient space domain than in image space domain. As a consequence, features extracted from gradient space domain of a defective periodic block will differ significantly to those extracted from a defective-free block. Considering that the Histogram of Oriented Gradients (HOG) features are extracted from generated Gabor filtered maps in quantized directions, a novel Gabor-HOG (GHOG) feature description is proposed to greatly reduce the feature dimension and to capture the directional feature. The construction process of the proposed GHOG descriptor is shown in Figure.2, and the specific procedures are described as follows:


1) \textbf{Gabor directional filtered map generation.} The complex function expression of a 2-D Gabor filter is described as
follows [34]:
\begin{equation}
g\left( {x,y;\lambda ,\psi ,\sigma ,\gamma } \right) = \exp \left( { - \frac{{x'^2  + \gamma ^2 y'^2 }}{{2\sigma ^2 }}} \right)\exp \left( {i\left( {2\pi \frac{{x'}}{\lambda } + \psi } \right)} \right)
\end{equation}
Its real part can be formulated as:
\begin{equation}
g\left( {x,y;\lambda ,\psi ,\sigma ,\gamma } \right) = \exp \left( { - \frac{{x'^2  + \gamma ^2 y'^2 }}{{2\sigma ^2 }}} \right)\cos \left( {2\pi \frac{{x'}}{\lambda } + \psi } \right)
\end{equation}
And its imaginary part is described as:
\begin{equation}
g\left( {x,y;\lambda ,\psi ,\sigma ,\gamma } \right) = \exp \left( { - \frac{{x'^2  + \gamma ^2 y'^2 }}{{2\sigma ^2 }}} \right)\sin \left( {2\pi \frac{{x'}}{\lambda } + \psi } \right)
\end{equation}
where $x' = x\cos \theta  + y\sin \theta$, $y' =  - x\sin \theta  + y\cos \theta$, $\lambda$ is wave length, which is always greater than or equal to 2, but not more than 1/5 of the size of the input image; $\theta$ represents directions, their values ranging from 0 to $2\pi$; $\psi$ indicates phase shift, whose range is from $-\pi$ to $\pi$, 0 and $\pi$ correspond to center-on and center-off functions, respectively, while $- \pi /2$ and $\pi /2$ correspond to anti-symmetric function; $\gamma$ is the length-width ratio, also known as the ratio of the vertical and the horizontal, which determines the ellipticity of the Gabor function; if $\gamma  = 1$, the shape is round, if $\gamma  < 1$ , shape stretches along the direction of parallel stripes, in this paper, $\gamma$ is set to 0.5; $\sigma$ is the Gaussian factor standard deviation of the Gabor function.The value of $\sigma$ cannot be preset directly, its change just depends on the variation of the bandwidth $b$. $b$ must be a positive constant, which is related to the ratio of $\sigma /\lambda$, we usually set it as 1. Then the relationship of $\sigma$ and $\lambda$ is $\sigma  = 0.56\lambda$. In this paper, empirically, we choose eight orientations with one scale to filter the patterned fabric image, and accordingly generate eight \textbf{directional filtered maps} $
I_{G_o }$ ($o$=1,2,...,\emph{N}, \emph{N}=8 here) that capture the directional features.

2) \textbf{Uniformly sampling for the Gabor filtered maps.} Once these directional filtered maps of all quantized directions are obtained, they are exploited as the inputs for the next computing histogram of orientated gradients features over the same image region. For each generated Gabor filtered map , the size of which is the same as the given original image, is equally decomposed into segments $\left\{ {I_{G_o }^i } \right\}_{i = 1,2...K}$ with sizes of $N_{\rm{b}}  \times N_{\rm{b}}$ ; where $o$ indicts the orientations, and $o$=1,2,...8, $K$ is the number of segments, $N_b$ equals 16 in this paper.

3) \textbf{ HOG feature extraction.}  For each segment $I_{G_o } ^i$, the HOG is similar to the method described in [35]. The detail procedures are as follows: 	

First of all, normalize the input image block $I_{G_{\rm{i}} } ^j$ obtained by gamma rectification, and it is described as follows.
\begin{equation}
\emph{H}_o (x,y) = (\emph{I}_{G_o }^i )^{gamma}
\end{equation}
In this paper, gamma is set to 1/2.

Calculate the gradient of image pixels along the horizontal and vertical directions:
\begin{equation}
mag_o (x,y) = \sqrt {\left( {\frac{{\partial H_o (x,y)}}{{\partial x}}} \right)^2  + \left( {\frac{{\partial H_o (x,y)}}{{\partial y}}} \right)^2 }
\end{equation}

\begin{equation}
\theta _o (x,y) = \arctan (\frac{{\partial H_o (x,y)}}{{\partial y}}/\frac{{\partial H_o (x,y)}}{{\partial x}})
\end{equation}

\begin{equation}
\frac{{\partial H_o \left( {x,y} \right)}}{{\partial x}} = H_o \left( {x + 1,y} \right) - H_o \left( {x - 1,y} \right)
\end{equation}

\begin{equation}
\frac{{\partial H_o \left( {x,y} \right)}}{{\partial y}} = H_o \left( {x,y + 1} \right) - H_o \left( {x,y - 1} \right)
\end{equation}

Then each orientation is mapped to the range of $[0,2\pi ]$ from that of $[ - \pi /2,\pi /2]$, which keeps consistent with the number of the Gabor filter maps. After quantization, the entry $n_o$ of each orientation $\theta _o$ is computed as follows:
\begin{equation}
n_o (x,y) = \bmod (\left\lfloor {\frac{{\theta _o (x,y)}}{{2\pi /N}} + \frac{1}{2}} \right\rfloor ,N),{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} o = 1,2,...,N
\end{equation}

The histogram of orientation gradients features, $h_{oi}$, is constructed as (10) by accumulating the gradient magnitude $mag_o$ of all the pixels with the same quantized orientation entry $n_o$.
\begin{equation}
h_{oi} (j) = \sum {f(n_o (x,y) = j)} *mag_o (x,y)
\end{equation}
where \emph{j} =0, 1,..., \emph{N}-1; \emph{o}=1,2,...,\emph{N}; \emph{i} =1,2,...,\emph{K}.
\begin{equation}
f(x) = \left\{ \begin{array}{l}
 1,{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} if{\kern 1pt} {\kern 1pt} {\kern 1pt} x{\kern 1pt} {\kern 1pt} {\kern 1pt} is{\kern 1pt} {\kern 1pt} {\kern 1pt} true \\
 0,{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} otherwise \\
 \end{array} \right.
\end{equation}

Then, for each Gabor filtered maps $I_{G_o }$, its HOG features $h_o$ is generated by concatenating all the histograms of all the segments:
\begin{equation}
h_o  = [h_{o1} ,h_{o2} ,h_{o3} ,...,h_{oK} ]^T
\end{equation}

The final GHOG descriptor is generated by concatenating all \emph{N} histogram of HOG features of all segments as (13). Each histogram $h_o$ is normalized to a unit norm vector $
\mathop {h_{o_K } }\limits^ \wedge$ before the concatenation.
\begin{equation}
GHOG_K  = \left[ {\mathop {h_{1K} }\limits^ \wedge  ,\mathop {h_{2K} }\limits^ \wedge  ,...,\mathop {h_{NK} }\limits^ \wedge  } \right]^T
\end{equation}

We define a feature matrix $\textbf{F}$ as the final GHOG descriptors to represent the information of the entire image.

\begin{equation}
\textbf{F} = [GHOG_1 ,GHOG_2 ,...,GHOG_K ]
\end{equation}

\subsection{Low-rank decomposition model}
Low-rank decomposition and subspace recovery have been widely used for detection and recognition. This is because the background of an image always lies in a low-dimensional subspace, while the objects to be detected are different from the background can be considered as either noise or errors. Therefore, these methods divide an image into a low-rank matrix, plus a sparse matrix in a learned feature space, where the low-rank matrix represents the background regions, and the sparse matrix indicates the salient object regions. For different kinds of patterns, the fabric's background has a visually homogeneous texture, and the defects stand out. Compared with object detection in a natural scene, the patterned fabric defect detection better fits the low-rank decomposition model. Therefore, in this paper, the low-rank decomposition model is proposed to detect the defect region.

For the aforementioned generated feature matrix $F$, a low-rank decomposition model is constructed as follows:

\begin{equation}
\begin{split}
 \left( {L^* ,S^* } \right) = \arg {\kern 1pt} {\kern 1pt} {\kern 1pt} \mathop {\min }\limits_{\left( {L,S} \right)} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} \left( {rank{\kern 1pt} {\kern 1pt} {\kern 1pt} \left( L \right) + \lambda \left\| S \right\|_0 {\kern 1pt} } \right){\kern 1pt} {\kern 1pt}  \\
 {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} s.t.{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} F = L + S \\
\end{split}
\end{equation}
where $L$ is a low-rank matrix, indicating the background, i.e., repeated patterns. $S$ is a sparse matrix, and it represents the defective objects.

Since the above problem is NP-hard, it is difficult to approximate the optimal solution of (7), so the convex surrogate is adopted as follows:

\begin{equation}
\left( {L^* ,S^* } \right) = \arg {\kern 1pt} {\kern 1pt} {\kern 1pt} \mathop {\min }\limits_{\left( {L,S} \right)} {\kern 1pt} {\kern 1pt} {\kern 1pt} \left( {\left\| L \right\|_*  + \lambda \left\| S \right\|_1 } \right){\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} s.t.{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt}  = L + S
\end{equation}
where $\left\| L \right\|_*$ is the nuclear norm of $L$, $\left\| {{\kern 1pt} {\kern 1pt} {\kern 1pt} .{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} } \right\|_1$ indicates the $l_1$ norm, $\lambda$ is a weighted factor that controls the low-rank and sparsity degree.

Using the nuclear norm as a convex surrogate in the first term of Eq. (8), i.e., rank minimization problem is correct, while non-convex optimization toward the rank minimization problem could lead to better recovery results.

In this paper, a smooth but non-convex surrogate of the rank is adopted instead of the nuclear norm. For a given matrix with a symmetric positive semi-definite $X \in R^{n \times n}$, the rank minimization problem can be approximately surrogate by minimizing the following equation [34]:
\begin{equation}
E(X,\xi ) = \log \det (X + \xi I)
\end{equation}
where $\xi$ is a positive scalar. $E\left( {X,\xi } \right)$ approximates the sum of the logarithm of singular values, thus it is smooth and non-convex. The log det as a non-convex surrogate of the rank has also been more carefully proofed from an information-theoretic perspective. As shown in Figure 3, the surrogate function $E\left( {X,\xi } \right)$ can better approximate the rank than the nuclear norm.

\begin{figure}[ht]
  \centering
  \includegraphics[width=0.4\textwidth]{Fig3.eps}\\
  \caption{Comparison of $L\left( {x,\xi } \right)$, $rank\left( x \right)$, $\left\| x \right\|_*$  in the case of a scalar.}
\end{figure}

For the low-rank matrix $L$, Eq.(9) is rewritten as follows:
\begin{equation}
\begin{split}
 L(L,\xi ) = \log \det ((LL^T )^{1/2}  + \xi I) \\
 {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt}  = \log \det (U\Sigma ^{1/2} U^{ - 1}  + \xi I) \\
 {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt}  = \log \det (\Sigma ^{1/2}  + \xi I) \\
\end{split}
\end{equation}
where $\Sigma$ is the diagonal matrix whose diagonal elements are eigenvalues of matrix $LL^T$, i.e., $LL^T  = U\Sigma U^{ - 1}$, meanwhile, $\Sigma ^{1/2}$ is also the diagonal matrix whose diagonal elements are the singular values of the matrix $L$. Hence, $L\left( {L,\xi } \right)$ is a log det(��) surrogate function of $rank\left( L \right)$ obtained by setting $X = \left( {LL^T } \right)^{1/2}$. Finally, Eq.(8) can be rewritten as follows:
\begin{equation}
(L^* ,S^* ) = \arg {\kern 1pt} {\kern 1pt} \mathop {\min }\limits_{(L,S)} {\kern 1pt} {\kern 1pt} (L(L,\xi ) + \lambda \left\| S \right\|_1 ){\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} s.t.{\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} F = L + S
\end{equation}

\subsection{Optimal solution of the model}
The alternative direction method of multipliers (ADMM) demonstrates a good balance between efficiency and accuracy in solving optimization problems. In this paper, ADMM has been adopted to solve Eq. (11).

The Augmented Lagrange Multiplier function of Eq.(11) is as follows:
\begin{equation}
\begin{split}
 L(L,S,Z) = L(L,\xi ) + \lambda \left\| S \right\|_1  + \frac{\beta }{2}\left\| {L + S - F} \right\|_F^2  \\
 {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt}  - \left\langle {Z,L + S - F} \right\rangle  \\
\end{split}
\end{equation}
where $Z \in R^{m \times n}$ is the multiplier of the linear constraint, $\beta  > 0$ is the penalty parameter for the violation of the linear constraint, $\left\langle  \cdot  \right\rangle$   is the inner product and $\left\|  \cdot  \right\|_F$ is the induced Frobenius norm. The proposed objective function can be solved by alternatively minimizing the objective function with respect to the $L$, $S$ and the multiplier $Z$. It can be described as solving the following three sub-problems:
\begin{equation}
\left\{ \begin{array}{l}
 L_{k + 1}  = \arg \min _L L(L,S_k ,Z_k ;\beta ) \\
 S_{k + 1}  = \arg \min _S L(L_{k + 1} ,S,Z_k ;\beta ) \\
 Z_{k + 1}  = Z_k  - \beta \left( {L_{k + 1}  + S_{k + 1}  - F} \right) \\
 \end{array} \right.
\end{equation}

For the first sub-problem in (13) which solves for $L$ at fixed $S$ and $Z$, it can be explicitly represented as the following form:
\begin{equation}
\begin{split}
 L^*  = \mathop {\arg \min }\limits_L \sum\nolimits_{j = 1}^{n_0 } {\log (\sigma _j \left( L \right) + \xi )}  + \frac{\beta }{2}\left\| {L + S - F} \right\|_F^2  \\
 {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt} {\kern 1pt}  - \left\langle {Z,L + S - F} \right\rangle  \\
\end{split}
\end{equation}
where $n_0  = \min \left\{ {m,n} \right\}$, and $\sigma _j \left( L \right)$  indicates the $j$-th singular value of $L$. For simplicity, we use $\sigma _j$ to denote $\sigma _j \left( L \right)$ . Even though $\sum\nolimits_{j = 1}^n {{\rm{log}}\left( {\sigma _j  + \xi } \right)}$ is non-convex, it can be solved by utilizing a local minimization approach. We define the equality $
f\left( \sigma  \right) = \sum\nolimits_{j = 1}^n {{\rm{log}}\left( {\sigma _j  + \xi } \right)}$. Then $f\left( \sigma  \right)$ can be approximated by using its first-order Taylor expansion, as follows:
\begin{equation}
f\left( \sigma  \right) = f\left( {\sigma ^{(k)} } \right) + \left\langle {\nabla f\left( {\sigma ^{(k)} } \right),\sigma  - \sigma ^{(k)} } \right\rangle
\end{equation}
where $\sigma ^{(k)}$ is the solution obtained in the $k$-th iteration. Therefore, Eq.(14) can be solved by iteratively solving:
\begin{equation}
\begin{split}
 L^{(k + 1)}  = \mathop {\arg \min }\limits_L \frac{\beta }{2}\left\| {L + S - F - \frac{Z}{\beta }} \right\|_F^2  \\
 {\kern 1pt} {\kern 1pt}  + \sum\nolimits_{j = 1}^n {\frac{{\sigma _j }}{{\sigma _j^{(k)}  + \xi }}}  \\
\end{split}
\end{equation}
where we use the fact that $\nabla f(\sigma ^{(k)} ) = \sum\nolimits_{j = 1}^{n_0 } {\frac{1}{{\sigma _j^{(k)}  + \xi }}}$ and ignore the constants in Eq.(14). For convenience, we rewrite Eq.(16) as:
\begin{equation}
L^{(k + 1)}  = \mathop {\arg \min }\limits_L \frac{1}{2}\left\| {L + S - F - \frac{Z}{\beta }} \right\|_F^2  + \tau \varphi \left( {L,\omega ^{(k)} } \right)
\end{equation}
where $\tau  = 1/\beta$. $\varphi (L,\omega ) = \sum\nolimits_j^{n_0 } {\omega _j^{(k)} } \sigma _j$ indicates a weighted nuclear norm whose weights $\omega _j^{(k)}  = 1/\left( {\sigma _j^{(k)}  + \xi } \right)$. Note that the weights are ascending, since the singular values $\sigma _j$ are ordered in a descending order.

In general, for a real matrix, the weighted nuclear norm is a convex function only if the weights are descending, and the optimal solution to Eq. (17) is obtained by a weighted singular value thresholding operator, referred to as the proximal operator. In this paper, the weights are ascending, thus Eq. (17) is non-convex. It is therefore difficult to find its global minimizer. Nevertheless, we could find that the weighted singular value thresholding gives one minimizer to Eq. (17) via Theorem 1 (Proximal Operator of Weighted Nuclear Norm) [35]. According to this Theorem, we can obtain the low-rank matrix at the $(k+1)$-th iteration by
\begin{equation}
L^{\left( {k + 1} \right)}  = U\left( {\Sigma  - \tau diag\left( {\omega ^{\left( k \right)} } \right)} \right)_ +  V^T
\end{equation}
where $U\Sigma V^T$ is the SVD of the feature matrix $F$, and $\omega _j^{(k)}  = 1/\left( {\sigma _j^{(k)}  + \xi } \right)$. Even though the weighted thresholding is only a local minimizer, it always leads to a decrease in the objective function value. In this paper, the initial value $\omega ^{\left( 0 \right)} {\kern 1pt} {\kern 1pt} {\kern 1pt}$ is set to $\left[ {1,1,...1} \right]^T$.

After solving the low-rank matrix L, the sparse matrix S can be solved by fixing L and Z. Indeed, we can easily obtain the solution using the widely-used shrinkage problem [36]:
\begin{equation}
S^{k + 1}  = \frac{1}{\beta }Z^k  - L^k  + F - P_{\Omega _\infty ^{\gamma /\beta } } \left[ {\frac{1}{\beta }Z^k  - L^k  + F} \right]
\end{equation}
where $P_{\Omega _\infty ^{\gamma /\beta } }$ indicts the Euclidean projection onto:
\begin{equation}
\Omega _\infty ^{\gamma /\beta } : = \left\{ {X \in R^{n \times n} \left| { - \gamma /\beta  \le X_{ij}  \le \gamma /\beta } \right.} \right\}
\end{equation}
Then the multipliers $Z$ can be updated as follows:
\begin{equation}
Z^{k + 1}  = Z^k  - \beta (L^{k + 1}  + S^{k + 1}  - F)
\end{equation}

\subsection{The generation and segmentation of the saliency map}
 \textbf{Saliency map generation.} After decomposing the feature matrix $F$ of the given patterned fabric image into the low-rank matrix $L$, which corresponds to the patterned fabric background, and a sparse matrix $S$, which corresponds to the defective regions by the aforementioned methods. A saliency map $M$ is generated by the $l_1$-norm of each column $S_i$ in $S$, and it is described as follows:
\begin{equation}
M(I_i ) = \left\| {S_i } \right\|_1
\end{equation}

The larger value of $M\left( {I_i } \right)$ indicates that the block $I_i$ has higher probability of being defective.

\textbf{The segmentation of saliency map.}

1). Denoise the saliency map $M$ to generate a new saliency map $\mathop M\limits^ \wedge$��
\begin{equation}
\mathop M\limits^ \wedge   = g*(M \circ M)
\end{equation}
where $g$ is the radius of the circular smoothing filter and "$\circ$" denotes the Hadamard inner product operator and "*" is the convolution operator.

2). Transform the saliency map $\mathop M\limits^ \wedge$ into a gray-scale image $G$ ��
\begin{equation}
G = \frac{{\mathop M\limits^ \wedge   - \min (\mathop M\limits^ \wedge  )}}{{\max (\mathop M\limits^ \wedge  ) - \min (\mathop M\limits^ \wedge  )}} \times 255
\end{equation}

3). Segment $G$ by using improved adaptive threshold algorithm [37] to locate the defect regions.

\section{Experimental results and analysis}
In order to verify the effectiveness of the proposed algorithm, we chose images from the dot-, box-, and star-patterned fabric databases for performance evaluation. The size of the fabric image is 512 pixels $\times$ 512 pixels. The dot-patterned fabric database contains 30 defect-free and 30 defective images, the star-patterned fabric database contains 25 defect-free and 25 defective images, and the box-patterned fabric database contains 30 defect-free and 26 defective images. All the defective images have a corresponding ground-truth that shows the defect-free regions as black and defective regions as white. All experiments in this paper were implemented in an Inter(R) Core(TM) i3-2120 3.3GHZCPU environment, using software MATLAB 2011a.

\emph{A. Qualitative Results}

The test patterned fabric image matrix was divided into the superposition of two parts, i.e., a low-rank matrix and a sparse matrix, and the visual saliency map was generated from the sparse matrix and outstands the defective regions. Thus a simple threshold method can easily localize the defect region.

The feature extraction method and detection model are equally important for fabric defect detection. In order to validate the effectiveness of our method, we firstly compared the saliency maps generated by different descriptors, including Gabor [32], HOG [33], and different detection models, such as the template matching model (TMM) [38] and the context analysis model (CAM) [39] with our method, as shown in Figure 4. The first column consists of the original images, the second column consists of saliency maps generated by the Gabor feature [32] and the LR detection model, the third column consists of the saliency maps generated by the HOG feature [33] and the LR detection model, the fourth column consists of the saliency maps generated by the GHOG feature and the TMM [38] detection model, the fifth column consists of the saliency maps generated by the GHOG feature and the CAM [39] detection model, and the last column consists of the saliency maps generated by our method (GHOG feature and the LR detection model). From the second column and the third column in Figure 4, we can conclude that the detection result based on the Gabor or HOG features cannot outstand the defect region for star-patterned fabric and box-patterned fabric images, but they can outstand the detect region for dot-patterned fabric images. On the other hand, from the fourth column and the fifth column in Figure 4, the saliency map generated by the GHOG feature and the TMM or CAM detection models cannot outstand the defect region. In the last column we can see that the saliency map generated by our method can efficiently outstand the defect region for all the three types of images. And the performance of these methods can be concluded as Table1.
\begin{table*}[htbp]
\centering
 \caption{\label{tab:test}Comparisons with other methods}
 \resizebox{\textwidth}{!}{
\begin{tabular}{lp{2cm}p{2.5cm}p{2.5cm}p{2.5cm}p{2.5cm}}
 %\begin{tabular}{lccccc}
  \toprule
  Methods$/$ fabric image & Gabor+LR & HOG+LR & GHOG+TMM & GHOG+CAM & GHOG+LR  \\
  star-patterned & $\times$ & $\times$ & $\times$ & $\times$ & $\surd$ \\
  box-patterned & $\times$ & $\times$ & $\times$ & $\times$ &$\surd$ \\
  dot-patterned & $\surd$ & $\surd$ & $\times$ & $\times$ &$\surd$  \\
  \bottomrule
 \end{tabular}}
\end{table*}


\begin{figure*}[htp]
\centering
\subfigure[Saliency map for star-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig4a.eps}}\quad
\subfigure[Saliency map for box-patterned fabric imagec]{\includegraphics[width= 0.495\textwidth]{Fig4b.eps}}\quad
\subfigure[Saliency map for dot-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig4c.eps}}\quad
    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
  \caption{The saliency maps generated by different features and detection model. The first column shows the original images, the second column shows saliency maps generated by Gabor [32] with the LR model (Gabor + LR), the third column shows the saliency maps generated by HOG [33] with LR model (HOG + LR), the fourth column shows the saliency maps generated by TDVSM [38](GHOG + TDVSM), the fifth column shows the saliency maps generated by LSF-GSA [39](GHOG + LSF-GSA), and the last column shows the saliency maps generated by our method(GHOG + LR).}
\end{figure*}


From Figure 4 and Table 1, we can see that the proposed defection method based on GHOG and LR is suitable for pattern fabric defect detection.

In addition, we compared our method with some state of the art visual saliency models, including the wavelet transform (WT) method [40], the prior guided least squares regression method (PGLSR) [41], the textural differential visual saliency model (TDVSM) [38] and the local statistic features and global saliency analysis model (LSF-GSA) [39].

As is shown in Figure 5, WT [40] first transformed the image into a frequency domain, then generated the saliency map by analyzing the wavelet coefficient. However, even in a normal background with a complicated pattern, its wavelet coefficients are larger, which will lead to incorrect detection results. The PGLSR method [41] could effectively detect defects in the patterned fabric, but similarities in texture between the background and the defect lead to inaccurate shape descriptions of the defects. In Li et al. [38], saliency was calculated by comparing their textural features with the average texture features, it  obtains a successful performance for fabric images with a stochastic texture, while the method fails to detect defects in a patterned fabric image, especially in box-patterned fabrics, as shown in Figure.5(b). Liu et al. [39] detected fabric defects by using the local statistic feature and global saliency analysis, while the detection results have a large amount of noise. Our method generates a saliency map by combining the GHOG feature descriptor with a low-rank decomposition model, and it effectively highlights the defect regions. Subsequently, the detection results are obtained by segmenting the generated saliency map.
\begin{figure*}[htp]
\centering
\subfigure[Saliency map for star-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig5a.eps}}\quad
\subfigure[Saliency map for box-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig5b.eps}}\quad
\subfigure[Saliency map for dot-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig5c.eps}}\quad
    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
  \caption{The saliency maps of our method compared with other state-of-the-art saliency models. The first column shows the original images, the second column shows saliency maps generated by WT [40], the third column shows the saliency maps generated by PGLSR [41], the fourth column shows the saliency maps generated by TDVSM [38], the sixth column shows the saliency maps generated by LSF-GSA [39], and the last column shows the saliency maps generated by our method.}
\end{figure*}
In order to further verify the effectiveness of our proposed method, we compared our detection method with the existing fabric detection algorithm. Because most of the traditional detection methods are invalid for detecting patterned fabric defect, in this paper, we only compared the proposed method with the other two valid detection methods for detecting patterned fabrics. The experimental results are described in Figure 6, where the white pixels represent the defect regions, and the black pixels represent the background. The first row represents the detection results generated by PGLSR [41], the second row represents the detection results generated by LSF-GSA [39], the third row indicates the detection results generated by our method and the last row indicates the ground-truth images. In Figure 6, we can see that the other two methods (as shown in the first two rows) can almost localize the defect region, but the detected shape of the defect is different from the ground truth. Our detection results (as shown in the third row) are similar to the ground truth (as shown in the last row), can efficiently localize the defect regions, and the detected shape of the defect is similar to the ground truth. This demonstrates our proposed method is superior to the other two methods.
\begin{figure*}[htp]
\centering
\subfigure[Detection result for star-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig6a.eps}}\quad
\subfigure[Detection result for box-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig6b.eps}}\quad
\subfigure[Detection result for dot-patterned fabric image]{\includegraphics[width= 0.495\textwidth]{Fig6c.eps}}\quad
    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
  \caption{Detection results of our method compared with other fabric defect detection methods. The first row shows the detection results of PGLSR method, the second row shows the detection results of LSF-GSA method, the third row shows the detection results of our method, the last row shows the ground-truth images.}
\end{figure*}

\emph{B. Quantitative Evaluations}

In order to further evaluate the performance of our proposed method, the receiver operating characteristic curve (ROC) is adopted, as shown in Figure 7. Figure.7(a) shows the ROC curves of star-patterned fabric images, Figure.7(b) shows the ROC curves of box-patterned fabric images, and Figure.7(c) shows the ROC curves of dot-patterned fabric images. From Figure 7(a) and (b), we can see that our method outperforms the other three methods for star-patterned and box-patterned fabrics. This demonstrates the effectiveness of our proposed method. However, our proposed method is unsatisfactory regarding dot-patterned fabrics, as shown in Figure.7(c). The proposed GHOG feature is orientation-aware, while the orientation features of the dot-patterned fabric are indistinct; therefore, GHOG is not enough to characterize the dot-patterned fabric. In fact, for most of the fabric samples, they are weaved using warp and weft, and have distinct directions.

\begin{figure*}[htp]
\centering
\subfigure[Star-patterned ROC curves]{\includegraphics[width= 0.32\textwidth]{Fig7a.eps}}\quad
\subfigure[Box-patterned ROC curves]{\includegraphics[width= 0.32\textwidth]{Fig7b.eps}}\quad
\subfigure[Dot-patterned ROC curves]{\includegraphics[width= 0.32\textwidth]{Fig7c.eps}}\quad
    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
  \caption{ROC curves of patterned fabric images compared with other detection methods. (a) ROC curves of the Star-patterned fabric images. (b) ROC curves of the Box-patterned fabric images. (c) ROC curves of the Dot-patterned fabric images.}
\end{figure*}

In addition, some other statistical parameters, such as true positive (TP), true negative (TN), false positive (FP), false negative (FN), are adopted in this paper, originally proposed by Ng.et.al [42]. Based on these parameters, some measure metrics, such as precision, are calculated as:

\begin{equation}
precision = \frac{{TP}}{{TP + FP}}
\end{equation}

and recall is calculated as:

\begin{equation}
recall = \frac{{TP}}{{TP + FN}}
\end{equation}

As shown in Figure 8, we can see that the proposed approach not only provided the highest rate in recall but also provided a balanced performance with respect to precision. Figure 9 takes into account both recall and precision, and adopts the criteria of the F-measure. Additionally, it also demonstrates the effectiveness of our proposed method.

\begin{equation}
F = 2\frac{{precision \cdot recall}}{{precision + recall}}
\end{equation}

\begin{figure*}[htp]
\centering
\subfigure[Star-patterned PR curves]{\includegraphics[width= 0.32\textwidth]{Fig8a.eps}}\quad
\subfigure[Box-patterned PR curves]{\includegraphics[width= 0.32\textwidth]{Fig8b.eps}}\quad
\subfigure[Dot-patterned PR curves]{\includegraphics[width= 0.32\textwidth]{Fig8c.eps}}\quad
    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
  \caption{ROC curves of patterned fabric images compared with other detection methods. (a) ROC curves of star-patterned fabric images. (b) ROC curves of box-patterned fabric images. (c) ROC curves of dot-patterned fabric images.}
\end{figure*}

\begin{figure}[htp]
  \centering
  \includegraphics[width=0.48\textwidth]{Fig9.eps}\\
  \caption{The F-measure of our method compared with other methods.}
\end{figure}


%\begin{figure*}[ht]
%\centering
%    \subfigure[Original Lena]{\includegraphics[width= 0.3\textwidth]{Fig1.eps}}\quad
%   \subfigure[Amplitudes]{\includegraphics[width= 0.3\textwidth]{Fig2.eps}}\quad
%    \subfigure[Signs]{\includegraphics[width= 0.3\textwidth]{Fig1.eps}}
%    %\subfigure[Probability distribution function]{\includegraphics[width= 0.3\textwidth]{lena_haar_pdf.eps}}
%  \caption{The amplitudes (b) and signs (c) distribution of Lena image's third level DWT coefficients using Haar wavelet. Red points in (b) indicate large amplitude coefficients, and red points in (c) are positive coefficients.}\label{fig:sign-distribution}
%\end{figure*}

% An example of a floating figure using the graphicx package.
% Note that \label must occur AFTER (or within) \caption.
% For figures, \caption should occur after the \includegraphics.
% Note that IEEEtran v1.7 and later has special internal code that
% is designed to preserve the operation of \label within \caption
% even when the captionsoff option is in effect. However, because
% of issues like this, it may be the safest practice to put all your
% \label just after \caption rather than within \caption{}.
%
% Reminder: the "draftcls" or "draftclsnofoot", not "draft", class
% option should be used if it is desired that the figures are to be
% displayed while in draft mode.
%
%\begin{figure}[!t]
%\centering
%\includegraphics[width=2.5in]{myfigure}
% where an .eps filename suffix will be assumed under latex,
% and a .pdf suffix will be assumed for pdflatex; or what has been declared
% via \DeclareGraphicsExtensions.
%\caption{Simulation results for the network.}
%\label{fig_sim}
%\end{figure}

% Note that the IEEE typically puts floats only at the top, even when this
% results in a large percentage of a column being occupied by floats.


% An example of a double column floating figure using two subfigures.
% (The subfig.sty package must be loaded for this to work.)
% The subfigure \label commands are set within each subfloat command,
% and the \label for the overall figure must come after \caption.
% \hfil is used as a separator to get equal spacing.
% Watch out that the combined width of all the subfigures on a
% line do not exceed the text width or a line break will occur.
%
%\begin{figure*}[!t]
%\centering
%\subfloat[Case I]{\includegraphics[width=2.5in]{box}%
%\label{fig_first_case}}
%\hfil
%\subfloat[Case II]{\includegraphics[width=2.5in]{box}%
%\label{fig_second_case}}
%\caption{Simulation results for the network.}
%\label{fig_sim}
%\end{figure*}
%
% Note that often IEEE papers with subfigures do not employ subfigure
% captions (using the optional argument to \subfloat[]), but instead will
% reference/describe all of them (a), (b), etc., within the main caption.
% Be aware that for subfig.sty to generate the (a), (b), etc., subfigure
% labels, the optional argument to \subfloat must be present. If a
% subcaption is not desired, just leave its contents blank,
% e.g., \subfloat[].


% An example of a floating table. Note that, for IEEE style tables, the
% \caption command should come BEFORE the table and, given that table
% captions serve much like titles, are usually capitalized except for words
% such as a, an, and, as, at, but, by, for, in, nor, of, on, or, the, to
% and up, which are usually not capitalized unless they are the first or
% last word of the caption. Table text will default to \footnotesize as
% the IEEE normally uses this smaller font for tables.
% The \label must come after \caption as always.
%
%\begin{table}[!t]
%% increase table row spacing, adjust to taste
%\renewcommand{\arraystretch}{1.3}
% if using array.sty, it might be a good idea to tweak the value of
% \extrarowheight as needed to properly center the text within the cells
%\caption{An Example of a Table}
%\label{table_example}
%\centering
%% Some packages, such as MDW tools, offer better commands for making tables
%% than the plain LaTeX2e tabular which is used here.
%\begin{tabular}{|c||c|}
%\hline
%One & Two\\
%\hline
%Three & Four\\
%\hline
%\end{tabular}
%\end{table}


% Note that the IEEE does not put floats in the very first column
% - or typically anywhere on the first page for that matter. Also,
% in-text middle ("here") positioning is typically not used, but it
% is allowed and encouraged for Computer Society conferences (but
% not Computer Society journals). Most IEEE journals/conferences use
% top floats exclusively.
% Note that, LaTeX2e, unlike IEEE journals/conferences, places
% footnotes above bottom floats. This can be corrected via the
% \fnbelowfloat command of the stfloats package.




\section{Conclusion}
In this paper, we proposed a novel patterned fabric defect algorithm based on GHOG and low-rank decomposition. GHOG descriptor is adopted to extract the features of the patterned fabric image, and the proposed low-rank model is adopted to decompose the fabric image into normal background and defect, respectively. Experimental results demonstrate that the proposed method can efficiently and correctly locate the defect region, and show that our approach outperforms other state-of-the-art methods. In the future, additional theoretical development will be beneficial for defect detection in the glass surface, rail surface, etc.





% if have a single appendix:
%\appendix[Proof of the Zonklar Equations]
% or
%\appendix  % for no appendix heading
% do not use \section anymore after \appendix, only \section*
% is possibly needed

% use appendices with more than one appendix
% then use \section to start each appendix
% you must declare a \section before using any
% \subsection or using \label (\appendices by itself
% starts a section numbered zero.)
%


%\appendices
%\section{Proof of the First Zonklar Equation}
%Appendix one text goes here.
%
%% you can choose not to have a title for an appendix
%% if you want by leaving the argument blank
%\section{}
%Appendix two text goes here.


% use section* for acknowledgment
\section*{Acknowledgment}
This work was supported by the National Natural Science Foundation of China (No.61202499, No.61379113), Science and technology innovation talent project of Education Department of Henan Province(17HASTIT019), Science and technology leader project of Zhengzhou City(131PLJRC643). In addition, the authors would like to thank Dr. Henry Y.T. Ngan, Industrial Automation Research Laboratory, Dept. of Electrical and Electronic Engineering, The University of Hong Kong, for providing the database of patterned fabric images.




% Can use something like this to put references on a page
% by themselves when using endfloat and the captionsoff option.
\ifCLASSOPTIONcaptionsoff
  \newpage
\fi



% trigger a \newpage just before the given reference
% number - used to balance the columns on the last page
% adjust value as needed - may need to be readjusted if
% the document is modified later
%\IEEEtriggeratref{8}
% The "triggered" command can be changed if desired:
%\IEEEtriggercmd{\enlargethispage{-5in}}

% references section

% can use a bibliography generated by BibTeX as a .bbl file
% BibTeX documentation can be easily obtained at:
% http://mirror.ctan.org/biblio/bibtex/contrib/doc/
% The IEEEtran BibTeX style support page is at:
% http://www.michaelshell.org/tex/ieeetran/bibtex/
%\bibliographystyle{IEEEtran}
% argument is your BibTeX string definitions and bibliography database(s)
%\bibliography{IEEEabrv,../bib/paper}
%
% <OR> manually copy in the resultant .bbl file
% set second argument of \begin to the number of references
% (used to reserve space for the reference number labels box)
\begin{thebibliography}{1}
\bibitem{1}
Selver, M. A., Avsar, V., $\&$  $\ddot O$zdemir, H. (2014). Textural fabric defect detection using statistical texture transformations and gradient search. Journal of the Textile Institute, 105(9), 998-1007.
\bibitem{2}
Jing, J. (2015). Automatic defect detection of patterned fabric via combining the optimal gabor filter and golden image subtraction. Journal of Fiber Bioengineering $\&$ Informatics, 8, 229-239.
\bibitem{3}
Allili, M. S., Baaziz, N., $\&$ Mejri, M. (2014). Texture modeling using contourlets and finite mixtures of generalized gaussian distributions and applications. Multimedia IEEE Transactions on, 16(3), 772-784.
\bibitem{4}
Zhou, J., Semenovich, D., Sowmya, A., $\&$ Wang, J. (2014). Dictionary learning framework for fabric defect detection. Journal of the Textile Institute, 105(3), 223-234.
\bibitem{5}
Borji, A., $\&$ Itti, L. State-of-the-art in visual attention modeling. Pattern Analysis and Machine Intelligence, IEEE Transactions on,2013, 35(1), 185-207.
\bibitem{6}
Lang C, Liu G, Yu J, et al. Saliency detection by multitask sparsity pursuit [J]. Image Processing, IEEE Transactions on, 2012, 21(3): 1327-1338.
\bibitem{7}
Chen C, Li S, Qin H, et al. Structure-Sensitive Saliency Detection via Multilevel Rank Analysis in Intrinsic Feature Space[J]. Image Processing, IEEE Transactions on, 2015, 24(8): 2303-2316.
\bibitem{8}
Selver, M. A., Avsar, V., $\&$ $\ddot O$zdemir, H. Textural fabric defect detection using statistical texture transformations and gradient search [J]. Journal of Thoracic Oncology Official Publication of the International Association for the Study of Lung Cancer, 2014, 6(105):2017-2023.
\bibitem{9}
Hu J, He Z, Weng G, et al. Detection of chemical fabric defects on the basis of morphological processing [J]. Journal of the Textile Institute, 2015:1-9.
\bibitem{10}
Guan S, Shi H, Zhao T. Image segmentation of fabric defect based on object rarity feature [J].Textile Research Journal, 2015,36(11): 45-50.
\bibitem{11}
Hanmandlu M, Choudhury D, Dash S. Detection of defects in fabrics using topothesy fractal dimension features [J]. Signal, Image and Video Processing, 2015, 9(7): 1521-1530.
\bibitem{12}
Sakhare K, Kulkarni A, Kumbhakarn M, et al. Spectral and spatial domain approach for fabric defect detection and classification [C]//Industrial Instrumentation and Control (ICIC), 2015 International Conference on. IEEE, 2015: 640-644.
\bibitem{13}
Jing J, Chen S, Li P. Automatic Defect Detection of Patterned Fabric via Combining the Optimal Gabor Filter and Golden Image Subtraction [J]. Journal of Fiber Bioengineering and Informatics, 2015, 8(2): 229-239.
\bibitem{14}
Wen Z, Cao J, Liu X, et al. Fabric defects detection using adaptive wavelets [J]. International Journal of Clothing Science and Technology, 2014, 26(3): 202-211.
\bibitem{15}
Xiaobo Y. Fabric defect detection of statistic aberration feature based on GMRF model [J]. Journal of Textile Research, 2013, 4: 026.
\bibitem{16}
Li M, Cui S, Xie Z. Application of Gaussian mixture model on defect detection of print fabric [J]. Journal of Textile Research, 2015, 8: 019.
\bibitem{17}
Allili M S, Baaziz N, Mejri M. Texture modeling using contourlets and finite mixtures of generalized Gaussian distributions and applications [J]. Multimedia, IEEE Transactions on, 2014, 16(3): 772-784.
\bibitem{18}
Zhou J, Wang J. Fabric defect detection using adaptive dictionaries [J]. Textile Research Journal, 2013.
\bibitem{19}
Qu T, Zou L, Zhang Q, et al. Defect detection on the fabric with complex texture via dual-scale over-complete dictionary [J]. The Journal of The Textile Institute, 2015: 1-14.
\bibitem{20}
Zhou J, Semenovich D, Sowmya A, et al. Dictionary learning framework for fabric defect detection [J]. The Journal of The Textile Institute, 2014, 105(3): 223-234.
\bibitem{21}
Ngan H Y T, Pang G K H, Yung S P, et al. Wavelet based methods on patterned fabric defect detection [J]. Pattern recognition, 2005, 38(4): 559-576.
\bibitem{22}
Ngan H Y T, Pang G K H. Novel method for patterned fabric inspection using Bollinger bands [J]. Optical Engineering, 2006, 45(8): 087202-087202-15.
\bibitem{23}
Ngan H Y T, Pang G K H. Regularity analysis for patterned texture inspection [J]. Automation Science and Engineering, IEEE Transactions on, 2009, 6(1): 131-144.
\bibitem{24}
G. Stubl, J.-L. Bouchot, P. Haslinger, B. Moser, Discrepancy norm as fitness function for defect detection on regularly textured surfaces, LNCS 7476 (2012) 428-437.
\bibitem{25}
Costa M F M, Rodrigues F, Guedes J, et al. Automated evaluation of patterned fabrics for defect detection [C]//Education and Training in Optics and Photonics (ETOP'99). International Society for Optics and Photonics, 2000: 403-407.
\bibitem{26}
Sanby C, Norton-Wayne L, Harwood R. The automated inspection of lace using machine vision [J]. Mechatronics, 1995, 5(2): 215-231.
\bibitem{27}
Farooq U, King T, Gaskell P H, et al. Machine vision using image data feedback for fault detection in complex deformable webs [J]. Transactions of the Institute of Measurement and Control, 2004, 26(2): 119-137.
\bibitem{28}
Cano J, Perez J C, Valiente J M, et al. Textile inspection with a parallel computer cluster [C]//5th Int. Conf. Quality Control by Artificial Vision (QCAV-2001), Le Creusot, France. 2001.
\bibitem{29}
Baykal I C, Muscedere R, Jullien G A. On the use of hash functions for defect detection in textures for in-camera web inspection systems [C]//Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on. IEEE, 2002, 5: V-665-V-668 vol. 5.
\bibitem{30}
Chetverikov D, Hanbury A. Finding defects in texture using regularity and local orientation [J]. Pattern Recognition, 2002, 35(10): 2165-2180.
\bibitem{31}
Tsang C S C, Ngan H Y T, Pang G K H. Fabric inspection based on the Elo rating method [J]. Pattern Recognition, 2016, 51: 378-394.
\bibitem{32}
Kruizinga P, Petkov N, Grigorescu S E. Comparison of Texture Features Based on Gabor Filters [J]. IEEE Transactions on Image Processing, 1999, 11(10):142-147.
\bibitem{33}
Dalal N, Triggs B. Triggs, B.: Histograms of Oriented Gradients for Human Detection. In: CVPR [J]. Proceedings / CVPR, IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, 1(12):886-893 vol. 1.
\bibitem{34}
Fazel M, Hindi H, Boyd S P. Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices [C]//American Control Conference, 2003. Proceedings of the 2003. IEEE, 2003, 3: 2156-2162.
\bibitem{35}
Dong W, Shi G, Li X, et al. Compressive sensing via nonlocal low-rank regularization [J]. Image Processing, IEEE Transactions on, 2014, 23(8): 3618-3632.
\bibitem{36}
Tibshirani R. Regression shrinkage and selection via the lasso [J]. Journal of the Royal Statistical Society. Series B (Methodological), 1996: 267-288.
\bibitem{37}
Zhoufeng L, Jiuge W, Quanjun Z, et al. Research on fabric defect detection algorithm based on improved adaptive threshold [J]. Microcomputer $\&$ Its Applications, 2013, 10: 016.
\bibitem{38}
LI C, ZHANG Z, LIU Z, et al. A novel fabric defect detection algorithm based on textural differential visual saliency model [J]. Journal of Shandong University (Engineering Science), 2014, 44(4): 1-9.
\bibitem{39}
LIU Z, ZHAO Q, LI C, et al. Fabric defect detection algorithm using local statistic features and global saliency analysis [J]. Journal of Textile Research, 2014, 11: 013.
\bibitem{40}
Imamo glu N, Lin W, Fang Y. A saliency detection model using low-level features based on wavelet transform [J]. Multimedia, IEEE Transactions on, 2013, 15(1): 96-105.
\bibitem{41}
Cao J, Zhang J, Wen Z, et al. Fabric defect inspection using prior knowledge guided least squares regression [J]. Multimedia Tools and Applications, 2015: 1-17.
\bibitem{42}
Ng M K, Ngan H Y T, Yuan X, et al. Patterned Fabric Inspection and Visualization by the Method of Image Decomposition[J]. IEEE Transactions on Automation Science $\&$ Engineering, 2014, 11(3):943-947.
\end{thebibliography}



% biography section
%
% If you have an EPS/PDF photo (graphicx package needed) extra braces are
% needed around the contents of the optional argument to biography to prevent
% the LaTeX parser from getting confused when it sees the complicated
% \includegraphics command within an optional argument. (You could create
% your own custom macro containing the \includegraphics command to make things
% simpler here.)
%\begin{IEEEbiography}[{\includegraphics[width=1in,height=1.25in,clip,keepaspectratio]{mshell}}]{Michael Shell}
% or if you just want to reserve a space for a photo:

%\begin{IEEEbiography}{Michael Shell}
%Biography text here.
%\end{IEEEbiography}
%
%% if you will not have a photo at all:
%\begin{IEEEbiographynophoto}{John Doe}
%Biography text here.
%\end{IEEEbiographynophoto}
%
%% insert where needed to balance the two columns on the last page with
%% biographies
%%\newpage
%
%\begin{IEEEbiographynophoto}{Jane Doe}
%Biography text here.
%\end{IEEEbiographynophoto}

% You can push biographies down or up by placing
% a \vfill before or after them. The appropriate
% use of \vfill depends on what kind of text is
% on the last page and whether or not the columns
% are being equalized.

%\vfill

% Can be used to pull up biographies so that the bottom of the last one
% is flush with the other column.
%\enlargethispage{-5in}



% that's all folks
\end{document}



1702.05555.extracted_bib
{1 Selver, M. A., Avsar, V., $\&$ $\ddot O$zdemir, H. (2014). Textural fabric defect detection using statistical texture transformations and gradient search. Journal of the Textile Institute, 105(9), 998-1007.
1702.05555.extracted_bib
{2 Jing, J. (2015). Automatic defect detection of patterned fabric via combining the optimal gabor filter and golden image subtraction. Journal of Fiber Bioengineering $\&$ Informatics, 8, 229-239.
1702.05555.extracted_bib
{3 Allili, M. S., Baaziz, N., $\&$ Mejri, M. (2014). Texture modeling using contourlets and finite mixtures of generalized gaussian distributions and applications. Multimedia IEEE Transactions on, 16(3), 772-784.
1702.05555.extracted_bib
{4 Zhou, J., Semenovich, D., Sowmya, A., $\&$ Wang, J. (2014). Dictionary learning framework for fabric defect detection. Journal of the Textile Institute, 105(3), 223-234.
1702.05555.extracted_bib
{5 Borji, A., $\&$ Itti, L. State-of-the-art in visual attention modeling. Pattern Analysis and Machine Intelligence, IEEE Transactions on,2013, 35(1), 185-207.
1702.05555.extracted_bib
{6 Lang C, Liu G, Yu J, et al. Saliency detection by multitask sparsity pursuit [J]. Image Processing, IEEE Transactions on, 2012, 21(3): 1327-1338.
1702.05555.extracted_bib
{7 Chen C, Li S, Qin H, et al. Structure-Sensitive Saliency Detection via Multilevel Rank Analysis in Intrinsic Feature Space[J]. Image Processing, IEEE Transactions on, 2015, 24(8): 2303-2316.
1702.05555.extracted_bib
{8 Selver, M. A., Avsar, V., $\&$ $\ddot O$zdemir, H. Textural fabric defect detection using statistical texture transformations and gradient search [J]. Journal of Thoracic Oncology Official Publication of the International Association for the Study of Lung Cancer, 2014, 6(105):2017-2023.
1702.05555.extracted_bib
{9 Hu J, He Z, Weng G, et al. Detection of chemical fabric defects on the basis of morphological processing [J]. Journal of the Textile Institute, 2015:1-9.
1702.05555.extracted_bib
{10 Guan S, Shi H, Zhao T. Image segmentation of fabric defect based on object rarity feature [J].Textile Research Journal, 2015,36(11): 45-50.
1702.05555.extracted_bib
{11 Hanmandlu M, Choudhury D, Dash S. Detection of defects in fabrics using topothesy fractal dimension features [J]. Signal, Image and Video Processing, 2015, 9(7): 1521-1530.
1702.05555.extracted_bib
{12 Sakhare K, Kulkarni A, Kumbhakarn M, et al. Spectral and spatial domain approach for fabric defect detection and classification [C]//Industrial Instrumentation and Control (ICIC), 2015 International Conference on. IEEE, 2015: 640-644.
1702.05555.extracted_bib
{13 Jing J, Chen S, Li P. Automatic Defect Detection of Patterned Fabric via Combining the Optimal Gabor Filter and Golden Image Subtraction [J]. Journal of Fiber Bioengineering and Informatics, 2015, 8(2): 229-239.
1702.05555.extracted_bib
{14 Wen Z, Cao J, Liu X, et al. Fabric defects detection using adaptive wavelets [J]. International Journal of Clothing Science and Technology, 2014, 26(3): 202-211.
1702.05555.extracted_bib
{15 Xiaobo Y. Fabric defect detection of statistic aberration feature based on GMRF model [J]. Journal of Textile Research, 2013, 4: 026.
1702.05555.extracted_bib
{16 Li M, Cui S, Xie Z. Application of Gaussian mixture model on defect detection of print fabric [J]. Journal of Textile Research, 2015, 8: 019.
1702.05555.extracted_bib
{17 Allili M S, Baaziz N, Mejri M. Texture modeling using contourlets and finite mixtures of generalized Gaussian distributions and applications [J]. Multimedia, IEEE Transactions on, 2014, 16(3): 772-784.
1702.05555.extracted_bib
{18 Zhou J, Wang J. Fabric defect detection using adaptive dictionaries [J]. Textile Research Journal, 2013.
1702.05555.extracted_bib
{19 Qu T, Zou L, Zhang Q, et al. Defect detection on the fabric with complex texture via dual-scale over-complete dictionary [J]. The Journal of The Textile Institute, 2015: 1-14.
1702.05555.extracted_bib
{20 Zhou J, Semenovich D, Sowmya A, et al. Dictionary learning framework for fabric defect detection [J]. The Journal of The Textile Institute, 2014, 105(3): 223-234.
1702.05555.extracted_bib
{21 Ngan H Y T, Pang G K H, Yung S P, et al. Wavelet based methods on patterned fabric defect detection [J]. Pattern recognition, 2005, 38(4): 559-576.
1702.05555.extracted_bib
{22 Ngan H Y T, Pang G K H. Novel method for patterned fabric inspection using Bollinger bands [J]. Optical Engineering, 2006, 45(8): 087202-087202-15.
1702.05555.extracted_bib
{23 Ngan H Y T, Pang G K H. Regularity analysis for patterned texture inspection [J]. Automation Science and Engineering, IEEE Transactions on, 2009, 6(1): 131-144.
1702.05555.extracted_bib
{24 G. Stubl, J.-L. Bouchot, P. Haslinger, B. Moser, Discrepancy norm as fitness function for defect detection on regularly textured surfaces, LNCS 7476 (2012) 428-437.
1702.05555.extracted_bib
{25 Costa M F M, Rodrigues F, Guedes J, et al. Automated evaluation of patterned fabrics for defect detection [C]//Education and Training in Optics and Photonics (ETOP'99). International Society for Optics and Photonics, 2000: 403-407.
1702.05555.extracted_bib
{26 Sanby C, Norton-Wayne L, Harwood R. The automated inspection of lace using machine vision [J]. Mechatronics, 1995, 5(2): 215-231.
1702.05555.extracted_bib
{27 Farooq U, King T, Gaskell P H, et al. Machine vision using image data feedback for fault detection in complex deformable webs [J]. Transactions of the Institute of Measurement and Control, 2004, 26(2): 119-137.
1702.05555.extracted_bib
{28 Cano J, Perez J C, Valiente J M, et al. Textile inspection with a parallel computer cluster [C]//5th Int. Conf. Quality Control by Artificial Vision (QCAV-2001), Le Creusot, France. 2001.
1702.05555.extracted_bib
{29 Baykal I C, Muscedere R, Jullien G A. On the use of hash functions for defect detection in textures for in-camera web inspection systems [C]//Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on. IEEE, 2002, 5: V-665-V-668 vol. 5.
1702.05555.extracted_bib
{30 Chetverikov D, Hanbury A. Finding defects in texture using regularity and local orientation [J]. Pattern Recognition, 2002, 35(10): 2165-2180.
1702.05555.extracted_bib
{31 Tsang C S C, Ngan H Y T, Pang G K H. Fabric inspection based on the Elo rating method [J]. Pattern Recognition, 2016, 51: 378-394.
1702.05555.extracted_bib
{32 Kruizinga P, Petkov N, Grigorescu S E. Comparison of Texture Features Based on Gabor Filters [J]. IEEE Transactions on Image Processing, 1999, 11(10):142-147.
1702.05555.extracted_bib
{33 Dalal N, Triggs B. Triggs, B.: Histograms of Oriented Gradients for Human Detection. In: CVPR [J]. Proceedings / CVPR, IEEE Computer Society Conference on Computer Vision and Pattern Recognition. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2005, 1(12):886-893 vol. 1.
1702.05555.extracted_bib
{34 Fazel M, Hindi H, Boyd S P. Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices [C]//American Control Conference, 2003. Proceedings of the 2003. IEEE, 2003, 3: 2156-2162.
1702.05555.extracted_bib
{35 Dong W, Shi G, Li X, et al. Compressive sensing via nonlocal low-rank regularization [J]. Image Processing, IEEE Transactions on, 2014, 23(8): 3618-3632.
1702.05555.extracted_bib
{36 Tibshirani R. Regression shrinkage and selection via the lasso [J]. Journal of the Royal Statistical Society. Series B (Methodological), 1996: 267-288.
1702.05555.extracted_bib
{37 Zhoufeng L, Jiuge W, Quanjun Z, et al. Research on fabric defect detection algorithm based on improved adaptive threshold [J]. Microcomputer $\&$ Its Applications, 2013, 10: 016.
1702.05555.extracted_bib
{38 LI C, ZHANG Z, LIU Z, et al. A novel fabric defect detection algorithm based on textural differential visual saliency model [J]. Journal of Shandong University (Engineering Science), 2014, 44(4): 1-9.
1702.05555.extracted_bib
{39 LIU Z, ZHAO Q, LI C, et al. Fabric defect detection algorithm using local statistic features and global saliency analysis [J]. Journal of Textile Research, 2014, 11: 013.
1702.05555.extracted_bib
{40 Imamo glu N, Lin W, Fang Y. A saliency detection model using low-level features based on wavelet transform [J]. Multimedia, IEEE Transactions on, 2013, 15(1): 96-105.
1702.05555.extracted_bib
{41 Cao J, Zhang J, Wen Z, et al. Fabric defect inspection using prior knowledge guided least squares regression [J]. Multimedia Tools and Applications, 2015: 1-17.
1702.05555.extracted_bib
{42 Ng M K, Ngan H Y T, Yuan X, et al. Patterned Fabric Inspection and Visualization by the Method of Image Decomposition[J]. IEEE Transactions on Automation Science $\&$ Engineering, 2014, 11(3):943-947.