检索结果-内蒙古大学图书馆

SPATIAL REASONING ANd SIMILARITY RETRIEVAL OF IMAGES USING 2d C-string KNOWLEdGE REPRESENTATION

PATTERN RECOGNITION 1992年第3期25卷 305-318页

作者： LEE, SY HSU, FJ NATL CHIAO TUNG UNIV CTR TELECOMMUN RESHSINCHU 30050TAIWAN IND TECHNOL RES INST COMP & COMMUN RES LABSHSINCHUTAIWAN

The data structure called 2d string to represent symbolic pictures was proposed by Chang et al. It allows a natural way to construct iconic indexes for pictures. A new spatial knowledge representation of a 2d C-string with accompanying cutting mechanism and a set of spatial operators are proposed. 2d C-string is more characteristic of spatial knowledge in images and is more efficient in representation and manipulation of images. Since a spatial relationship is a fuzzy concept, the capability of similarity retrieval is essential in image database systems. The spatial query and spatial reasoning based on a 2d C-string representation are presented. The similarity measure is defined and the algorithm for similarity retrieval of iconic images is also proposed.

关键词： IMAGE dATABASE SPATIAL KNOWLEdGE 2d string 2d C-string SPATIAL REASONING SIMILARITY RETRIEVAL PICTORIAL QUERY

来源：评论

学校读者我要写书评

暂无评论

2d C-string - A NEW SPATIAL KNOWLEdGE REPRESENTATION FOR IMAGE dATABASE-SYSTEMS

引用

PATTERN RECOGNITION 1990年第10期23卷 1077-1087页

作者： LEE, SY HSU, FJ NATL CHIAO TUNG UNIV CTR TELECOMMUN RESHSINCHU 30039TAIWAN NATL CHIAO TUNG UNIV INST INFORMAT SCIHSINCHU 30039TAIWAN

The data structure called 2d string to represent symbolic pictures was proposed by Chang et al. It allows a natural way to construct iconic indexes for pictures. Jungert has extended 2d strings to represent more types of spatial relationships between picture objects, but the operators and the derived knowledge cannot be stored in a unified structure. In this paper, a new spatial knowledge representation 2d C-string with accompanied cutting mechanism and a set of spatial operators are proposed. 2d C-string is more characteristic of spatial knowledge in images and is more efficient in representation and manipulation of images. The cutting and reconstruction algorithms for 2d C-string representation of symbolic pictures are also developed.

关键词： Image database 2d string Spatial knowledge Iconic index 2d C-string Spatial relationship

来源：评论

学校读者我要写书评

暂无评论

A spatial data representation: An adaptive 2d-H string

引用

PATTERN RECOGNITION LETTERS 1996年第2期17卷 175-185页

作者： Chang, CC Lin, dC Institute of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan 62107 ROC

Based on the 2d-H string, an alternative spatial data structure, called the adaptive 2d-H string, is proposed for representing symbolic pictures. We present an algorithm for converting symbolic pictures of any size into adaptive 2d-H strings. In this paper, we will also analyze and compare the needed storage space of 2d-H strings and that of adaptive 2d-H strings. The results show that our adaptive 2d-H string demonstrates better performance in some cases. Besides, from the experimental results, we see that our adaptive 2d-H string can work well for many unbalanced non-square small pictures, which frequently exist in our real environment.

关键词： 2d string 2d-H string image database systems quadtree symbolic pictures

来源：评论

学校读者我要写书评

暂无评论

PERFECT HASH TABLE ALGORITHM FOR IMAGE dATABASES USING NEGATIVE ASSOCIATEd VALUES

引用

PATTERN RECOGNITION 1995年第7期28卷 1091-1101页

作者： SABHARWAL, CL BHATIA, SK UNIV MISSOURI DEPT MATH & COMP SCI ST LOUIS MO 63121 USA

A 2d string data structure allows for efficient spatial reasoning on an image database for query and retrieval. A 7d string can be converted to a set of triples leading to an elegant O(1) solution for image retrieval with simple queries using a perfect hash table. For complex queries, the retrieval complexity is linear in this approach and depends on the number of possible pairings of picture objects in the query. The perfect hash table computation for this problem is mapped directly to a permutation problem. In an earlier paper [S. K. Bhatia and C. L. Sabharwal, Pattern Recognition 27, 365-376 (1974)], we presented a set of heuristics that result in a fast computation of associated values, for picture objects, used in the calculation of hash addresses. In this paper, we present an additional heuristic leading to a 90% reduction in search space over our earlier algorithm. The new heuristic promises to generate a minimal perfect hash function for each experimental data set, which was not possible with the earlier algorithms. Mathematical analysis of complexity of the algorithms is presented and is supported by experimental results.

关键词： IMAGE dATABASE SYSTEMS SPATIAL REASONING STORAGE ANd RETRIEVAL 2d string PERFECT HASHING ASSOCIATEd VALUE FUNCTION

来源：评论

学校读者我要写书评

暂无评论

Multidimensional interval filter: A new indexing method for subpicture query of image retrieval

引用

PATTERN RECOGNITION LETTERS 1998年第13期19卷 1241-1255页

作者： Shan, MK Lee, SY Natl Chiao Tung Univ Inst Comp Sci & Informat Engn Hsinchu 30050 Taiwan

In this paper a new indexing method, called multidimensional interval filter, is proposed to speed up processing of subpicture query. The basic idea is the transformation of spatial information of each image into a multidimensional rectangle. Processing of subpicture query becomes that of rectangle containment query which can be further speeded up by some well-developed spatial access methods such as R-Trees. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： 2d string content-base image retrieval image databases spatial access method

来源：评论

学校读者我要写书评

暂无评论

A bit-pattern-based matrix strategy for efficient iconic indexing of symbolic pictures

引用

PATTERN RECOGNITION LETTERS 2003年第1-3期24卷 537-545页

作者： Chang, YI Yang, BY Yeh, WH Natl Sun Yat Sen Univ Dept Comp Sci & Engn Kaohsiung 804 Taiwan Natl Sun Yat Sen Univ Dept Appl Math Kaohsiung 80424 Taiwan

In this paper, we propose an efficient iconic indexing strategy called bit-pattern-based matrix (BP matrix) for symbolic pictures, in which each spatial relationship between any two objects along the x-axis (or y-axis) is represented as a binary-bit pattern, and is recorded in a matrix. There are 12 bits in each bit pattern. When the bits in a certain subset of those 12 bits are set to 1, they denote a certain spatial relationship. Bit-wise-and/bit-wise-or operations are used for query processing;therefore, they are efficient enough as compared to the previous approaches. From our simulation, we show that the proposed BP matrix strategy requires shorter time for query processing than the generalized prime-number-based matrix strategy. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： 2d string 2d C-string 9dLT image databases similarity retrieval spatial reaoning

来源：评论

学校读者我要写书评

暂无评论

A FAST ALGORITHM TO RETRIEVE SYMBOLIC PICTURES

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1992年第3-4期43卷 133-138页

作者： CHANG, CC Institute of Computer Science and Information Engineering National Chung Cheng University Chiayi 62107 China

We propose a scheme for determining whether or not a pattern of icons is contained in a subject image. For two icons, their spatial relationship is simplified to nine relationships, according to the relations <, =, or > of their X and Y coordinates. Our spatial match retrieval scheme is base upon the Chinese remainder theorem. For a subject pattern image, a set of keys associated to all the icons within the image to reveal the spatial relationships is computed and stored. An algorithm to determine whether or not a pattern of icons is a subpicture of a subject image is also presented.

关键词： SPATIAL MATCH RETRIEVAL CHINESE REMAINdER THEOREM 2d string 9dLT MATRIX

来源：评论

学校读者我要写书评

暂无评论

Archival and retrieval of symbolic images: An invariant scheme based on triangular spatial relationship

引用

PATTERN RECOGNITION LETTERS 2003年第14期24卷 2397-2408页

作者： Guru, dS Punitha, P Nagabhushan, P Univ Mysore Dept Studies Comp Sci Mysore 570006 Karnataka India

In this paper, a novel scheme for representing symbolic images in a symbolic image database (SId) is proposed. The proposed scheme is based on triangular spatial relationship (TSR) [Pattern Recognition Lett. 22 (2001) 999]. The scheme preserves TSR among the components in a symbolic image by the use of quadruples. A SId is created through the construction of B-tree, an efficient multilevel indexing structure. A methodology to retrieve similar images for a given query image is also presented. The presented retrieval model has logarithmic search time complexity. The study made in this work reveals that the model bears various advantages when compared to other existing models and could be extended towards dynamic databases. (C) 2003 Elsevier B.V. All rights reserved.

关键词： symbolic images 2d string 9dLT matrix iconic indexing triangular spatial relationship B-tree symbolic image database similarity retrieval

来源：评论

学校读者我要写书评

暂无评论

A FAST IMPLEMENTATION OF A PERFECT HASH FUNCTION FOR PICTURE OBJECTS

引用

PATTERN RECOGNITION 1994年第3期27卷 365-376页

作者： BHATIA, SK SABHARWAL, CL UNIV MISSOURI CTR GRAD ENGN ST LOUIS MO 63121 USA MCDONNELL DOUGLAS CORP ST LOUIS MO 63166 USA

In image database systems, symbolic pictures are represented by two-dimensional (2d) strings that are converted into triples. Each triple is mapped to a unique hash address for timely retrieval of pictures, reducing the pattern-matching problem corresponding to a query to that of computation of a hash function. The values associated with the picture objects are used to compute hash addresses for triples developed from the query. Heuristics are proposed to speed up the computation of the associated values for the picture objects. Experimental results show that the new algorithm achieves almost a 90%. gain, in search space, over existing algorithms to compute the associated values.

关键词： IMAGE dATABASE SYSTEMS 2d string PERFECT HASHING FUNCTION A-ASTERISK SEARCH ALGORITHM ASSOCIATEd VALUE FUNCTION

来源：评论

学校读者我要写书评

暂无评论

A spatial match retrieval mechanism for symbolic pictures

引用

JOURNAL OF SYSTEMS ANd SOFTWARE 1998年第1期44卷 73-83页

作者： Chang, CC Lee, CF Natl Chung Cheng Univ Inst Comp Sci & Informat Engn Chiayi 621 Taiwan

Spatial relationships are important ingredients of spatial access methods in retrieval mechanism systems for pictorial or multimedia databases. We suggest a one-to-one mapping method of retrieving the symbolic pictures in a pictorial database based upon the spatial relationships among the objects in the picture. In our mechanism, each picture or query is transformed into a set of ordered triples (O-i, O-j, r(ij))'s, where O-i and O-j are two objects and r(ij) is the spatial relationship between O-i and O-j. Then we construct a one-to-one mapping table for all (O-i, O-j, r(ij))'s of all the pictures in the pictorial database. By searching the preconstructed mapping table for all of the (O-i, O-j, r(ij))'s associated with a query, the desired pictures can be easily determined. Besides, the proposed spatial match retrieval approach can be easily embedded into various systems such as parallelism systems or distributed database system. (C) 1998 Published by Elsevier Science Inc. All rights reserved.

关键词： perfect hashing match retrieval pictorial database 2d string

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：