earticle

논문검색

Grassfire Spot Matching Algorithm in 2-DE

초록

영어

Grassfire method for spot matching is proposed based on similarity comparison of topological patterns for neighbor spots. Grassfire method is an algorithm where spot matching is performed as if fire spreads all around on grass. Spot matching starts from a seed spot pair confirmed as a matched pair of spots and spot matching spreads to the direction where the best matching result is produced. In this paper, the simple type of grassfire method where a seed spot pair is manually selected and spot matching is conducted under the circumstances without outlier spots is studied to examine the potential of grassfire method. The proposed method outperforms matching methods by random combination of spots in terms of speed and accuracy.

목차

Abstract
 1. Introduction
 2. Definition
 3. Spot Matching using Grassfire Method
  3.1. Topological Transform of Neighbor Spots
  3.2. Evaluation of similarity for topological patterns of neighbor spots
  3.3. Grassfire Method
 4. Experiment and Results
 5. Conclusion
 References

저자정보

  • Yun-Kyoo Ryoo Department of Medical Computer Science, Daegu Health College
  • Chan-Myeong Han Department of Computer Engineering, Yeungnam University
  • Ja-Hyo Ku Department of Computer Engineering, Kyungwoon University
  • Dae-Seong Jeoune Department of Media Design, Daegu Future Colleage
  • Young-Woo Yoon Department of Computer Engineering, Yeungnam University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.