• Title/Summary/Keyword: Coding Pattern

Search Result 214, Processing Time 0.027 seconds

A Study on Primitive Segments Extraction from Printed Korean Characters by means of a Directional Projection (방향 투영에 의한 인쇄체 한글의 기본 선소 추출에 관한 연구)

  • Kim, Sang-Woon;Lee, Ryeong-Rae;Lee, Gyu-Won;Park, Kyu-Tae
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1100-1103
    • /
    • 1987
  • In this paper, we report a method for the primitive segments extraction from printed Korean characters without thinning as a preliminary stage to design an efficient recognition system. The primitive segments are defined by fundamental subpatterns which are vertical(I), right sloping(/), left. sloping(\). horizontal(-), and circular segment(o). The circular segment among the five kinds of segment is different from the others in geometrical properties. Therefore, at first, the circular segment is extracted by using the closed circle of the inner boundary and the geometrical characteristics of its outer. Next, linear segments are separated from the character pattern by means of a directional coding method. Finally, primitive segments are extracted from each set of linear segments by using a projection profile which involves the fact whether the segment has branches or not. The experimental results show that this method reduces computation time and storage space in comparision with the existing methods.

  • PDF

Pattern generation for coding error detection in VHDL behavioral-level designs (VHDL 행위-레벨 설계의 코딩 오류 검출을 위한 패턴 생성)

  • Kim, Jong Hyeon;Kim, Dong Uk
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.3
    • /
    • pp.31-31
    • /
    • 2001
  • 최근 VHDL 코딩 및 합성방법에 의한 설계가 널리 사용되고 있다. 집적도가 증가함에 따라 VHDL에 의한 설계 또한 그 분량이 증가하여 많은 코딩오류가 발생하고 있으며, 이를 검색하는데 많은 시간과 노력이 소요되고 있다. 본 논문에서는 VHDL 행위-레벨 설계를 대상으로 코딩오류를 검색하는 방법을 제안하였다. 그 방법에 있어서는 검색패턴을 생성하여 오류가 없는 응답과 설계의 응답을 비교함으로써 설계오류를 찾는 방법을 택하였다. 따라서 본 논문에서는 코딩오류를 검색하기 위한 검색패턴을 생성하는 알고리듬을 제안하였다. 검색패턴 생성은 각 코드에 대해 수행하며, 할당오류와 조건오류를 구분하여 수행하였다. 패턴생성을 위해 VHDL 코드를 CDFG로 변환하여 사용하며, CDFG상의 경로를 탐색하여 패턴생성에 필요한 정보를 추출한다. 경로탐색은 오류가 발생하였다고 가정한 지점으로부터 역방향 탐색과 정방향 탐색을 수행하여 패턴을 생성한다. 제안한 알고리듬은 C-언어로 구현하였다. 펜티엄-Ⅱ 400MHz의 환경에서 여러 가지 VHDL 행위-레벨 설계를 대상으로 제안한 알고리듬을 적용하였다. 그 결과, 고려한 모든 설계의 모든 코드에 대한 검색패턴을 생성할 수 있었으며, 가정한 모든 오류를 검색할 수 있었다. 검색패턴 생성에 소요되는 시간은 고려한 모든 대상 설계에서 1초 미만의 CPU 시간을 보여 속도면에서도 매우 우수함을 나타내었다. 따라서 본 논문에서 제안한 검색방법은 VHDL에 의한 설계에서 설계검증에 필요한 시간과 노력을 상당히 감소시킬 것으로 기대된다.

Speech/Mixed Content Signal Classification Based on GMM Using MFCC (MFCC를 이용한 GMM 기반의 음성/혼합 신호 분류)

  • Kim, Ji-Eun;Lee, In-Sung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.185-192
    • /
    • 2013
  • In this paper, proposed to improve the performance of speech and mixed content signal classification using MFCC based on GMM probability model used for the MPEG USAC(Unified Speech and Audio Coding) standard. For effective pattern recognition, the Gaussian mixture model (GMM) probability model is used. For the optimal GMM parameter extraction, we use the expectation maximization (EM) algorithm. The proposed classification algorithm is divided into two significant parts. The first one extracts the optimal parameters for the GMM. The second distinguishes between speech and mixed content signals using MFCC feature parameters. The performance of the proposed classification algorithm shows better results compared to the conventionally implemented USAC scheme.

Signal Detection for Pattern Dependent Noise Channel (신호패턴 종속잡음 채널을 위한 신호검출)

  • Jeon, Tae-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.5
    • /
    • pp.583-586
    • /
    • 2004
  • Transition jitter noise is one of major sources of detection errors in high density recording channels. Implementation complexity of the optimal detector for such channels is high due to the data dependency and correlated nature of the jitter noise. In this paper, two types of hardware efficient sub-optimal detectors are derived by modifying branch metric of Viterbi algorithm and applied to partial response (PR) channels combined with run length limited modulation coding. The additional complexity over the conventional Viterbi algorithm to incorporate the modified branch metric is either a multiplication or an addition for each branch metric in the Viterbi trellis.

Sequencing of the RSDA Gene Encoding Raw Starch-Digesting $\alpha$-Amylase of Bacillus circulans F-2: Identification of Possible Two Domains for Raw Substrate-Adsorption and Substrate-Hydrolysis

  • Kim, Cheorl-Ho
    • Journal of Microbiology and Biotechnology
    • /
    • v.2 no.1
    • /
    • pp.56-65
    • /
    • 1992
  • The complete nucleotide sequence of the Bacillus circulans F-2 RSDA gene, coding for raw starch digesting a-amylase (RSDA), has been determined. The RSDA structure gene consists of an open reading frame of 2508 bp. Six bp upstream of the translational start codon of the RSDA is a typical gram-positive Shine-Dalgarno sequence and the RSDA encodes a preprotein of 836 amino acids with an Mr of 96, 727. The gene was expressed from its own regulatory region in E. coli and two putative consensus promoter sequences were identified upstream of a ribosome binding site and an ATG start codon. Confirmation of the nucleotide sequence was obtained and the signal peptide cleavage site was identified by comparing the predicted amino acid sequence with that derived by N-terminal analysis of the purified RSDA. The deduced N-terminal region of the RSDA conforms to the general pattern for the signal peptides of secreted prokaryotic proteins. The complete amino acid sequence was deduced and homology with other enzymes was compared. The results suggested that the Thr-Ser-rich hinge region and the non-catalytic domain are necessary for efficient adsorption onto raw substrates, and the catalytic domain (60 kDa) is necessary for the hydrolysis of substrates, as suggested in previous studies (8, 9).

  • PDF

Motion Compensation by Affine Transform using Polygonal Matching Algorithm (다각형 정합 알고리듬을 이용한 affine 변환 움직임 보상)

  • Park, Hyo-Seok;Hwang, Chan-Sik
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.1
    • /
    • pp.60-69
    • /
    • 1999
  • Motion compensation by affine transform has been proposed as a solution to the artifact problems in very low bit rate video coding and a HMA(Hexagoanl Matching Algorithm) has been proposed for refine motions estimation. When dividing images with an affine transform, as image objects do not necessarily conform to triangle patterns. In this paper we propose a method that first divides an image into triangular patches according to its edge information and then further divides the image into more detailed triangular patches where more complicated edge information occurs. We image propose a PMA(Polygona Matching Algorithm) for refine motion estimation because of the different triangle pattern types of neighboring blocks and its performance is compared with H.263.

  • PDF

Error rate performance of DS / SSMA system in multipath fading channel (다경로 페이딩 채널에서 DS/SSMA 시스템의 오율특성)

  • 박성경;송왕철;강창언
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.6 no.1
    • /
    • pp.66-76
    • /
    • 1995
  • In this paper, the error rate performance of DS/SSMA system in multipath fading channel is calculated by computer simulation. At first, the multipath fading channel is modeled with TDL(Tap Delay Line) model. The characteristics of channels, including multipath fading effects and error pattern, are examined by doppler frequency and signal bandwidth, and time spread variation. Using the multipath fading channel model, the error rateperformance of block code and convolutional code is compared, thus the coding sys- tem is applied to the DS / SSMA system. The BER results of DS / SSMA system show that the proposed receiver gives about 2~3[dB] improve- ment compared with the conventional receiver.

  • PDF

Reduction of Blocking Effect using a Rational Open Uniform B-Spline Curve (유리 개방형 균일 B 스플라인 곡선을 이용한 블록 효과 감소)

  • 김희정;김지홍
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.4
    • /
    • pp.386-392
    • /
    • 2002
  • In this paper, we propose a novel blocking effect reduction method based on a rational B-spline. The blocking effect results from independent coding of each image block and becomes highly visible especially coded at very low bit rates. The proposed approach adopts a rational open uniform B-spline curve that used to produce a smooth curve through a set of control points. The pixels on the block boundary are treated as control points, and the weight values, which decide the shape of curve, are determined differentially by considering the distance the position of the pixels and that of the block boundary. The simulation results show that the proposed method has excellent performance for all pattern of the blocking effect with less computational complexity.

  • PDF

A Multimodal Fusion Method Based on a Rotation Invariant Hierarchical Model for Finger-based Recognition

  • Zhong, Zhen;Gao, Wanlin;Wang, Minjuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.131-146
    • /
    • 2021
  • Multimodal biometric-based recognition has been an active topic because of its higher convenience in recent years. Due to high user convenience of finger, finger-based personal identification has been widely used in practice. Hence, taking Finger-Print (FP), Finger-Vein (FV) and Finger-Knuckle-Print (FKP) as the ingredients of characteristic, their feature representation were helpful for improving the universality and reliability in identification. To usefully fuse the multimodal finger-features together, a new robust representation algorithm was proposed based on hierarchical model. Firstly, to obtain more robust features, the feature maps were obtained by Gabor magnitude feature coding and then described by Local Binary Pattern (LBP). Secondly, the LGBP-based feature maps were processed hierarchically in bottom-up mode by variable rectangle and circle granules, respectively. Finally, the intension of each granule was represented by Local-invariant Gray Features (LGFs) and called Hierarchical Local-Gabor-based Gray Invariant Features (HLGGIFs). Experiment results revealed that the proposed algorithm is capable of improving rotation variation of finger-pose, and achieving lower Equal Error Rate (EER) in our homemade database.

Analysis on Pre-service Early Childhood Teachers' Stage of Concerns about Software Education According to the Concerns-Based Adoption Model (예비유아교사의 소프트웨어 교육에 대한 관심도 분석: 관심중심수용모형(CBAM)을 중심으로)

  • Jung, Ji-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.7
    • /
    • pp.431-440
    • /
    • 2017
  • This study surveyed pre-service early childhood teachers' level of concern about software education on the assumption that software education will be introduced into early childhood education in the future. It was shown that the pre-service early childhood teachers' level of concern about software education is the highest at stage 0(95%) and that they have a high level of informative, personal and managerial concern. Thus, a non-user pattern was mostly indicated. However, compared to the typical non-user pattern, their personal and informative level of concern is slightly higher. A 'tailing up' phenomenon to stage 6(refocusing) was shown. Hence, a pattern aspect close to critical non-user appeared to some extent. A difference in the significant level of concern was shown at all stages, except for managerial concern, according to the need for awareness, the appearance of a future implementation plan, and technology efficacy level. Based on this outcome, it was proposed that teacher training in early childhood software education should be made available as part of the educational activity connected with the Nuri Curriculum, since this would be more suitable for young children's developmental level than the early childhood software education, including coding education, etc., currently found in private institutions.