基于嵌入式零树小波编码直方图图像检索

图像和视频应用的快速增长，使得根据图像和视频内容进行查询的技术变得越来越重要，人们提出了许多基于像素域或压缩域的图像检索技术，因为多媒体数据库通常具有相当大的数据量，所以基于像素域图像检索技术的计算复杂度相当大，因此，许多文献提出更快的基于压缩域的图像检索技术，本文提出一种改进的基于嵌入式零树小波编码直方图的图像检索技术，特征提取综合考虑图像的颜色，纹理，频率和空间信息，所有的特征可以在压缩过程中自动得到，图像检索的过程就是匹配待检索图像和来自数据库的侯选图像的索引，实验证明这种方法具有好的检索性能。     

An Indexing and Retrieval Mechanism for Complex Similarity Queries in Image Databases

A content-based image retrieval mechanism to support complex similarity queries is presented. The image content is defined by three kinds of features: quantifiable features describing the visual information, nonquantifiable features describing the semantic information, and keywords describing more abstract semantic information. In correspondence with these feature sets, we construct three types of indexes: visual indexes, semantic indexes, and keyword indexes. Index structures are elaborated to provide effective and efficient retrieval of images based on their contents. The underlying index structure used for all indexes is the HG-tree. In addition to the HG-tree, the signature file and hashing technique are also employed to index keywords and semantic features. The proposed indexing scheme combines and extends the HG-tree, the signature file, and the hashing scheme to support complex similarity queries. We also propose a new evaluation strategy to process the complex similarity queries. Experiments have been carried out on large image collections to demonstrate the effectiveness of the proposed retrieval mechanism.     

Boosting image object retrieval and indexing by automatically discovered pseudo-objects

State-of-the-art object retrieval systems are mostly based on the bag-of-visual-words representation which encodes local appearance information of an image in a feature vector. An image object search is performed by comparing query object’s feature vector with those for database images. However, a database image vector generally carries mixed information of the entire image which may contain multiple objects and background. Search quality is degraded by such noisy (or diluted) feature vectors. To tackle this problem, we propose a novel representation, pseudo-objects – a subset of proximate feature points with its own feature vector to represent a local area, to approximate candidate objects in database images. In this paper, we investigate effective methods (e.g., grid, G-means, and GMM–BIC) to estimate pseudo-objects. Additionally, we also confirm that the pseudo-objects can significantly benefit inverted-file indexing both in accuracy and efficiency. Experimenting over two consumer photo benchmarks, we demonstrate that the proposed method significantly outperforms other state-of-the-art object retrieval and indexing algorithms.     

基于重组DCT系数子带能量直方图的图像检索

现在许多图像采用JPEG格式存储,检索这些图像通常要先解压缩,然后提取基于像素域的特征矢量进行图像检索。己有文献提出直接在DCT域进行图像检索的方法,这样可以降低检索的时间复杂度。本文提出对JPEG图像的DCT系数利用多分辨率小波变换的形式进行重组,对整个数据库中所有图像的DCT系数重组得到的若干子带,分别建立子带能量直方图,而后采用Morton顺序建立每幅图像的索引,并采用变形B树结构组织图像数据库用于图像检索。     

Efficient privacy-preserving image retrieval scheme over outsourced data with multi-user

The traditional privacy-preserving image retrieval schemes not only bring large computational and communication overhead,but also cannot protect the image and query privacy in multi-user scenarios.To solve above problems,an efficient privacy-preserving content-based image retrieval scheme was proposed in multi-user scenarios.The scheme used Euclidean distance comparison technique to rank the pictures according to similarity of picture feature vectors and return top-k returned.Meanwhile,the efficient key conversion protocol designed in proposed image retrieval scheme allowed each search user to generate queries based on his own private key so that he can retrieval encrypted images generated by different data owners.Strict security analysis shows that the user privacy and cloud data security can be well protected during the image retrieval process,and the performance analysis using real-world dataset shows that the proposed image retrieval scheme is efficient and feasible in practical applications.     

Knowledge-driven multidimensional indexing structure for biomedical media database retrieval.

Today, biomedical media data are being generated at rates unimaginable only years ago. Content-based retrieval of biomedical media from large databases is becoming increasingly important to clinical, research, and educational communities. In this paper, we present the recently developed entropy balanced statistical (EBS) k-d tree and its applications to biomedical media, including a high-resolution computed tomography (HRCT) lung image database and the first real-time protein tertiary structure search engine. Our index utilizes statistical properties inherent in large-scale biomedical media databases for efficient and accurate searches. By applying concepts from pattern recognition and information theory, the EBS k-d tree is built through top-down decision tree induction. Experimentation shows similarity searches against a protein structure database of 53 363 structures consistently execute in less than 8.14 ms for the top 100 most similar structures. Additionally, we have shown improved retrieval precision over adaptive and statistical k-d trees. Retrieval precision of the EBS k-d tree is 81.6% for content-based retrieval of HRCT lung images and 94.9% at 10% recall for protein structure similarity search. The EBS k-d tree has enormous potential for use in biomedical applications embedded with ground-truth knowledge and multidimensional signatures.     

基于音频子带能量动态范围的快速音频检索

提出了利用音频子带能量动态范围特征实现两阶段快速音频检索的方法。在预处理阶段根据音频库的子带能量动态范围（DRSBE）特征首先建立1个索引库,检索时分为2步：第一步先计算输入参考音频片段的DRSBE特征,然后根据数据库中建立的索引找到候选音频;第二步计算参考音频和候选音频之间的相似度,输出最后结果。实验结果表明,基于DRSBE特征的快速音频检索方法对于同源音频检索的速度和精度都非常高,在高质量的广播音频检索中达到了实用要求。     

Texture Recognition and Image Retrieval Using Gradient Indexing

Our starting point is gradient indexing, the characterization of texture by a feature vector that comprises a histogram derived from the image gradient field. We investigate the use of gradient indexing for texture recognition and image retrieval. We find that gradient indexing is a robust measure with respect to the number of bins and to the choice of the gradient operator. We also find that the gradient direction and magnitude are equally effective in recognizing different textures. Furthermore, a variant of gradient indexing called local activity spectrum is proposed and shown to have improved performance. Local activity spectrum is employed in an image retrieval system as the texture statistic. The retrieval system is based on a segmentation technique employing a distance measure called Sum of Minimum Distance. This system enables content-based retrieval of database images from templates of arbitrary size.     

CLUE: cluster-based retrieval of images by unsupervised learning.

In a typical content-based image retrieval (CBIR) system, target images (images in the database) are sorted by feature similarities with respect to the query. Similarities among target images are usually ignored. This paper introduces a new technique, cluster-based retrieval of images by unsupervised learning (CLUE), for improving user interaction with image retrieval systems by fully exploiting the similarity information. CLUE retrieves image clusters by applying a graph-theoretic clustering algorithm to a collection of images in the vicinity of the query. Clustering in CLUE is dynamic. In particular, clusters formed depend on which images are retrieved in response to the query. CLUE can be combined with any real-valued symmetric similarity measure (metric or nonmetric). Thus, it may be embedded in many current CBIR systems, including relevance feedback systems. The performance of an experimental image retrieval system using CLUE is evaluated on a database of around 60,000 images from COREL. Empirical results demonstrate improved performance compared with a CBIR system using the same image similarity measure. In addition, results on images returned by Google's Image Search reveal the potential of applying CLUE to real-world image data and integrating CLUE as a part of the interface for keyword-based image retrieval systems.     

Nonparametric motion characterization using causal probabilisticmodels for video indexing and retrieval

This paper describes an original approach for content-based video indexing and retrieval. We aim at providing a global interpretation of the dynamic content of video shots without any prior motion segmentation and without any use of dense optic flow fields. To this end, we exploit the spatio-temporal distribution, within a shot, of appropriate local motion-related measurements derived from the spatio-temporal derivatives of the intensity function. These distributions are then represented by causal Gibbs models. To be independent of camera movement, the motion-related measurements are computed in the image sequence generated by compensating the estimated dominant image motion in the original sequence. The statistical modeling framework considered makes the exact computation of the conditional likelihood of a video shot belonging to a given motion or more generally to an activity class feasible. This property allows us to develop a general statistical framework for video indexing and retrieval with query-by-example. We build a hierarchical structure of the processed video database according to motion content similarity. This results in a binary tree where each node is associated to an estimated causal Gibbs model. We consider a similarity measure inspired from Kullback-Leibler divergence. Then, retrieval with query-by-example is performed through this binary tree using the maximum a posteriori (MAP) criterion. We have obtained promising results on a set of various real image sequences.     

An efficient signature representation for retrieval of spatially similar images

Multimedia applications involving image retrieval demand fast and efficient response. Efficiency of search and retrieval of information in a database system is index dependent. Generally, a two-level indexing scheme in an image database can help to reduce the search space against a given query image. In such type of indexing scheme, the first level is required to significantly reduce the search space for second stage of comparisons and must be computationally efficient. It is also required to guarantee that no false negatives may result. The second level of indexing involves more detailed analysis and comparison of potentially relevant images. In this paper, we present an efficient signature representation scheme for first level of a two-level image indexing scheme that is based on hierarchical decomposition of image space into spatial arrangement of image features. Experimental results demonstrate that our signature representation scheme results in fewer number of matching signatures in the first level and significantly improves the overall computational time. As this scheme relies on corner points as the salient feature points in an image to describe its contents, we also compare results using several different contemporary corner detection methods. Further, we formally prove that the proposed signature representation scheme not only results in fewer number of signatures but also does not result in any false negative.     

Integration of wavelet transform,Local Binary Patterns and moments for content-based image retrieval

The proliferation of large number of images has made it necessary to develop systems for indexing and organizing images for easy access. This has made Content-Based Image Retrieval (CBIR) an important area of research in Computer Vision. This paper proposes a combination of features in multiresolution analysis framework for image retrieval. In this work, the concept of multiresolution analysis has been exploited through the use of wavelet transform. This paper combines Local Binary Pattern (LBP) with Legendre Moments at multiple resolutions of wavelet decomposition of image. First, LBP codes of Discrete Wavelet Transform (DWT) coefficients of images are computed to extract texture feature from image. The Legendre Moments of these LBP codes are then computed to extract shape feature from texture feature for constructing feature vectors. These feature vectors are used to search and retrieve visually similar images from large database. The proposed method has been tested on five benchmark datasets, namely, Corel-1K, Olivia-2688, Corel-5K, Corel-10K, and GHIM-10K, and performance of the proposed method has been measured in terms of precision and recall. The experimental results demonstrate that the proposed method outperforms some of the other state-of-the-art methods in terms of precision and recall.     

Perceptual Image Indexing and Retrieval

We describe a perceptual approach to generating features for use in indexing and retrieving images from an image database. Salient regions that immediately attract the eye are large color regions that usually dominate an image. Features derived from these will allow search for images that are similar perceptually. We compute color features and Gabor color texture features on regions obtained from a multiscale representation of the image, generated by a multiband smoothing algorithm based on human psychophysical measurements of color appearance. The combined feature vector is then used for indexing all salient regions of an image. For retrieval, those images are selected that contain more similar regions to the query image by using a multipass retrieval and ranking mechanism. Matches are found using the L₂ metric. The results demonstrate that the proposed method performs very well.     

融合多特征的图像检索算法

针对单一特征不能很好地表述图像的问题,提出了一种融合多特征的图像检索算法.首先,提取查询图像和图像库中样本图像的GIST(Generalized Search Tree)特征,用欧氏距离衡量图像间的GIST相似度值,根据查询图像的GIST特征在图像库中进行检索,将结果按相似度进行排序;然后,提取查询图像和返回结果中前k幅图像的尺度不变特征变换(SIFT)特征,使用BBF(Best Bin First)算法进行特征匹配;最后,通过特征点匹配点对数排序并返回检索结果.实验在改进的Corel1000数据集上进行,与传统的单特征图像检索算法对比,提出的图像检索算法不仅提高了检索准确率,而且获得了较好的检索效率.     

基于p-稳定分布局部敏感哈希地址的鲁棒音频检索方法

局部敏感哈希（Local-Sensitive Hashing, LSH）索引方法具有快速的优点,对数据规模具有子线性的时间复杂度。但是该方法对待检集合的选取要求苛刻,容易将带噪数据排除在待检集合之外,导致检索精度下降。针对这一缺点,本文从p-稳定分布理论出发,分析噪声对数据的局部敏感哈希地址的影响,并利用数据的哈希地址受噪声影响在原始地址附近偏移的特性,提出一种鲁棒的音频检索方法。该方法将LSH地址直接作为相似性判定的特征,并通过扩大检索范围来提高噪声鲁棒性。实验表明,所提方法在噪声鲁棒性方面优于LSH索引方法;进一步引入向量搜索算法优化后,其检索速度也可达到与LSH索引方法接近的水平。      

基于颜色纹理特征的SVD图像检索方法

网络等媒体中包含的图片越来越丰富,从众多的图像中查找到自己感兴趣的内容是图像处理一个重要目标.图像的颜色和纹理能从视觉上表现图像特征,因此提出了图像颜色和纹理特征融合,并用奇异值分解方法降低特征向量维度的图像检索方法.首先,提取图像LTrP(Local Tetra Patterns)纹理特征向量和HSV颜色特征向量;对图像分块,用奇异值分解方法降低图像块特征向量维度和噪声,连接图像块向量得到图像的特征向量;用欧式距离对图像进行相似性检测.实验结果表明,该方法平均检索精度明显高于其他同类检索方法.     

A Novel Web Image Retrieval Method

Traditional image retrieval methods, make use of color, shape and texture features, are based on local image database. But in the condition of which much more images are available on the internet, so big an image database includes various types of image information. In this paper, we introduce an intellectualized image retrieval method based on internet, which can grasp images on Internet automatically using web crawler and build the feature vector in local host. The method involves three parts: the capture-node, the manage-node, and the calculate-node. The calculate-node has two functions: feature extract and similarity measurement. According to the results of our experiments, we found the proposed method is simple to realization and has higher processing speed and accuracy.