本文討論了在給定數(shù)字輪廓線(xiàn)頂點(diǎn)數(shù)目為N 的情況下，從其上選擇k 個(gè)點(diǎn)來(lái)構(gòu)造擬和
多邊形來(lái)近似原圖，使得物體輪廓線(xiàn)的形狀丟失最小。本文的貢獻(xiàn)在于1)本文的輪廓線(xiàn)擬和是以物體輪廓線(xiàn)的形狀的信息丟失最小為目標(biāo)的。而傳統(tǒng)的方法是以擬和多邊形和原圖的面積差距最小。2）本文認(rèn)為每一個(gè)點(diǎn)具有一定的形狀信息，然后建立了一個(gè)以丟失的形狀信息最小的0-1 規(guī)劃模型; 3)使用了兩種方法對(duì)輪廓線(xiàn)進(jìn)行了多邊形擬合，并把兩個(gè)結(jié)果進(jìn)行了比較。
關(guān)鍵詞： 初始輪廓線(xiàn); 信息論;0-1 規(guī)劃模型 動(dòng)態(tài)規(guī)劃
Abstract: This paper presents the problem of polygonal approximation of digitized outlines in
which k polygonal is constructed by selecting k vertexes from original outlines so that the lost
shape information of outline could be minimized. The contributions of this paper are 1) The
polygonal approximation here targets to minimized the lost shape information rather than the lost area information which is used in traditional way; 2) A 0-1 mathematical model which targets to minimize the lost shape information is build, since each vertex in the outline represents the shape information; 3) Last, two means are used to approximate the digitized outline and the results are compared.
Keywords: outline; 0-1 programming model; dynamic programming