共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
There exist few studies investigating the multi-query image retrieval problem. Existing methods are not based on hash codes. As a result, they are not efficient and fast. In this study, we develop an efficient and fast multi-query image retrieval method when the queries are related to more than one semantic. Image hash codes are generated by a deep hashing method. Consequently, the method requires lower storage space, and it is faster compared to the existing methods. The retrieval is based on the Pareto front method. Reranking performed on the retrieved images by using non-binary deep-convolutional features increase retrieval accuracy considerably. Unlike previous studies, the method supports an arbitrary number of queries. It outperforms similar multi-query image retrieval studies in terms of retrieval time and retrieval accuracy. 相似文献
5.
6.
Wang Zuyuan Luo Lin Zhuang Zhenquan 《电子科学学刊(英文版)》2001,18(4):306-313
This paper proposes a new texture image retrieval method for the considering of the population search and random information exchange merits of evolving programming which can be used to optimize image feature vector extraction. The experimental results show that this way can efficiently improve the retrieval accuracy and realize fasttips with the advantage of evolving programming algorithm. 相似文献
7.
8.
一种分形域基于内容的图像检索方法 总被引:5,自引:0,他引:5
基于内容的图像检索是多媒体、网络通信及计算机等应用研究领域的一项关键技术。该文提出了一种在分形压缩域直接进行基于内容的图像检索方法。该方法不需要对查询图像进行分形变换,因此可以提高检索速度,降低检索复杂度。仿真结果表明,使用该文提出的方法,能够有效地进行分形域基于内容的图像检索,比较大幅度地降低了检索时间,优于试验中其他3种方法。 相似文献
9.
With the development of multimedia technology, fine-grained image retrieval has gradually become a new hot topic in computer vision, while its accuracy and speed are limited due to the low discriminative high-dimensional real-valued embedding. To solve this problem, we propose an end-to-end framework named DFMH (Discriminative Feature Mining Hashing), which consists of the DFEM (Discriminative Feature Extracting Module) and SHCM (Semantic Hash Coding Module). Specifically, DFEM explores more discriminative local regions by attention drop and obtains finer local feature expression by attention re-sample. SHCM generates high-quality hash codes by combining the quantization loss and bit balance loss. Validated by extensive experiments and ablation studies, our method consistently outperforms both the state-of-the-art generic retrieval methods as well as fine-grained retrieval methods on three datasets, including CUB Birds, Stanford Dogs and Stanford Cars. 相似文献
10.
Zhixin Li Zhiping Shi Xi Liu Zhiqing Li Zhongzhi Shi 《Journal of Visual Communication and Image Representation》2010,21(8):798-805
In this paper, we present an approach based on probabilistic latent semantic analysis (PLSA) to achieve the task of automatic image annotation and retrieval. In order to model training data precisely, each image is represented as a bag of visual words. Then a probabilistic framework is designed to capture semantic aspects from visual and textual modalities, respectively. Furthermore, an adaptive asymmetric learning algorithm is proposed to fuse these aspects. For each image document, the aspect distributions of different modalities are fused by multiplying different weights, which are determined by the visual representations of images. Consequently, the probabilistic framework can predict semantic annotation precisely for unseen images because it associates visual and textual modalities properly. We compare our approach with several state-of-the-art approaches on a standard Corel dataset. The experimental results show that our approach performs more effectively and accurately. 相似文献
11.
Naif Alajlan Mohamed S. Kamel George Freeman 《Signal Processing: Image Communication》2006,21(10):904-918
We aim at developing a geometry-based retrieval system for multi-object images. We model both shape and topology of image objects including holes using a structured representation called curvature tree (CT); the hierarchy of the CT reflects the inclusion relationships between the objects and holes. To facilitate shape-based matching, triangle-area representation (TAR) of each object and hole is stored at the corresponding node in the CT. The similarity between two multi-object images is measured based on the maximum similarity subtree isomorphism (MSSI) between their CTs. For this purpose, we adapt a continuous optimization approach to solve the MSSI problem and a very effective dynamic programming algorithm to measure the similarity between the attributed nodes. Our matching scheme agrees with many recent findings in psychology about the human perception of multi-object images. Experiments on a database of 1500 logos and the MPEG-7 CE-1 database of 1400 shape images have shown the significance of the proposed method. 相似文献
12.
图像情感检索研究的进展与展望 总被引:7,自引:0,他引:7
基于语义内容的图像检索是解决图像简单视觉特征和用户检索丰富语义之间存在的语义鸿沟的关键。其中情感语义是最高层的语义。本文首先介绍情感图像检索的一般框架,并引出情感图像检索的4个主要内容:图像感性特征的抽取、用户情感信息的计算机描述、情感用户模型的建立和用户模型的个性化;并对这4个主要内容的现有算法和研究进展进行归纳和总结;接着介绍3个典型的原型系统;最后从情感数据库、用户模型的评估和用户模型的计算3个方面阐明实现情感图像检索所面临的问题,并提出一些初步的解决思路。 相似文献
13.
14.
如何为内容丰富多变的大量图像数据编制索引并利用该索引进行高效地相似检索是研究的核心问题。相似图像检索系统通过图像特征提取器提取图像的特征,提供访问图像内容的方法;距离函数是用来计算这些特征之间相似程度的主要工具。实验证明,该系统可以高效地为用户检索出指定特征的图像,对实际应用具有重要的价值。 相似文献
15.
《Journal of Visual Communication and Image Representation》2014,25(6):1308-1323
Content-based image retrieval (CBIR) has been an active research topic in the last decade. As one of the promising approaches, salient point based image retrieval has attracted many researchers. However, the related work is usually very time consuming, and some salient points always may not represent the most interesting subset of points for image indexing. Based on fast and performant salient point detector, and the salient point expansion, a novel content-based image retrieval using local visual attention feature is proposed in this paper. Firstly, the salient image points are extracted by using the fast and performant SURF (Speeded-Up Robust Features) detector. Then, the visually significant image points around salient points can be obtained according to the salient point expansion. Finally, the local visual attention feature of visually significant image points, including the weighted color histogram and spatial distribution entropy, are extracted, and the similarity between color images is computed by using the local visual attention feature. Experimental results, including comparisons with the state-of-the-art retrieval systems, demonstrate the effectiveness of our proposal. 相似文献
16.
《Journal of Visual Communication and Image Representation》2014,25(6):1324-1334
A new image indexing and retrieval algorithm for content based image retrieval is proposed in this paper. The local region of the image is represented by making the use of local difference operator (LDO), separating it into two components i.e. sign and magnitude. The sign LBP operator (S_LBP) is a generalized LBP operator. The magnitude LBP (M_LBP) operator is calculated using the magnitude of LDO. A robust LBP (RLBP) operator is presented employing robust S_LBP and robust M_LBP. Further, the combination of Gabor transform and RLBP operator has also been presented. The robustness is established by conducting four experiments on different image database i.e. Corel 1000 (DB1), Brodatz texture database (DB2) and MIT VisTex database (DB3) under different lighting (illumination) and noise conditions. Investigations reveal a promising achievement of the technique presented when compared to S_LBP and other existing transform domain techniques in terms of their evaluation measures. 相似文献
17.
Learning effective relevance measures plays a crucial role in improving the performance of content-based image retrieval (CBIR) systems. Despite extensive research efforts for decades, how to discover and incorporate semantic information of images still poses a formidable challenge to real-world CBIR systems. In this paper, we propose a novel hybrid textual-visual relevance learning method, which mines textual relevance from image tags and combines textual relevance and visual relevance for CBIR. To alleviate the sparsity and unreliability of tags, we first perform tag completion to fill the missing tags as well as correct noisy tags of images. Then, we capture users’ semantic cognition to images by representing each image as a probability distribution over the permutations of tags. Finally, instead of early fusion, a ranking aggregation strategy is adopted to sew up textual relevance and visual relevance seamlessly. Extensive experiments on two benchmark datasets well verified the promise of our approach. 相似文献
18.
19.
多示例学习对处理各类歧义问题有较好的效果,将它应用于周像检索问题,提出了一种新的基于多示例学习的图像检索方法。首先提取每幅图像的局部区域特征,通过对这些特征聚类求得一组基向量,并利用它们对每个局部特征向量进行编码,接着使用均值漂移聚类算法对图像进行分割,根据局部特征点位置所对应的分割块划分特征编码到相应的子集,最后将每组编码子集聚合成一个向量,这样每幅图像对应一个多示例包。根据用户选择的图像生成正包和反包,采用多示例学习算法进行学习,取得了较为满意的结果。 相似文献