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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PIcTURE ALGEBRA FOR SPATIAL REASONING OF IcONIc IMAGES REPRESENTEd IN 2d c-string

引用

PATTERN REcOGNITION LETTERS 1991年第7期12卷 425-435页

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

A new spatial knowledge representation 2d c-string with accompanied cutting mechanism and a set of spatial operators are proposed. 2d c-string is characteristic of spatial knowledge embedded in images and is efficient in representation and manipulation of images. In this paper, transitive laws, distributive laws and manipulation laws of picture algebra are presented. All the binary relationships among objects in an image can be derived from 2d c-string. The picture algebra provides the theoretic basis for spatial reasoning and pictorial query inference.

关键词： IMAGE dATABASE SPATIAL KNOWLEdGE 2d c-string SPATIAL REASONING PIcTURE ALGEBRA PIcTORIAL QUERY

来源：评论

学校读者我要写书评

暂无评论

2d Z-string: A new spatial knowledge representation for image databases

引用

PATTERN REcOGNITION LETTERS 2003年第16期24卷 3015-3026页

作者： Lee, AJT chiu, HP Natl Taiwan Univ Dept Informat Management Taipei 106 Taiwan

The knowledge structure called the 2d c+-string, proposed by Huang et al., to represent symbolic pictures allows a natural way to construct iconic indexes for images. According to the cutting mechanism of the 2d c+-string, an object may be partitioned into several subparts. The number of partitioned subparts is bounded to O(n(2)), where n is the number of objects in the image. Hence, the string length is also bounded to O(n(2)). In this paper, we propose a new spatial knowledge representation called the 2d Z-string. Since there are no cuttings between objects in the 2d Z-string, the integrity of objects is preserved and the string length is bounded to 0(n). Finally, some experiments are conducted to compare the performance of both approaches. (c) 2003 Elsevier B.V. All rights reserved.

关键词： iconic indexing image database 2d Z-string 2d c-string 2d c+-string

来源：评论

学校读者我要写书评

暂无评论

USING 2d c+-stringS AS SPATIAL KNOWLEdGE REPRESENTATION FOR IMAGE dATABASE-SYSTEMS

引用

PATTERN REcOGNITION 1994年第9期27卷 1249-1257页

作者： HUANG, PW JEAN, YR Department of Applied Mathematics National Chung-Hsing University Taichung 40227 Taiwan R.O.C.

The pictorial data structure based on 2d strings provides an efficient method for iconic indexing in image database systems. Previous approaches ignore the sizes of and distances between objects. These representations have deficiencies in picture reconstruction, similarity retrieval, and spatial reasoning. In this paper, we propose a new spatial knowledge representation scheme called 2d c+-strings as well as a picture reconstruction algorithm. As a result, our scheme offers the following major advantages: (1) more accuracy in picture reconstruction;(2) less ambiguity in similarity retrieval;(3) reasoning about relative sizes, locations, and distances for a symbolic picture is possible.

关键词： IMAGE dATABASE SPATIAL KNOWLEdGE 2d string 2d c-string 2d c+-string SPATIAL REASONING SIMILARITY RETRIEVAL PIcTORIAL QUERY

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient access methods for image databases

引用

INFORMATION PROcESSING LETTERS 1997年第2期64卷 95-105页

作者： chang, YI Yang, BY Department of Applied Mathematics National Sun Yat-Sen University Kaohsiung Taiwan ROC

In the previous approaches to retrieve a symbolic picture from an image database which contains multiple symbolic pictures, only 9 spatial relationships that are represented in 2d strings or 9dLT matrices were considered. In this paper, we propose two efficient access methods for image databases, which can handle 169 spatial relationships. In the first proposed method, each record signature is represented by 26 bits and 26-bit strings of size N, where N > 0. In the second proposed method, each record signature is represented by 26 bits and 26 products of prime numbers. Given the same image databases, the same query picture and the same hash functions, the ratio of the false match in our strategy can be smaller than that of the previous approaches, where a false match is that a record signature matches a query signature but the corresponding record does not satisfy the query. (c) 1997 Elsevier Science B.V.

关键词： image databases 2d string 2d c-string pictorial query similarity retrieval spatial reasoning symbolic databases

来源：评论

学校读者我要写书评

暂无评论

A generalized prime-number-based matrix strategy for efficient iconic indexing of symbolic pictures

引用

PATTERN REcOGNITION LETTERS 2001年第6-7期22卷 657-666页

作者： 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 generalized prime-number-based matrix (GPN Matrix) for symbolic pictures, in which each spatial relationship between any two objects is represented as a product of some prime numbers from a set of 12 prime numbers and is recorded in a matrix. In the proposed strategy, we classify 169 spatial relationships between two objects in 2d space into five spatial categories, and define a generalized category rule (based on module operations) for each of those five spatial categories. As compared to the prime-number-based matrix (PN Matrix) strategy (chang and Yang, 1997), in which each spatial relationship between any two objects is represented as a product of some prime numbers from a set of 17 prime numbers, the GPN Matrix strategy has a smaller storage space requirement than the PN Matrix strategy. which also improves the query processing time. (c) 2001 Elsevier Science B.V. All rights reserved.

关键词： 2d string 2d c-string image databases pictorial query pictorial databases similarity retrieval spatial reasoning

来源：评论

学校读者我要写书评

暂无评论

A prime-number-based matrix strategy for efficient iconic indexing of symbolic pictures

引用

PATTERN REcOGNITION 1997年第10期30卷 1745-1757页

作者： chang, YI Yang, BY Department of Applied Mathematics National Sun Yat-Sen University Kaohsiung Taiwan R.O.C.

In the previous approaches to represent pictorial data, as the complexity of the representation strategy is increased, the more spatial relationships can be represented, which also results in a more complex strategy for query processing and a limited types of queries that can be answered. In this paper, we propose an efficient iconic indexing scheme called Prime-Number-based Matrix (PN Matrix) for symbolic pictures, which combines the advantages of the 2d c-string and the 9dLT matrix. Basically, the proposed strategy can represent those complex relationships which are represented in 2d c-strings in a matrix, and an efficient module-based operation can be used to support pictorial query, spatial reasoning and similarity retrieval. In the proposed scheme, we classify 169 spatial relationships between two objects in 2d space into five spatial categories, and define a category rule for each of those five spatial categories. Those category rules are module-operation-based;therefore, they are efficient enough as compared to the previous approaches. Following those category rules, we propose algorithms to efficiently support spatial reasoning, picture queries and similarity retrieval based on a data structure of a Prime-Number-based Matrix (PN Matrix). (c) 1997 Pattern Recognition Society. Published by Elsevier Science Ltd.

关键词： 2d c-string image databases pictorial query similarity retrieval spatial reasoning symbolic databases

来源：评论

学校读者我要写书评

暂无评论

A unique-Id-based matrix strategy for efficient iconic indexing of symbolic pictures

引用

PATTERN REcOGNITION 2000年第8期33卷 1263-1276页

作者： chang, YI Ann, HY Yeh, WH Natl Sun Yat Sen Univ Dept Appl Math Kaohsiung 80424 Taiwan

In this paper, we propose an efficient iconic indexing strategy called unique-Id-based matrix (UId matrix) for symbolic pictures, in which each spatial relationship between any two objects is assigned with a unique identifier (Id) and is recorded in a matrix. Basically, the proposed strategy can represent those complex relationships that are represented in 2d c-strings in a matrix, and an efficient range checking operation can be used to support pictorial query, spatial reasoning and similarity retrieval;therefore, they are efficient enough as compared to the previous approaches. From our simulation, we show that the proposed UId matrix strategy requires shorter time to convert the input data into the corresponding representation than the 2d c-string strategy, so is the case with query processing. Moreover: our proposed UId matrix strategy may require lesser storage cost than the 2d c-string strategy in some cases. (c) 2000 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

关键词： 2d string 2d c-string image databases pictorial query similarity retrieval spatial reasoning symbolic databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：