204 0

Medoid selection from sub-tree leaf nodes for k-medoid clustering-based hierarchical template tree construction

Title
Medoid selection from sub-tree leaf nodes for k-medoid clustering-based hierarchical template tree construction
Author
정호기
Keywords
Contour detection; K-medoid; K-medoid clustering algorithms; Medoids; Sub trees; Tree construction; Clustering algorithms; Iterative methods
Issue Date
2013-02
Publisher
IET
Citation
Electronics Letters, Jan 2013, 49(2), P.108-109
Abstract
A method to construct a hierarchical template tree for pedestrian contour detection by iteratively applying a k-medoid clustering algorithm from the lowest level to the highest level was recently proposed and received much attention. Analysed here is the limitation of the method using lower level medoids as points of the next higher level, and proposed is a method of selecting a medoid from the leaf nodes of sub-trees corresponding to the lower level medoids.
URI
http://ieeexplore.ieee.org/document/6420080/http://hdl.handle.net/20.500.11754/44077
ISSN
0013-5194
DOI
10.1049/el.2012.3288
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > AUTOMOTIVE ENGINEERING(미래자동차공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE