• Journal of the Korea Society of Computer and Information
• /
• v.23 no.4
• /
• pp.33-39
• /
• 2018

In this paper, we propose a describes how to detect a false iris image by inserting watermark into a iris image. The existing method, which inserts the watermark into the entire iris image to detect a fake iris, has a problem that can evade it by segmenting iris region of an iris image. The purpose of overcoming the problem, this paper proposes a new fake iris detection technique based on digital watermark. It first searches a central point of an iris image, divide the image into blocks with respect to the point. executes Discrete Cosine Transform, inserts watermark into the blocks, and then verifies an iris image using NC(Normalized Correlation). In the experiments, we confirm the robustness for attacks - crop and JPEG.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.572-577
• /
• 2009

This paper proposes a novel reversible image authentication method that requires neither location map nor memorization of parameters. The proposed method detects image tampering and further localizes tampered regions. Though this method once distorts an image to hide data for tamper detection, it recovers the original image from the distorted image unless no tamper is applied to the image. The method extracts hidden data and recovers the original image without memorization of any location map that indicates hiding places and of any parameter used in the algorithm. This feature makes the proposed method practical. Simulation results show the effectiveness of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.49-58
• /
• 2005

In this paper, we proposed a blind watermarking algerian to use characteristics of a scalar quantizer which is the recommended in the JPEG2000 and JPEG. The proposed algorithm shifts a quantization index according to the value of each watermark bit to prevent losing the watermark information during the compression by quantization. Therefore, the watermark is embedded during the process of quantization, not an additional process for watermarking, and is adaptively applied as a assigned quantizer according application areas. Before embedding process, a LFSR(Linear feedback shift register) rearranged the watermark for the security of the watermark itself and in the embedding process, a LFSR is used to hide the watermarking positions. Therefore the embedded watermark can he extracted by only the owner who knows the initial value of LFSR without the original image. The visual recognizable pattern such as a binary image was used as the watermark. The experimental results showed that the proposed algerian satisfies the robustness and imperceptibility corresponding to the major requirement of watermarking. The results showed the largest error rate to be $5.7\%$ for attack. The experimental result which compares the proposed algorithm with the Mohamed algorithm showed that the proposed algorithm was better than it, exactly $4\~5$ times for the attacks of JPEG and JPEG2000.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1417-1426
• /
• 2007

As one of schemes to protect multimedia content. it is the selective encryption scheme to encrypt partially multimedia content. Compared AES(advanced encryption standard) of traditional encryption, the selective encryption scheme provides low security but is applicable to applications of multimedia content not to require high secrecy. In this paper, we improve the image scrambling scheme proposed by Van De Ville which scrambles an image without bandwidth expansion using DPSS(discrete prolate spheroidal sequence) to make it more secure based on Shujun's research which verifies the secrecy of Van De Ville's scheme. The proposed method utilizes an orthonormalized random matrix instead of Hadamard matrix for secret matrix and to add it for providing high secrecy against statistical attack or known-plaintext attack using some statistical property or estimate of secret matrix from a scrambled image. The experimental results show that the proposed method is more secure than the existing scheme. In addition, we show that the proposed method can be applied to access control or copy control of watermarking application.

• The KIPS Transactions:PartB
• /
• v.10B no.5
• /
• pp.491-496
• /
• 2003

We present a new watermark design tool for digital images and digital videos that are based on human visual system (HVS) characteristics. In this tool, basic mechanisms (inhibitory and excitatory behaviour of cells) of HVS are used to determine image dependent upper bound values on watermark insertion. This allows us to insert maximai allowable transparent watermark, which in turn is extremely hard to attack with common image processing, Motion Picture Experts Group (MPEG) compression. As the number of details (e.g. edges) increases in an image, the HVS decrease its sensitivity to the details. In the same manner, as the number of motion increases in a video signal, the HVS decrease its sensitivity to the motions. We model this decreased sensitivity to the details and motions as an (motion) entropy masking. Entropy masking model can be efficiently used to increase the robustness of image and video watermarks. We have shown that our entropy-masking model provides watermark scheme with increased transparency and henceforth increased robustness.

• 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 Information Processing Systems
• /
• v.15 no.1
• /
• pp.1-6
• /
• 2019

Recently, big data and artificial intelligence (AI) based on communication systems have become one of the hottest issues in the technology sector, and methods of analyzing big data using AI approaches are now considered essential. This paper presents diverse paradigms to subjects which deal with diverse research areas, such as image segmentation, fingerprint matching, human tracking techniques, malware distribution networks, methods of intrusion detection, digital image watermarking, wireless sensor networks, probabilistic neural networks, query processing of encrypted data, the semantic web, decision-making, software engineering, and so on.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.242-245
• /
• 2002

최근 인터넷의 보편화로 인한 디지털 컨텐츠의 폭발적 요구 증가로 디지털 저작권 보호를 위한 여러 기술들이 연구되고 있다. 디지털 워터마킹은 디지털 컨텐츠의 저작자의 정보를 삽입하여 저작권을 보호하는 기술이다. 본 논문에서는 DCT 영역에서 대역확산을 이용하여 이미지 압축에 강인하고, 비 가시성이 뛰어난 워터마킹 기술을 제안한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.174-177
• /
• 2002

디지털 워터마킹 평가를 위한 벤치마킹 방법이 여러 가지 개발되고 있다. 특히 Stirmark 벤치마킹은 정지영상에 대한 디지털 워터마킹 기술을 평가하기 위한 방법으로 현존 벤치마킹 방법들 중 가장 대표적인 것으로서 강인성에 주안점을 둔 방법이다. 본 논문에서는 Stirmark의 공격 종류와 Stirmark를 이용하여 기존에 개발되어 있는 여러 가지 워터마킹 기법을 평가하고자 한다.

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.168-180
• /
• 2002

This paper proposes a novel method to detect unauthorized copies of digital images. This copy detection scheme can be used as either an alternative approach or a complementary approach to watermarking. A test image is reduced to 8$\times$8 sub-image by intensity averaging, and the AC coefficients of its discrete cosine transform (DCT) are used to compute distance from those generated from the query image, of which a user wants to find copies. Copies may be Processed to avoid copy detection or enhance image quality. We show ordinal measure of DCT coefficients, which is based on relative ordering of AC magnitude values and using distance metrics between two rank permutations, are robust to various modifications of the original image. The optimal threshold selection scheme using the maximum a posteriori (MAP) criterion is also addressed.