• Title/Summary/Keyword: 오류 삽입

Search Result 119, Processing Time 0.026 seconds

Bugs on the IEEE 802.11 Module of ns-2.31 (ns-2.31의 IEEE 802.11 모듈 버그)

  • Jung, Nak-Cheon;Ahn, Jong-Suk
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.841-844
    • /
    • 2008
  • 본 논문은 공개 네트워크 시뮬레이터 ns-2.31(Network Simulator 2.31)의 802.11 DCF 모듈에서 버그(bug)를 소개하고 이의 영향 결과를 분석한다. ns의 802.11 DCF 모듈은 다음과 같은 문제점을 가지고 있다. 첫째, 백오프(backoff) 알고리즘은 표준안에서 명시한 알고리즘대로 작성되지 않았다. 둘째, 특정조건에 해당되는 충돌에 대하여 트레이스 파일에 출력하지 않는다. 셋째, 전파 오류 모듈을 삽입하여도 전파 오류 결과를 트레이스 파일에 출력하지 않는다. 넷째, MAC(Medium Access Control) 알고리즘만을 평가할 수 있는 기법을 제공하지 않는다. 이러한 문제점을 수정한 ns-2와 수정전의 ns-2와 평균4.6%의 충돌률 차이를 보인다.

An Effective Method for Replacing Caption in Video Images (비디오 자막 문자의 효과적인 교환 방법)

  • Chun Byung-Tae;Kim Sook-Yeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.97-104
    • /
    • 2005
  • Caption texts frequently inserted in a manufactured video image for helping an understanding of the TV audience. In the movies. replacement of the caption texts can be achieved without any loss of an original image, because the caption texts have their own track in the films. To replace the caption texts in early methods. the new texts have been inserted the caption area in the video images, which is filled a certain color for removing established caption texts. However, the use of these methods could be lost the original images in the caption area, so it is a Problematic method to the TV audience. In this Paper, we propose a new method for replacing the caption text after recovering original image in the caption area. In the experiments. the results in the complex images show some distortion after recovering original images, but most results show a good caption text with the recovered image. As such, this new method is effectively demonstrated to replace the caption texts in video images.

  • PDF

Energy Efficiency for Building Security Application of Adaptive Error Control and Adaptive Modulation (빌딩 보안 어플리케이션의 적응 오류제어와 적응 변조의 에너지 효율에 관한 연구)

  • Long, Bora;Kang, Heau-Jo
    • Journal of Advanced Navigation Technology
    • /
    • v.11 no.4
    • /
    • pp.423-429
    • /
    • 2007
  • Since the wireless smart card has played a main role in the identification security application for the building access; this research has its purpose to improve the performance of the smart card system and aims to offer more convenient to user. The contactless cards do not require insertion into a card reader and can work up to centimeters away from the reading device. To be able to cope with this performance the controlling of power consumption through the adaptive modulation and error control is needed. This paper addresses a forward error control (FEC) scheme with the adaptive Reed-Solomon code rate and an M-ary frequency shift keying (M-FSK) modulation scheme with the varying symbol size M over the link. The result of comparing energy efficiencies of adaptive error correction and adaptive modulation to other various static schemes shows to save over 50% of the energy consumption.

  • PDF

Improving Recall for Context-Sensitive Spelling Correction Rules Through Integrated Constraint Loosening Method (통합적 제약완화 방식을 통한 한국어 문맥의존 철자오류 교정규칙의 재현율 향상)

  • Choi, Hyunsoo;Yoon, Aesun;Kwon, Hyukchul
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.6
    • /
    • pp.412-417
    • /
    • 2015
  • Context-sensitive spelling errors (CSSE) are hard to correct, since they are perfect words when analyzed alone. Determined only by considering the semantic and syntactic relations of their context, CSSEs affect largely the performance of spelling and grammar checkers. The existing Korean Spelling and Grammar Checker (KSGC 4.5) adopts a rule-based method, which uses hand-made correction rules for CSSEs. Using rule-based method, the KSGC 4.5 is designed to obtain the very high precision, which results in the extremely low recall. In this paper, we integrate our previous works that control the CSSE correction rules, in order to improve the recall without sacrificing the precision. In addition to the integration, facultative insertion of adverbs and conjugation suffix of predicates are also considered, as for constraint-loosening linguistic features.

Augmented QSBC(Quantum Short-Block Code)-QURC(Quantum Unity-Rate Code)(II) with Pauli X,Y,Z error detection (파울리 X,Y,Z 오류검출 기능을 갖는 증강된 QSBC(Quantum Short-Block Code)-QURC(Quantum Unity-Rate Code)(II))

  • Dong-Young Park;Sang-Min Suh;Baek-Ki Kim
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.3
    • /
    • pp.495-508
    • /
    • 2023
  • This paper proposes a method to find out the type and location information of Pauli X, Y, Z errors generated in quantum channels using only the quantum information processing part of the multiple-rate quantum turbo short-block code without external help from the classical information processing part. In order to obtain the location information of the Pauli X,Y error, n-auxiliary qubits and n-CNOT gates were inserted into the C[n,k,2] QSBC-QURC encoder. As a result, the maximum coding rate is limited to about 1/2 as the trade-off characteristics. The location information of the Pauli Z error for C[n,k,2] QSBC-QURC was obtained through the Clifford-based stabilizer measurement. The proposed method inherits all other characteristics of C[n,k,2] QSBC-QURC except for the coding rate.

A Digital Watermarking Algorithm Based on Wavelet Transform Using Turbo Code and Human Visual System (터보 부호와 인간 시각 시스템을 이용한 웨이블릿 기반의 디지털 워터마킹 알고리즘)

  • 김주영;권성근;황희철;정태연;권기룡;김덕규
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.05d
    • /
    • pp.896-900
    • /
    • 2002
  • 본 논문에서는 기존의 워터마킹 알고리즘보다 채널에 대해서 더욱 강인한 특성을 위해 오류 정정 능력이 뛰어난 터보 부호 및 인간 시각 시스템을 이용한 디지털 워터마킹 방법을 제안하였다. 이 알고리즘에서는 터보 부호를 이용하여 워터마크를 생성하고, 채널에 강인한 특성을 위해 채널의 부가 정보를 이용하여 워터마크를 삽입한다. 제안한 워터마킹 알고리즘의 성능 평가를 위한 모의실험에서 제안한 워터마킹 알고리즘이 기존의 알고리즘보다 견고성면에서 우수함을 확인하였다.

  • PDF

Analysis and Prediction of Prosodic Phrage Boundary (운율구 경계현상 분석 및 텍스트에서의 운율구 추출)

  • Kim, Sang-Hun;Seong, Cheol-Jae;Lee, Jung-Chul
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.1
    • /
    • pp.24-32
    • /
    • 1997
  • This study aims to describe, at one aspect, the relativity between syntactic structure and prosodic phrasing, and at the other, to establish a suitable phrasing pattern to produce more natural synthetic speech. To get meaningful results, all the word boundaries in the prosodic database were statistically analyzed, and assigned by the proper boundary type. The resulting 10 types of prosodic boundaries were classified into 3 types according to the strength of the breaks, which are zero, minor, and major break respectively. We have found out that the durational information was a main cue to determine the major prosodic boundary. Using the bigram and trigram of syntactic information, we predicted major and minor classification of boundary types. With brigram model, we obtained the correct major break prediction rates of 4.60%, 38.2%, the insertion error rates of 22.8%, 8.4% on each Test-I and Test-II text database respectively. With trigram mode, we also obtained the correct major break prediction rates of 58.3%, 42.8%, the insertion error rates of 30.8%, 42.8%, the insertion error rates of 30.8%, 11.8% on Test-I and Test-II text database respectively.

  • PDF

The Construction of A Parallel type Bloom Filter (병렬 구조의 블룸필터 설계)

  • Jang, Young-dal;Kim, Ji-hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.6
    • /
    • pp.1113-1120
    • /
    • 2017
  • As the size of the data is getting larger and larger due to improvement of the telecommunication techniques, it would be main issues to develop and process the database. The bloom filter used to lookup a particular element under the given set is very useful structure because of the space efficiency. In this paper, we analyse the main factor of the false positive and propose the new parallel type bloom filter in order to minimize the false positive which is caused by other hash functions. The proposed method uses the memory as large as the conventional bloom filter use, but it can improve the processing speed using parallel processing. In addition, if we use the perfect hash function, the insertion and deletion function in the proposed bloom filter would be possible.

Error Performance Analysis of Concatenated Codes in advanced T-DMB System with Hierarchical Modulation (계층 변조를 포함한 개선된 지상파 DMB 시스템에서 연접 부호들의 오류 성능 분석)

  • Lim, Hyung-Taek;Lee, Sang-Hoon;Kim, Jeong-Goo;Joo, Eon-Kyeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.1
    • /
    • pp.10-17
    • /
    • 2007
  • Hierarchical modulation technology which can make the advanced T-DMB(terrestrial-digital multimedia broadcasting) system backward compatible with the conventional T-DMB system and provide high-rate and high-quality services is introduced in this paper. As additional data streams are embedded within the conventional data streams by the hierarchical modulation, the advanced T-DMB system can provide high-quality video service and more broadcasting service channels. In order to guarantee the quality of both the conventional and additional services powerful error correcting scheme is required. The error performance of advanced T-DMB system with hierarchical modulation is investigated and analyzed according to the various error correcting schemes in this paper.

Exploitation of Auxiliary Motion Vector in Video Coding for Robust Transmission over Internet (화상통신에서의 오류전파 제어를 위한 보조모션벡터 코딩 기법)

  • Lee, Joo-Kyong;Choi, Tae-Uk;Chung, Ki-Dong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.571-578
    • /
    • 2002
  • In this paper, we propose a video sequence coding scheme called AMV (Auxiliary Motion Vector) to minimize error propagation caused by transmission errors over the Internet. Unlike the conventional coding schemes the AMY coder, for a macroblock in a frame, selects two best matching blocks among several preceding frames. The best matching block, called a primary block, is used for motion compensation of the destination macroblock. The other block, called an auxiliary block, replaces the primary block in case of its loss at the decoder. When a primary block is corrupted or lost during transmission, the decoder can efficiently and simply suppress error propagation to the subsequent frames by replacing the block with an auxiliary block. This scheme has an advantage of reducing both the number and the impact of error propagations. We implemented the proposed coder by modifying H.263 standard coding and evaluated the performance of our proposed scheme in the simulation. The simulation results show that AMV coder is more efficient than the H.263 baseline coder at the high packet loss rate.