Index spaces for 3D retrieval : Toward a better understand of their geometry and distribution

  1. (PDF, 777 KB)
DOIResolve DOI:
AuthorSearch for: ; Search for:
Proceedings titleProceedings of SPIE
ConferenceThree-Dimensional Image Processing (3DIP) and Applications, January 18-19, 2010, San Jose, California, USA
Pages# of pages: 10
Subject3D; Clustering; curvature; curved space; distribution; Euclidian; geodesic distance; retrieval; metric; object; Riemannian
AbstractDistance is a fundamental concept when considering the information retrieval and cluster analysis of 3D information. That is, a large number of information retrieval descriptor comparison and cluster analysis algorithms are built around the very concept of the distance, such as the Mahalanobis or Manhattan distances, between points. Although not always explicitly stated, a significant proportion of these distances are, by nature, Euclidian. This implies that it is assumed that the data distribution, from a geometrical point of view, may be associated with a Euclidian flat space. In this paper, we draw attention to the fact that this association is, in many situations, not appropriate. Rather, the data should often be characterised by a Riemannian curved space. It is shown how to construct such a curved space and how to analyse its geometry from a topological point of view. The paper also illustrates how, in curved space, the distance between two points may be calculated. In addition, the consequences for information retrieval and cluster analysis algorithms are discussed.
Publication date
AffiliationNational Research Council Canada (NRC-CNRC); NRC Institute for Information Technology
Peer reviewedYes
NPARC number15261136
Export citationExport as RIS
Report a correctionReport a correction
Record identifier24795ae2-2941-46d9-984d-32593a604fbc
Record created2010-06-10
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: