• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.10a
• /
• pp.1191-1192
• /
• 2015

기존의 유사 시퀀스 검색 방법들은 시퀀스 간의 거리를 이용하여 유사도를 판단하였다. 그러나 이러한 방법은 시퀀스의 형태를 고려하지 못하는 문제가 있다. 본 논문에서는 시퀀스를 쉬프팅하여 형태를 고려하고 시퀀스 간의 거리를 이용해 유사한 시퀀스를 검색하는 방법을 제안하고자 한다.

• Journal of Advanced Marine Engineering and Technology
• /
• v.36 no.5
• /
• pp.700-706
• /
• 2012

The core technology of a starting device in the packaged power system is the pinion gear shifting device and to limit the initial starting voltage. Although the conventional products have been used the starting controller using mechanical contactor, these have a big problem such as the uncertainty for the start of starting motor after a pinion gear is completely shifted or the arc demage due to high current. In this study, in order to solve these problems, we designed and fabricated a new product to achieve the safety and reliability as follows: the pinion gear-shifting control circuits to eliminate the uncertainty of the start, the starting control system using semiconductor device to prevent the arc demage of contactor caused by high current, a start safety devices for soft starting of series motor. In addition, we obtained the electrical safety by separating the pinion gear control circuit and the source circuit of motor.

• The Journal of Society for e-Business Studies
• /
• v.11 no.2
• /
• pp.1-11
• /
• 2006

This paper proposes an efficient inversion algorithm for Galois field GF(2n) by using a modified multi-bit shifting method based on the Montgomery algorithm. It is well known that the efficiency of arithmetic algorithms depends on the basis and many foregoing papers use either polynomial or optimal normal basis. An inversion algorithm, which modifies a multi-bit shifting based on the Montgomery algorithm, is studied. Trinomials and AOPs (all-one polynomials) are tested to calculate the inverse. It is shown that the suggested inversion algorithm reduces the computation time up to 26 % of the forgoing multi-bit shifting algorithm. The modified algorithm can be applied in various applications and is easy to implement.

• The KIPS Transactions:PartC
• /
• v.14C no.1 s.111
• /
• pp.39-44
• /
• 2007

In this paper, we propose a reversible watermarking method to recover an original image after the watermark has been extracted. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed method, we utilize histogram shifting concept and Location Map structure. We could solve the Filp-Flop problem by using Location Map structure and enlarge the information embedding capacity by embedding recursively. Experimental results demonstrate that the embedding information as large as 120k bits can be realized while the invisibility as high as 41dB can be maintained.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2006.11a
• /
• pp.313-316
• /
• 2006

디지털 핑거프린팅(Digital Fingerprinting)은 기 밀 정보를 디지털 콘텐츠에 삽입하는 측면에서는 디지털 워터마킹과 동일 하다고 볼 수 있으나 저작권자나 판매자의 정보가 아닌 콘텐츠를 구매한 사용자의 정보를 삽입함으로써 콘텐츠 불법 배포자를 추적할 수 있도록 한다는 점에서 워터마킹과 차별화된 기술이다. 이러한 핑거프린팅 기술은 소유권에 대한 인증뿐만 아니라 개인 식별 기능까지 제공해야 하므로 기존의 워터마킹이 갖추어야 할 요구사항인 비가시성, 견고성, 유일성과 더불어 공모허용, 비대칭성, 익명성, 조건부 추적성 등이 부가적으로 필요하다. 본 논문에서는 행렬의 한 열을 선택 후 쉬프팅 기법을 사용 하서 사용자 정보로 조합하여 핑거프린트를 생성하였다. 이렇게 생성된 핑거프린트 정보를 2레벨 웨이블릿 변환 영역 중 LH2, HL2, HH2 부대역에 삽입하였다. 쉬프팅 정보와 도메인 개념을 사용하여 보다 많은 사용자에게 핑거프린트 정보를 삽입할 수 있으며, 공모공격과 JPEG 압축에서도 최소한 1명 이상의 공모자를 검출할 수 있는 핑거프린팅의 기본 조건을 만족하였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.168-174
• /
• 2007

In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from the watermarked image. Most watermarking algorithms cause degradation of image quality in original digital contents in the process of embedding watermarks. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and the location map are employed in this algorithm, there is no need of extra information transmitted to the receiving side. As the locations watermark embedding are identified using the location map, the amount of watermark data can increase through recursive embedding.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.67-75
• /
• 2016

DNA computing technology makes the interests on DNA storage and DNA watermarking / steganography that use the DNA information as a newly medium. DNA watermarking that embeds the external watermark into DNA information without the biological mutation needs the reversibility for the perfect recovery of host DNA, the continuous embedding and detecting processing, and the mutation analysis by the watermark. In this paper, we propose a reversible DNA watermarking based on circular histogram shifting of DNA code values with the prevention of false start codon, the preservation of DNA sequence length, and the high watermark capacity, and the blind detection. Our method has the following features. The first is to encode nucleotide bases of 4-character variable to integer code values by code order. It makes the signal processing of DNA sequence easy. The second is to embed the multiple bits of watermark into -order coded value by using circular histogram shifting. The third is to check the possibility of false start codon in the inter or intra code values. Experimental results verified the our method has higher watermark capacity 0.11~0.50 bpn than conventional methods and also the false start codon has not happened in our method.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.576-578
• /
• 2006

The wide use of digital media during the past few years, has led to an increase of digital piracy and tampering. To deal with these problems, the concept of digital fingerprinting has been introduced. Digital fingerprinting is an effective method to identify users who might try to redistribute multimedia content. In this paper, we propose new digital image fingerprinting techniques using watermark shifting scheme and concept of domain.

• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.417-429
• /
• 2010

Reversible watermarking inserts watermark into digital media in such a way that visual transparency is preserved and then enables to restore the original media from the marked one without any loss of media quality. This watermarking can be applied to quality-sensitive imaging such as medical imaging, military imaging, remote-sensing imaging, and precious artwork, where the original media should be preserved during image processing and analysis. In this paper, a reversible image watermarking technique that embeds message bits by modifying the differential histogram of adjacent pixels is presented. In order to satisfy both high embedding capacity and visual quality, the proposed technique exploits the fact that adjacent pixels in the image have highly spatial correlation. Also, we prevent overflow/underflow problem and salt-and-pepper artifacts by employing a predicted error compensation scheme. Through experiments using various test images, we prove that the presented technique provides perfect reversibility and high embedding capacity, while maintaining the induced-distortion low.

• The KIPS Transactions:PartB
• /
• v.19B no.2
• /
• pp.83-92
• /
• 2012

Multimedia contents can be copied and manipulated without quality degradation. Therefore, they are vulnerable to digital forgery and illegal distribution. In these days, with increasing the importance of multimedia security, various multimedia security techniques are studied. In this paper, we propose a content authentication algorithm based on reversible watermarking which supports JPEG compression commonly used for multimedia contents. After splitting image blocks, a specific authentication code for each block is extracted and embedded into the quantized coefficients on JPEG compression which are preserved against lossy processing. At a decoding process, the watermarked JPEG image is authenticated by extracting the embedded code and restored to have the original image quality. To evaluate the performance of the proposed algorithm, we analyzed image quality and compression ratio on various test images. The average PSNR value and compression ratio of the watermarked JPEG image were 33.13dB and 90.65%, respectively, whose difference with the standard JPEG compression were 2.44dB and 1.63%.