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

DOI

10.2991/iccsee.2013.91How to use a DOI?

Keywords

Fingertip Detection , Webbed point Detection,K-vector Algorithm, K-medoids Clustering Algorithm

Abstract

The paper presents a calculation method to get the probable fingertips and webbed points in outline. First, use K-vectoe 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.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hong Duan
AU  - Kunyu Cai
PY  - 2013/03
DA  - 2013/03
TI  - A Fingertip and Webbed Point Detection Method Based on K-vector and K-medoids Clustering Algorithm
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 358
EP  - 360
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.91
DO  - 10.2991/iccsee.2013.91
ID  - Duan2013/03
ER  -