• Title/Summary/Keyword: 경로설정기법

Search Result 375, Processing Time 0.045 seconds

Hierarchical Visualization of the Space of Facial Expressions (얼굴 표정공간의 계층적 가시화)

  • Kim Sung-Ho;Jung Moon-Ryul
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.12
    • /
    • pp.726-734
    • /
    • 2004
  • This paper presents a facial animation method that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically Our system creates the facial expression space from about 2400 captured facial frames. To represent the state of each expression, we use the distance matrix that represents the distance between pairs of feature points on the face. The shortest trajectories are found by dynamic programming. The space of facial expressions is multidimensional. To navigate this space, we visualize the space of expressions in 2D space by using the multidimensional scaling(MDS). But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 10 clusters from the space of 2400 facial expressions. Every tine the level increases, the system doubles the number of clusters. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. The user selects new key frames along the navigation path of the previous level. At the maximum level, the user completes key frame specification. We let animators use the system to create example animations, and evaluate the system based on the results.

An Implementation of the Fault Simulator for Switch Level Faults (스위치 레벨 결함 모델을 사용한 결함시뮬레이터 구현)

  • Yeon, Yun-Mo;Min, Hyeong-Bok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.628-638
    • /
    • 1997
  • This paper describes an implementation of fault simulator that can switch level fault models such as transistor stuck-open and stuck-closed faults as well as stuck-at faults. It overcomes the limitation when only stuck-at faults are used in VLSI circuits. Signal flow of a transistor switch is bidirectional in its nature, but most of signal flows in a switch level circuits, about 95%, are in one direction. This fault simulator focuses on the way which changes a switch level circuit into a graph model with two directed edges. Two paths from Vdd to ground and from ground to directions. Logic simulation is performed along dominant signal flows. The switch level fault simulation estimates the dominant path by injecting switch-level fualts, and pattern vectors are used for faults simulation. Experimental results are shown to demonstrate correctness of the fault simulator.

  • PDF

Modeling End-to-End Throughput of Multiple Flows and Efficient Route Selection in Wireless Mesh Networks (무선 메쉬 네트워크에서의 다중 트래픽 흐름을 위한 종단간 처리량 모델링 및 효율적인 라우팅 경로 선택 기법)

  • Wang, Xiaofei;Kwon, Ted Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.272-283
    • /
    • 2010
  • Wireless Mesh Networks (WMNs) have gained a lot of attention recently. Based on the characteristic of WMNs as a highly connected wireless infrastructure, many efforts from research organizations are made in order to improve the performance of the flow throughput in WMNs. Therefore, it is very critical issue to establish efficient routing paths for multiple concurrent ongoing flows. In this paper, we propose a general modeling methodology to analyze the end-to-end throughput of multiple concurrent flows by analytical calculation taking into account the carrier sensing behaviors, interference and the IEEE 802.11 Distributed Coordination Function mechanism. After the comparison of the average service time for each successful transmission at each node, we analyze the bottlenecks of flows, and hence obtain the maximum end-to-end throughput of them. By using our proposed model, it is possible to predicate the throughput of several candidate routing paths for multiple concurrent ongoing data flows, so we can select the most efficient route that can achieve the highest throughput. We carry out simulations with various traffic patterns of multiple flows in WMNs to validate our modeling and our efficient route selection mechanism.

A Directed Messaging for Energy Efficiency of Sensor Networks (에너지 효율적인 센서 네트워크를 위한 방향성 메시징 기법)

  • Jeon, Jin-Hwan;Khil, A-Ra;Kim, Byung-Gi
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.773-777
    • /
    • 2006
  • 센서 네트워크 상의 센서 노드들은 싱크 노드의 ADV 메시지를 통한 질의에 해당하는 정보를 싱크 노드에게로 전송하며 싱크 노드는 수신한 정보를 사용자에게 제공한다. 그러나, 센서 네트워크을 위한 각종 라우팅 알고리즘들은 싱크 노드가 요청하는 해당 질의에 맞는 정보를 가지고 있는 센서 노드의 위치를 알기 위하여 매번 전체 네트워크로 ADV 메시지를 퍼뜨리는 방법을 사용하기 때문에 전체 네트워크의 수명과 직접적인 관련성이 있는 센서 노드들의 에너지 소비량을 극심하게 증가시킨다. 본 논문에서는 싱크 노드의 질의에 해당하는 목적지 노드를 찾기 위한 초기 경로 설정 시, 방향성 정보를 가진 ADV 메시지를 제한된 방향으로만 전파함으로써 관련없는 노드들의 메시지 송수신으로 인한 불필요한 에너지 소비를 줄이도록 하는 새로운 메시징 기법을 제안하고 이의 효율성을 모의실험을 통하여 나타내 보인다.

  • PDF

Camera Calibration Using the Image of a Pin Type Insulator (애자 영상을 이용한 카메라 보정)

  • Kim, Chang-Hoi;Jeong, Seung-Ho;Jeong, Tae-Won
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.1748-1749
    • /
    • 2007
  • 활선차량의 붐 끝단에 탑재되어 있는 로봇의 기준좌표계는 활선차량의 접근 위치와 붐의 확장 길이 및 각도에 따라 달라지므로 작업대상물과 로봇 사이의 상대 위치를 찾아내어 설정된 작업 경로를 보정하여야만 한다. 본 논문에서는 작업대상물인 애자 영상으로부터 카메라를 보정하는 기법을 제시하여 활선작업 차량의 붐 끝단에 장착된 로봇의 위치 및 자세를 측정할 수 있도록 하였다. 이를 위하여 핀홀 카메라 모델을 적용하였으며 원기둥 형태의 애자 영상으로부터 카메라 내부 파라미터 및 외부 파라미터를 추출하였다. 제시된 기법은 시뮬레이션을 통하여 효용성을 입증하였다.

  • PDF

Efficient Bus Arbitration Method for Distributed System (분산 시스템을 위한 효율적인 버스 중재 기법)

  • Song, Sung-Gun;Park, Seong-Mo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.697-700
    • /
    • 2007
  • 산업현장에서 이용되는 각종 제어 및 계측 시스템들은 그 용도에 따라 여러 개의 프로세서 모듈이나 기기들로 나뉜다. 이들 프로세서 모듈이나 기기들은 각각의 기능이나 요구 사항에 따라 서로 다른 공간에 설치, 운용 되며 정보교환과 제어를 위하여 통합된 데이터 처리 기술을 필요로 한다. 본 논문에서는 이러한 분산 시스템들의 경제적이고 효율적인 통신을 위한 버스 중재 기법에 대하여 다루고 있다. 제안 된 구조는 메시지 기반 데이터 교환 방식으로 이를 위해 표준 메시지 규격을 정의하였으며 메시지를 해석하여 경로를 설정하고 버스 중재를 담당하는 버스 중재 모듈을 구현하였다. 또한 구현된 버스 중재 모듈을 사용하여 실제 검측 시스템을 구성하고 실험하였다.

  • PDF

Multiple-Section Using 3D Spline based Cut-Scene Effect (3차 곡선을 이용한 다 구간 경로 기반의 컷씬 효과)

  • Sun, Bok-Gun;Shin, Young-Seo;Park, Sung-Jun
    • Journal of Korea Game Society
    • /
    • v.11 no.1
    • /
    • pp.93-100
    • /
    • 2011
  • Cinematic camera techniques are being increasingly applied to the game development these days. In this study, the object movement and camera effect for the game development using the curve in the 3D space were discussed. The Catmull-Rom spline algorithm follows the curve more closely than the other curve algorithms. With the algorithm proposed in this study, the Catmull-Rom spline was dynamically created according to the user's input in multiple sections in the 3D space, and objects smoothly passed along the route. In addition, Cut-Scene section is specified using the Catmull-Rom spline and the object movement can be observed. The results of the study on the accuracy and efficiency of the curve showed that the Catmull-Rom spline is very efficient not only for the object movement but also for the cinematic camera technique.

Location-based Area Setup Method and Optimization Technique for Deviation Detection (위치기반 영역 설정 방법 및 이탈 검출의 최적화 기법)

  • Choi, Jae-Hyun;Lim, Yang-Won;Lim, Han-Kyu
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.4
    • /
    • pp.19-28
    • /
    • 2014
  • Recent advancements in the IT industry have made daily life more convenient than ever before. In particular, studies have focused on the position detection of individuals using the GPS in smartphones, and this application has been utilized actively in emergency rescue organizations. However, existing methods send the location information of a user to a predetermined guardian set by the user or to a control center when the user enters into or deviates from a predetermined space. Such spaces are created by an arbitrary radius, thereby making it difficult to set a detailed area by using an existing radius-area creation method in an unstructured space and path with a specific road, such as for trekking, amusement parks, or mountaineering. This study proposes a novel method for setting up an area by connecting multiple radii to improve the existing radius-area creation method in order to easily set a detailed area in smart devices or on the Internet. In addition, an optimization method for resource use is proposed by comparing the operation results in which a user's location is detected by using the proposed location-based area setup method and deviation detection.

Development of Multiclass Assignment For Dynamic Route Guidance Strategy (동적 경로안내전략수행을 위한 다계층 통행배정모형의 개발)

  • Lee, Jun;Lim, Kang-Won;Lee, Young-Ihn;Lim, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.91-98
    • /
    • 2004
  • This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

Energy-Efficient Routing Protocol for Hybrid Ad Hoc Networks (하이브리드 애드 혹 네트워크에서의 에너지 효율성을 고려한 라우팅 알고리즘)

  • Park, Hye-Mee;Park, Kwang-Jin;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.133-140
    • /
    • 2007
  • Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

  • PDF