| Project/Area Number |
06680334
|
|---|
| Research Category |
Grant-in-Aid for General Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | OSAKA ELECTRO-COMMUNICATION UNIVERSITY |
|---|
Principal Investigator |
ASANO Tetsuo OSAKA ELECTRO-COMMUNICATION UNIVERSITY,DEPARTMENT OF ENGINEERING INFORMATICS,PROFESSOR, 情報工学部, 教授 (90113133)
|
|---|
| Project Period (FY) |
1994 – 1995
|
| Project Status |
Completed (Fiscal Year 1995)
|
| Budget Amount *help |
¥2,200,000 (Direct Cost: ¥2,200,000)
Fiscal Year 1995: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1994: ¥1,500,000 (Direct Cost: ¥1,500,000)
|
|---|
| Keywords | Computational Geometry / Pattern recognition / Algorithms / Digital lines and curves / Hough transform / 直線検出 |
|---|
| Research Abstract |
The problem of detecting all digital line components contained in a black-white image is one of the most fundamental problems in pattern recognition. In this study we have developed efficient algorithms for detecting all of digital line components. We also developed space-efficient algorithms for detecting all of digital curve components. This is the first linear-space algorithm for the purpose for detecting curve components and in addition the first to define a family of digital curves using least possible number of parameters. More concretely, key ideas are duality transform between points and lines and efficient search in an arrangment of lines. One advantage of the proposed algorithms to be distinguished from the existing ones is that they can detect all possible line and curve components satisfying the conditions without missing one. We also analyzed the computational complexity of the problem itself and algorithms to establish the optimality of the proposed algorithms. Experimental results show the practical usefullness and effectiveness of the proposed methods.
|
