Finding unknown repeated patterns in images

We consider the problem of finding unknown patterns that appear multiple times in a digital image. We want to find the number of repetitions and their positions in the image without constraining the nature and shape of the pattern in any way. We propose a method that is able to pinpoint the possible locations of the repetitions by exploring the connection between image compression and image complexity. The method uses a finite-context model to build a complexity map of the image in which the repeated patterns correspond to areas of low complexity, which mark the locations of the repetitions.

[1]  Armando J. Pinho,et al.  Progressive lossless compression of medical images , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[2]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[3]  Paolo Ferragina,et al.  Text Compression , 2009, Encyclopedia of Database Systems.

[4]  Goren Gordon.  Multi-dimensional Linguistic Complexity , 2003, Journal of biomolecular structure & dynamics.

[5]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[6]  Bin Ma,et al.  The similarity metric , 2001, IEEE Transactions on Information Theory.

[7]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..

[8]  Armando J. Pinho,et al.  Lossless Compression of Microarray Images Using Image-Dependent Finite-Context Models , 2009, IEEE Transactions on Medical Imaging.

[9]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[10]  Armando J. Pinho,et al.  Lossy-to-Lossless Compression of Images Based on Binary Tree Decomposition , 2006, 2006 International Conference on Image Processing.

[11]  Douglas R. Heisterkamp,et al.  Content-based image retrieval with the normalized information distance , 2008, Comput. Vis. Image Underst..

[12]  Joel Max,et al.  Quantizing for minimum distortion , 1960, IRE Trans. Inf. Theory.

[13]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[14]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[15]  C. S. Wallace,et al.  An Information Measure for Classification , 1968, Comput. J..

[16]  Mihai Datcu,et al.  Complexity Based Image Artifact Detection , 2008, Data Compression Conference (dcc 2008).

[17]  Paul M. B. Vitányi,et al.  Clustering by compression , 2003, IEEE Transactions on Information Theory.

[18]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[19]  António J. R. Neves,et al.  L-INFINITY PROGRESSIVE IMAGE COMPRESSION , 2007 .

[20]  Trevor I. Dix,et al.  Comparative analysis of long DNA sequences by per element information content using different contexts , 2007, BMC Bioinformatics.

[21]  Nicholas Tran.  The normalized compression distance and image distinguishability , 2007, Electronic Imaging.

[22]  Michael W. Marcellin,et al.  JPEG2000 - image compression fundamentals, standards and practice , 2013, The Kluwer international series in engineering and computer science.

[23]  Guillermo Sapiro,et al.  The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS , 2000, IEEE Trans. Image Process..

[24]  Péter Gács,et al.  Information Distance , 1998, IEEE Trans. Inf. Theory.