用于图像检索的MPEG-7形状描述子

介绍了基于内容的图像检索技术的研究现状，并对将MPEG-7形状描述子应用于图像数据库进行图像检索进行了研究，最后提出了一些需要解决的问题和今后的研究方向。     

A METHOD OF SHAPE ENCODING AND RETRIEVAL

A method of shape encoding and retrieval is proposed in this letter, which uses centripetal code to encode shape and extracts shape's convex for retrieval. For the rotation invariance and translation invariance of the centripetal code and the normalization of convex, the proposed retrieval method is similarity transform resistant, Experimental results confirm this capability.     

Deformed shape retrieval based on Markov model

A new deformed shape retrieval method based on the Markov model (MM) is proposed. The proposed method is translation rotation and scale invariant. In addition, it is robust to various non-rigid deformations such as perspective, shear, occlusion, pincushion, barrel and other nonlinear distortions. The proposed method has been applied to two databases: geometric and character. The effectiveness and practicability of the proposed approach have been proven by various experimental results     

Collaborative Distribution Alignment for 2D image-based 3D shape retrieval

Retrieving 3D shapes with 2D images has become a popular research area nowadays, and a great deal of work has been devoted to reducing the discrepancy between 3D shapes and 2D images to improve retrieval performance. However, most approaches ignore the semantic information and decision boundaries of the two domains, and cannot achieve both domain alignment and category alignment in one module. In this paper, a novel Collaborative Distribution Alignment (CDA) model is developed to address the above existing challenges. Specifically, we first adopt a dual-stream CNN, following a similarity guided constraint module, to generate discriminative embeddings for input 2D images and 3D shapes (described as multiple views). Subsequently, we explicitly introduce a joint domain-class alignment module to dynamically learn a class-discriminative and domain-agnostic feature space, which can narrow the distance between 2D image and 3D shape instances of the same underlying category, while pushing apart the instances from different categories. Furthermore, we apply a decision boundary refinement module to avoid generating class-ambiguity embeddings by dynamically adjusting inconsistencies between two discriminators. Extensive experiments and evaluations on two challenging benchmarks, MI3DOR and MI3DOR-2, demonstrate the superiority of the proposed CDA method for 2D image-based 3D shape retrieval task.     

Multi-object image retrieval based on shape and topology

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.     

Orthogonal Polar V Transforms and application to shape retrieval

The traditional orthogonal moments (e.g., Zernike moments) are formulated with polynomials as their basis that often face the problem of computation difficulty especially with the high-order moments. In this paper, we present a novel set of transforms namely the Polar V Transforms (PVTs). We can use the PVTs not only to generate the rotation-invariant features but also to capture global and local information of images. Since the PVTs basis functions can keep a low order of polynomials, we can significantly speed-up the runtime for computing the kernels. The experimental results have demonstrated that our proposed method outperforms the previous methods in runtimes and achieves very good results in shape retrieval compared to the previous methods especially when the images with high degree of perspective distortions.     

A spine X-ray image retrieval system using partial shape matching

In recent years, there has been a rapid increase in the size and number of medical image collections. Thus, the development of appropriate methods for medical information retrieval is especially important. In a large collection of spine X-ray images, maintained by the National Library of Medicine, vertebral boundary shape has been determined to be relevant to pathology of interest. This paper presents an innovative partial shape matching (PSM) technique using dynamic programming (DP) for the retrieval of spine X-ray images. The improved version of this technique called corner-guided DP is introduced. It uses nine landmark boundary points for DP search and improves matching speed by approximately 10 times compared to traditional DP. The retrieval accuracy and processing speed of the retrieval system based on the new corner-guided PSM method are evaluated and included in this paper.     

基于Nonsubsampled Contourlet变换的SAR图像形状特征检索

Nonsubsampled Contourlet变换是一种非抽取得具有平移不变性的多尺度多方向的变换。将Canny算子和Nonsubsampled Contourlet变换(NSCT)[1]相结合,对图像运用Canny算子[2]提取边缘特征,再进行Nonsubsampled Contourlet变换,引入了三阶中心矩作为特征向量提取形状特征的算法。实现了基于Nonsubsampled Contourlet变换的图像形状特征检索,并将结果与基于2-D小波变换和基于Contourlet变换的图像形状特征检索作了比较,实验结果证明该方法的图像形状特征检索效率有较大的提高。     

A two-stage shape retrieval (TSR) method with global and local features

A robust two-stage shape retrieval (TSR) method is proposed to address the 2D shape retrieval problem. Most state-of-the-art shape retrieval methods are based on local features matching and ranking. Their retrieval performance is not robust since they may retrieve globally dissimilar shapes in high ranks. To overcome this challenge, we decompose the decision process into two stages. In the first irrelevant cluster filtering (ICF) stage, we consider both global and local features and use them to predict the relevance of gallery shapes with respect to the query. Irrelevant shapes are removed from the candidate shape set. After that, a local-features-based matching and ranking (LMR) method follows in the second stage. We apply the proposed TSR system to MPEG-7, Kimia99 and Tari1000 three datasets and show that it outperforms all other existing methods. The robust retrieval performance of the TSR system is demonstrated.     

Fundamental limits for information retrieval

The fundamental limits of performance for a general model of information retrieval from databases are studied. In the scenarios considered, a large quantity of information is to be stored on some physical storage device. Requests for information are modeled as a randomly generated sequence with a known distribution. The requests are assumed to be “context-dependent,” i.e., to vary according to the sequence of previous requests. The state of the physical storage device is also assumed to depend on the history of previous requests. In general, the logical structure of the information to be stored does not match the physical structure of the storage device, and consequently there are nontrivial limits on the minimum achievable average access times, where the average is over the possible sequences of user requests. The paper applies basic information-theoretic methods to establish these limits and demonstrates constructive procedures that approach them, for a wide class of systems. Allowing redundancy greatly lowers the achievable access times, even when the amount added is an arbitrarily small fraction of the total amount of information in the database. The achievable limits both with and without redundancy are computed; in the case where redundancy is allowed the limits essentially coincide with lower limits for more general storage systems