RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

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

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

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기

    블록비교를 이용한 프렉탈 영상 압축의 계층적 해석에 관한 연구 = A Study on Hierarchical Interpetation of Fractal Image Compression By Block Comparison

    한글로보기

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

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수
    인용문이 복사되었습니다.

    부가정보

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

    This paper present a model and experimental results, in fractal image compression using quadtree partition. Fractal coding offers superior runtime performance, but suffers from the problem of long search time in the domain block pool. The output of the coder in fractals compression is IFS, and it is using for feature classification to speeding up the coding time. The encoding of IFS that is continuous blocks iteratively recombined. Before, Original image is devide into regular size called the Range block and A domain block size is double of range block. Here domain and range block consist of a collection for small size partition using fractal image compression. Each connected sets of small square image blocks, of which is a neighbor partitioning with a fractal code. They are selected for which except random neighoboring domain and range block on a fitness criterion. This approach showed as compared to quad tree partition.
    번역하기

    This paper present a model and experimental results, in fractal image compression using quadtree partition. Fractal coding offers superior runtime performance, but suffers from the problem of long search time in the domain block pool. The output of th...

    This paper present a model and experimental results, in fractal image compression using quadtree partition. Fractal coding offers superior runtime performance, but suffers from the problem of long search time in the domain block pool. The output of the coder in fractals compression is IFS, and it is using for feature classification to speeding up the coding time. The encoding of IFS that is continuous blocks iteratively recombined. Before, Original image is devide into regular size called the Range block and A domain block size is double of range block. Here domain and range block consist of a collection for small size partition using fractal image compression. Each connected sets of small square image blocks, of which is a neighbor partitioning with a fractal code. They are selected for which except random neighoboring domain and range block on a fitness criterion. This approach showed as compared to quad tree partition.

    더보기

    목차 (Table of Contents)

    • Ⅰ. 서론
    • Ⅱ. 이론
    • 1. 화상 처리
    • 2. 3차원 좌표 계산
    • 3. 변형률 계산
    • Ⅰ. 서론
    • Ⅱ. 이론
    • 1. 화상 처리
    • 2. 3차원 좌표 계산
    • 3. 변형률 계산
    • Ⅲ. 카메라 보정
    • Ⅳ. 측정 실험
    • Ⅴ. 결론
    • 참고문헌
    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

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

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

    나만을 위한 추천자료

    해외이동버튼