• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1264-1267
• /
• 2012

IT기기의 발전으로 다량의 개인정보들이 생성되고 이동하고 사라진다. 이에 따라 개인정보 보호의 중요성이 커지며 기존의 단순한 파일 숨김 또는 파일 잠금 형태의 보호 시스템이 아닌 데이터를 암호화하여 보안성을 높이는 시스템이 필요하다. 우리가 개발한 시스템은 윈도우즈에서는 물론 안드로이드 기기에서도 사용할 수 있으며, 윈도우즈 PC와 안드로이드 스마트폰이 통신하며 암 복호화를 가능하게 하여 활용성을 높이려 노력하였고, PC버전의 경우 대용량데이터 암 복호화 및 파일 안전 삭제 기능을 추가 하여 구현 하여 PC의 특수성도 별도로 고려하였다.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.359-368
• /
• 2002

In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was $(15\times{5)}$ through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.4
• /
• pp.242-250
• /
• 2014

Conventional researches of standard tool validating cryptographic algorithm have been studied for the internet environment, for the mobile internet. It is important to develop the validation tool for establishment of interoperability and convenience of users in the information systems. Therefore, this paper presents the validation tool of Elliptic Curve Cryptography algorithm that can test if following X9.62 technology standard specification. The validation tool can be applied all information securities using DES, SEED, AES, SHA-1/256/384/512, RSA-OAEP V2.0, V2.1, ECDSA, ECKCDSA, ECDH, etc. Moreover, we can enhance the precision of validation through several experiments and perform the validation tool in the online environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.49-60
• /
• 2002

We propose an algorithm for extracting the boundary of a desired object with shape information obtained from sample images. Considering global shape obtained from sample images and edge orientation as well as edge magnitude, the Proposed method composed of two steps finds the boundary of an object. The first step is the approximate segmentation that extracts a rough boundary with a probability map and an edge map. And the second step is the detailed segmentation for finding more accurate boundary based on the SEEL (seed-point extraction and edge linking) algorithm. The experiment results using IR images show robustness to low-quality image and better performance than conventional segmentation methods.

• Journal of Internet Computing and Services
• /
• v.13 no.5
• /
• pp.55-64
• /
• 2012

Nowadays, as Cloud computing becomes popular, a need for a DFS(distributed file system) is increased. But, in the current Cloud computing environments, there is no DFS framework that is sufficient to protect sensitive private information from attackers. Therefore, we designed and proposed a secure scheme for distributed file systems. The scheme provides confidentiality and availability for a distributed file system using a secret sharing method. In this paper, we measured the speed of encryption and decryption for our proposed method, and compared them with that of SEED algorithm which is the most popular algorithm in this field. This comparison showed the computational efficiency of our method. Moreover, the proposed secure read/write model is independent of Hadoop DFS structure so that our modified algorithm can be easily adapted for use in the HDFS. Finally, the proposed model is evaluated theoretically using performance measurement method for distributed secret sharing model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.661-664
• /
• 2003

Trade-off of sorority and speed always exists in the latest network environment. Recently, developed security processors is improved very performance, and sorority connection algorithms of a lot of part were embodied by hardware. This high speed security processor is essential ingredient in string network security solution equipment development that require very big band width. In this paper, we wish to describe about design and implementation of 10 Giga VPN equipments. In this system, embodied 10 Giga to use Cavium company's Nitrox-II processor, and supports two SP14-2 interface and PCI interface. All of the password algorithm that password algorithm that support is used in common use VPN equipment for compatibility with common use VPN equipment are supported and support SEED algorithm developed in domestic. Designed to support IPsec and SSL protocol, and supports all of In-Line structure that is profitable in high speed transaction and the Look-Aside structure that is profitable in practical use degree of NPU(Network Processor Unit).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.1
• /
• pp.210-216
• /
• 2010

In this study, we propose a novel method to segment an individual tooth region in a true color image. The difference of the intensity in RGB is initially extracted and subsequent morphological reconstruction is applied to minimize the spurious segmentation regions. Multiple seeds in the tooth regions are chosen by searching regional minima and a Sobel-mask edge operations is performed to apply MCWA(Marker-Controlled Watershed Algorithm). As the results of applying MCWA transform for our proposed tooth segmentation algorithm, the individual tooth region can be resolved in a CCD tooth color image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2552-2562
• /
• 1996

In this paper, we propose a segmentation algorithm that can reliably separate moving objects from noisy background in the image sequance received from a camera at the fixed position. The proposed algorithm consists of three processes:generation of the difference image between the input image and the reference image, multilevel quantization of the difference image, and multistagemerging in the quantized image. The quantization process requantizes the difference image based on the multiple threshold values determined bythe histogram analysis. The merging starts from the seed region which created by using the highest threshold value and ends when termination conditions are met. the proposed method has been tested with various real imge sequances containing intruders. The test results show that the proposed algorithm can detect moving objects like intruders very effectively in the noisy environment.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.540-553
• /
• 2023

The hollow letter CAPTCHA (Completely Automated Public Turing test to tell Computers and Humans Apart) is an optimized version of solid CAPTCHA, specifically designed to weaken characteristic information and increase the difficulty of machine recognition. Although convolutional neural networks can solve CAPTCHA in a single step, a good attack result heavily relies on sufficient training data. To address this challenge, we propose a seed filling algorithm that converts hollow characters to solid ones after contour line restoration and applies three rounds of detection to remove noise background by eliminating noise blocks. Subsequently, we utilize a support vector machine to construct a feature vector for recognition. Security analysis and experiments show the effectiveness of this algorithm during the pre-processing stage, providing favorable conditions for subsequent recognition tasks and enhancing the accuracy of recognition for hollow CAPTCHA.

• Journal of Biosystems Engineering
• /
• v.39 no.4
• /
• pp.318-323
• /
• 2014

Purpose: This study was carried out to predict the growth period and fresh weight of sprouts grown in a cultivator designed to grow sprouts under optimal conditions. Methods: The temperature, light intensity, and amount of irrigation were controlled, and images of seed sprouts were acquired to predict the days of growth and weight from pixel counts of leaf area. Broccoli, clover, and radish sprouts were selected, and each sprout was cultivated in a 90-mm-diameter Petri dish under the same cultivating conditions. An image of each sprout was taken every 24 hours from the 4th day, and the whole cultivating period was 6 days, including 3 days in the dark. Images were processed by histogram inspection, binary images, image erosion, image dilation, and the overlay image process. The RGB range and ratio of leaves were adjusted to calculate the pixel counts for leaf area. Results: The correlation coefficients between the pixel count of leaf area and the growth period of sprouts were 0.91, 0.98, and 0.97 for broccoli, clover, and radish, respectively. Further, the correlation coefficients between the pixel count of leaf area and fresh weight were 0.90 for broccoli, 0.87 for clover, and 0.95 for radish. Conclusions: On the basis of these results, we suggest that the simple image acquisition system and processing algorithm can feasibly estimate the growth period and fresh weight of seed sprouts.