Lattice-based patterned fabric inspection by using total variation with sparsity and low-rank representations

Michael K. Ng, Henry Y. T. Ngan, Xiaoming Yuan, Wenxing Zhang

Research output: Contribution to journalJournal articlepeer-review

9 Citations (Scopus)
28 Downloads (Pure)


In this paper, we study an image decomposition model for patterned fabric inspection. It is important to represent fabric patterns effectively so that fabric defects can be separated. One concern is that both patterned fabric (e.g., star- or box-patterned fabrics) and fabric defects contain mainly low frequency components. The main idea of this paper is to use the convolution of a lattice with a Dirac comb to characterize a patterned fabric image so that its repetitive components can be effectively represented in the image decomposition model. We formulate a model with total variation, sparsity, and low-rank terms for patterned fabric inspection. The total variation term is used to regularize the defective image, and the sparsity and the low-rank terms are employed to control the Dirac comb function. The proposed model can be solved efficiently via a convex programming solver. Our experimental results for different types of patterned fabrics show that the proposed model can inspect defects at a higher accuracy compared with some classical methods in the literature.

Original languageEnglish
Pages (from-to)2140-2164
Number of pages25
JournalSIAM Journal on Imaging Sciences
Issue number4
Publication statusPublished - 21 Nov 2017

Scopus Subject Areas

  • Mathematics(all)
  • Applied Mathematics

User-Defined Keywords

  • Convex programming
  • Lattice
  • Low-rank
  • Motif
  • Patterned fabric inspection
  • Sparsity


Dive into the research topics of 'Lattice-based patterned fabric inspection by using total variation with sparsity and low-rank representations'. Together they form a unique fingerprint.

Cite this