東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Efficient minimum bounding circle-ba...

Safar, Maytham Hassan.

Linked to FindBook

Google Book

Amazon

博客來

Efficient minimum bounding circle-based shape retrieval and spatial querying.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Efficient minimum bounding circle-based shape retrieval and spatial querying./
Author:	Safar, Maytham Hassan.
Description:	190 p.
Notes:	Source: Dissertation Abstracts International, Volume: 63-02, Section: B, page: 0882.
Contained By:	Dissertation Abstracts International63-02B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3041515
ISBN:	0493549951

Efficient minimum bounding circle-based shape retrieval and spatial querying.
Safar, Maytham Hassan.

Efficient minimum bounding circle-based shape retrieval and spatial querying. - 190 p.

Source: Dissertation Abstracts International, Volume: 63-02, Section: B, page: 0882.

Thesis (Ph.D.)--University of Southern California, 2000.

Shape of an object is an important feature for image and multimedia similarity retrievals. Therefore, this study focuses on shape-based object retrieval techniques and proposes three index structures on features that are extracted from the objects' minimum bounding circles (MBC) for efficient retrieval of 2D objects. We also describe several metrics and criterions to evaluate the effectiveness of a given shape representation technique based on: (1) computation and storage costs, (2) accuracy, (3) sensitivity to noise and boundary points representing a shape, (4) support for different query types, and (5) factoring in the human perception on similarity.

ISBN: 0493549951Subjects--Topical Terms:

626642
Computer Science.

Efficient minimum bounding circle-based shape retrieval and spatial querying.
LDR:03248nmm 2200277 4500 001 1849339
005 20051206073021.5
008 130614s2000 eng d
020 $a 0493549951
035 $a (UnM)AAI3041515
035 $a AAI3041515
040 $a UnM $c UnM
100 1 $a Safar, Maytham Hassan. $3 1937301
245 1 0 $a Efficient minimum bounding circle-based shape retrieval and spatial querying.
300 $a 190 p.
500 $a Source: Dissertation Abstracts International, Volume: 63-02, Section: B, page: 0882.
500 $a Adviser: Cyrus Shahabi.
502 $a Thesis (Ph.D.)--University of Southern California, 2000.
520 $a Shape of an object is an important feature for image and multimedia similarity retrievals. Therefore, this study focuses on shape-based object retrieval techniques and proposes three index structures on features that are extracted from the objects' minimum bounding circles (MBC) for efficient retrieval of 2D objects. We also describe several metrics and criterions to evaluate the effectiveness of a given shape representation technique based on: (1) computation and storage costs, (2) accuracy, (3) sensitivity to noise and boundary points representing a shape, (4) support for different query types, and (5) factoring in the human perception on similarity.
520 $a To evaluate our index structures, we conducted a simulation study and the results show the superiority of our techniques as compared to a naive indexing (at least 40% improvement in I/O cost). We also compared the performance of the different shape representation methods, and the results showed the effectiveness of our metrics in their evaluation. First, using recall and precision, we showed that the similarity retrieval accuracy of our method was comparable to the other methods. Second, analytical study showed that some of the methods have a comparable computation cost to compute the similarity between two shape signatures, however, some techniques (e.g., MBC-TPVAS) have much lower computation cost to generate the shape signatures. Third, some methods (e.g., MBC-TPVAS) have better accuracy than others in the presence of noise. Fourth, we distinguish the techniques (e.g., MBC-TPVAS) that are less sensitive than others to the number of vertices used to represent a shape. Finally, some methods (i.e., MBC-TPVAS) were shown to have direct support for different query types (such as spatial queries). We further improve the performance of our method in several aspects. First, we propose a more efficient algorithm to identify MBC of an object that operates only on a subset of the object's vertices. The optimized MBC computation algorithm reduced the execution time significantly (up to 90% reduction). Second, we propose a new technique to improve the response time of MBC-based methods for match queries under specified rotation angles. The technique relies on utilizing the symmetry property of the phase values of the Fourier transform of a real sequence under different rotations.
590 $a School code: 0208.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Southern California. $3 700129
773 0 $t Dissertation Abstracts International $g 63-02B.
790 1 0 $a Shahabi, Cyrus, $e advisor
790 $a 0208
791 $a Ph.D.
792 $a 2000
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3041515