• Title/Summary/Keyword: Symbols

Search Result 1,536, Processing Time 0.024 seconds

A Study on the Feature Extraction of Maps using Mechanism of Optical Neural Field (시각정보처리 개념을 이용한 지형도의 특징추출에 관한 연구)

  • 손진우;김욱현;이행세
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.154-160
    • /
    • 1995
  • Maps are one of the most complicated types of drawings. Drawing recognition technology is not yet sophisticated enough for automated map reading. To automatically extract a road map directly form more complicated topographical maps, a very complicated algorithm is needed, simce the image generally involves such complicated patterns as symbols, characters, residential sections, rivers,etc. This paper describes a new feature extraction method based on the human optical neural field. We apply this method to extract complete set of road segments from topographical maps. The proposed method successfully extract road segments from various areas.

  • PDF

Computer Aided Drawing Check for CAD Systems A Method for the Checking of Dimensions in Mechanical Part Drawings (CAD시스템을 위한 컴퓨터원용 설계도면검도 -기계부품도의 치수검도방법 -)

  • 이성수
    • Korean Journal of Computational Design and Engineering
    • /
    • v.1 no.2
    • /
    • pp.97-106
    • /
    • 1996
  • Existing CAD systems do not provide advanced functions for automatic checking design and drafting errors in mechanical drawings. If the knowledge of checking in mechanical ddrsfting can be implemented into computers, CAD systems could automatically check for design and drafting errors. This paper describes a method for systematic checking of dimension errors. such as deficiency and/or redundancy of dimension input-errors in dimension figures and symbols, etc. The logic for finding dimensional errors is written by using a proccedural language. A geometric model and a topological-graph model are used in this method. Checking for deficiency and redundancy of dimensions is based upon graph Theory.

  • PDF

Statistical Measurement of Monsyllable Entropy for Korean Language (한국어 음절의 Entropy에 관한 연구)

  • 이주근;최흥문
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.11 no.3
    • /
    • pp.15-21
    • /
    • 1974
  • The information amount of monosyllables(characters) in Korean language is measured, in order of the following 3 steps. 1) The basic consonants and vowels are partitioned into two steps, 2) These set symbols, C and V, are sequentially combined to obtain the equation which represent the flow state of monosyllables. 3) From the equation, the state graphs can be constructed to examine the proferties of a stochastic process of monosyllables in Korean language. Furthermore, the entropy of Korean language by statistics is measured and compared with that of the western languages. The proposed methods are more definite, systematic, and simpler than the usual methods in examining the nature of information sources.

  • PDF

Modified MMSE Estimator based on Non-Linearly Spaced Pilots for OFDM Systems

  • Khan, Latif Ullah
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.1
    • /
    • pp.35-39
    • /
    • 2014
  • This paper proposes a Modified Minimum Mean Square Error (M-MMSE) estimator for an Orthogonal Frequency Division Multiplexing (OFDM) System over fast fading Rayleigh channel. The proposed M-MMSE estimator considered the effects of the efficient placement of pilots based on the channel energy distribution. The pilot symbols were placed in a non-linear manner according to the density of the channel energy. Comparative analysis of the MMSE estimator for a comb-type pilot arrangement and M-MMSE estimator for the proposed pilot insertion scheme revealed significant performance improvement of the M-MMSE estimator over the MMSE estimator.

Drowsiness Detection using Eye-blink Patterns (눈 깜박임 패턴을 이용한 졸음 검출)

  • Choi, Ki-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.10 no.2
    • /
    • pp.94-102
    • /
    • 2011
  • In this paper, a novel drowsiness detection algorithm using eye-blink pattern is proposed. The proposed drowsiness detection model using finite automata makes it easy to detect eye-blink, drowsiness and sleep by checking the number of input symbols standing for closed eye state only. Also it increases the accuracy by taking vertical projection histogram after locating the eye region using the feature of horizontal projection histogram, and minimizes the external effects such as eyebrows or black-framed glasses. Experimental results in eye-blinks detection using the JZU eye-blink database show that our approach achieves more than 93% precision and high performance.

Kinetic Family Drawing According to Preschoolers' External Problem Behavior (유아의 외현화 문제행동 여부에 따른 동적가족화 연구)

  • Kim, Jin-Kyung
    • Journal of Families and Better Life
    • /
    • v.31 no.1
    • /
    • pp.61-72
    • /
    • 2013
  • This study evaluated Kinetic Family Drawing according to preschoolers' external problem behavior. To achieve this, 120 preschoolers who were four or five years old were investigated and data were statistically analyzed using mean, and chi square analysis with the SPSS Win 13.0 program. The preschoolers' family drawings were analyzed by using the method in Kinetic Family Drawing(Burns & Kaufman, 1972). First, regarding characteristics, the preschoolers in the aggression group rotated certain person or drew the figure from behind, the preschoolers in the delinquency group drew long arms, the figure from behind, and angular forms. Second, regarding action depicted, the preschoolers in both aggression and delinquency groups perceived the lower activity level of their fathers, dangerous situations, and excluded family interaction. Third, regarding symbols, the preschoolers in the delinquency group drew objects such as balls. Finally, regarding drawing style, the preschoolers in the delinquency group drew edges and underline.

Evaluation on MRC Diversity Reception of M-ary PSK and DPSK Signals on Wireless Fading Channels

  • Kim, Chung-Sock;Kim, Chang-Hwan;Jin, Yong-Ok
    • Journal of electromagnetic engineering and science
    • /
    • v.7 no.3
    • /
    • pp.109-115
    • /
    • 2007
  • The performances of M-ary PSK(MPSK) systems using L-branch maximum ratio combining(MRC) diversity reception in frequency-nonselective slow Rician fading channels are derived theoretically. Especially we investigate the effect of number of symbols on the difference between the approximation to bit error probability and the exact bit error rate(BER) in evaluating the performance of MPSK signals through numerical analyses. On the other hand, when M-ary DPSK(MDPSK) signals experience the Rician fading channels, the general formula for evaluating BER of MDPSK signals in the independent branch diversity system is presented using the integral-form expressions.

Recognition and classification of dimension set for automatic input of mechanical drawings (기계 도면의 자동 입력을 위한 치수 집합의 인식 및 분류)

  • 정윤수;박길흠
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.11
    • /
    • pp.114-125
    • /
    • 1997
  • This paper presents a method that automatically recognizes dimension sets from the mechanical drawings, and that classifies 6 types dimension sets according to functional purpose. In the proposed method, the object and closed-loop symbols are separated from the character-free drawings. Then object lines and interpretation lines are vectorized. And, after recognizing dimension sets(consistings of arrowhead, shape line, tail lines, extension lines, text-string, and feature control frame), we classify recognized dimension sets as horizontal, vertical, angular, diametral, radial, and leader dimension sets. Finally the proposed method converts classified dimension sets into AutoCAD data by using AutoLisp language. By using the methods of geometric modeling, the proposed method readily recognized and classifies dimension sets from complex drawings. Experimetnal results are presented, which are obtained by applying the proposed method to drawings drawn in compliance with the KS drafting standard.

  • PDF

Generalization of the Spreading Function and Weyl Symbol for Time-Frequency Analysis of Linear Time-Varying Systems

  • Iem, Byeong-gwan
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.7
    • /
    • pp.628-632
    • /
    • 2001
  • We propose time-frequency (TF) tools for analyzing linear time-varying (LTV) systems and nonstationary random processes. Obtained warping the narrowband Weyl symbol (WS) and spreading function (SF), the new TF tools are useful for analyzing LTV systems and random processes characterized by generalized frequency shifts, This new Weyl symbol (WS) is useful in wideband signal analysis. We also propose WS an tools for analyzing systems which produce dispersive frequency shifts on the signal. We obtain these generalized, frequency-shift covariant WS by warping conventional, narrowband WS. Using the new, generalized WS, we provide a formulation for the Weyl correspondence for linear systems with instantaneous of linear signal transformation as weighted superpositions of non-linear frequency shifts on the signal. Application examples in signal and detection demonstrate the advantages of our new results.

  • PDF

A Term-based Language for Resource-Constrained Project Scheduling and its Complexity Analysis

  • Kutzner, Arne;Kim, Pok-Son
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.12 no.1
    • /
    • pp.20-28
    • /
    • 2012
  • We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.