Presentation 2010-01-21
An Algorithm for Getting Border Points lying in Euclidean Space
Fumiya KOBAYASHI, Toshinori WATANABE, Hisashi KOGA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Given a set of points S, we call its outer border points as a border points set B. For convex S, it is easy to get B by choosing points each of which has the biggest projection to randomly chosen vectors. However, this is not the case for non convex S. In this paper, we propose a method that partitions the S into subsets each of which has enhanced convexity and gathers border points of them to get B. Probabilistic LSH-like searching scheme is also adapted to reduce computation cost.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Information Classification / Information Retrieval / Feature Space / Clustering / LSH
Paper # CQ2009-72,PRMU2009-171,SP2009-112,MVE2009-94
Date of Issue

Conference Information
Committee MVE
Conference Date 2010/1/14(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Media Experience and Virtual Environment (MVE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Algorithm for Getting Border Points lying in Euclidean Space
Sub Title (in English)
Keyword(1) Information Classification
Keyword(2) Information Retrieval
Keyword(3) Feature Space
Keyword(4) Clustering
Keyword(5) LSH
1st Author's Name Fumiya KOBAYASHI
1st Author's Affiliation Graduate School of Information Systems, University of Electro-Communications()
2nd Author's Name Toshinori WATANABE
2nd Author's Affiliation Graduate School of Information Systems, University of Electro-Communications
3rd Author's Name Hisashi KOGA
3rd Author's Affiliation Graduate School of Information Systems, University of Electro-Communications
Date 2010-01-21
Paper # CQ2009-72,PRMU2009-171,SP2009-112,MVE2009-94
Volume (vol) vol.109
Number (no) 376
Page pp.pp.-
#Pages 6
Date of Issue