• 제목/요약/키워드: 이진체

검색결과 452건 처리시간 0.024초

A Study on the Recognition of Handwritten Mixed Documents (필기체 혼합 문서 인식에 관한 연구)

  • 심동규;김인권;함영국;박래홍;이창범;김상중;윤병남
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제19권6호
    • /
    • pp.1126-1139
    • /
    • 1994
  • This paper proposes an effective recognition system which recognizes the mixed document consisting of handwritten korean/alphanumeric texts and graphic images. In the preprocessing step, an input image is binarized by the proposed thresholding scheme, then graphic and character regions are separated by using connected components and chain codes. Separated Korean characters are merged based on partial recognition and their character types and sized. In the character recognition step, we use the branch and bound algorithm based on DP matching costs to recognize Korean characters. Also we recognize alphanumeric characters using several robust features. Finally we use a dictionary and information of a recognition step to correct wrong recognition results. Computer simulation with several test documents shows what the proposed algorithm recognized effectively handwritten mixed texts.

  • PDF

Computing Method of Cross-Correlation of Non-Linear Sequences Using Subfield (부분체를 이용한 비선형 수열의 상호상관관계의 효율적인 계산방법)

  • Choi, Un-Sook;Cho, Sung-Jin;Kim, Seok-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제16권8호
    • /
    • pp.1686-1692
    • /
    • 2012
  • Spreading sequence play an important role in wireless communications, such as in a CDMA(code division multiple access) communication system and multi-carrier spectrum communication system. Spreading sequences with low cross-correlation, in a direct-sequence spread spectrum communication system, help to minimize multiple access interference and to increase security degree of system. Analysis of cross-correlations between the sequences is a necessary process to design sequences. However it require lots of computing time for analysis of cross-correlations between sequences. In this paper we propose a method which is possible to compute effectively cross-correlation using subfield in the process of practical computation of cross-correlation between nonlinear binary sequences.

Y2MoO6:RE3+(RE=Eu, Sm) 형광체 분말의 제조 및 특성

  • Lee, Jin-Hong;Jo, Sin-Ho
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 한국진공학회 2015년도 제49회 하계 정기학술대회 초록집
    • /
    • pp.164-164
    • /
    • 2015
  • 최근에 고효율의 적색 발광체를 개발하고자 무기물 모체에 다양한 활성제 이온을 주입하는 연구가 상당한 관심을 끌고 있다. 본 연구에서는 발광 효율이 높은 적색 형광체 분말을 제조하고자 두 종류의 활성제 이온 $Eu^{3+}$$Sm^{3+}$가 도핑된 $Y_2MoO_6$형광체 분말을 고체상태 반응법을 사용하여 전기로에서 $400^{\circ}C$에서 하소와 $1100^{\circ}C$에서 소결공정을 통하여 제조하였다. 활성제 이온의 몰 비에 따른 적색 형광체의 결정 구조, 발광과 흡광 스펙트럼을 조사하였다. 파장 299 nm로 여기 시킨 $Y_2MoO_6:Eu^{3+}$ 경우, 발광 세기가 가장 강한 611 nm의 주 피크를 방출하는 적색 스펙트럼이 관측되었으며, 함량이 0.01 mol에 0.2 mol로 증가함에 따라 611 nm의 주 적색 발광 스펙트럼의 세기가 증가하는 경향을 나타내었다. 파장 611 nm로 제어한 흡광 스펙트럼은 299 nm에 피크를 갖는 전하전달밴드 (CTB) 이었다 [그림 참조].

  • PDF

A Design of Point Scalar Multiplier for Binary Edwards Curves Cryptography (이진 에드워즈 곡선 암호를 위한 점 스칼라 곱셈기 설계)

  • Kim, Min-Ju;Jeong, Young-Su;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제26권8호
    • /
    • pp.1172-1179
    • /
    • 2022
  • This paper describes a design of point scalar multiplier for public-key cryptography based on binary Edwards curves (BEdC). For efficient implementation of point addition (PA) and point doubling (PD) on BEdC, projective coordinate was adopted for finite field arithmetic, and computational performance was improved because only one inversion was involved in point scalar multiplication (PSM). By applying optimizations to hardware design, the storage and arithmetic steps for finite field arithmetic in PA and PD were reduced by approximately 40%. We designed two types of point scalar multipliers for BEdC, Type-I uses one 257-b×257-b binary multiplier and Type-II uses eight 32-b×32-b binary multipliers. Type-II design uses 65% less LUTs compared to Type-I, but it was evaluated that it took about 3.5 times the PSM computation time when operating with 240 MHz. Therefore, the BEdC crypto core of Type-I is suitable for applications requiring high-performance, and Type-II structure is suitable for applications with limited resources.

A Study on Binarization of Handwritten Character Image (필기체 문자 영상의 이진화에 관한 연구)

  • 최영규;이상범
    • Journal of the Korea Computer Industry Society
    • /
    • 제3권5호
    • /
    • pp.575-584
    • /
    • 2002
  • On-line handwritten character recognition be achieved successful results since effectively neural networks divided the letter which is the time ordering of strokes and stroke position. But off-line handwritten character recognition is in difficulty of incomplete preprocessing because has not information of motion or time and has frequently overlap of the letter and many noise occurrence. consequently off-line handwritten character recognition needs study of various methods. This paper apply watershed algorithm to preprocessing for off-line handwritten hangul character recognition. This paper presents effective method in four steps in watershed algorithm as consider execution time of watershed algorithm and quality of result image. As apply watershed algorithm with effective structure to preprocessing, can get to the good result of image enhancement and binarization. In this experiment, this paper is estimate the previous method with this paper method for execution time and quality in image. Average execution time on the previous method is 2.16 second and Average execution time on this paper method is 1.72 second. While this paper method is remove noise effectively with overlap stroke, the previous method does not seem to be remove noise effectively with overlap stroke.

  • PDF