Back to search

NJIT

Application of geometric hashing techniques to retrieval of high dimensional objects in scientific databases

Abstract

dc:description.abstract

An approach to designing very fast algorithms for tackling the problem of approximate object matching in very large databases of high-dimensional objects is proposed. Given are a target object C and a database D containing information about a set of high-dimensional objects each of which is represented as a set of points. Our algorithms have an off-line object preprocessing (shape representation) phase and a recognition phase. The described algorithms determine those objects from D which are the closest to object C, according to delete or insert some points, move and rotation. All of these can be achieved very efficiently with the help of geometric hashing techniques. This scheme has been successfully applied to a real scientific database.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science - (M.S.)
Discipline thesis:degree_discipline
Computer and Information Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lu, Joyce Ye
Contributors dc:contributor
  • Jason T. L. Wang
  • Peter A. Ng
  • Marvin K. Nakayama

Subjects

dc:subject × 3

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/1018

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lu, Joyce Ye. Application of geometric hashing techniques to retrieval of high dimensional objects in scientific databases. https://digitalcommons.njit.edu/theses/1018