DCT-domain image retrieval via block-edge-patterns

Qiu, KJ, Jiang, J, Xiao, G and Irianto, SY (2006) DCT-domain image retrieval via block-edge-patterns Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4141 L. pp. 673-684.

Full text not available from this repository.

Abstract

A new algorithm for compressed image retrieval is proposed in this paper based on DCT block edge patterns. This algorithm directly extract three edge patterns from compressed image data to construct an edge pattern histogram as an indexing key to retrieve images based on their content features. Three feature-based indexing keys are described, which include: (i) the first two features are represented by 3-D and 4-D histograms respectively; and (ii) the third feature is constructed by following the spirit of run-length coding, which is performed on consecutive horizontal and vertical edges. To test and evaluate the proposed algorithms, we carried out two-stage experiments. The results show that our proposed methods are robust to color changes and varied noise. In comparison with existing representative techniques, the proposed algorithms achieves superior performances in terms of retrieval precision and processing speed. © Springer-Verlag Berlin Heidelberg 2006.

Item Type:	Article
Authors :	Name Email ORCID Qiu, KJ Jiang, J jianmin.jiang@surrey.ac.uk Xiao, G Irianto, SY
Date :	1 January 2006
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 12:24
Last Modified :	17 May 2017 15:03
URI:	http://epubs.surrey.ac.uk/id/eprint/835218

Actions (login required)

View Item

Downloads