• Journal of Information Processing Systems
• /
• 제16권2호
• /
• pp.460-477
• /
• 2020

As one of the most significant challenges in the virtual data center, the virtual data center embedding has attracted extensive attention from researchers. The existing research works mainly focus on how to design algorithms to increase operating revenue. However, they ignore the energy consumption issue of the physical data center in virtual data center embedding. In this paper, we focus on studying the energy-aware virtual data center embedding problem. Specifically, we first propose an energy consumption model. It includes the energy consumption models of the virtual machine node and the virtual switch node, aiming to quantitatively measure the energy consumption in virtual data center embedding. Based on such a model, we propose two algorithms regarding virtual data center embedding: one is heuristic, and the other is based on particle swarm optimization. The second algorithm provides a better solution to virtual data center embedding by leveraging the evolution process of particle swarm optimization. Finally, experiment results show that our proposed algorithms can effectively save energy while guaranteeing the embedding success rate.

• 대한한의학원전학회지
• /
• 제32권1호
• /
• pp.61-74
• /
• 2019

Objectives : The purpose of this study is to help select an appropriate word embedding method when analyzing East Asian traditional medicine texts as data. Methods : Based on prescription data that imply traditional methods in traditional East Asian medicine, we have examined 4 count-based word embedding and 2 prediction-based word embedding methods. In order to intuitively compare these word embedding methods, we proposed a "prescription generating game" and compared its results with those from the application of the 6 methods. Results : When the adjacent vectors are extracted, the count-based word embedding method derives the main herbs that are frequently used in conjunction with each other. On the other hand, in the prediction-based word embedding method, the synonyms of the herbs were derived. Conclusions : Counting based word embedding methods seems to be more effective than prediction-based word embedding methods in analyzing the use of domesticated herbs. Among count-based word embedding methods, the TF-vector method tends to exaggerate the frequency effect, and hence the TF-IDF vector or co-word vector may be a more reasonable choice. Also, the t-score vector may be recommended in search for unusual information that could not be found in frequency. On the other hand, prediction-based embedding seems to be effective when deriving the bases of similar meanings in context.

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

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

• 한국멀티미디어학회논문지
• /
• 제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.

• 방송공학회논문지
• /
• 제12권2호
• /
• pp.112-119
• /
• 2007

Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data as well should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data hiding scheme. The difference expansion method achieves high embedding capacity and keeps the distortion low. This paper shows that the difference expansion method with simplified location map, and new expandability and changeability can achieve more embedding capacity while keeping the distortion almost the same as the original expansion method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 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.

• 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.

• 대한전자공학회논문지SP
• /
• 제43권4호
• /
• pp.27-36
• /
• 2006

무손실 정보은닉은 정보를 삽입하되 추출과정에서 원본 영상으로의 완벽한 복원이 가능하도록 정보를 삽입하는 기술이다. 본 논문에서는 웨이블릿 영역에서 영상에 대한 무손실 정보은닉 알고리즘을 제안한다. 제안된 알고리즘은 히스토그램 수정을 웨이블릿 계수에 적용한 방법으로 두 단계의 삽입과정으로 이루어진다. 1차 삽입과정에서 히스토그램을 수정함으로써 웨이블릿 계수에 정보를 은닉한다. 2차 삽입과정은 1차 삽입 과정에서 발생한 영상의 왜곡을 줄이는 동시에 정보를 은닉할 수 있는 방법으로 높은 삽입용량을 얻을 수 있게 한다. 제안 알고리즘은 모의실험을 통해 기존의 방법들보다 삽입용량 대 PSNR 측면에 서 향상된 성능을 보여주었다.

• 방송공학회논문지
• /
• 제16권5호
• /
• pp.801-810
• /
• 2011

본 논문에서는 디지털 영상을 위한 공간 영역에서의 무손실 데이터 삽입 방법을 제안한다. 제안하는 방법은 데이터 삽입 및 추출을 위해 위치 지도 등의 부가 정보를 삽입하는 대신에 단 한 개의 파라미터 만을 필요로 한다. 삽입 과정에서는 $3{\times}3$ 크기의 창이 대상 영상 위를 한 화소 단위로 움직이며 각 위치에서 한 비트의 데이터를 삽입 할 수 있다. 따라서, 이상적인 삽입 용량은 영상의 화소수와 동일하다. 또한, 추가적인 실제 삽입 용량의 증가를 위해, 삽입 대상 화소의 예측을 위한 새로운 계수를 적용하였다. 그 결과 기존의 방법에 비해 삽입 용량이 매우 큰 폭으로 증가하고, 고용량 데이터 삽입 시의 영상 화질 또한 향상되었다. 제안 방법은 컴퓨터 시뮬레이션을 통해 검증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3298-3321
• /
• 2021

A lot of data hiding schemes have been proposed to embed secret data in the plain cover images or compressed images of various formats, including JPEG, AMBTC, VQ, etc. In this paper, we propose a production process of mosaic images based on three regular images of coffee beans. A primary image is first mimicked by the process to produce a mosaic cover image. A two-layer steganography is applied to hide secret data in the mosaic image. Based on the low visual quality of the mosaic cover image, its PSNR value can be improved about 1.5 dB after embedding 3 bpp. This is achieved by leveraging the newly proposed polarized search mask and the concepts of strong embedding and weak embedding. Applying steganography to the mosaic cover images is a completely new idea and it is promising.