Hee-Kap Ahn

Dr. Hee-Kap Ahn

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2004 in Theoretical Computer Science
Verified
Journal Article
Closed access
HAHee-Kap Ahn
Hee-Kap Ahn
SCSiu-Wing Cheng
Siu-Wing Cheng
OCOtfried Cheong
Otfried Cheong
MGMordecai Golin
Mordecai Golin
RORené van Oostrum
René van Oostrum

1 July 2002 in Computer-Aided Design
Verified
Journal Article
Closed access
HAHee-Kap Ahn
Hee-Kap Ahn
MBMark de Berg
Mark de Berg
PBProsenjit Bose
Prosenjit Bose
SCSiu-Wing Cheng
Siu-Wing Cheng
DHDan Halperin
Dan Halperin
OSOtfried Schwarzkopf
Otfried Schwarzkopf

11 July 2016 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
HAHee-Kap Ahn
Hee-Kap Ahn
LBLuis Barba
Luis Barba
PBProsenjit Bose
Prosenjit Bose
JCJean-Lou De Carufel
Jean-Lou De Carufel
MKMatias Korman
Matias Korman
EOEunjin Oh
Eunjin Oh

1 June 2012
Verified
Conference Paper
Closed access
YHYoonho Hwang
Yoonho Hwang
BHBohyung Han
Bohyung Han
HAHee-Kap Ahn
Hee-Kap Ahn
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for large-scale computer vision problems. We embed data points nonlinearly onto a low-dimensional space by simple computations and prove that the distance between two points in the embedded space is bounded by the distance in the original space. Instead of computing the distances in the high-dimensional original space to find the nearest neighbor, a lot of candidates are to be rejected based on the distances in the low-dimensional embedded space; due to this property, our algorithm is well-suited for high-dimensional and large-scale problems. We also show that our algorithm is improved further by partitioning input vectors recursively. Contrary to most of existing fast nearest neighbor search algorithms, our technique reports the exact nearest neighbor - not an approximate one - and requires a very simple preprocessing with no sophisticated data structures. We provide the theoretical analysis of our algorithm and evaluate its performance in synthetic and real data.

1 January 2009
Verified
Book Chapter
Closed access
PDF file
WSWanbin Son
Wanbin Son
MLMu-Woong Lee
Mu-Woong Lee
HAHee-Kap Ahn
Hee-Kap Ahn
SHSeung-Won Hwang
Seung-Won Hwang

1 March 2014 in Information Systems
Verified
Journal Article
Closed access
WSWanbin Son
Wanbin Son
SHSeung-Won Hwang
Seung-Won Hwang
HAHee-Kap Ahn
Hee-Kap Ahn