Algorithms, Computational Geometry, Databases, Data Mining and Web Mining
Current WorkShape Matching : Given two sets of points that represent two different shapes(say two different brain scans), we do shape matching to compare the two different shapes and match them by minimizing the distance between them under translations. We can match them by keeping one of the point set fixed and translating the other point set to match the first one such that the distance between the two shapes is minimized. The calculation of this distance function is expensive and our goal is to design efficient algorithms to speedup the distance calculation for efficient shape matching.
Submitted a paper for the Fall Workshop on Computational Geometry '09 and waiting for the result