Elsevier

Theoretical Computer Science

Volume 647, 27 September 2016, Pages 74-84
Theoretical Computer Science

Indexing and querying color sets of images

https://doi.org/10.1016/j.tcs.2016.07.041Get rights and content
Under an Elsevier user license
open archive

Abstract

We aim to study the set of color sets of continuous regions of an image given as a matrix of m rows over nm columns where each element in the matrix is an integer from [1,σ] named a color. The set of distinct colors in a region is called fingerprint. We aim to compute, index and query the fingerprints of all rectangular regions named rectangles. The set of all such fingerprints is denoted by F. A rectangle is maximal if it is not contained in a greater rectangle with the same fingerprint. The set of all locations of maximal rectangles is denoted by L. We first explain how to determine all the |L| maximal locations with their fingerprints in expected time O(nm2σ) using a Monte Carlo algorithm (with polynomially small probability of error) or within deterministic O(nm2σlog(|L|nm2+2)) time. We then show how to build a data structure which occupies O(nmlogn+|L|) space such that a query which asks for all the maximal locations with a given fingerprint f can be answered in time O(|f|+loglogn+k), where k is the number of maximal locations with fingerprint f. If the query asks only for the presence of the fingerprint, then the space usage becomes O(nmlogn+|F|) while the query time becomes O(|f|+loglogn). We eventually consider the special case of squared regions (squares).

Keywords

Image algorithms
Text algorithms
Fingerprint
Set of characters
Set of colors
Maximal locations

Cited by (0)