Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/68174
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | - |
dc.creator | Ren, JC | - |
dc.creator | Zhao, RC | - |
dc.creator | Feng, DD | - |
dc.date.accessioned | 2017-07-27T08:35:47Z | - |
dc.date.available | 2017-07-27T08:35:47Z | - |
dc.identifier.issn | 0372-2112 | - |
dc.identifier.uri | http://hdl.handle.net/10397/68174 | - |
dc.language.iso | zh | en_US |
dc.publisher | 中國電子學會 | en_US |
dc.rights | © 2002 中国学术期刊电子杂志出版社。本内容的使用仅限于教育、科研之目的。 | en_US |
dc.rights | © 2002 China Academic Journal Electronic Publishing House. It is to be used strictly for educational and research purposes. | en_US |
dc.subject | Critical point detection | en_US |
dc.subject | Directional pixel length (DPL) | en_US |
dc.subject | Line judgment | en_US |
dc.subject | Leaning line | en_US |
dc.title | A new effective method on critical point detection of planar curves | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 640 | - |
dc.identifier.epage | 642 | - |
dc.identifier.volume | 30 | - |
dc.identifier.issue | 5 | - |
dcterms.abstract | 平面曲线的关键点检测可用于数字曲线的直线段逼近 ,因此在很多图像识别、测量及分析的场合均有重要应用 .由于一般的数字直线均为若干连续的水平、垂直、± 4 5°夹角直线段合成 ,称之为四个基本方向 ,并将每个基本方向的最大直线段长度定义为其方向象素长度 (directionalpixellength ,DPL) .提出了四个定理 ,证明了在相互垂直方向上的DPL不会同时超过 1个象素 ,而 4 5°夹角方向上DPL不会同时超过 2个象素 .在此基础上 ,提出并设计了一种全自动关键点检测算法 .通过和现有典型算法的实验对比 , 验证了该方法在减少关键点数和时空开销方面的显著优势. | - |
dcterms.abstract | Critical point detection (CPD) of planar curves can be well applied in approaching of curves using poly lines,which has very important applications in image recognition,measurement and analysis.As digital lines are commonly composed by several continuous short lines,which are horizontal (k is 0),vertical (k is 1) and ±45°(k is ±1) lines.We call these four lines basic lines and define the maximum length of every basic line as corresponded directional pixel length (DPL),which are further denoted as Lx,Ly,L+ and L .Furthermore,four theorems on DPL are proposed,based on which,an automatic algorithm for CPD is also presented.The comparisons of algorithms from Ansari Huang,Zhu Chirlian and ours was showed.The satisfactory experimental results have demonstrated that our algorithm has apparent advantages in reducing critical point number and spatial temporal spending. | - |
dcterms.accessRights | open access | en_US |
dcterms.alternative | 一种有效的平面曲线关键点检测新方法 | - |
dcterms.bibliographicCitation | 電子學報 (Acta electronica sinica), 2002, v. 30, no. 5, p. 640-642 | - |
dcterms.isPartOf | 電子學報 (Acta electronica sinica) | - |
dcterms.issued | 2002 | - |
dc.identifier.rosgroupid | r07581 | - |
dc.description.ros | 2001-2002 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
dc.description.oaCategory | VoR allowed | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
r07581.pdf | 121.67 kB | Adobe PDF | View/Open |
Page views
295
Last Week
0
0
Last month
Citations as of Oct 13, 2024
Downloads
94
Citations as of Oct 13, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.