• Title/Summary/Keyword: Image Privacy

Search Result 103, Processing Time 0.02 seconds

Reversible Data Hiding and Message Authentication for Medical Images (의료영상을 위한 복원 가능한 정보 은닉 및 메시지 인증)

  • Kim, Cheon-Shik;Yoon, Eun-Jun;Jo, Min-Ho;Hong, You-Sik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.65-72
    • /
    • 2010
  • Nowadays, most hospitals have been used to create MRI or CT and managed them. Doctors depend on fast access to images such as magnetic resonance imaging (MRIs), computerized tomography (CT) scans, and X-rays for accurate diagnoses. Those image data are related privacy of a patient. Therefore, it should be protected from hackers and managed perfectly. In this paper, we propose a data hiding method into MRI or CT related a condition and intervention of a patient, and it is suggested that how to authenticate patient information from an image. In this way, we create hash code using HMAC with patient information, and hash code and patient information is hided into an image. After then, doctor will check authentication using HMAC. In addition, we use a reversible data hiding DE(Difference Expansion) algorithm to hide patient information. This technique is possible to reconstruct the original image with stego image. Therefore, doctor can easily be possible to check condition of a patient. As a consequence of an experiment with MRI image, data hiding, extraction and reconstruct is shown compact performance.

Fault Tolerant Encryption and Data Compression under Ubiquitous Environment (Ubiquitous 환경 하에서 고장 극복 암호 및 데이터 압축)

  • You, Young-Gap;Kim, Han-Byeo-Ri;Park, Kyung-Chang;Lee, Sang-Jin;Kim, Seung-Youl;Hong, Yoon-Ki
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.8
    • /
    • pp.91-98
    • /
    • 2009
  • This paper presents a solution to error avalanche of deciphering where radio noise brings random bit errors in encrypted image data under ubiquitous environment. The image capturing module is to be made comprising data compression and encryption features to reduce data traffic volume and to protect privacy. Block cipher algorithms may experience error avalanche: multiple pixel defects due to single bit error in an encrypted message. The new fault tolerant scheme addresses error avalanche effect exploiting a three-dimensional data shuffling process, which disperses error bits on many frames resulting in sparsely isolated errors. Averaging or majority voting with neighboring pixels can tolerate prominent pixel defects without increase in data volume due to error correction. This scheme has 33% lower data traffic load with respect to the conventional Hamming code based approach.

A Development of Non-Invasive Body Monitoring IOT Sensor for Smart Silver Healthcare (스마트 실버 헬스케어를 위한 비접촉 인체감지 IOT 센서 개발)

  • Kang, Byung Wuk;Kim, Sang Hee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.1
    • /
    • pp.28-34
    • /
    • 2018
  • This paper is composed of a passenger management system using a temperature sensing module, a PIR sensor module for detecting movement inside a room, and a smart breath sensing module for determining a sleeping state. An embedded sensor module and a communication system integrated the sensing part and the algorithm driving part. As the aging society is accelerating and becoming more upgraded, the social cost of Silver Care increases, and in order to protect privacy, it is necessary to reduce costs by developing efficient smart silver care devices. The proposed non - image human body detection IOT sensor system is implemented by hardware and software and has superior performance compared with conventional image monitoring method.

Methods and Examples of Pseudonymized Image Value Measurement using Contingent Valuation Method (조건부가치평가법을 이용한 가명화된 이미지 가치측정 방법 및 사례)

  • You Jeong Choi;Tae-Sung Kim
    • Information Systems Review
    • /
    • v.26 no.1
    • /
    • pp.57-71
    • /
    • 2024
  • There are several ways to assess the value of personal data, but there is no standard for evaluating data value. In the case of medical my data utilization platform services, it was found that when the platform company received the user's consent and received data for the purpose of data utilization, an average of about 4,000 credits was paid per user as compensation. As in the previous case, the value of personal information is mainly measured based on the value of each individual, not on specific items of personal information. However, as the number and type of personal information increases, the value of personal information must be measured by type. This study focuses on measuring the value of unstructured personal information, especially images, and proposes standards for unstructured personal information. By measuring the value of images, we will be able to help platform companies set credit standards for compensation per person when providing data and support objective and reasonable pricing when selling B2B data.

A Secure Face Cryptogr aphy for Identity Document Based on Distance Measures

  • Arshad, Nasim;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.10
    • /
    • pp.1156-1162
    • /
    • 2013
  • Face verification has been widely studied during the past two decades. One of the challenges is the rising concern about the security and privacy of the template database. In this paper, we propose a secure face verification system which generates a unique secure cryptographic key from a face template. The face images are processed to produce face templates or codes to be utilized for the encryption and decryption tasks. The result identity data is encrypted using Advanced Encryption Standard (AES). Distance metric naming hamming distance and Euclidean distance are used for template matching identification process, where template matching is a process used in pattern recognition. The proposed system is tested on the ORL, YALEs, and PKNU face databases, which contain 360, 135, and 54 training images respectively. We employ Principle Component Analysis (PCA) to determine the most discriminating features among face images. The experimental results showed that the proposed distance measure was one the promising best measures with respect to different characteristics of the biometric systems. Using the proposed method we needed to extract fewer images in order to achieve 100% cumulative recognition than using any other tested distance measure.

A Local Feature-Based Robust Approach for Facial Expression Recognition from Depth Video

  • Uddin, Md. Zia;Kim, Jaehyoun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1390-1403
    • /
    • 2016
  • Facial expression recognition (FER) plays a very significant role in computer vision, pattern recognition, and image processing applications such as human computer interaction as it provides sufficient information about emotions of people. For video-based facial expression recognition, depth cameras can be better candidates over RGB cameras as a person's face cannot be easily recognized from distance-based depth videos hence depth cameras also resolve some privacy issues that can arise using RGB faces. A good FER system is very much reliant on the extraction of robust features as well as recognition engine. In this work, an efficient novel approach is proposed to recognize some facial expressions from time-sequential depth videos. First of all, efficient Local Binary Pattern (LBP) features are obtained from the time-sequential depth faces that are further classified by Generalized Discriminant Analysis (GDA) to make the features more robust and finally, the LBP-GDA features are fed into Hidden Markov Models (HMMs) to train and recognize different facial expressions successfully. The depth information-based proposed facial expression recognition approach is compared to the conventional approaches such as Principal Component Analysis (PCA), Independent Component Analysis (ICA), and Linear Discriminant Analysis (LDA) where the proposed one outperforms others by obtaining better recognition rates.

A Study of Photoshop Retouching Technique for Beauty Make-up (뷰티 메이크업을 위한 포토샵 리터칭 기법 연구)

  • Kwon, Hyun-Ah
    • The Research Journal of the Costume Culture
    • /
    • v.14 no.6
    • /
    • pp.932-944
    • /
    • 2006
  • With supplied computers and the development of information and communication thropugh the Internet, the space of personal home pages in potal sites has been filled with photos taken by digital cameras, and 'the introduction of privacy' done in the personal home pages has become a general trend in society. As the use of Photoshop, available to edit and modify digital photos, in this social atmosphere, has grown general, they have shown their interest in the retouching technique of Photoshop. Computer graphics, marked based on the treatment of a variety of information into pictures or a technology to mark it, recently various application methods have been found in make-up. Especially, Adobe Photoshop, used to edit and modify images, is a sofetware program proper to perform beauty make-up in correcting and creating images in an effective way. The purpose of this study is to express each factor in Adobe Photoshop CS2 about the beauty make-up. As a result, I can say, the process that digital image is retouched by Adobe Photoshop CS is similar work to beauty make-up. The process of Photoshop retouching can be used as the materials for educating of make-up and as the materials for presentation of beauty make-up trend. And also we can serve the simulation to the customer before real make-up. Therefore, this study is for the effective performance of diverse beauty makeup integrating retouch technique with Photoshop CS.

  • PDF

Digital Evidence Collection Procedure for Hardware Unique Information Collection (하드웨어 고유 정보 수집에 대한 디지털 증거 수집 절차)

  • Pak, Chan-ung;Lee, Sang-jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.4
    • /
    • pp.839-845
    • /
    • 2018
  • Sensitive data is encrypted and stored as privacy policy is strengthened through frequent leakage of personal information. For this reason, the cryptographically owned encrypted data is a very important analysis from the viewpoint of digital forensics. Until now, the digital evidence collection procedure only considers imaging, so hardware specific information is not collected. If the encryption key is generated by information that is not left in the disk image, the encrypted data can not be decrypted. Recently, an application for performing encryption using hardware specific information has appeared. Therefore, in this paper, hardware specific information which does not remain in file form in auxiliary storage device is studied, and hardware specific information collection method is introduced.

Robust Watermarking in Medical Images Using by Polar Transformation (의료영상에서 Polar 변환을 적용한 강인한 워터마킹 기법)

  • 남기철;박무훈
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.379-385
    • /
    • 2004
  • Medical images are being managed more by PACS in general medical institutions. It is important to protect patients from being invaded their privacy related to the images. It is also necessary to confirm the ownership, the right of property of the medical images and notice whether the data are modified. In this paper, we propose a robust watermarking against RST attacks in medical images on the PACS. The proposed scheme modifies and improves Log-Polar Mapping and Fourier Mellin Transform in order to realize and recover serious image degradation and watermark data loss caused by the conversion between cartesian coordinate and log-polar coordinate. We used the radius and theta Look Up Table to solve the realization of the Fourier Mellin Transform, and inserted a watermark into 2D-DFT magnitudes using Spread Spectrum. Experimental results shows that this method are robust to rotation attack.

Efficient Scheme for Secret Hiding in QR Code by Improving Exploiting Modification Direction

  • Huang, Peng-Cheng;Li, Yung-Hui;Chang, Chin-Chen;Liu, Yanjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2348-2365
    • /
    • 2018
  • QR codes as public patent are widely used to acquire the information in various fields. However, it faces security problem when delivering the privacy message by QR code. To overcome this weakness, we propose a secret hiding scheme by improving exploiting modification direction to protect the private message in QR code. The secret messages will be converted into octal digit stream and concealed to the cover QR code by overwriting the cover QR code public message bits. And the private messages can be faithfully decoded using the extraction function. In our secret hiding scheme, the QR code public message still can be fully decoded publicly from the marked QR codes via any standard QR Code reader, which helps to reduce attackers' curiosity. Experiments show that the proposed scheme is feasible, with high secret payload, high security protection level, and resistant to common image post-processing attacks.