• IEMEK Journal of Embedded Systems and Applications
• /
• v.10 no.6
• /
• pp.335-343
• /
• 2015

As the usage of mobile devices becomes diverse, a number of attacks on Android also have increased. Among the attacks, Android can be compromised by flashing a new image of compromised Android Linux. In order to solve this problem, we propose SeBo (Secure Boot System) which prevents compromised Android Linux by guaranteeing secure boot environment for mobile devices based on ARM TrustZone architecture. SeBo checks the hash value of the Android Linux image before the Android Linux executes. SeBo detects all the attacks within 5 seconds. Moreover, since SeBo only trusts the Secure Bootloader from Secure World, SeBo can reduce the additional overhead of checking the Normal Bootloader from Normal World.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4516-4521
• /
• 2014

Digital watermarking for digital image authentication and integrity schemes are based on fragile watermarking and can detect any modifications in a watermark embedded image by comparing the embedded watermark with the regenerated watermark. Therefore, the digital watermark for image authentication and integrity should be erased easily when the image is changed by digital image processing, such as scaling or filtering etc. This paper proposes an effective tamper detection scheme for digital images. In the proposed scheme, the original image was divided into many non-overlapping $2{\times}2$ blocks. The digital watermark was divided into two LSB of each block and the image distortion was imperceptible to the human eye. The watermark extraction process can be used to determine if the watermarked image has been tampered. The experimental results successfully revealed the effectiveness of the proposed scheme.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1462-1471
• /
• 2005

Recently, the medical image has been digitized by the development of computer science and digitization of the medical devices. There are needs for database service of the medical image and long term storage because of the construction of PACS(picture archiving and communication system) following DICOM(digital imaging communications in medicine) standards, telemedicine, and et al. However, it also caused some kinds of problems, such as illegal reproduction of medical image, proprietary rights and data authentication. In this paper, we propose the new digital watermarking technique for medical image based on public key encryption algorithm for integrity verification. It prevents illegal forgery that can be caused after transmitting medical image data remotely. The watermark is the value of bit-plane in wavelet transform of the original image for certification method of integrity verification. We proposed the embedding regions are randomly chosen considering ROI, and a digital signature is made using hash function of MD5 which input is a secret key. The experimental results show that the watermark embedded by the proposed algorithm can survive successfully in image processing operations and that the watermark's invisibility is good.

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1125-1133
• /
• 2014

Recently, there are many researches have been studying for analyzing user interests and emotions based on users profiles and diverse information from Social Network Services (SNSs) due to their popularities. However, most of traditional researches are focusing on their researches based on single resource such as text, image, hash tag, and more, in order to obtain what user emotions are. Hence, this paper propose a method for obtaining user emotional information by analyzing texts and images both from Instagram which is one of the well-known image based SNSs. In order to extract emotional information from given images, we firstly apply GRAB-CUT algorithm to retrieve objects from given images. These retrieved objects will be regenerated by their representative colors, and compared with emotional vocabulary table for extracting which vocabularies are the most appropriate for the given images. Afterward, we will extract emotional vocabularies from text information in the comments for the given images, based on frequencies of adjective words. Finally, we will measure WUP similarities between adjective words and emotional words which extracted from the previous step. We believe that it is possible to obtain more precise user emotional information if we analyzed images and texts both time.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.39-47
• /
• 2005

This paper proposes and analyzes the MAC(Message Authentication Code) algorithm that is used for the transition integrity and the entity authentication of message. The MAC algorithm uses the DES algorithm which has 64-bit block and 56-bit key and we compare the security according to 64-bit and 32-bit length of MAC value. Moreover, we use the SEED algorithm which has 128-bit block and 128-bit key and compare the security according to 128-bit and 64-bit length of MAC value. We analyze the security the forgery attack according to length of message and length of MAC value. this paper, a coarse-to-fine optical flow detection method is proposed. Provided that optical flow gives reliable approximation to two-dimensional image motion, it can be used to recover the three-dimensional motion. but usually to get the reliable optical flows are difficult. The proposed algorithm uses Horn's algorithm (or detecting initial optical flow, then Thin Plate Spline is introduced to warp a image frame of the initial optical flow to the next image frame. The optical flow for the warped image frame is again used iteratively until the mean square error between two image sequence frames is lowered. The proposed method is experimented for the real moving Picture image sequence. The proposed algorithm gives dense optical flow vectors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.4300-4314
• /
• 2019

With the development of video-related applications, media content has increased dramatically through applications. There is a substantial amount of near-duplicate videos (NDVs) among Internet videos, thus NDVR is important for eliminating near-duplicates from web video searches. This paper proposes a novel NDVR system that supports large-scale retrieval and contributes to the efficient and accurate retrieval performance. For this, we extracted keyframes from each video at regular intervals and then extracted both commonly used features (LBP and HSV) and new image features from each keyframe. A recent study introduced a new image feature that can provide more robust information than existing features even if there are geometric changes to and complex editing of images. We convert a vector set that consists of the extracted features to binary code through a set of hash functions so that the similarity comparison can be more efficient as similar videos are more likely to map into the same buckets. Lastly, we calculate similarity to search for NDVs; we examine the effectiveness of the NDVR system and compare this against previous NDVR systems using the public video collections CC_WEB_VIDEO. The proposed NDVR system's performance is very promising compared to previous NDVR systems.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.165-168
• /
• 2019

The advancement in technology has led to the enormous use of multimedia applications. The video/image recorded by such applications provides critical information that can be used as a visual evidence. However, owing to the adequacy in using different editing tools, it is susceptible to malicious alterations. Thus, the reliability or the integrity of the visual information should be verified before using it as an evidence. In this paper, we propose an integrity verification method for the surveillance system using randomized hashing. The integrity value of the surveillance data is generated using the randomized hashing and elliptic curve cryptography (ECC), which is used later for the validation. The experimental results obtained from the embedded accident data recorder (ADR) system shows that the proposed method is very efficient and provides a high level of security.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.73.4-73
• /
• 2001

We suggest a system to detection whether material picked up is double or single when the robot feeds them in automation line. This system measures thickness of metal plate and alarms when they are double sheet measuring boundary lines of metal sheet. This system calculates the minimum distance of straight boundary lines by eliminating noise in the edge regions. In the experimental system, double or single is determined by calculating implemented the thickness in the image where the distance of pixels are retrieved by the hash table. In this paper, the algorithm of histogram is adapted to experiment in the implement, thus proved as double sheet detection system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1767-1770
• /
• 2003

PDA 는 터치패드 방식의 문자 입력을 한다. 따라서 사용자에게 긴 입력을 요구할 때 불편한 환경을 제공한다. 따라서 이미지의 특정 지점을 마우스로 선택함으로 문자입력을 대신하여 인증을 함으로써 편리한 환경을 제공한다. 보안을 제공하기 위하여 초기 이미지에 따른 이미지의 배열 정보 및 입력된 값을 해시코드화 하여 인증 및 키교환이 안전하게 이루어진다. HASH와 SEED 암호화 알고리즘을 적용하여 효율적이고, 전송 메시지의 무결성을 보장하며 내부 참여자에 의한 정보 유출이 있더라도 안전한 전자지불 프로토콜 시스템을 설계 및 구현하였다.

• Korean Journal of Remote Sensing
• /
• v.16 no.2
• /
• pp.145-156
• /
• 2000

Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.