| 標題主旨 |
講題: Possibilistic Shell Clustering of Template-Based Shapes
演講者：王才沛 (交通大學資訊工程學系)
Abstract:
In this talk, we present a new type of alternating optimization-
based possibilistic c-shell algorithm for clustering template-
based shapes. A cluster prototype consists of a copy of the
template after translation, scaling, rotation, and/or affine transformations.
This extends the capability of shell clustering beyond a
few standard geometrical shapes that have been in the literature
so far. We use a number of 2-D datasets, consisting of both synthetic
and real-world images, to illustrate the capability of our
algorithm in detecting generic-template-based shapes in images.
We also describe a progressive clustering procedure aimed to relax
the requirements for a known number of clusters and good initialization,
as well as new performance measures of shell-clustering
algorithms.
時間：2010年09月28日(星期二) 14：00 ∼ 16：00
地點：推廣大樓3樓9313室
<< 歡迎 老師,同學 踴躍參與!! >>
|
