Repository logo
 

Three new methods for color and texture based image matching in Content-Based Image Retrieval

dc.contributor.authorHE, DAAN
dc.contributor.copyright-releaseNot Applicableen_US
dc.contributor.degreeDoctor of Philosophyen_US
dc.contributor.departmentFaculty of Computer Scienceen_US
dc.contributor.ethics-approvalNot Applicableen_US
dc.contributor.external-examinerAndrew K.C. Wongen_US
dc.contributor.graduate-coordinatorMalcom Heywooden_US
dc.contributor.manuscriptsNot Applicableen_US
dc.contributor.thesis-readerNorm Scrimgeren_US
dc.contributor.thesis-readerQigang Gaoen_US
dc.contributor.thesis-readerChristian Blouinen_US
dc.contributor.thesis-supervisorNick Cerconeen_US
dc.date.accessioned2010-05-03T15:23:55Z
dc.date.available2010-05-03T15:23:55Z
dc.date.defence2010-04-22
dc.date.issued2010-05-03T15:23:55Z
dc.description.abstractImage matching is an important and necessary process in Content-Based Image Retrieval (CBIR). We propose three new methods for image matching: the first one is based on the Local Triplet Pattern (LTP) histograms; the second one is based on the Gaussian Mixture Models (GMMs) estimated by using the Extended Mass-constraint (EMass) algorithm; and the third one is called the DCT2KL algorithm. First, the LTP histograms are proposed to capture spatial relationships between color levels of neighboring pixels. An LTP level is extracted from each 3x3 pixel block, which is a unique number describing the color level relationship between a pixel and its neighboring pixels. Second, we consider how to represent and compare multi-dimensional color features using GMMs. GMMs are alternative methods to histograms for representing data distributions. GMMs address the high-dimensional problems from which histograms usually suffer inefficiency. In order to avoid local maxima problems in most GMM estimation algorithms, we apply the deterministic annealing method to estimate GMMs. Third, motivated by image compression algorithms, the DCT2KL method addresses the high dimensional data by using the Discrete Cosine Transform (DCT) coefficients in the YCbCr color space. The DCT coefficients are restored by partially decoding JPEG images. Assume that each DCT coefficient sequence is emitted from a memoryless source, and all these sources are independent of each other. For each target image we form a hypothesis that its DCT coefficient sequences are emitted from the same sources as the corresponding sequences in the query image. Testing these hypotheses by measuring the log-likelihoods leads to a simple yet efficient scheme that ranks each target image according to the Kullback-Leibler (KL) divergence between the empirical distribution of the DCT coefficient sequences in the query image and that in the target image. Finally we present a scheme to combine different features and methods to boost the performance of image retrieval. Experimental results on different image data sets show that these three methods proposed above outperform the related works in literature, and the combination scheme further improves the retrieval performance.en_US
dc.identifier.urihttp://hdl.handle.net/10222/12817
dc.language.isoenen_US
dc.subjectImage matchingen_US
dc.subject, Content-Based Image Retrievalen_US
dc.subjectColoren_US
dc.subjectTextureen_US
dc.titleThree new methods for color and texture based image matching in Content-Based Image Retrievalen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
thesis_daan_pdfa.pdf
Size:
2.94 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.77 KB
Format:
Item-specific license agreed upon to submission
Description: