Direct content access and extraction from JPEG compressed images

In this paper, we propose a novel design of content access and extraction algorithm for compressed image browsing and indexing, which is critical for all visual information systems. By analyzing the relationship between DCT coefficients of one block of 8×8 pixels and its four sub-blocks of 4×4 pixels, the proposed algorithm extract an approximated image with smaller size for indexing and content browsing without incurring full decompression. While the computing cost is significantly lower than full decompression, the approximated image also reserves the content features, which are sufficient for indexing and browsing as evidenced by our extensive experiments.     

基于DCT压缩的JPEG图像的快速检索

提出了一种基于离散余弦变换(DCT)压缩的JPEC图像的检索方法。该方法利用JPEG图像数据在DCT压缩域的特性,直接提取特征,而且只需要对JPEC进行部分熵解码。在加速了图像检索的过程的同时也保证了检索结果的精确性,并且具有一定的鲁棒性。     

Image indexing and retrieval based on vector quantization

To effectively utilize information stored in a digital image library, effective image indexing and retrieval techniques are essential. This paper proposes an image indexing and retrieval technique based on the compressed image data using vector quantization (VQ). By harnessing the characteristics of VQ, the proposed technique is able to capture the spatial relationships of pixels when indexing the image. Experimental results illustrate the robustness of the proposed technique and also show that its retrieval performance is higher compared with existing color-based techniques.     

Color indexing for efficient image retrieval

Content based image retrieval is an active area of research. Many approaches have been proposed to retrieve images based on matching of some features derived from the image content. Color is an important feature of image content. The problem with many traditional matching-based retrieval methods is that the search time for retrieving similar images for a given query image increases linearly with the size of the image database. We present an efficient color indexing scheme for similarity-based retrieval which has a search time that increases logarithmically with the database size.In our approach, the color features are extracted automatically using a color clustering algorithm. Then the cluster centroids are used as representatives of the images in 3-dimensional color space and are indexed using a spatial indexing method that usesR-tree. The worst case search time complexity of this approach isOn _q log(N^* n_avg)), whereN is the number of images in the database, andn _q andn _avg are the number of colors in the query image and the average number of colors per image in the database respectively. We present the experimental results for the proposed approach on two databases consisting of 337 Trademark images and 200 Flag images.     

JPEG compressed image retrieval via statistical features

To improve efficiency of compressed image retrieval, we propose a novel statistical feature extraction algorithm in this paper to characterize the image content directly in its compressed domain. The statistical feature extracted is mainly through computing a set of moments directly from DCT coefficients without involving full decompression or inverse DCT. Following the algorithm design, a content-based image retrieval system is implemented especially targeting retrieving joint picture expert group compressed images. Theoretical analysis and experimental results support that the system is robust to translation, rotation and scale transform with minor disturbance, and the system achieves good performances in terms of retrieval efficiency and effectiveness.     

基于压缩域显著点的图像检索方法

给出了基于DCT压缩域显著点的快速图像检索方法,该方法直接利用少量DCT非零系数快速计算图像显著点,不需要完全解压缩,降低了计算复杂度,并且具有较强的鲁棒性。实验结果表明,基于显著点提取的图像特征表征能力强,适于图像检索。     

一种云环境下JPEG图像的安全检索方法

为了保护数据隐私,私密图像在上传到云服务器之前需要进行加密,然而,加密会导致传统的图像特征无法提取,进而给图像检索带来困难。因此,本文提出了一种云环境下JPEG图像的安全检索方法：数据拥有者部分解码JPEG码流得到图像的DCT(Discrete Cosine Transform)系数,对系数进行置乱加密然后生成密文图像并上传到云服务器;然后云服务器在图像密文上提取DC系数差分特征以及LBP(Local Binary Patterns)特征,通过比较图像的特征向量之间的距离来确定图像的相似度,最后返回相似图像。该方法不仅减少了计算复杂度,而且使得数据拥有者与云服务器之间的交互次数尽可能的减少,同时,保证了图像的机密性和检索精确度,能实现对JPEG图像安全高效的检索。最后基于本文提出的方法做了简单的仿真系统,进一步验证了该方法的有效性。     

DCT域图像边缘的快速提取

压缩域的图像分析处理技术已成为多媒体研究领域的一个热点。文中给出了DCT压缩域图像边缘的快速检测方法。该方法直接利用DCT非零系数计算图像边缘点,不需要完全解压缩,与传统象素域边缘检测方法相比,大大降低了计算复杂度,并且能根据需要提取不同精度的边缘图像。该方法在远程目标识别或基于边缘的Web图像检索等方面将能满足一定的实时性要求,具有较好的实用价值。针对JPEG图像,给出了边缘提取的实验结果,并与传统的象素域边缘检测方法进行了比较。     

基于统计特征的DCT压缩域纹理图像检索方法

提出了一种基于离散余弦变换（Discrete Cosine Transfrom,DCT）的纹理图像的检索方法.该方法在DCT压缩域,通过直接对DCT系数计算,获得图像纹理的统计特征,并作为检索的依据.理论分析和实验结果都表明,该方法具有很好的检索准确率和效率,并且对于旋转具有不变性.     

Exploring statistical correlations for image retrieval

Bridging the cognitive gap in image retrieval has been an active research direction in recent years, of which a key challenge is to get enough training data to learn the mapping functions from low-level feature spaces to high-level semantics. In this paper, image regions are classified into two types: key regions representing the main semantic contents and environmental regions representing the contexts. We attempt to leverage the correlations between types of regions to improve the performance of image retrieval. A Context Expansion approach is explored to take advantages of such correlations by expanding the key regions of the queries using highly correlated environmental regions according to an image thesaurus. The thesaurus serves as both a mapping function between image low-level features and concepts and a store of the statistical correlations between different concepts. It is constructed through a data-driven approach which uses Web data (images, their surrounding textual annotations) as training data source to learn the region concepts and to explore the statistical correlations. Experimental results on a database of 10,000 general-purpose images show the effectiveness of our proposed approach in both improving search precision (i.e. filter irrelevant images) and recall (i.e. retrieval relevant images whose context may be varied). Several major factors which have impact on the performance of our approach are also studied.     

Texture image retrieval using adaptive tetrolet transforms

This paper proposes a novel technique for texture image retrieval based on tetrolet transforms. Tetrolets provide fine texture information due to its different way of analysis. Tetrominoes are applied at each decomposition level of an image and best combination of tetrominoes is selected, which better shows the geometry of an image at each level. All three high pass components of the decomposed image at each level are used as input values for feature extraction. A feature vector is created by taking standard deviation in combination with energy at each subband. Retrieval performance in terms of accuracy is tested on group of texture images taken from benchmark databases: Brodatz and VisTex. Experimental results indicate that the proposed method achieves 78.80% retrieval accuracy on group of texture images D1 (taken from Brodatz), 84.41% on group D2 (taken from VisTex) and 77.41% on rotated texture image group D3 (rotated images from Brodatz).     

基于熵编码的JPEG压缩域脆弱图像水印算法

为了解决JPEG图像水印算法在嵌入容量、不可感知性、实时性和窜改定位的问题,提出了一种基于熵编码的JPEG压缩域脆弱图像水印算法。首先选择JPEG熵编码阶段进行水印嵌入,这样就可避免正向和逆向的DCT和量化运算,保证算法在嵌入阶段对图像的改变量较小且具有较好的实时性;接着根据熵编码过程中某些比特不会参与哈夫曼编码这一原则,在其中选择符合条件的系数嵌入水印,将水印信息嵌入到这些系数的最低有效位中,以规避修改哈夫曼编码系数后带来的编码误差,进一步加强了算法的透明性。实验表明,该算法不仅具有较大的嵌入容量和很好的不可感知性,而且脆弱性较高且能够对恶意窜改进行准确定位。     

Image retrieval based on index compressed vector quantization

Increased amount of visual data in several applications necessitates content-based image retrieval. Since most of visual data is stored in compressed form, it is crucial to develop indexing techniques for searching images based on their content in compressed form. Therefore, it is desirable to explore image compression techniques with capability of describing image content in compressed form. Vector Quantization (VQ) is a compression scheme that exploits intra-block correlation and image correlation reflects image content, hence VQ is a suitable compression technique for compressed domain image retrieval.This paper introduces a novel indexing scheme for compressed domain image databases based on indices generated from IC-VQ. The proposed scheme extracts image features based on relationship between indices of IC-VQ compressed images. This relationship detects contiguous regions of compressed image based on inter- and intra-block correlation. Experimental results show effectiveness superiority of the new scheme compared to VQ and color-based schemes.     

Web image retrieval using majority-based ranking approach

Web image retrieval has characteristics different from typical content-based image retrieval; web images have associated textual cues. However, a web image retrieval system often yields undesirable results, because it uses limited text information such as surrounding text, URLs, and image filenames. In this paper, we propose a new approach to retrieval, which uses the image content of retrieved results without relying on assistance from the user. Our basic hypothesis is that more popular images have a higher probability of being the ones that the user wishes to retrieve. According to this hypothesis, we propose a retrieval approach that is based on a majority of the images under consideration. We define four methods for finding the visual features of majority of images; (1) majority-first method, (2) centroid-of-all method, (3) centroid-of-top K method, and (4) centroid-of-largest-cluster method. In addition, we implement a graph/picture classifier for improving the effectiveness of web image retrieval. We evaluate the retrieval effectiveness of both our methods and conventional ones by using precision and recall graphs. Experimental results show that the proposed methods are more effective than conventional keyword-based retrieval methods.     

Multivariate image similarity in the compressed domain using statistical graph matching

We address the problem of image similarity in the compressed domain, using a multivariate statistical test for comparing color distributions. Our approach is based on the multivariate Wald-Wolfowitz test, a nonparametric test that assesses the commonality between two different sets of multivariate observations. Using some pre-selected feature attributes, the similarity measure provides a comprehensive estimate of the match between different images based on graph theory and the notion of minimal spanning tree (MST). Feature extraction is directly provided from the JPEG discrete cosine transform (DCT) domain, without involving full decompression or inverse DCT. Based on the zig-zag scheme, a novel selection technique is introduced that guarantees image's enhanced invariance to geometric transformations. To demonstrate the performance of the proposed method, the application on a diverse collection of images has been systematically studied in a query-by-example image retrieval task. Experimental results show that a powerful measure of similarity between compressed images can emerge from the statistical comparison of their pattern representations.     

Robust image retrieval with hidden classes

For the purpose of content-based image retrieval (CBIR), image classification is important to help improve the retrieval accuracy and speed of the retrieval process. However, the CBIR systems that employ image classification suffer from the problem of hidden classes. The queries associated with hidden classes cannot be accurately answered using a traditional CBIR system. To address this problem, a robust CBIR scheme is proposed that incorporates a novel query detection technique and a self-adaptive retrieval strategy. A number of experiments carried out on the two popular image datasets demonstrate the effectiveness of the proposed scheme.     

Wavelet correlogram: A new approach for image indexing and retrieval

In this paper, a new algorithm for content-based image indexing and retrieval is presented. The proposed method is based on a combination of multiresolution image decomposition and color correlation histogram. According to the new algorithm, wavelet coefficients of the image are computed first using a directional wavelet transform such as Gabor wavelets. A quantization step is then applied before computing one-directional autocorrelograms of the wavelet coefficients. Finally, index vectors are constructed using these one-directional wavelet correlograms. The retrieval results obtained by application of our new method on a 1000 image database demonstrated a significant improvement in effectiveness and efficiency compared to the indexing and retrieval methods based on image color correlogram or wavelet transform.     

一种快速JPEG图像检索方法

给出了一种基于归一化转动惯量（Normalized Moment Inertia,NMI)的JPEG图像快速检索方法,其特点是直接在压缩域中DCT系数进行块分类,每一类分块形成一个直值索引图,统计该索引图的NMI值作为该类的一个特征,所有类的NMI特征构成了图像的一个特征序列,以此进行图像检索。本方法不需要完全解压缩,降低了计算复杂度,对图像的平移,旋转和尺度变换有较好的鲁棒性,试验结果表明这种图像检索方法具有良好的检索性能。