RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

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

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

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

    개선된 동적 타임 워핑 알고리즘을 이용한 효율적인 필기문자 감정

    한글로보기

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

    • 0

      상세조회
    • 0

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

    부가정보

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

    In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular projection method to input handwritten strings and extracts their representative features including shape, directions, etc. It then calculates the similarity between two character strings by using an improved dynamic time warping (DTW) algorithm. We improved the conventional DTW algorithm efficiently through adopting the branch-and-bound policy to the existing DTW algorithm which is well-known to produce good results in the various optimization problems. The experimental results to verify the performance of the proposed system show that the suggested handwritten character verification method operates more efficiently than the existing DTW and DDTW algorithms in terms of the speed.
    번역하기

    In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular pr...

    In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular projection method to input handwritten strings and extracts their representative features including shape, directions, etc. It then calculates the similarity between two character strings by using an improved dynamic time warping (DTW) algorithm. We improved the conventional DTW algorithm efficiently through adopting the branch-and-bound policy to the existing DTW algorithm which is well-known to produce good results in the various optimization problems. The experimental results to verify the performance of the proposed system show that the suggested handwritten character verification method operates more efficiently than the existing DTW and DDTW algorithms in terms of the speed.

    더보기

    참고문헌 (Reference)

    1 김계영, "지역특징과 지역특징을 통한 필기문자열의 품질평가시스템" 한국인터넷정보학회 5 (5): 121-128, 2004

    2 B.Fang,, "Off-Line Signature Verification by the Tracking of Feature and Stroke Positions" 36 (36): 91-101, 2003

    3 Kai Huang, "Off-Line Signature Verification Using Structural Feature Correspondence" 35 (35): 2467-2477, 2002

    4 Alan McCab, "Hidden Markov Modeling with Simple Directional Features for Effective and Efficient Handwriting Verification" 5 (5): 216-219, 1988

    5 L.Rabiner, "Fundamentals of Speech Recognition" Prentice Hall 1993

    6 Eamonn J. Keogh, "Derivative Dynamic Time Warping" 1-11, 2001

    7 L.G.Mitten, "Branch-and-Bound Methods:General Formulation and Properties" 18 : 24-34, 1970

    8 Basabi Chakraborty, "A New Feature Extraction Technique for On-line Recognition of Handwritten Alphanumeric Characters" 148 (148): 55-70, 2002

    9 Edson J.R.Justino, "A Comparison of SVM and HMM Classifiers in the Off-Line Signature Verification" 26 (26): 1377-1485, 2005

    10 Marc Parizeau a, "A Comparative Analysis of Regional Correlation,Dynamic Time Warping,and Skeletal Tree Matching for Signature Verification" 12 (12): 710-717, 1990

    1 김계영, "지역특징과 지역특징을 통한 필기문자열의 품질평가시스템" 한국인터넷정보학회 5 (5): 121-128, 2004

    2 B.Fang,, "Off-Line Signature Verification by the Tracking of Feature and Stroke Positions" 36 (36): 91-101, 2003

    3 Kai Huang, "Off-Line Signature Verification Using Structural Feature Correspondence" 35 (35): 2467-2477, 2002

    4 Alan McCab, "Hidden Markov Modeling with Simple Directional Features for Effective and Efficient Handwriting Verification" 5 (5): 216-219, 1988

    5 L.Rabiner, "Fundamentals of Speech Recognition" Prentice Hall 1993

    6 Eamonn J. Keogh, "Derivative Dynamic Time Warping" 1-11, 2001

    7 L.G.Mitten, "Branch-and-Bound Methods:General Formulation and Properties" 18 : 24-34, 1970

    8 Basabi Chakraborty, "A New Feature Extraction Technique for On-line Recognition of Handwritten Alphanumeric Characters" 148 (148): 55-70, 2002

    9 Edson J.R.Justino, "A Comparison of SVM and HMM Classifiers in the Off-Line Signature Verification" 26 (26): 1377-1485, 2005

    10 Marc Parizeau a, "A Comparative Analysis of Regional Correlation,Dynamic Time Warping,and Skeletal Tree Matching for Signature Verification" 12 (12): 710-717, 1990

    더보기

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

    동일학술지 더보기

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

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

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2026 평가 재인증평가 신청대상 (재인증)
    2020-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2017-01-01 등재 등재학술지 유지 (계속평가) KCI등재
    2013-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2010-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2007-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    2006-01-01 등재 등재후보 1차 PASS (등재후보1차) KCI등재후보
    2004-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.44 0.44 0.44
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.43 0.38 0.58 0.15
    더보기

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

    나만을 위한 추천자료

    해외이동버튼