RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
          펼치기
        • 등재정보
          펼치기
        • 학술지명
          펼치기
        • 주제분류
        • 발행연도
          펼치기
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        효과적인 가역 정보은닉을 위한 픽셀의 차이 값을 이용한 개선된 보간법

        김평한,정기현,윤은준,유관우,Kim, Pyung Han,Jung, Ki Hyun,Yoon, Eun-Jun,Ryu, Kwan-Woo 한국멀티미디어학회 2021 멀티미디어학회논문지 Vol.24 No.6

        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.

      • KCI등재

        Reversible Data Hiding in Permutation-based Encrypted Images with Strong Privacy

        ( Chih-wei Shiu ),( Yu-chi Chen ),( Wien Hong ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.2

        Reversible data hiding in encrypted images (RDHEI) provides some real-time cloud applications; i.e. the cloud, acting as a data-hider, automatically embeds timestamp in the encrypted image uploaded by a content owner. Many existing methods of RDHEI only satisfy user privacy in which the data-hider does not know the original image, but leaks owner privacy in which the receiver can obtains the original image by decryption and extraction. In the literature, the method of Zhang et al. is the one providing weak content-owner privacy in which the content-owner and data-hider have to share a data-hiding key. In this paper, we take care of the stronger notion, called strong content-owner privacy, and achieve it by presenting a new reversible data hiding in encrypted images. In the proposed method, image decryption and message extraction are separately controlled by different types of keys, and thus such functionalities are decoupled to solve the privacy problem. At the technique level, the original image is segmented along a Hilbert filling curve. To keep image privacy, segments are transformed into an encrypted image by using random permutation. The encrypted image does not reveal significant information about the original one. Data embedment can be realized by using pixel histogram-style hiding, since this property, can be preserved before or after encryption. The proposed method is a modular method to compile some specific reversible data hiding to those in encrypted image with content owner privacy. Finally, our experimental results show that the image quality is 50.85dB when the averaged payload is 0.12bpp.

      • KCI등재

        비밀자료 삽입용량을 증가시키기 위한 비밀 공유 기반의 이중 이미지 가역 정보은닉 기법

        김평한,유관우,Kim, Pyung Han,Ryu, Kwan-Woo 한국멀티미디어학회 2022 멀티미디어학회논문지 Vol.25 No.9

        The dual image-based reversible data hiding scheme embeds secret data into two images to increase the embedding capacity of secret data. The dual image-based reversible data hiding scheme can transmit a lot of secret data. Therefore, various schemes have been proposed until recently. In 2021, Chen and Hong proposed a dual image-based reversible data hiding scheme that embeds a large amount of secret data using a reference matrix, secret data, and bit values. However, in this paper, more secret data can be embedded than Chen and Hong's scheme. To achieve this goal, the proposed scheme generates polynomials and shared values using secret sharing scheme, and embeds secret data using reference matrix and septenary number, and random value. Experimental results show that the proposed scheme can transmit more secret data to the receiver while maintaining the image quality similar to other dual image-based reversible data hiding schemes.

      • Reversible Data Hiding with Hierarchical Access Control for Medical Imagery

        Seungwu HAN,Masaaki FUJIYOSHI,Haekwang KIM,Hitoshi KIYA 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7

        This paper proposes a reversible data hiding method for supporting hierarchical control of access to data embedded in a medical image. The proposed method firstly hides the most important information to a medical image by the reversible manner in which information is enciphered. To the stego image to which once information is hidden, this method embeds different information that is enciphered with a different key. In the proposed method, only one key corresponding to the most important data is managed, and other keys are generated from the managed key through a one-way hash function. The privileged user such as the attending doctor receives the managed key and he/she extracts and deciphers all hidden data, whereas the unprivileged user like an ordinary nurse receives a key that for the least important data. The proposed method also has tamper detection ability. Simulation results show the effectiveness of the proposed method.

      • KCI우수등재

        가역 정보 은닉 기반 노이즈 최소화 자동 화질 개선 기법

        박성빈(Seongbin Park),김수아(Suah Kim),김형중(Hyoung Joong Kim) 대한전자공학회 2020 전자공학회논문지 Vol.57 No.3

        본 논문은 가역 정보 은닉을 활용한 자동 컨트라스트 개선 방법에서 발생하는 노이즈를 최소화하는 방법을 제안하였다. 가역 정보 은닉에 기반한 대표적인 이미지 개선 알고리즘인 ACERDH(Automatic Contrast Enhancement using Reversible Data Hiding)의 경우, 극단적인 명도 분포를 갖는 영상에서 특정 픽셀이 많이 이용되는 현상으로 인해 노이즈가 발생한다. 이를 해결하기 위해 새로운 ACERDH를 제안한다. 제안된 방법은 최대 높이의 봉우리를 선정함에 있어 봉우리 선정 임계값을 적용하여 노이즈가 발생될 것이라고 추정되는 픽셀을 통제함으로써 노이즈를 최소화한다. 또한 이웃 간 픽셀 합을 이용해 최저 높이의 봉우리를 선정함으로써 로케이션 맵의 크기를 최소화하여 은닉용량을 효율적으로 증가시켜 확보한다. This paper is about minimizing the noise generated by the automatic contrast enhancement using reversible data hiding. In the case of ACERDH (Automatic Contrast Enhancement using Reversible Data Hiding), a representative image enhancement algorithm based on reversible data hiding, noise occurs due to over-embedding into specific pixels in over- and under-exposed images with extreme brightness distribution. In order to solve it, a novel automatic contrast enhancement based on reversible data hiding is proposed. The proposed method minimizes the noise by controlling the pixels that are expected to generate noise by applying the peak selection threshold to the highest peak. Also, by selecting lowest peak using the sum of pixels between neighbors, the embedding capacity is increased efficiently by minimizing the size of the location map.

      • High Capacity, Reversible Data Hiding Using CDCS Along with Medical Image Authentication

        Amrinder Singh Brar,Mandeep Kaur 보안공학연구지원센터(IJSIP) 2015 International Journal of Signal Processing, Image Vol.8 No.1

        Healthcare institution that handles a number of patients, opinions is often sought from different experts. It demands the exchange of the medical history of the patient among the experts which includes the medical images, prescriptions and electronic patient records (EPR) etc. In order to reduce storage and transmission cost, data hiding techniques are used to embed patient information with medical images. In medical imaging applications, there are stringent constraints on image fidelity that strictly prohibit any permanent image distortion by the watermarking or data hiding. Authenticity is another important aspect in medical image watermarking. This paper proposed modified difference expansion watermarking using LSB replacement in the difference of virtual border for data hiding in medical images. The Class Dependent Coding Scheme (CDCS) is used to encode the EPR data so that embedding capacity can be increased. The image hash is calculated using MD5 to provide authentication. Experimental results show that proposed scheme provide us large data hiding capacities along with very high PSNR values as compared to earlier EPR data hiding techniques.

      • KCI등재

        DE 기반의 적응적인 가역정보은닉기법

        최장희(Jang-Hee Choi),윤은준(Eun-Jun Yoon),유기영(Kee-Young Yoo) 大韓電子工學會 2012 電子工學會論文誌-CI (Computer and Information) Vol.49 No.2

        공간 도메인에서 많은 DE 기반의 가역정보은닉 기법과 히스토그램 쉬프팅 기반의 가역정보은닉 기법들이 제안되어 왔다. 히스토그램 쉬프팅 기반의 가역정보은닉 기법은 스테고 이미지의 왜곡이 적다는 장점을 갖는다. 하지만 비밀 데이터의 삽입 용량이 적고, 추가 데이터가 많다는 단점이 있다. 이에 반해, DE 기반의 가역정보은닉 기법은 높은 삽입 용량을 갖는다는 장점이 있지만 스테고 이미지의 왜곡이 많다는 단점이 있다. 본 논문에서는 삽입 용량을 유지하지만 스테고 이미지의 왜곡을 줄이는 DE 기반의 가역정보은닉 기법을 제안한다. 본 논문에서는 비밀 데이터를 삽입하기 전에 예측 오차들을 블록으로 나눈 후, 각 블록에 비밀 데이터를 삽입할 수 있는지 확인한다. 만약 블록에 한 비트의 비밀 데이터만이라도 삽입하면 블록의 픽셀들은 변화한다. 제안하는 기법은 PSNR이 50dB 이상으로 다른 DE 기반의 가역정보은닉 기법보다 스테고 이미지의 왜곡을 줄인다. The many DE based data hiding schemes and the many data hiding schemes based on Histogram shifting are researched in spatial domain. The data hiding scheme based on Histogram shifting have an advantage of low distortion of the stego image. But the capacity is low than other schemes. On the other hands, the DE based data hiding schemes have an advantage of high capacity. But the quality of the stego image is low. In this paper, new data hiding scheme which has the similar capacity but the increased quality of the stego image is proposed. The prediction error is divided into blocks to embed the secret data in this scheme. The prediction errors in the block are scanned before the secret data is embedded. If one prediction error is low than the threshold at least, the block is changed to embed the secret data. Otherwise the secret data is not embedded. The distortion of the stego image is minimized by this method. But the block that the secret data embedded is marked in location map. So the additional information to extract the secret data and recover the cover image is needed.

      • Reversible Data-hiding Algorithm in Encrypted Image for Security Application in Cloud Computing

        Zhang Jing 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.7

        There is a shortcoming in reversible data-hiding algorithm in encrypted images, it is the low capacity. we put forward a new algorithm oriented security application in cloud computing, in the new algorithm of reversible data-hiding algorithm in encrypted image, we bring in cloud computing service and singular value decomposition based on matrix. Using the powerful computing and storage capacity, compute the singular value decomposition of some selected bit planes of the encrypted image, and store the recovery dictionary that generated in this process, in the end ,we directly embed the information into the singular value matrix. Experimental results show that under the premise of ensured image privacy security and higher image fidelity, the embedding capacity has been significantly improved, and the image can be fully recovered after information extraction. In the same time, the processes of information extraction and image restoration are separable. Compared with other algorithms, it has higher embedding capacity.

      • KCI등재

        비밀 공유 기반의 7×7 스도쿠를 사용한 가역 정보 은닉 기법

        김영주,김평한,유기영,Kim, Young-Ju,Kim, Pyung-Han,Yoo, Kee-Young 한국멀티미디어학회 2017 멀티미디어학회논문지 Vol.20 No.2

        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.

      • KCI등재

        Reversible Data Hiding Scheme for VQ Indices Based on Absolute Difference Trees

        ( Chin-chen Chang ),( Thai-son Nguyen ),( Chia-chen Lin ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.7

        Reversible data hiding is a technique for recovering original images without any distortion after secret data are extracted from the image. The technique continues to attract attention from many researchers. In this paper, we introduce a new reversible data hiding scheme based on the adjacent index differences of vector quantization (VQ) indices. The proposed scheme exploits the differences between two adjacent indices to embed secret data. Experimental results show that our scheme can achieve a lower compression rate than an earlier scheme by Yang and Lin. Our scheme`s average compression rate, 0.44 bpp, outperforms that of Yang and Lin`s scheme, which averages 0.53 bpp. Moreover, the embedding capacity of our scheme can rise to 1.45 bpi, which also is superior to that of Chang et al.`s scheme [35] (1.00 bpi)Yang and Lin`s scheme [27] (0.91 bpi) as well as Chang et al.`s scheme [26] (0.74 bpi).

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼