• Title/Summary/Keyword: 데이터 삽입

Search Result 765, Processing Time 0.026 seconds

A Blind Watermarking Algorithm of 3D Mesh Model for Rapid Prototyping System Application (RP 시스템 적용을 위한 3차원 메쉬 모델의 블라인드 워터마킹)

  • Ji-Zhe, Cui
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12C
    • /
    • pp.1194-1202
    • /
    • 2007
  • In this paper, we proposed a blind watermarking algorithm to apply to the rapid prototyping system. The 3D mesh model is used in the step of the CAD modeling before the making of the prototype system of the rapid prototyping system. STL type mesh modeling which is used in this system reduces the error of the system and improves the accuracy of the system. In the step of the CAD modeling, some transformations which do not change the model accuracy are used, but some transformations which change the model accuracy are not used because the mesh model error is related to the accuracy of the prototype system. Most watermarking algorithms embedded a specific random noise as the watermark information into the model. These kinds of the algorithms are not proper to the 3D model watermarking. The proposed algorithm can be used for the accurate prototyping system because it does not change the model after the watermark embedding This means it can be used for the copyright marking and the data integrity.

A Parallel Bulk Loading Method for $B^+$-Tree Using CUDA (CUDA를 활용한 병렬 $B^+$-트리 벌크로드 기법)

  • Sung, Joo-Ho;Lee, Yoon-Woo;Han, A;Choi, Won-Ik;Kwon, Dong-Seop
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.707-711
    • /
    • 2010
  • Most relational database systems provide $B^+$-trees as their main index structures, and use bulk-loading techniques for creating new $B^+$-trees on existing data from scratch. Although bulk loadings are more effective than inserting keys one by one, they are still time-consuming because they have to sort all the keys from large data. To improve the performance of bulk loadings, this paper proposes an efficient parallel bulk loading method for $B^+$-trees based on CUDA, which is a parallel computing architecture developed by NVIDIA to utilize computing powers of graphic processor units for general purpose computing. Experimental results show that the proposed method enhance the performance more than 70 percents compared to existing bulk loading methods.

Detection of Colluded Multimedia Fingerprint using LDPC and BIBD (LDPC와 BIBD를 이용한 공모된 멀티미디어 핑거프린트의 검출)

  • Rhee Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.5 s.311
    • /
    • pp.68-75
    • /
    • 2006
  • Multimedia fingerprinting protects multimedia content from illegal redistribution by uniquely marking every copy of the content distributed to each user. Differ from a symmetric/asymmetric scheme, fingerprinting schemes, only regular user can know the inserted fingerprint data and the scheme guarantee an anonymous before recontributed data. In this paper, we present a scheme which is the algorithm using LDPC(Low Density Parity Check) for detection of colluded multimedia fingerprint and correcting errors. This proposed scheme is consists of the LDPC block, Hopfield Network and the algorithm of anti-collusion code generation. Anti-collusion code based on BIBD(Balanced Incomplete Block Design) was made 100% collusion code detection rate about the linear collusion attack(average, AND and OR) and LD% block for the error bits correction confirmed that can correct error until AWGN 0dB.

Reversible Watermarking For Relational Databases using DE (Difference Expansion) Algorithm (DE 알고리즘을 사용한 관계형 데이터베이스를 위한 가역 워터마킹)

  • Kim, Cheonshik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.7-13
    • /
    • 2015
  • Generally, watermarking can be used copyright for contents such as audios, videos, images, and texts. With the development of Internet, many malicious attackers illegally copy relational databases synchronized applications Therefore, it is needed for the protection of databases copyright, because databases involve various sensitive information such as personal information, information industry, and secret national intelligence. Thus, the protection of relational databases is a major research field in the databases research topics. In this paper, we will review previous researches related the protection of relational databases and propose new method for relational data. Especially, we propose watermarking scheme for databases using reversible method in this paper. As an experimental result, the proposed scheme is very strong to malicious attacks. In addition, we proved our proposed scheme is to apply real application.

Design of A Stateless Minimum-Bandwidth Binary Line Code MB46d (Stateless 최소대역폭 2진 선로부호 MB46d의 설계)

  • Lee, Dong-Il;Kim, Dae-Young
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.10
    • /
    • pp.11-18
    • /
    • 1998
  • A binary line code, called MB46d, is designed by use of the BUDA(Binary Unit DSV and ASV) cell concept to retain the property of being runlength limited, DC tree, and with a power spectral null at the Nyquist frequency. This new code is a stateless line code with a simple encoding and a decoding rule and enables efficient error monitoring. The power spectrum and the eye pattern of the new line code are simulated for a minimum-bandwidth digital transmission system where the sinc function is used as a basic pulse. The obtained power null at the Nyquist frequency is wide enough to enable easy band-limiting as well as secure insertion of a clock pilot where necessary. The eye is also substantially wide to tolerate a fair amount of timing jitter in the receiver.

  • PDF

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.

A Content-based Audio Retrieval System Supporting Efficient Expansion of Audio Database (음원 데이터베이스의 효율적 확장을 지원하는 내용 기반 음원 검색 시스템)

  • Park, Ji Hun;Kang, Hyunchul
    • Journal of Digital Contents Society
    • /
    • v.18 no.5
    • /
    • pp.811-820
    • /
    • 2017
  • For content-based audio retrieval which is one of main functions in audio service, the techniques for extracting fingerprints from the audio source, storing and indexing them in a database are widely used. However, if the fingerprints of new audio sources are continually inserted into the database, there is a problem that space efficiency as well as audio retrieval performance are gradually deteriorated. Therefore, there is a need for techniques to support efficient expansion of audio database without periodic reorganization of the database that would increase the system operation cost. In this paper, we design a content-based audio retrieval system that solves this problem by using MapReduce and NoSQL database in a cluster computing environment based on the Shazam's fingerprinting algorithm, and evaluate its performance through a detailed set of experiments using real world audio data.

Performance Analysis of Clock Recovery for OFDM/QPSK-DMR System Using Band Limited-Pulse Shaping Filter (대역 제한 필터를 이용하는 OFDM/QPSK-DMR 시스템을 위한 클럭 복조기의 성능 분석)

  • 안준배;양희진;강희곡;오창헌;조성준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.245-249
    • /
    • 2004
  • In this paper, we have proposed a clock recovery algorithm of Orthogonal Frequency Division Multiplexing/Quadrature Phase Shift Keying Modulation-Digital Microwave Radio(OFDM/QPSK-DMR) system using Band Limited-Pulse Shaping Filter(BL-PSF) and compared the clock phase error variance of OFDM/QPSK-DMR system with that of single carrier DMR system. The OFDM/QPSK-DMR system using windowing method requires training sequence or Cyclic Prefix (CP) to synchronize the clock phase of received signal. But transmit efficient is increased in our proposed DMR system because of no using redundant data such as training sequence or CP. The proposed clock recovery algorithm is simply realized in the OFDM/QPSK-DMR system using BL-PSF. The simulation results confirm that the proposed clock recovery algorithm has the same clock phase error variance performance in a single carrier DR system under Additive White Gaussian Noise(AWGN) environment.

Detection of Source Code Security Vulnerabilities Using code2vec Model (code2vec 모델을 활용한 소스 코드 보안 취약점 탐지)

  • Yang, Joon Hyuk;Mo, Ji Hwan;Hong, Sung Moon;Doh, Kyung-Goo
    • Journal of Software Assessment and Valuation
    • /
    • v.16 no.2
    • /
    • pp.45-52
    • /
    • 2020
  • Traditional methods of detecting security vulnerabilities in source-code require a lot of time and effort. If there is good data, the issue could be solved by using the data with machine learning. Thus, this paper proposes a source-code vulnerability detection method based on machine learning. Our method employs the code2vec model that has been used to propose the names of methods, and uses as a data set, Juliet Test Suite that is a collection of common security vulnerabilities. The evaluation shows that our method has high precision of 97.3% and recall rates of 98.6%. And the result of detecting vulnerabilities in open source project shows hopeful potential. In addition, it is expected that further progress can be made through studies covering with vulnerabilities and languages not addressed here.

Caption Processing Method for MPEG Video Stream in MC-DCT Dom (MPEG 비디오 스트림에 대한 MC-DCT 영역에서의 자막 처리 방법)

  • Gwon, O-Hyeong;Nang, Jong-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.10
    • /
    • pp.1003-1014
    • /
    • 2000
  • MPEG은 동영상 압축 규약의 하나로서 고하질을 유지하면서 높은 압축율을 제공하기 때문에 그 사용 범위가 점차로 넓어지고 있으며, 또한 이러한 이유로 인해서 MPEG 데이터에 대한 편집 시스템의 요구도 점차 증가되고 있다. 그러나. MPEG 스트림에 대한 편집은 대부분 공간 영역에서 수행되기 때문에 수행 시간이 오래 걸리고 화질이 저하된다는 단점을 안고 있다. 본 논문에서는 DC 이미지를 이용한 MC-DCT 영역에서의 자막 처리 방법을 제안함으로써 기존의 자막 처리 방법이 안고 있는 단점을 극복하도록 하였다. 제안한 방법에서는 MC-DCT 영역에서의 워터마크 삽입 방법[1]을 응용하여 빠른 처리가 가능하도록 하였으며, MC-DCT 영역에서 쉽게 구할 수 있는 DC 이미지를 이용하여 화면 상태에 따라 자막의 세기를 조절함으로써 P,B 프레임의 처리 과정에서 발생하게 되는 화질 저하를 최소화하도록 하였다. 이러한 MC-DCT 영역에서의 자막 방법을 사용함으로써 기존의 자막 처리 방법 보다 약 4.9배 빠른 수행 속도를 얻을 수 있었으며, 화질 보존의 측면에서도 기존의 자막 처리 방법이 화면 전체에 대해서 화질 저하가 발생하는 반면 제안한 방법은 자막이 들어가는 부분에 대해서만 화질 저하가 발생하였다. 이러한 방법을 MPEG 스트림에 대해서 사용하게 된다면, 소프트웨어만을 이용한 저가의 데스크 탑 환경에서도 효율적인 자막 처리가 가능하게 될 것이다.

  • PDF