• Title/Summary/Keyword: 심볼화

Search Result 219, Processing Time 0.036 seconds

Department of Information and Communications Engineering, Hankuk University of Foreign Studies (Data Matrix 이차원 바코드의 디코딩 알고리즘의 구현)

  • 황진희;한희일
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.06a
    • /
    • pp.351-355
    • /
    • 2001
  • 2차원 바코드는 2차원인 점자식 코드로서 낮은 공간점유, 높은 정보, 다양한 정보처리 기능이 가능한 차세대 라벨링 기법이다. 즉, 2차원(2D) 심볼로지는 양축(X 방향, Y 방향)으로 데이터를 배열시켜 평면화 시킨것으로서 기존의 일차원(1D) 바코드 심볼로지가 가지는 문제점인 데이터 표현의 제한성, 즉 선적용 패키지와 같은 로트 번호, 구매 주문 번호, 수취자, 수랑 기타 정보 등의 다양한 내용을 바코드로 표현하여 대상물에 부착하거나 동반시킴으로써 1750년대 중반에 등장하게 되었고, 현재 많은 부분에서 사용하고 있다. 본 논문에서는 현재 많이 쓰이는 2 차원 바코드 중 하나인 Data Matrix 의 구성과 디코딩 알고리즘을 제안한다. Data Matrix는 데이터를 효율적으로 나타내기 위하며 각 정보의 교환에 따라 다른 인코딩 방식을 사용하고 있다. 디코딩 알고리즘은 그에 따라서 구현되었다.

  • PDF

Gesture Recognition in Video image with Combination of Partial and Global Information (로컬 모션정보와 글로벌 모션정보를 조합한 제스쳐 인식)

  • 오재용;이칠우
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.279-283
    • /
    • 2004
  • 본 논문에서는 일반적인 비디오 스트림에서 자동으로 인간의 제스처를 인식하는 알고리즘에 대하여 기술한다. 본 알고리즘은 입력된 비디오 영상으로부터 추출된 신체영역의 2차원적 특징 벡터를 사용하며, 주성분 분석법(Principle Component Analysis)을 통하여 모델 제스처 공간(Model Gesture space)을 구성함으로서 제스처를 통계학적으로 분석/표현하며, 이 제스처 공간에서 새로 입력되는 영상을 같은 방법으로 투영시키고, HMM(Hidden Markov Model) 이론을 적용하여 심볼화함으로써 최종적으로 제스처를 인식하게 된다. 본 방법은 기존의 제스처 인식 방법들과는 달리 전체적인 영상 정보(Global Information)와 세부적인 영상 정보(Partial Information)를 조합하여 사용한다는데 특징이 있으며, 본 알고리즘을 통해 보다 정확하게 강건한 제스처 인식 기술을 실생활에 적용할 수 있을 것이다.

  • PDF

A Study of The world famous university's UI symbolic (세계 유명대학 UI의 상징성 연구)

  • Lei, Yu-Hong;Noh, Hwangwoo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2014.11a
    • /
    • pp.145-146
    • /
    • 2014
  • 중국 대학의 글로벌화 및 경쟁력 강화를 위하여 새로운 UI 적용 및 자료 활용 방안으로 본 연구를 하고자 한다. 중국대학의 심불타입을 보면 비교적 원형의 심불과 단색, 중국문자의 특징 중에 하나인 상형문자를 이용하여 대학의 심볼을 나타낸 경우가 많았다. 이를 더 발전시키기 위해서는 새로운 UI 적용 시 기존의 형식에서 벗어난 학교, 문화, 역사에 맞는 상징물과 소재를 사용하며, 색상을 단색보다 다양하게 사용한다면 현재보다 더욱 글로벌화 된 모습을 표현 할 수 있다.

  • PDF

A Main Wall Recognition of Architectural Drawings using Dimension Extension Line (치수보조선을 이용한 도면의 주벽인식)

  • Kwon, Young-Bin
    • The KIPS Transactions:PartB
    • /
    • v.10B no.7
    • /
    • pp.837-846
    • /
    • 2003
  • This paper deals with plain figures on the architectural drawings of apartment. This kind of architectural drawings consist of main walls represented by two parallel bold lines, symbols (door, window, $\cdots$), dimension line, extension line, and dimensions represent various numerical values and characters. This paper suggests a method for recognizing main wall which is a backbone of apartment in an architectural drawing. In this thesis, the following modules are realized : an efficient image barbarization, a removal of thin lines, a vectorization of detected lines, a region bounding for main walls, a calculation of extension lines, a finding main walls based on extension line, and a field expansion by searching other main walls which are linked with the detected main walls. Although the windows between main walls are not represented as main walls, a detection module for the windows is considered during the recognition period. So the windows are found as a part of main wall. An experimental result on 9 different architectural drawings shows 96.5% recognition of main walls and windows, which is about 5.8% higher than that of Karl Tombre.

An Adaptive Decoding Algorithm Using the Differences Between Level Radii for MIMO Systems (다중 송수신 안테나 시스템에서 단계별 반경의 차이를 이용한 적응 복호화 알고리즘)

  • Kim, Sang-Hyun;Park, So-Ryoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.7C
    • /
    • pp.618-627
    • /
    • 2010
  • In this paper, we propose an adaptive K-best algorithm in which the number K of candidates is changed according to the differences of level radii. We also compare the bit error performance and complexity of the proposed algorithm with those of several conventional K-best algorithms, where the complexity is defined as the total number of candidates of which partial Euclidean distances have to be calculated. The proposed algorithm adaptively decides K at each level by eliminating the symbols, whose differences of radii are larger than a threshold, from the set of candidates, and the maximum or average value of differences can be adopted as the threshold. The proposed decoding algorithm shows the better bit error performance and the lower complexity than a conventional K-best decoding algorithm with a constant K, and also has a similar bit error performance and the lower complexity than other adaptive K-best algorithms.

Geomorphological Mapping for Construction GIS Database of Geomorphic Elements (GIS Database 구축을 위한 지형 요소의 지도화)

  • 이민부;김남신;한균형
    • Journal of the Korean Geographical Society
    • /
    • v.36 no.2
    • /
    • pp.81-92
    • /
    • 2001
  • 본 연구의 목적은 지형요소의 GIS Database 구축을 위한 전산화된 지형분류도 제작방안을 제시하는 것이다. 지형요소 전산화는 지형요소의 분류, 지형요소의 코드화, 범례화, 심볼의 제작, 마지막으로 지도화의 과정을 통하여 완성된다. 지형분류는 지형요소의 공간적 분포와 형태, 지형형성과 발달에 영향을 미치는 자연환경체계와 지형형성기구의 역할을 고려하며, 동적인 지형형성과정과 이 과정을 통해 물질관계를 파악할 수 있도록 하였다. 지형분류도는 1: 25,000 축적에 표현 가능한 지형요소를 나타낼 수 있도록 고려하였다. 지형요소들의 지도화 되었을 때는 시.공간적인 관계를 통해 지형환경체계가 인식되도록 하였다. 지형요소들은 GIS에서 Layer단위로 입력되어야 하기 때문에 Data Feature의 성격을 점.선.면으로 분류하여 지형요소의 형상을 범례로 만들었다. 지형요소 범례는 지형의 형태, 물질 그리고 성인을 고려하여 지형요소를 상징화할 수 있도록 설계하였다.

  • PDF

A Design of All-Digital QPSK Demodulator for High-Speed Wireless Transmission Systems (고속 무선 전송시스템을 위한 All-Digital QPSK 복조기의 설계)

  • 고성찬;정지원
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.1
    • /
    • pp.83-91
    • /
    • 2003
  • High-speed QPSK demodulator has been in important design objective of any wireless communication systems, especially those offering broadband multimedia service. This paper describes all-digital QPSK demodulator for high-speed wireless communications, and its hardware structures are discussed. All-digital QPSK demodulator is mainly composed of symbol time circuit and carrier recovery circuit to estimate timing and phase-offsets. There are various schemes. Among them, we use Gardner algorithm and Decision-Directed carrier recovery algorithm which is most efficient scheme to warrant the fast acquisition and tacking to fabricate FPGA chip. The testing results of the implemented onto CPLD-EPF10K100GC 503-4 chip show demodulation speed is reached up to 2.6[Mbps]. If it is implemented a CPLD chip with speed grade 1, the demodulation speed can be faster by about 5 times. Actually in case of designing by ASIC, its speed my be faster than CPLD by 5 times. Therefore, it is possible to fabricate the all-digital QPSK demodulator chipset with speed of 50[Mbps].

  • PDF

A Study on the Mixed Model Approach and Symbol Probability Weighting Function for Maximization of Inter-Speaker Variation (화자간 변별력 최대화를 위한 혼합 모델 방식과 심볼 확률 가중함수에 관한 연구)

  • Chin Se-Hoon;Kang Chul-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.24 no.7
    • /
    • pp.410-415
    • /
    • 2005
  • Recently, most of the speaker verification systems are based on the pattern recognition approach method. And performance of the pattern-classifier depends on how to classify a variety of speakers' feature parameters. In order to classify feature parameters efficiently and effectively, it is of great importance to enlarge variations between speakers and effectively measure distances between feature parameters. Therefore, this paper would suggest the positively mixed model scheme that can enlarge inter-speaker variation by searching the individual model with world model at the same time. During decision procedure, we can maximize inter-speaker variation by using the proposed mixed model scheme. We also make use of a symbol probability weighting function in this system so as to reduce vector quantization errors by measuring symbol probability derived from the distance rate of between the world codebook and individual codebook. As the result of our experiment using this method, we could halve the Detection Cost Function (DCF) of the system from $2.37\%\;to\;1.16\%$.

PDF-Distance Minimizing Blind Algorithm based on Delta Functions for Compensation for Complex-Channel Phase Distortions (복소 채널의 위상 왜곡 보상을 위한 델타함수 기반의 확률분포거리 최소화 블라인드 알고리듬)

  • Kim, Nam-Yong;Kang, Sung-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5036-5041
    • /
    • 2010
  • This paper introduces the complex-version of an Euclidean distance minimization algorithm based on a set of delta functions. The algorithm is analyzed to be able to compensate inherently the channel phase distortion caused by inferior complex channels. Also this algorithm has a relatively small size of Gaussian kernel compared to the conventional method of using a randomly generated symbol set. This characteristic implies that the information potential between desired symbol and output is higher so that the algorithm forces output more strongly to gather close to the desired symbol. Based on 16 QAM system and phase distorted complex-channel models, mean squared error (MSE) performance and concentration performance of output symbol points are evaluated. Simulation results show that the algorithm compensates channel phase distortion effectively in constellation performance and about 5 dB enhancement in steady state MSE performance.

Performance Analysis of Frequency Diversity Scheme for OFDM Systems Using Sub-channel Correlation Characteristics (부채별 상관 특성을 이용한 OFDM 시스템의 주파수 다이버시티 기법 성능 분석)

  • 이종식;김장욱;오창헌;조성준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6A
    • /
    • pp.614-622
    • /
    • 2004
  • In this paper, we propose the frequency diversity scheme for performance improvement of a OFDM system without decreasing the spectral efficiency. In the proposed scheme, information bit is encoded to symbol by a simple procedure, and the encoded symbol is transmitted through the two lowest correlated sub-channels with the particular phase difference. At the receiver, a frequency diversity gain is obtained by a simple signal processing. We also suggest optimum phase difference value to minimize the performance degradation which resulted from a phase difference estimation error and bit/symbol mapping method to minimize BER. As results, at the point of performance improvement, the proposed scheme is excellent even though it requires a little increase of system complexity because of an additional encoding and decoding. In particular, we confirmed through computer simulation that on the same channel environment and bandwidth efficiency, the 27x/1Rx STBC-OFDM system adopting the proposed frequency diversity scheme outperforms the conventional 27x/1Rx STBC-OFDM system performance