RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      넒이우선탐색에 의한 이진영상의 거리변환 = A Distance Transformation in Binary Images Using Breadth First Search Strategy

      한글로보기

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

      • 0

        상세조회
      • 0

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

      부가정보

      다국어 초록 (Multilingual Abstract)

      The distance transformation converts a binary image, consisting of feature and non-feature pixels, into an image where all feature pixels have a value corresponding to the distance to the nearest non-feature pixel. In this paper, we propose a method of distance transformation of digital pictures by means of the breadth first search strategy which is the simplest problem solving method in artificial intelligence.
      First of all, it is shown that only two strategies which are uniform cost search and breadth first search are available for the computing of distance transformation among various search strategies. Also, it is shown experimentally that breadth first search is as efficient as uniform cost search in the transformation. The ground is based on the observation that the computation at pixels near the reference set must be performed before computing at pixels further away.
      번역하기

      The distance transformation converts a binary image, consisting of feature and non-feature pixels, into an image where all feature pixels have a value corresponding to the distance to the nearest non-feature pixel. In this paper, we propose a method o...

      The distance transformation converts a binary image, consisting of feature and non-feature pixels, into an image where all feature pixels have a value corresponding to the distance to the nearest non-feature pixel. In this paper, we propose a method of distance transformation of digital pictures by means of the breadth first search strategy which is the simplest problem solving method in artificial intelligence.
      First of all, it is shown that only two strategies which are uniform cost search and breadth first search are available for the computing of distance transformation among various search strategies. Also, it is shown experimentally that breadth first search is as efficient as uniform cost search in the transformation. The ground is based on the observation that the computation at pixels near the reference set must be performed before computing at pixels further away.

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

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

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

      나만을 위한 추천자료

      해외이동버튼