• Journal of Computing Science and Engineering
• /
• 제1권1호
• /
• pp.95-123
• /
• 2007

Existing systems that support semistructured views do not maintain semantics during the process of designing the views. Thus, these systems do not guarantee the validity and reversibility of the views. In this paper, we propose an approach to address the issue of valid and reversible semistructured views, We design a set of view operators for designing semistructured views. These operators are select, drop, join and swap. For each operator, we develop a complete set of rules to maintain the semantics of the views. In particular, we maintain the evolution and integrity of relationships once an operator is applied. We also examine the reversible view problem under our operators and develop rules to guarantee that the designed views are reversible. Finally, we examine the changes in the participation constraints of relationship types during the view design process, and develop rules to ensure the correctness of the participation constraints.

• 전자공학회논문지A
• /
• 제31A권12호
• /
• pp.71-79
• /
• 1994

In this paper, $As_{40}Se_{50-x}S_[x}Ge_{10}$(x=0, 25, 35, at.%) bulk and thin films, to develope device of reversible hologram, proved amorphous by X-RD analysis. On the thin films with composition rate, as Se-doped-quantity increased, absorption edge shifted to long wavelength, and we found that reversible photodarkening effect occurred when thin films are exposed and annealed. Optical energy gap was larger when thin films are annealed than exposed. In this effect thin films structurally stabilized by annealing. It is to formed grating hologram by the bragg method on the $As_{40}Se_{15}S_[35}Ge_{10}$ thisn films with the best transmittance properties As polariging angle grew larger, we found that maximum diffraction efficiency became smaller, and obtained it of 4.5% on the thin fim thicknesss of 0.6 m, polarizing angle of 40$^[\circ}$ and exposing for 20sec.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.261-270
• /
• 2017

Data hiding is a way to hide the information in multimedia media such as images or video. The scheme proposed by Nguyen and Chang, was able to embed, extract, and restore the cover image and the secret data using Sudoku. But in the extracting phase, the occurrence of duplicate values in the reference matrix was found to decrease the embedding capacity of secret data. This paper has proposed a reversible data hiding scheme while maintaining the quality of the image to provide high embedding capacity using $7{\times}7$ Sudoku and Shamir's secret sharing scheme.

• 디지털콘텐츠학회 논문지
• /
• 제14권2호
• /
• pp.199-206
• /
• 2013

데이터를 한정된 양의 저장 공간 및 한정된 속도의 전송매체에서 다루기 위하여 여러 가지 데이터압축 방식이 개발되었다. 그 중 가장 최근에 개발된 기술인 재압축 기술은 대부분의 다른 압축방식과는 달리 데이터의 정보 엔트로피와는 무관하게 추가적인 정보 삽입이 가능하다. 재압축 기술은 원래의 멀티미디어 데이터를 블럭 단위로 나누어 각 블록의 반전 여부에 따라 0 또는 1을 삽입하는 기술이다. 본 논문에서는 제안한 재압축 기술을 오디오 파일에 적용시켰고, 이를 통하여 가역 정보은닉 방식을 구현하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
• /
• pp.133-136
• /
• 2000

A RVLC(Reversible Variable Length Code) with an efficient table memory is proposed in this paper. In the conventional decoding methods, the weight of symbols and code values are used for the decoding table. These methods can be applied for Huffman decoding. In VLC decoding, many studies have been done for memory efficiency and decoding speed. We propose an improved table construction method for general VLC and RVLC decoding, which uses the transition number of bits within a symbol with an enhanced weight decomposition. In this method, tile table for RVLC decoding can be implemented with a smaller memory

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.253-257
• /
• 2009

정보가 가역적으로 숨기어 졌다는 말은, 숨기고자 하는 정보가 삽입된 컨텐츠에서 비밀 정보를 찾아내고 또한 원본 컨텐츠를 완벽하게 복구할 수 있다는 말이다. 여러 가지 컨텐츠에 정보를 숨길 수 있으나 그 중에서 특히 이미지에 정보를 숨기고자 할 때는 두 가지 목표가 있다. 첫째는, 숨기고자 하는 데이터의 용량을 극대화 시키는 것이고 둘째는, 정보를 숨긴 다음에 생긴 이미지와 원본 이미지와의 차이를 줄이는 것이다. 본 논문은 데이터를 삽입시키는 차분값으로서 예측 오류 값을 이용하여 정보를 숨기는 개선된 방법을 제안하려고 한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.137-140
• /
• 2003

In this paper, we propose a new construction algorithm for the reversible variable-length code (RVLC) using a simplified average length function of the optimal Huffman code. RVLC is introduced as one of the error resilience tools in H.263+ and MPEG-4 owing to its error-correcting capability. The proposed algorithm demonstrates an improved performance in terms of the average codeword length over the existing HVLC algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.404-421
• /
• 2020

A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

• 한국멀티미디어학회논문지
• /
• 제17권7호
• /
• pp.849-857
• /
• 2014

In this paper, we propose a (2,2)-reversible secret image sharing scheme using histogram shifting and difference expansion. Two techniques are widely used in information hiding. Advantages of them are the low distortion between cover and stego images, and high embedding capacity. In secret image sharing procedure, unlike Shamir's secret sharing, a histogram generate that the difference value between the original image and copy image is computed by difference expansion. And then, the secret image is embedded into original and copy images by using histogram shifting. Lastly, two generated shadow images are distributed to each participant by the dealer. In the experimental results, we measure a capacity of a secret image and a distortion ratio between original image and shadow image. The results show that the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

• 한국정보전자통신기술학회논문지
• /
• 제10권6호
• /
• pp.617-625
• /
• 2017

본 논문에서는 기밀 데이터를 커버 이미지에 은닉하는 효과적인 가역 데이터 은닉 기법을 제안하였다. 제안된 기법에서는 이미지에 존재하는 지역적 유사성을 이용하여 픽셀 값을 정확하게 예측하여 예측 이미지를 생성하였고, 생성된 예측 이미지와 원본 커버 이미지를 사용하여 차분 시퀀스를 생성한 후, 히스토그램 쉬프트 기법을 적용하여 기밀데이터가 은닉된 스테고 이미지(stego-image)를 생성하였다. 스테고 이미지로부터 기밀 데이터를 추출하고 원본 커버 이미지를 손실 없이 복원할 수 있다. 제안된 기법을 적용하면 기존의 APD 기법에 비하여 더 많은 기밀 데이터를 은닉할 수 있음을 실험으로 확인하였다.