• 한국정보전자통신기술학회논문지
• /
• 제9권6호
• /
• pp.573-577
• /
• 2016

본 논문에서는 영상의 지역성과 인접 픽셀 차분시퀀스를 이용하는 가역 데이터 임베딩 기법을 제안하였다. 자연영상에는 일반적으로 지역성이 존재한다. 영상의 지역성을 이용하여 인접한 픽셀 값을 예측하는 기법을 기존의 기법인 APD(Adjacent Pixel Difference) 기법에 적용하여 임베딩 가능한 데이터 량을 증가 시키고 다양한 레벨로 데이터 임베딩을 가능하게 하는 가역 데이터 임베딩 기법을 제안하였다. 실험결과를 통하여 제안된 기법의 우수성을 확인하였다.

• ETRI Journal
• /
• 제40권5호
• /
• pp.677-686
• /
• 2018

A novel data hiding technique based on modified histogram shifting that incorporates multi-bit secret data hiding is proposed. The proposed technique divides the image pixel values into embeddable and nonembeddable pixel values. Embeddable pixel values are those that are within a specified limit interval surrounding the peak value of an image. The limit interval is calculated from the number of secret bits to be embedded into each embeddable pixel value. The embedded secret bits can be perfectly extracted from the stego image at the receiver side without any overhead bits. From the simulation, it is found that the proposed technique produces a better quality stego image compared to other data hiding techniques, for the same embedding rate. Since the proposed technique only embeds the secret bits in a limited number of pixel values, the change in the visual quality of the stego image is negligible when compared to other data hiding techniques.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.247-250
• /
• 2002

Data embedding has recently become important for protecting authority. In this paper, we Propose a robust data embedding technique for images. Our techniques are based on the convolution between message image and a random phase carrier. We add extra bits with carrier image to improve precision of detecting rate, moreover, we use block by block based cyclic correlation for the compensation of distortion. In experiment, we show that the proposed a1gorithm is robust to Stirmark 3.1. attacks.

• 한국멀티미디어학회논문지
• /
• 제23권9호
• /
• pp.1181-1190
• /
• 2020

Detection of an anomaly pattern deviating normal data distribution in streaming data is an important technique in many application areas. In this paper, a method for detection of an newly emerging pattern in text streaming data which is an ordered sequence of texts is proposed based on text embedding and anomaly pattern detection. Using text embedding methods such as BOW(Bag Of Words), Word2Vec, and BERT, the detection performance of the proposed method is compared. Experimental results show that anomaly pattern detection using BERT embedding gave an average F1 value of 0.85 and the F1 value of 1 in three cases among five test cases.

• 한국멀티미디어학회논문지
• /
• 제24권6호
• /
• pp.768-788
• /
• 2021

The reversible data hiding technique safely transmits secret data to the recipient from malicious attacks by third parties. In addition, this technique can completely restore the image used as a transmission medium for secret data. The reversible data hiding schemes have been proposed in various forms, and recently, the reversible data hiding schemes based on interpolation are actively researching. The reversible data hiding scheme based on the interpolation method expands the original image into the cover image and embed secret data. However, the existing interpolation-based reversible data hiding schemes did not embed secret data during the interpolation process. To improve this problem, this paper proposes embedding the first secret data during the image interpolation process and embedding the second secret data into the interpolated cover image. In the embedding process, the original image is divided into blocks without duplicates, and the maximum and minimum values are determined within each block. Three way searching based on the maximum value and two way searching based on the minimum value are performed. And, image interpolation is performed while embedding the first secret data using the PVD scheme. A stego image is created by embedding the second secret data using the maximum difference value and log function in the interpolated cover image. As a result, the proposed scheme embeds secret data twice. In particular, it is possible to embed secret data even during the interpolation process of an image that did not previously embed secret data. Experimental results show that the proposed scheme can transmit more secret data to the receiver while maintaining the image quality similar to other interpolation-based reversible data hiding schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권12호
• /
• pp.3100-3116
• /
• 2012

Reversible data hiding enables the embedding of messages in a host image without any loss of host content, which is proposed for image authentication that if the watermarked image is deemed authentic, we can revert it to the exact copy of the original image before the embedding occurred. In this paper, we present an improved histogram-based reversible data hiding scheme based on prediction and sorting. A rhombus prediction is employed to explore the prediction for histogram-based embedding. Sorting the prediction has a good influence on increasing the embedding capacity. Characteristics of the pixel difference are used to achieve large hiding capacity while keeping low distortion. The proposed scheme exploits a two-stage embedding strategy to solve the problem about communicating peak points. We also present a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing reversible data hiding schemes are provided to demonstrate the superiority of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2984-3004
• /
• 2015

Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1407-1423
• /
• 2020

A graph is a data structure consisting of nodes and edges between these nodes. Graph embedding is to generate a low dimensional vector for a given graph that best represents the characteristics of the graph. Recently, there have been studies on graph embedding, especially using deep learning techniques. However, until now, most deep learning-based graph embedding techniques have focused on unweighted graphs. Therefore, in this paper, we propose a graph embedding technique for weighted graphs based on long short-term memory (LSTM) autoencoders. Given weighted graphs, we traverse each graph to extract node-weight sequences from the graph. Each node-weight sequence represents a path in the graph consisting of nodes and the weights between these nodes. We then train an LSTM autoencoder on the extracted node-weight sequences and encode each nodeweight sequence into a fixed-length vector using the trained LSTM autoencoder. Finally, for each graph, we collect the encoding vectors obtained from the graph and combine them to generate the final embedding vector for the graph. These embedding vectors can be used to classify weighted graphs or to search for similar weighted graphs. The experiments on synthetic and real datasets show that the proposed method is effective in measuring the similarity between weighted graphs.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제9권1호
• /
• pp.70-76
• /
• 2003

디지털 워터마킹은 이미지, 사운드와 같은 멀티미디어 데이타에 지각할 수 없도록 비밀 정보를 삽입하는 기법이다. 일반적으로 주파수 영역 워터마킹 기법에서는 원 이미지에 대해 주파수 변환을 하고, 그 변환 면에 부호화된 워터마크 데이타를 삽입한다. 본 논문에서 우리는 Fresnel 변환을 이용한 새로운 워터마크 데이타 삽입 기법을 제안한다. 워터마크 이미지를 Fresnel 변환시켜 얻은 패턴의 값들을 원 이미지에 삽입한다. 본 워터마킹 모델은, 하나의 워터마크 이미지로부터 Fresnel 변환의 거리 파라미터의 값에 변화를 줌으로써 다양한 삽입 패턴을 얻을 수 있음으로 인해 데이타 삽입에 있어서 유연성을 가진다. 또한 도형, 문자, 사진과 같은 모든 종류의 이미지를 워터마크 데이타로 사용하는 것이 가능하다. 제안된 기법의 유효성을 검증하기 위한 실험 결과, 손실 압축, 필터링, 기하학적 변환 등의 공격에 대해 내성을 지니고 있음을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권1호
• /
• pp.170-191
• /
• 2024

The transmission of confidential data using cover media is called steganography. The three requirements of any effective steganography system are high embedding capacity, security, and imperceptibility. The text file's structure, which makes syntax and grammar more visually obvious than in other media, contributes to its poor imperceptibility. Text steganography is regarded as the most challenging carrier to hide secret data because of its insufficient redundant data compared to other digital objects. Unicode characters, especially non-printing or invisible, are employed for hiding data by mapping a specific amount of secret data bits in each character and inserting the character into cover text spaces. These characters are known with limited spaces to embed secret data. Current studies that used Unicode characters in text steganography focused on increasing the data hiding capacity with insufficient redundant data in a text file. A sequential embedding pattern is often selected and included in all available positions in the cover text. This embedding pattern negatively affects the text steganography system's imperceptibility and security. Thus, this study attempts to solve these limitations using the Part-of-speech (POS) tagging technique combined with the randomization concept in data hiding. Combining these two techniques allows inserting the Unicode characters in randomized patterns with specific positions in the cover text to increase data hiding capacity with minimum effects on imperceptibility and security. Format-preserving encryption (FPE) is also used to encrypt a secret message without changing its size before the embedding processes. By comparing the proposed technique to already existing ones, the results demonstrate that it fulfils the cover file's capacity, imperceptibility, and security requirements.