• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.4
• /
• pp.2757-2763
• /
• 2015

p-Snake is an energy minimizing algorithm that applies an additional prototype energy to the existing Active Contour Model and is used to extract the contour line in the area where the edge information is unclear. In this paper suggested the creation of a prototype energy field that applies a variable prototype expressed as a combination of circle and straight line primitives, and a fudge function, to improve p-Snake's contour extraction performance. The prototype was defined based on the parts codes entered and the appropriate initial contour was extracted in each primitive zones acquired from the pre-processing process. Then, the primitives variably adjusted to create the prototype and the contour probability based on the distance to the prototype was calculated through the fuzzy function to create the prototype energy field. This was applied to p-Snake to extract the contour from 100 images acquired from various small parts and compared its similarity with the prototype to find that p-Snake made with the adaptive prototype was about 4.6% more precise than the existing Snake method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.2
• /
• pp.169-180
• /
• 1998

This research presents development of real-time service primitive in MHS(Message Hanling system) supporting desk-top conferencing system. Desk-top conferencing system is one of the real-time GC(Group Communication) services. The complexity of modem society has led to the consequent need for real-time GC between a number of people in order to jointly handle tasks in business, government and other forms of organization. Despite the many different form of desk-top conferencing systems developed to date, there are still few systems in widespred no. One of the biggest hurdle preventing the widespred adoption of real-time GC is the lack of agreement on user-friendly interchange environments. In distributed office environments, the MHS is one of the most widely used service for information interchange. It is a standard of electronic mail system which is concerned mostly with asynchronous exchange of short notes. It is clear that additional functions on MHS are necessary in order to allow users to properly process their real-time group messages and provide them with important facilities as a communication infrastructure for real-time GC.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.5
• /
• pp.271-281
• /
• 2007

Real-time support of embedded OS is not optional, but essential in contemporary embedded systems. In order to achieve these system#s real-time property, it is crucial that schedulability analysis for tasks having its property have been accomplished before system execution. Acquiring Worst-Case Execution Time(WCET) of task is a core part of schedulability analysis. Because traditional WCET tools analyze only its estimation of application task(i.e. program), it is not considered that application tasks are affected by scheduling primitives(e.g. scheduler, interrupt service routine, etc.) of OS when it schedules them. In this paper, we design and implement WCET analysis tool which deliberates on scheduling primitives of system using embedded Linux widely used in embedded OSes. This tool can estimate either WCET of normal application programs or corresponding primitives which have an influence on schduling property in embedded Linux kernel. Therefore, precision of estimation about schedulability analysis is improved. We develop this tool as Eclipse#s plug-in to work properly in any platform and support convenient interface or functionality for user.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.27-31
• /
• 2003

본 논문은 그름 멤버들간의 안전한 통신을 위한 그룹키 관리(Group key management)에 대한 새로운 방법을 제안한다. 제안된 방식은 선형 셀룰러 오토마타를 이용해서 생성된 involution 특성을 갖는 기본 암호 프리미티브를 이용하여 비밀 공유키를 생성한다. 제안된 방식은 공모에 대한 위협을 근본적으로 방지할 수 있는 특징을 가지고 있다.

• Journal of IKEEE
• /
• v.12 no.3
• /
• pp.151-157
• /
• 2008

The DNP3.0 and the IEC61850 are the most important standards in the SCADA systems for the power. Each standard has strength and weakness, so they will coexist for a while. This paper presents a design of the gateway function between DNP3.0 and IEC61850. Both standards use object-oriented modelling methods, so, they have some similarities. However, the DNP3.0 objects are described by object number and index, and the IEC61850 objects are described by name. So there should be mapping function between the object number and index of DNP3.0 objects and the object name of IEC61850 objects. We analyse the communication profiles of both standards, and shows the service-primitive mapping table and the procedure of the gateway function.

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.135-144
• /
• 2006

Implicit surface model is convenient for modeling objects composed of complicated surfaces such as characters and liquids. Moreover, it can express various forms of surface using a relatively small amount of data. In addition, it can represent both the surface and the volume of objects. Therefore, the modeling technique can be applied efficiently to deformation of objects and 3D animation. However, the existing implicit primitives are parallel to the axis or symmetrical with respect to the axes. Thus it is not easy to use them in modeling objects with various forms of motions. In this paper, we propose an efficient animation method for modeling various poses of characters according to matching with motion capture data by adding the attribute of rotation to metacube which is one of the implicit primitives.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.4
• /
• pp.566-571
• /
• 2008

In this paper, we propose a footstep planning method of biped robot based on the Particle Swarm Optimization(PSO). We define configuration and locomotion primitives for biped robots in the 2 dimensional workspace. A footstep planning method is designed using learning process of PSO that is initialized with a population of random objects and searches for optima by updating generations. The footstep planner searches for a feasible sequence of locomotion primitives between a starting point and a goal, and generates a path that avoids the obstacles. We design a path optimization algorithm that optimizes the footstep number and planning cost based on the path generated in the PSO learning process. The proposed planning method is verified by simulation examples in cluttered environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.235-244
• /
• 1999

This Paper proposes a new compaction algorithm for IDDQ testing in CMOS Circuits. A primary test pattern is generated by the primitive fault pattern which is able to detect GOS(gate-oxide short) and the bridging faults in an internal primitive gate. The new algorithm can reduce the number of the test vectors by decreasing the don't care(X) in the primary test pattern. The controllability of random number is used on processing of the backtrace together four ones of heuristics. The simulation results for the ISCAS-85 benchmark circuits show that the test vector reduction is more than 45% for the large circuits on the average compared to static compaction algorithms.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.185-188
• /
• 2001

본 논문에서는 차세대 이동통신 환경에서 모바일 이용자가 자신의 단말기를 이용, 부가가치 서비스 제공자(VASP, Value Added Service Provider)에게 접근하여 서비스를 받을 경우에 대한 과금 문제를 다루고자 한다. 또한 이 과정에서 발생할 수 있는 모바일 이용자와 부가가치 서비스 제공자사이에 인증문제, 상호간에 분쟁이 발생했을 경우에 대한 해결, 모바일 사용자의 위치 정보에 대한 프라이버시 보호 그리고 모바일 사용자의 신분에 대한 익명성 보장문제 등을 암호학적인 프리미티브들을 이용하여 아울러 해결하고자 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.550-552
• /
• 2001

본 논문은 3차원 그래픽스 시스템이 기본적으로 제공하는 프리미티브인 면(surface), 솔리드(solid)의 복셀화 및 이들을 결합한 CSG 표현의 복셀화에 대하여 고찰한다. 복셀화는 서피스로 표현된 물체의 빈 내부를 복셀로 표현하여 내부를 태우는 과정이다. 본 방법의 특징은 PC 플랫폼이 제공하는 그래픽스 API인 OpenGL을 이용하여 면, 솔리드 등을 고속으로 복셀화하여 이들을 기본 물체로 하여 불리언연산에 의해서 간단히 새로운 물체를 만들고 볼륨 환경에서 이들을 단일화된 방법으로 렌더링할 수 있는 것이다.