Polygonal Paths Comparison and Application
碩士 === 國立交通大學 === 資訊科學系 === 89 === The problem of polygonal paths comparison is an important task in computer vision and pattern recognition. In this thesis we present a method that determine the similarity of curves or contours in two-dimension space. The polygonal path is converted to...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81990701529509679109 |
Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 89 === The problem of polygonal paths comparison is an important task in computer vision and pattern recognition. In this thesis we present a method that determine the similarity of curves or contours in two-dimension space. The polygonal path is converted to a chain code. The similarity of contours is obtained using dynamic programming method to match the longest common subsequence. The matching technique is applied to match the lanes in the Pulsed-Field Gel Electrophoresis Image.
|
---|