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

Search Result 765, Processing Time 0.028 seconds

A Robust Image Watermarking Algorithm and System Architecture for Semi-fingerprinting (Semi-fingerprinting을 위한 강인한 이미지 워터마킹 알고리즘 및 시스템 구조)

  • Joung, Gil-Ho;Lee, Han-Ho;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.309-316
    • /
    • 2003
  • In this paper, we propose a new watermarking method based on spread spectrum and a semi-fingerprinting system architecture that can be built using our robust watermarking method. Especially, we describe a method that extends the application area of watermarking technology to more practical application domains by applying the watermarking technology that has been focused mainly on copyright protection to fingerprinting area. Our proposed watermarking scheme uses the method that inserts more data by using random number shifting method. We improved the reliability of acquired data with 20-bits CRC code and 60-bits inserted information. In addition, we designed the system architecture based on the recommendation of cIDf (content ID forum) in order to apply the system on the semi-fingerprinting area.

Extended Pairing Heap Algorithms Considering Cache Effect (캐쉬 효과를 고려한 확장된 Pairing Heap 알고리즘)

  • 정균락;김경훈
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.250-257
    • /
    • 2003
  • As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.

$\alpha$ Scaling Parameter Optimization On Watermarking Using Autostereogram (오토스테레오그램을 이용한 워터마킹에서 $\alpha$스켈링 파라미터 최적화)

  • 허덕규;이인정;김성옥
    • Journal of Internet Computing and Services
    • /
    • v.2 no.4
    • /
    • pp.101-109
    • /
    • 2001
  • In recent year, the use of digital picture information and general picture information has been increased, However, numerous copyright infringement and pirate copy of picture information through Internet and CD-ROM happen very often, As a result, several methods of watermarking have been presented to solve and verify distortion of the original data, In addition, watermark data have been suggested to resolve the vastness of the original data, Watermarking methods are often used to protect the right of ownership of a copyright, However, these Watermarking methods have brought the obscurity of recognition caused by the complexity of verification procedure and the increase of magnitude computation occurrence, This paper mainly mentions about the local optimization of scaling parameter, the maximization of hiding of Watermark information and maximization of watermark information in case of restoration that determine the amount of inserted information which is used for preventing distortion and transformation of the original data caused by insertion and hiding of Watermark information on compounding Autostereogram into JPEG picture information.

  • PDF

Gray-level Image Watermarking using Wavelet Transform (웨이브렛 변환을 이용한 그레이-레벨 영상 워터마킹)

  • Min, Sun-Jin;Chung, Hoon;Kim, Chung-Hwa
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.487-490
    • /
    • 2001
  • With the establishment of the optimized copyright, digital image watermarking technique is demended to identify the owner of a certain image and to avoid the unauthorized distribution of digital image copies. Also, a robust watermarking approach should survive several possible attacks, such as image processing and lossy image compession. The proposed scheme distributes the 256 gray-level signature information in discrete wavelet transform domain of the host image where is very little visible distortion. While much of the privious work used signature data that is a small fraction of th e host images the proposed approach can easily handle gray-scale Images. As the result, stable reconstruction can be obtained even when the images are transformed, JPEG lossy compression or otherwise modified by low-pass filtering operations.

  • PDF

An Effective Anonymization Management under Delete Operation of Secure Database (안전한 데이터베이스 환경에서 삭제 시 효과적인 데이터 익명화 유지 기법)

  • Byun, Chang-Woo;Kim, Jae-Whan;Lee, Hyang-Jin;Kang, Yeon-Jung;Park, Seog
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.3
    • /
    • pp.69-80
    • /
    • 2007
  • To protect personal information when releasing data, a general privacy-protecting technique is the removal of all the explicit identifiers, such as names and social security numbers. De-identifying data, however, provides no guarantee of anonymity because released information can be linked to publicly available information to identify them and to infer information that was not intended for release. In recent years, two emerging concepts in personal information protection are k-anonymity and $\ell$-diversity, which guarantees privacy against homogeneity and background knowledge attacks. While these solutions are signigicant in static data environment, they are insufficient in dynamic environments because of vulnerability to inference. Specially, the problem appeared in record deletion is to deconstruct the k-anonymity and $\ell$-diversity. In this paper, we present an approach to securely anonymizing a continuously changeable dataset in an efficient manner while assuring high data quality.

Implementation Issues in Brain Implantable Neural Interface Microsystem (뇌 삽입형 신경 접속 마이크로 시스템의 구현상 이슈)

  • Song, Yoon-Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.4
    • /
    • pp.229-235
    • /
    • 2013
  • In this paper, we investigate several important issues on the implementation of a totally implantable microsystem for brain-machine interface that has been attracting a lot of attention recently. So far most of the scientific research has been focused on the high performance, low power electronics or systems such as neural signal amplifiers and wireless signal transmitters, but the real application of the implantable microsystem is affected significantly by a number of factors, ranging from design of the encapsulation structure to physiological and anatomical characteristics of the brain. In this work, we discuss on the thermal effect of the system, the detecting volume of the neural probes, wireless data transmission and power delivery, and physiological and anatomical factors that are critically important for the actual implementation of a totally brain implantable neural interface microsystem.

Software Reliabilit Growth Models for an Imperfect Debugging with Induced Software Faults (소프트웨어 내에 잠입한 에러에 의한 불완전 디버깅을 고려한 소프트웨어 신뢰도성장모델)

  • Lee, J.K.;Lee, K.H.;Park, K.C.
    • Electronics and Telecommunications Trends
    • /
    • v.18 no.5 s.83
    • /
    • pp.63-72
    • /
    • 2003
  • 소프트웨어의 신뢰성을 정량적으로 평가하는 데 있어서 소프트웨어 개발 프로세스의 시험단계나 사용자의 운용단계에 처한 동적 환경상태에서 소프트웨어 고장발생기능 현상을 기술한 소프트웨어 신뢰도성장모델을 많이 제안하고 있다. 대다수의 모델이 발생된 소프트웨어 고장의 발생원인에 대한 완전한 수정을 요구하는 완전 디버깅 환경을 가정하고 있다. 그러나 실제 개발자가 디버깅 작업을 수행할 때 완전한 수정이 불가능하기 때문이다. 다시 말해서 여러 소프트웨어 개발자가 경험한 이러한 디버깅 작업을 행하는 경우에는 결함을 제거하는 데 한계가 있기 때문에 수정 작업시 새로운 결함이 삽입되는 경우가 많다. 즉, 결함 수정은 불완전 환경에 처한다. 본 논문에서는 결함 수정시 신규 결함의 삽입 가능성을 고려하고 불완전 디버깅 환경에 대한 소프트웨어 신뢰도 성장모델을 제안한다. 소프트웨어 동작 환경 하에서 발생된 소프트웨어 고장과 시험 전 소프트웨어 내의 고유 결함에 의한 고장과 동작중에 랜덤하게 삽입된 결함에 의해 발생되는 고장 등 2종류의 결함을 고려하여 비동차 포아송과정(NHPP)에 의한 소프트웨어 고장발생 현상을 기술한다. 또한 소프트웨어 신뢰성 평가에 유용한 정량적인 척도를 도출하고 실측 데이터를 이용하여 적용한 결과를 제시하고 기존의 모델과의 적합성을 비교, 분석한다.

An LBX Interleaving Watermarking Method with Robustness against Image Removing Attack (영상제거 공격에 강인한 LBX 인터리빙 워터마킹 방법)

  • 고성식;김정화
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.6
    • /
    • pp.1-7
    • /
    • 2004
  • The rapid growth of digital media and communication networks has created an urgent need for self-contained data identification methods to create adequate intellectual property right(IPR) protection technology. In this paper we propose a new watermarking method that could embed the gray-scale watermark logo in low frequency coefficients of discrete wavelet transform(DWT) domain as the marking space by using our Linear Bit-eXpansion(LBX) interleaving of gray-scale watermark, to use lots of watermark information without distortion of watermarked image quality and particularly to be robust against attack which could remove a part of image. Experimental results demonstrated the high robustness in particular against attacks such as image cropping and rotation which could remove a part of image.

Digital Image Watermarking based on Wavelet Transform and Spatial (웨이브렛 변환 및 공간지각특성을 이용한 디지털영상 워터마킹)

  • Bae, Mi-Young;Lee, Jeong-Hwan;Kim, Yun-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.1165-1168
    • /
    • 2005
  • This paper proposes an digital image watermarking method based on discrete wavelet transform(DWT) and spatial perceptual properties of human visula system. first, an digital image is transformed by DWT and inserted gaussian watermark into the frequency domain. To increase the robustness and perceptual invisibility of watermark, the proposed algorithm is combined with the characteristics of digital image and human visual system. The proposed method is invisible and blind watermarking which the original image is not required to detect watermarks. Simulation results show that the proposed method is robust to the general attack such as JPEG compression, enhancement, noise, cropping, and filtering etc.

  • PDF

A Method for Recovering Image Data for Caption Regions and Replacing Caption Text (비디오 자막 영역 원영상 복원 후 자막 교환 방법)

  • Chun, Byung-Tae;Han, Kyu-Seo;Bae, Young-Lae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.10a
    • /
    • pp.743-746
    • /
    • 2001
  • 멀티미디어 정보 중 비디오 데이터는 정보량이 많기 때문에 자동화된 비디오 영상 처리 기술이 필요하다. 시청자의 이해와 시청의 편의성을 제공하기 위하여 대부분 비디오에 자막을 삽입하게 된다. 외국 방송물 및 영화에 삽입된 다른 언어 자막을 편집 과정에서 자막으로 교환 할 필요성이 종종 있게 된다. 기존의 방법들은 자막 부분을 충분히 포함하는 일정 영역에 특정 색상을 채운 후 새로운 자막을 삽입하게 된다. 기존 방법의 문제점은 많은 영역에 대해 비디오 영상 정보를 손실 시킴으로써 시청자에게 시청의 불편을 초래하고 자막 교환의 비 효율성과 부 자연스러움을 발생시킨다. 본 논문에서는 기존 방법의 문제점을 극복하기 위하여 자막 영역을 원영상으로 복원한 후 다른 자막으로 교환하는 방법을 제안하고자 한다. 원영상 복원을 위하여 비디오 정보와 BMA(Block Matching Algorithm)를 이용한 원영상 복원 방법을 제안하고, 복원된 영역에 다른 자막으로 교환함으로써 효과적인 자막 교환 방법을 제안하고자 한다. 실험 결과 원영상 복원을 이용한 자막 교환 방법은 기존 방법에 비해 자연스럽고 효과적인 교환 방법임을 볼 수 있었다.

  • PDF