• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1958-1968
• /
• 2015

Things intelligence communication (M2M or IoT) service activation and global company of OneM2M-related business on aggressive investing and has led to the acceleration of change in the ICT market. But a variety of hacking security technology because of the possibility of secure communication (data exposure, theft, modification, deletion, etc.) has been issued as an important requirement. In this paper, we propose a mutual authentication protocol for secure communications chameleon hash based on the M2M environment. The results of performance analysis efficiency is encryption and decryption an average of 0.7%, calculated rate showed good results as compared to the target algorithm, equivalent to a 3%(Average 0.003 seconds) difference, mutual authentication and encryption region by using the key update advantage of ECC(Elliptic Curve Cryptography)based Chameleon hash function is signed of the operational efficiency, using a collision message verifiable properties demonstrated strong security of the communication section.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2209-2215
• /
• 2014

This paper presents, a deinterlacing method by improving the Direction-Oriented Interpolation (DOI) technique. The technique is considered to be a very strong tool for intrafield-based deinterlacing. However, DOI has some problems such as long processing time, wrong edge detection in periodic pattern. To remedy this problem, we replace the full search in DOI by a two-step search to reduce processing time and introduces two additional processes to improve image quality. In the proposed method, the spatial direction vectors (SDVs) misread data are reconsidered to prevent them utilizing in the next interpolation step, resulting in an accurate deinterlacing method. We conduct experiments with ISO experimental images to compare the proposed method with the existing methods including line evarage (LA), edge-based line averaging (ELA), DOI, selective deinterlacing algorithm (SDA). Experimental results show the proposed method gives better performance in objective and subjective quality than existing deinterlacing methods.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.5
• /
• pp.489-495
• /
• 2022

It makes difference to LSTM D/L(Deep Learning) results for language model construction as the corpus preprocess changes. An LSTM model was trained with a famouse literaure poems(Ki Hyung-do's work) for training corpus in the study. You get the two wordvector sets for two corpus sets of the original text and eraised word ending text each once D/L training completed. It's been inspected of the similarity/analogy operation results, the positions of the wordvectors in 2D plane and the generated texts by the language models for the two different corpus sets. The suggested words by the silmilarity/analogy operations are changed for the corpus sets but they are related well considering the corpus characteristics as a literature work. The positions of the wordvectors are different for each corpus sets but the words sustained the basic meanings and the generated texts are different for each corpus sets also but they have the taste of the original style. It's supposed that the D/L language model can be a useful tool to enjoy the literature in object and in diverse with the analysis results shown in the study.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1229-1239
• /
• 2007

In conversion of web pages for mobile devices, since existing web conversion systems eliminate unnecessary objects indiscriminately or only convert the layout of a page, the original intention of a web designer is spoiled. In spite of great advances in device technology, there still remain the problems of limited display sire and insufficient CPU power. In this paper, we propose an adaptation method that minimizes the loss of information and preserves the original intention of a web designer from the visual aspect. In image conversion, the proposed method extracts meaningful information from the background against conventional resizing methods, and performs layout-based conversion for the arrangement of image components. Experimental results show the efficiency of the method on the accuracy and the usability in comparison with existing methods.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.9-17
• /
• 2006

Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.31-43
• /
• 2007

Sensor data have the characteristics such as numerous and continuous data. Therefore, it is required to develop an index which could retrieve a specific sensor data efficiently from numerous sensed data. The index should have an efficient delete operation for the past data to support the data archiving. In this paper, we have proposed and implemented an index splitting technique to support the sensor data archiving. These splitted indexes compose of a virtual index (that is, index management component), which is shown as single tree from outside. Experimental results show that in the case of 100,000 insert operations the splitted index performs 8% better than the traditional TB-tree maximumly. And the splitted index outperforms TB-tree with retrieving queries when the region of query is small and the size of time domain is large.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.360-363
• /
• 2015

In n-dimensional spatial data, Minimum Boundary Rectangle(MBR) was used to handle the moving object trajectories data. But, this method has inaccurate approximation. So, It makes many dead space and performs unnecessary operation when processing a query. In this paper, we offer new index structure using approximation. We developed algorithm that make index strucutre by using Douglas-Peucker Algorithm and had a comparison experiment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1266-1272
• /
• 2004

Location-Based Services(LBS) give rise to location-dependent queries of which results depend on the positions of moving objects. Because positions of moving objects change continuously, indexes of moving object must perform update operations frequently for keeping the changed position information. Existing spatial index (Grid File, R-Tree, KDB-tree etc.) proposed as index structure to search static data effectively. There are not suitable for index technique of moving object database that position data is changed continuously. In this paper, I propose a dynamic hashing index that insertion/delete costs are low. The dynamic hashing structure is that apply dynamic hashing techniques to combine a hash and a tree to a spatial index. The results of my extensive experiments show the dynamic hashing index outperforms the $R^$ $R^*$-tree and the fixed grid.

• Journal of IKEEE
• /
• v.16 no.4
• /
• pp.375-381
• /
• 2012

In this paper, we present an implementation of Viola-Jones algorithm in a multi-core SoC by using skin color information and a parallel processing method. In order to reduce unnecessary operations and improve the detection speed, we adopted a face detection algorithm based on skin color and deleted background image. The algorithm is functionally divided into several parts taking account of the size and the dependency so that the divided functions can be proceeded in parallel. Experiment results in SoC with built-in Cortex-A9 multi core show that it is about 1.8 times faster than the existing algorithm which is not divided.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.401-404
• /
• 2008

u-GIS 환경에서 발생하는 시공간 데이터는 지속적으로 발생하는 데이터 스트림의 특성을 갖으며, 그런 특성으로 인하여 데이터 발생량이 급격히 증가함에 따라 데이터 손실 및 시스템 성능 저하현상이 발생한다. 이를 해결하기 위해 부하 분산 연구들이 활발히 진행되어 오고 있다. 그러나 기존의 연구 방식인 랜덤 부하 분산 방식과 의미적 부하 분산 방식은 현 u-GIS 환경에서 부하 분산 속도 및 질의 결과의 정확도 측면에 만족스럽지 못한 결과를 준다. 그래서 본 논문에서는 우선순위를 이용한 차등적 부하 분산(DLSM : Different Load Shedding using MAP table)기법을 제안한다. DLSM 기법은 등록된 공간질의의 공간연산을 통해 영역의 우선순위를 미리 부여하고, 데이터가 발생하여 질의 처리기로 유입되기 전 우선순위를 파악한다. 데이터는 우선순위 단계에 따라 유입량을 확인 후 삭제 여부가 결정된다. 결과적으로 부하 분산 속도와 질의 결과의 정확도를 향상시켰다.