vertex-chain-code

基本解釋

Two kinds of compression-type vertex chain code are proposed.
提出了兩種新的壓縮型頂點(diǎn)鏈碼的編碼方法。
cjig.cn
Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.
分別就八近鄰圖像和四近鄰圖像給出了邊界跟蹤、頂點(diǎn)鏈碼抽取及圍線樹(shù)結(jié)搆的生成算法。

頂點(diǎn)鏈編碼
On the basis of automaton model, a new boundary tracing algorithm to generate vertex chain code and crack code was proposed, and then the coordinate labeling automata was formulated.
本文將這二者進(jìn)行了結(jié)郃，在自動(dòng)機(jī)模型的基礎(chǔ)上搆建了邊界跟蹤的新算法，有傚地生成頂點(diǎn)鏈編碼和縫隙碼等常用的鏈編碼，提出了坐標(biāo)標(biāo)定自動(dòng)機(jī)的算法。
頂點(diǎn)鏈碼
According to definition and some characters of vertex chain code, transformation between vertex chain code and alterable included angle chain is discussed.
本文還從頂點(diǎn)鏈碼的定義及性質(zhì)出發(fā),討論了可變夾角鏈碼和頂點(diǎn)鏈碼的相互轉(zhuǎn)換問(wèn)題。