• Title/Summary/Keyword: Coding Pattern

Search Result 213, Processing Time 0.024 seconds

Performance Comparison on Pattern Recognition Between DNA Coding Method and GA Coding Method (DNA 코딩방법과 GA 코딩방법의 패턴인식 성능 비교에 관한 연구)

  • 백동화;한승수
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.12a
    • /
    • pp.383-386
    • /
    • 2002
  • In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.

An Optimum Selection of Dual Coding Subfield Pattern for Plasma Displays

  • Kwak, Dong-Chan;Kim, Choon-Woo
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2003.07a
    • /
    • pp.730-733
    • /
    • 2003
  • Dual coding technique is one of the popular techniques to reduce the dynamic false contours on PDP. Subfield pattern is a key factor affecting the performance of dual coding technique. In this paper, an optimum subfield selection method based on genetic algorithm is proposed. Two types of string structures are defined to account for all the possible configurations of the dual coding subfield patterns. Genetic operators are proposed for optimization of dual coding subfield pattern. Quantitative measures to describe degrees of dynamic false contours and checkerboard patterns are defined. Experimental results indicate that dual coding subfield pattern that is determined by proposed method reduces dynamic false contours and checkerboard patterns.

  • PDF

Numeric Pattern Recognition Using Genetic Algorithm and DNA coding (유전알고리즘과 DNA 코딩을 이용한 Numeric 패턴인식)

  • Paek, Dong-Hwa;Han, Seung-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.1
    • /
    • pp.37-44
    • /
    • 2003
  • In this paper, we investigated the performance of both DNA coding method and Genetic Algorithm(GA) in numeric pattern (from 0 to 9) recognition. The performance of the DNA coding method is compared to the that of the GA. GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by Adenine(A), Cytosine(C), Guanine(G) and Thymine(T). To compare the performance of both method, the same genetic operators(crossover and mutation) are applied and the probabilities of crossover and mutation are set the same values. The results show that the DNA coding method has better performance over GA. The reasons for this outstanding performance are multiple candidate solution presentation in one string and variable solution string length.

Recognition of Printed Korean Characters(II) (한글문자 인식에 관한 연구(II)(한글자모의 인식 Code와 display))

  • 이주근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.7 no.3
    • /
    • pp.5-11
    • /
    • 1970
  • Some of the coding method have been discussed by extracting characteristics from vowels and consonants of Korean characters. given letters were sampled through 3$\times$5 mesh and also constituted first matrix system which taken subpatterns of vertical Conponent as variables and then, characteristics of the letters are extracted from the second matrix system expresses by common characteristics which are combined-with first one. Single coding was obtained by scanning the characteristic pattern. a good agree between theoretical values and their measurements and the reproducing of all vowels and consonants of Korean chasacters about coding were certified on the display designed.

  • PDF

Implementation of JBIG2 CODEC with Effective Document Segmentation (문서의 효율적 영역 분할과 JBIG2 CODEC의 구현)

  • 백옥규;김현민;고형화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6A
    • /
    • pp.575-583
    • /
    • 2002
  • JBIG2 is an International Standard fur compression of Bi-level images and documents. JBIG2 supports three encoding modes for high compression according to region features of documents. One of which is generic region coding for bitmap coding. The basic bitmap coder is either MMR or arithmetic coding. Pattern matching coding method is used for text region, and halftone pattern coding is used for halftone region. In this paper, a document is segmented into line-art, halftone and text region for JBIG2 encoding and JBIG2 CODEC is implemented. For efficient region segmentation of documents, region segmentation method using wavelet coefficient is applied with existing boundary extraction technique. In case of facsimile test image(IEEE-167a), there is improvement in compression ratio of about 2% and enhancement of subjective quality. Also, we propose arbitrary shape halftone region coding, which improves subjective quality in talc neighboring text of halftone region.

Analysis of characteristics and location of the appearance for codding pattern in the source code (소스 코드에 포함된 코딩 패턴의 특성과 출현 위치 관련성에 대한 분석)

  • Kim, Young-Tae;Kong, Heon-Tag;Kim, Chi-Su
    • Journal of Digital Convergence
    • /
    • v.11 no.7
    • /
    • pp.165-171
    • /
    • 2013
  • Coding patterns that appeared frequently in the source code is a typical piece of code. The functionality that difficult to modularize, such as logging or synchronization processing, and the useful sentences in programming is extracted in software as codding pattern. Large-scale software could not be analyzed fully because the number of coding pattern that can be manually investigated is limited. In this paper, the characteristics of coding patterns perform the evaluation. The goal is to extract for codding-pattern to analyzed by developer. We was selected 6 indicators and performed analysis of 4 open-source. Matrix relations between the values and characteristics of the actual pattern analysis, pattern instances, the width of the distribution of instances, the pattern repeating structure of the elements included in the rates should be analyzed for patterns and indicators that help in choosing was confirmed.

Detection of Frame Deletion Using Coding Pattern Analysis (부호화 패턴 분석을 이용한 동영상 삭제 검출 기법)

  • Hong, Jin Hyung;Yang, Yoonmo;Oh, Byung Tae
    • Journal of Broadcast Engineering
    • /
    • v.22 no.6
    • /
    • pp.734-743
    • /
    • 2017
  • In this paper, we introduce a technique to detect the video forgery using coding pattern analysis. In the proposed method, the recently developed standard HEVC codec, which is expected to be widely used in the future, is used. First, HEVC coding patterns of the forged and the original videos are analyzed to select the discriminative features, and the selected feature vectors are learned through the machine learning technique to model the classification criteria between two groups. Experimental results show that the proposed method is more effective to detect frame deletions for HEVC-coded videos than existing works.

Pattern Generation for Coding Error Detection in VHDL Behavioral-Level Designs (VHDL 행위-레벨 설계의 코딩오류 검출을 위한 패턴 생성)

  • Kim, Jong-Hyeon;Park, Seung-Gyu;Seo, Yeong-Ho;Kim, Dong-Uk
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.3
    • /
    • pp.185-197
    • /
    • 2001
  • Recently, the design method by VHDL coding and synthesis has been used widely. As the integration ratio increases, the amount design by VHDL at a time also increases so many coding errors occur in a design. Thus, lots of time and effort is dissipated to detect those coding errors. This paper proposed a method to verify the coding errors in VHDL behavioral-level designs. As the methodology, we chose the method to detect the coding error by applying the generated set of verifying patterns and comparing the responses from the error-free case(gold unit) and the real design. Thus, we proposed an algorithm to generate the verifying pattern set for the coding errors. Verifying pattern generation is peformed for each code and the coding errors are classified as two kind: condition errors and assignment errors. To generate the patterns, VHDL design is first converted into the corresponding CDFG(Control & Data Flow Graph) and the necessary information is extracted by searching the paths in CDFG. Path searching method consists of forward searching and backward searching from the site where it is assumed that coding error occurred. The proposed algorithm was implemented with C-language. We have applied the proposed algorithm to several example VHDL behavioral-level designs. From the results, all the patterns for all the considered coding errors in each design could be generated and all the coding errors were detectable. For the time to generate the verifying patterns, all the considered designed took less than 1 [sec] of CPU time in Pentium-II 400MHz environments. Consequently, the verification method proposed in this paper is expected to reduce the time and effort to verify the VHDL behavioral-level designs very much.

  • PDF

Method for Verification of VHDL Behavioral-level Design (행위 수준의 VHDL 설계 검증 방법)

  • 박승규;김종현;서영호;김동욱
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.377-380
    • /
    • 1999
  • This paper proposed a method to detect and locate coding errors in HDL behavioral descriptions (designs). The target coding errors are the ones that the compiler cannot find out. As the method, this paper used verification pattern generation method. Thus, an algorithm to generate the verification patterns was proposed, in which the pattern generation is performed by a path- searching method. Various example designs were applied to this algorithm to verify the correctness and effectiveness of the proposed method.

  • PDF

Coded Single Input Channel for Color Pattern Recognition in Joint Transform Correlator

  • Jeong, Man-Ho
    • Journal of the Optical Society of Korea
    • /
    • v.15 no.4
    • /
    • pp.335-339
    • /
    • 2011
  • Recently, we reported a single input channel joint transform correlator for the color pattern recognition which decomposes the input color image into three R, G, and B gray components and adds those components into a single gray image in the input plane. This technique has the merit of a single input channel instead of three input channels. However, we found this technique has some problems with discrimination impossibility in the case of a simple primary color pattern which results in the same gray level through the addition process. Thus, we propose a modified coding technique which selectively recombines the decomposed three R, G, and B gray components instead of the simple adding process. Simulated results show that the modified coding technique can accurately discriminate a variety of kinds of color images.