Earticle

초록

영어

This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.

목차

Abstract
 Ⅰ. Introduction
 Ⅱ. Prior Work
 Ⅲ. Proposed Idea/Algorithm
  1. Line Detection
  2. Corner detection
  3. Feature Extraction
 Ⅳ. Experimental Results
 Ⅴ. Performance Evaluation
 Ⅵ. Conclusion
 References

키워드

저자

• Ahmad Nishat [ 조선대학교 정보통신공학과 박사과정 ] 주저자
• 안영은 [ Young-Eun An | 조선대학교 정보통신공학과 박사과정 ] 공저자
• 박종안 [ Jong-An Park | 조선대학교 정보통신공학부 교수 ] 교신저자

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  한국ITS학회논문지 [The Journal of The Korean Society of Intelligent Transport Systems]

• 간기

  격월간

• pISSN

  1738-0774

• eISSN

  2384-1729

• 수록기간

  2003~2026

• 등재여부

  KCI 등재

• 십진분류

  KDC 326 DDC 338