A Fingertip and Webbed Point Detection Method Based on K-vector and K-medoids Clustering Algorithm

摘要：

　　The paper presents a calculation method to get the probable fingertips and webbed points in outline.First,use K-vectoc to calculate the K-slope of all points in outline and get a series of peak point sets.Then,cluster the peak point sets which have been obstained by K-medoids algorithm and get the location of every fingertips and probable points; At last,distinguish the fingertips and webbed points by vector cross product operation.The experiment shows that this method achieve the precise positionong of the fingertips and finger webbed points.

关键词： Fingertip Detection Webbed point Detection K-vector Algorithm K-medoids Clustering Algorithm

作者: Duan Hong Cai Kunyu

作者单位: Software School of Xiamen University Xiamen city,China

会议类型: 国际会议

会议名称: 2013 2nd International Conference on Computer Science and Electronics Engineering(ICCSEE2013)(2013年第二届计算机科学与电子工程国际会议)

会议地点: 杭州

会议语种:英文

页码: 358-360

在线出版日期: 2013-03-22（万方平台首次上网日期，不代表论文的发表时间）