• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.283-290
• /
• 2005

The mismatched allocation of watermarking position due to parallel translation, rotation, and scaling distortion is a problem that requires an answer in watermarking. In this paper, we propose a watermarking method robust enough to hold against geometrical distorting using restoration pattern matching. The proposed method defines restoration pattern, then inserts the pattern to a watermark embedded image for distribution. Geometrical distortion is verified by comparing restoration pattern extracted from distributed image and the original restoration pattern inserted to the image. If geometrical distortion is found, inverse transformation is equally performed to synchronize the watermark insertion and extraction position. To evaluate the performance of the proposed method, experiments in translation, rotation, and scaling attack are performed.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.71-83
• /
• 2009

In this paper, we propose a paging scheme considering local environment and moving patterns of mobile hosts on HMIPv6. The proposed paging scheme can adaptively construct a paging domain according to handoff probability of mobile hosts and local environment, and process a paging based on handoff probability stage by stage. For analysis of the proposed paging scheme, we simulate our scheme in two different experiment environments: an open environment like a square and a restricted environment like downtown. In experiment results, the proposed scheme shows superior performance to that of compared scheme all over. Particularly, in case of high call request rate and a restricted environment, the proposed scheme shows better performance.

• The Journal of Korean Association of Computer Education
• /
• v.8 no.6
• /
• pp.123-132
• /
• 2005

There are many research results for the location update cost minimization of location management in cellular networks. For minimizing the location update cost, we have to take in consideration of each users' mobility pattern. This paper suggests location area list generation and a 3-step paging method based on users' movement history with the users' profiles. Users' mobility has not only geographical regular patterns but also time-related regularity. So, the method extracts users' movement regularities in both geography and time from their movement history, and generate location area list considering the regularities. For the performance analysis of the suggested method, we have executed a simulation for suggested method with user's mobility model. The results of the simulation show that suggested algorithm has some merits in the location management cost.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2017.04a
• /
• pp.144-144
• /
• 2017

쌈 채소 생산 및 유통의 효율성, 생산성 개선으로 경쟁력 향상을 위해 IoT 기반 스마트 저울과 쌈 채소전용 포장용 가이드를 개발 융합하여 안전하고 빠른 포장, 이동성 개선, 포장과 무게측정 동시 진행 및 출하량 자동측정으로 작업공정개선을 통해 최종적으로 생산성을 향상시킬 수 있는 제품을 개발하고자 한다. 1) 쌈 채소 포장용 가이드를 포함한 실시간 포장 무게 측정 장치 개발 ${\circ}$ 포장 박스와 관계없이 용이하게 사용할 수 있는 쌈 채소 포장용 가이드 개발 ${\circ}$ 실시간 포장 무게를 측정하여 출하 무게에 도달하였을 때 생산담당자에게 부저를 통해 신호전달 2) 생산패턴 분석을 통한 생산관리 애플리케이션 개발 ${\circ}$ 생산 패턴을 파악하여 실시간 생산량을 BLE 통신을 통해 관리자 스마트 폰으로 통지 ${\circ}$ 포장용 지그, 스마트 스케일, 이동체 1식으로 구성하여 용이하게 하우스 이동 3) 센서 디바이스 개발 ${\circ}$ 각종 센서(온도, 습도, 조도 등)의 디바이스를 활용하여 주위환경 데이터 수집 ${\circ}$ 스마트 폰 등을 활용한 콘텐츠 개발 및 노동복지 환경조성(작업환경 개선)

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.786-792
• /
• 2022

In the cloud computing environment, there has been a lot of research into the Fog/Edge Computing (FEC) paradigm for securing user proximity of application services and computation offloading to alleviate service delay difficulties. The method of predicting dynamic location change patterns of edge devices (moving objects) requesting application services is critical in this FEC environment for efficient computing resource distribution and deployment. This paper proposes an optimal moving pattern extraction algorithm in which variable weights (distance, time, congestion) are applied to selected paths in addition to a support factor threshold for frequency patterns (moving objects) of edge devices. The proposed algorithm is compared to the OPE_freq [8] algorithm, which just applies frequency, as well as the A^* and Dijkstra algorithms, and it can be shown that the execution time and number of nodes accessed are reduced, and a more accurate path is extracted through experiments.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.345-354
• /
• 2008

Recently, small-scale mobile network which is composed of many mobile devices in a man becomes popular. Also, Examples of large-scale mobile network can be thought access networks deployed on public transportation such as ships, trains and buses. To provide seamless mobility for mobile nodes in this mobile network, binding update messages must be exchanged frequently. However, it incurs network overhead increasingly and decreases energy efficiency of mobile router. If we try to reduce the number of the messages to cope with the problem, it may happen the security -related problems conversely Thus, mobile router needs a effective algorithm to update location information with low cost and to cover security problems. In this paper, mobility management scheme based on mobile router's mobility pattern is proposed. Whenever each mobile router leaves a visiting network, it records related information as moving log. And then it periodically computes mean resident time for all visited network, and saves them in the profile. If each mobile router moves into the visited network hereafter, the number of binding update messages can be reduced since current resident time may be expected based on the profile. At this time, of course, security problems can happen. The problems, however, are solved using key credit, which just sends some keys once. Through extensive experiments, bandwidth usages are measured to compare binding update messages in proposed scheme with that in existing scheme. From the results, we can reduce about 65% of mobility-management-related messages especially when mobile router stays more than 50 minutes in a network. Namely, the proposed scheme improves network usage and energy usage of mobile router by decreasing the number of messages and authorization procedure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1073-1079
• /
• 2014

One of the techniques that are most in the spotlight today, it can be said that Big data. With Big Data, technologies already prevalent in our lives is GPS. Based on the GPS data and Big Data, in this paper, we try to analyze the pattern and path of movement of a particular target. Specific target collects the GPS data by classifying weather and grade and sex of college students, and day of the week in college students of one university. The collected data is analyzed such as movement path, movement time, pattern of repetitive behavior. And visualize it. The analysis method will be classified according to the purpose of data. By identifying relationships with other data results obtained. Based on the present study, the future, we will derive the results of the data more reliable. For this purpose, a wide range of information to be collected will additionally. Research will be developed add to such as Season, time, blood type, occupation data.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.1255-1258
• /
• 2012

클라우드 컴퓨팅에서 사용되는 웹 서비스들은 워크플로우에 따라 서비스가 설계되어 조합된다. 대표적인 웹서비스 명세언어인 BPEL의 검증방법에는 Petri nets, Abstract State Machine(ASM), BPE-Calculus 등이 존재한다. 하지만 기존의 방법은 설계와 검증이 분리되어 있어 일관성이 부족하고, 시각화 문제, 동일성, 시간에 대한 제약조건의 문제점이 존재한다. 이에 대한 해결방안으로 이동성, 재구성성, 동일성, 시간속성 등의 새로운 분석 방법을 제시하는 Onion 언어가 제안되었다. 본 논문은 BPEL로 명세된 서비스를 Onion 시스템에 적용시키기 위한, 변환 과정에 대해서 다룬다. 이에 대한 과정으로 BPEL의 액티비티를 Onion으로 변환하고, 워크플로우 패턴을 적용하여, 3 가지 패턴을 Onion OVL로 변환을 적용하였다. 이를 통하여 BPEL을 Onion OVL로 변환하는데 문제가 없음을 보였으며, 효율적인 표현이 가능함을 보였다. 추후 Onion 시스템의 컴포넌트로 적용하여, BPEL로 작성된 서비스를 Onion 시스템을 통해 분석/검증할 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.811-819
• /
• 2017

A behavior pattern analysis algorithm based on descriptors consists of information of a moving object and temporal histogram is proposed. Background learning is performed first for detecting, tracking and analyzing moving objects. Each object is identified using an association of the center of gravity of objects and tracked individually. A temporal histogram represents a motion pattern using positions of the center of gravity and time stamp of objects. The characteristic and behavior of objects are figured out by comparing each coordinates of a position history in the histogram. Behavior information which is comprised with numbers of a start and end frame, and coordinates of positions of objects is stored and managed in the linked list. Descriptors are made with the stored information and the video retrieval algorithm is designed. We confirmed the higher retrieval accuracy compare with conventional methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1265-1268
• /
• 2003

사용자의 인터넷 환경이 점차 무선 접속을 통한 인터넷의 사용과 실시간 응용 데이터의 사용이 늘어가는 주세에 따라, 이동 인터넷 서비스를 하기 위한 방안으로 Mobile IPv6(MIPv6)가 제시되었다. 그러나 MIPv6에서, 현재 표준대로 핸드오프를 하는 경우에 길게는 수초에 이르는 핸드오프 지연이 생기고 그로 인한 패킷의 유실과 지연이 초래된다. 이것은 멀티미디어 스트리밍과 같이 실시간 데이터의 경우 치명적인 단점이 된다. 이에 이동노드가 외부 네트워크로 이동하는 경우 낮은 지연을 가지는 핸드오프 방법으로 fast핸드오프 방법이 있다. fast핸드오프는 히스토리 파일에 있는 임의의 한 이동노드가 전에 방문한 셀들에 대한 정보를 사용하여 이동전에 등록에 관한 패킷을 다음 이동할 셀 외부에이전트에게 미리 전송하고 이동을 하는 방법이다. 이 논문에서는 무선 단말의 이동 패턴 및 캐쉬 내 방향그래프(Directed Graph) 형식으로 작성한 히스토리 파일을 이용하여 이동성 예측 실패 시 패킷소실을 없앨 수 있는 방안에 대해 제안한다.