講 題
主講人
Context, Computation, and
Asymptotic ROC Performance in Hierarchical Models
張洛賓
教授
(交通大學應用數學系)
101 年 10 月 23 日(星期二)13:30-14:30
時
間
地
點 一研 102 演講廳
摘
要
Under any reasonable formulation, the vision problem is provably
NP-hard. So are many other problems from biological systems, e.g.
protein folding and neuron signal transmission. The nature handles these
problems routinely, but how does the nature compute? One of the
common problems is the combinatorial complexity. In this talk, I will
propose a probabilistic combinatorial formulation, and focus on vision as
an example. I will provide some asymptotic theorems based on extensions
of large-deviation theory. Through the asymptotic analysis, and our
recognition experiments, I will argue that essentially optimal performance
can be attained through a computationally feasible sequential decision
analysis.
 更詳資料請參考http://www.fmath.pu.edu.tw/
 交通資訊查詢 http://www.pu.edu.tw/chi/pu_glt.php
Website:
http://www.fmath.pu.edu.tw/
臺中市沙鹿區臺灣大道 7 段 200 號
靜宜大學財務與計算數學系敬邀
聯絡人:
彭栢堅 [email protected]
TEL:04-26328001ext 15160
林素慧 [email protected]
TEL: 04-26328001ext 15013
FAX:04-26324653