In our computers all stored images are in JPEG compressed format even when we download an image from the internet that is also in JPEG compressed format, so it is very essential that we should have content based image indexing its retrieval conducted directly in the compressed domain. In this paper we used a partial decoding algorithm for all the JPEG compressed images to index the images directly in the JPEG compressed domain. We also compare the performance of the approaches in DCT domain and the original images in the pixel domain. This technology will prove preciously in those applications where fast image key generation is required. Image and audio techniques are very important in the multimedia applications. In this paper, we comprise...
The locally-dependent compression rate of images tells us about the image complexity. This can be us...
Development of various multimedia applications hinges on the availability of fast and efficient stor...
xii, 139 leaves : ill. (some col.) ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M EIE 2005 AuVisu...
Given an image with N blocks of 8x8 pixels, we construct an indexing key by overlapping the N blocks...
We propose a new method of feature extraction in orderto improve the effective of image retrieving b...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
Digital images are useful media for storing spatial, spectral and temporal components of information...
We propose a new simple method of DC feature extraction that enables to speed up and decrease storag...
In this paper we introduce a low complexity and accurate technique for target image search and retri...
Fast content access and content based retrieval of images are among the common web and signal proces...
Given a broad scope, we aim at the analysis of image content in the compressed domain and compare wi...
This paper is concerned with the indexing and retrieval of images based on features extracted direct...
The locally-dependent compression rate of images tells us about the image complexity. This can be us...
Development of various multimedia applications hinges on the availability of fast and efficient stor...
xii, 139 leaves : ill. (some col.) ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M EIE 2005 AuVisu...
Given an image with N blocks of 8x8 pixels, we construct an indexing key by overlapping the N blocks...
We propose a new method of feature extraction in orderto improve the effective of image retrieving b...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
International audienceThis paper approaches the problem of efficient content-based image retrieval, ...
Digital images are useful media for storing spatial, spectral and temporal components of information...
We propose a new simple method of DC feature extraction that enables to speed up and decrease storag...
In this paper we introduce a low complexity and accurate technique for target image search and retri...
Fast content access and content based retrieval of images are among the common web and signal proces...
Given a broad scope, we aim at the analysis of image content in the compressed domain and compare wi...
This paper is concerned with the indexing and retrieval of images based on features extracted direct...
The locally-dependent compression rate of images tells us about the image complexity. This can be us...
Development of various multimedia applications hinges on the availability of fast and efficient stor...
xii, 139 leaves : ill. (some col.) ; 30 cm.PolyU Library Call No.: [THS] LG51 .H577M EIE 2005 AuVisu...