RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      Scale Invariant Feature Transform의 연산과 응용을 실제시간에 수행

      한글로보기

      https://www.riss.kr/link?id=T11614055

      • 저자
      • 발행사항

        울산 : 울산대학교 대학원, 2009

      • 학위논문사항

        Thesis(Master) -- 울산대학교 대학원 , 컴퓨터정보통신공학과 컴퓨터공학 전공

      • 발행연도

        2009

      • 작성언어

        영어

      • 발행국(도시)

        대한민국

      • 형태사항

        ⅶ, 47 p. ; 26cm

      • 일반주기명

        지도교수:이종수

      • 소장기관
        • 울산대학교 도서관 소장기관정보
      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

      Noways,image matching is used to solve many problem in computer vision, including object or scene recogniton,3D structure from multiple images, stereo correspondence, and motion tracking. In recent years, an approach has been proposed to generate a set of image features.This approach has been named the Scale Invariant Feature Transform;it transforms image data into scale-invariant coordinates relative to local features. The SIFT algorithm combines a scale invariant region detector and a descriptor based on the gradient distribution in the detected regions. The descriptor is presented by a 3D histogram of gradient locations and orientations. Those descriptors(local features)are very distinctive and invariant for image scaling or rotation.SIFT keypoint is used in many object recognition applications because of this propery.
      However, SIFT algorithm is a complex algorithm. To apply SIFT in multimedia applications, it is necessary to find a scheme to implement the algorithm in real-time.
      In this thesis, I used a parallel approach to implement the SIFT algorithm. In my implementation,a single instruction stream multiple data stream pixel processor is used. By using the SIMD pixel processor system,the available parallelism of the SIFT algorithm can be exposed fully.Major results showed that we can apply this new approach to implement the SIFT algorithm in real-time.
      번역하기

      Noways,image matching is used to solve many problem in computer vision, including object or scene recogniton,3D structure from multiple images, stereo correspondence, and motion tracking. In recent years, an approach has been proposed to generate a se...

      Noways,image matching is used to solve many problem in computer vision, including object or scene recogniton,3D structure from multiple images, stereo correspondence, and motion tracking. In recent years, an approach has been proposed to generate a set of image features.This approach has been named the Scale Invariant Feature Transform;it transforms image data into scale-invariant coordinates relative to local features. The SIFT algorithm combines a scale invariant region detector and a descriptor based on the gradient distribution in the detected regions. The descriptor is presented by a 3D histogram of gradient locations and orientations. Those descriptors(local features)are very distinctive and invariant for image scaling or rotation.SIFT keypoint is used in many object recognition applications because of this propery.
      However, SIFT algorithm is a complex algorithm. To apply SIFT in multimedia applications, it is necessary to find a scheme to implement the algorithm in real-time.
      In this thesis, I used a parallel approach to implement the SIFT algorithm. In my implementation,a single instruction stream multiple data stream pixel processor is used. By using the SIMD pixel processor system,the available parallelism of the SIFT algorithm can be exposed fully.Major results showed that we can apply this new approach to implement the SIFT algorithm in real-time.

      더보기

      목차 (Table of Contents)

      • CHAPTER 1 INTRODUCTION = 1
      • 1.1 Problem Overview = 1
      • 1.2 Thesis Objective = 3
      • 1.3 Thesis Outline = 4
      • CHAPTER 2 SIFT ALGORITHM = 5
      • CHAPTER 1 INTRODUCTION = 1
      • 1.1 Problem Overview = 1
      • 1.2 Thesis Objective = 3
      • 1.3 Thesis Outline = 4
      • CHAPTER 2 SIFT ALGORITHM = 5
      • 2.1. SIFT Algorithm Description = 5
      • 2.1.1. Detection of scale-space extrema = 6
      • 2.1.2. Local extrema detection = 9
      • 2.1.3. Accurate keypoint localization = 10
      • 2.1.4. Eliminating edge responses = 12
      • 2.1.5. Orientation assignment = 14
      • 2.1.6. The local image descriptor = 16
      • 2.1.7. Descriptor representation = 16
      • 2.2. SIFT Evaluation = 19
      • 2.3. Applications in multimedia = 20
      • 2.3.1. Object recognition using SIFT features = 20
      • 2.3.2. Robot localization and mapping = 21
      • 2.3.3. Panorama stitching = 21
      • 2.3.4. 3D scene modeling, recognition and tracking = 22
      • 2.3.5. 3D SIFT descriptors for human action recognition = 22
      • CHAPTER 3 PREVIOUS WORKS = 24
      • 3.1 PCA-SIFT: A More Distinctive Representation for Local Image Descriptors = 24
      • 3.2 A High Real-Time and Robust Object Recognition and Localization Algorithm = 26
      • 3.3 Fast approximated SIFT = 29
      • CHAPTER 4 IMPLEMENT THE SIFT ALGORITHM IN SIMD PROCESSOR = 33
      • 4.1. SIMD Pixel Processor Architecture = 33
      • 4.2. Implement SIFT algorithm on SIMD Processor = 35
      • CHAPTER 5 PERFORMANCE ANALYSIS = 39
      • CHAPTER 6 CONCLUSIONS = 44
      • REFERENCE = 45
      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼