• Title/Summary/Keyword: fuzzy partition

Search Result 106, Processing Time 0.019 seconds

Intelligent Test Plan Metrics on Adaptive Use Case Approach

  • Kim, R. Young Chul;Lee, Jaehyub
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.2 no.1
    • /
    • pp.70-77
    • /
    • 2002
  • This paper describes a design driven approach to drive intelligent test plan generation based on adaptive use case (3,5). Its foundation is an object-oriented software design approach which partitions design schema into design architecture of functional components called “design component”. A use case software development methodology of adaptive use case approach developed in I.I .T is employed which preserves this unit architecture on through to the actual code structure. Based on the partition design schema produced during the design phase of this methodology, a test plan is generated which includes a set of component and scenario based test. A software metric is introduced which produces an ordering of this set to enhance productivity and both promote and capitalize on test case reusability, This paper contains an application that illustrates the proposed approach.

Development of a Traversability Map for Safe Navigation of Autonomous Mobile Robots (자율이동로봇의 안전주행을 위한 주행성 맵 작성)

  • Jin, Gang-Gyoo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.4
    • /
    • pp.449-455
    • /
    • 2014
  • This paper presents a method for developing a TM (Traversability Map) from a DTM (Digital Terrain Model) collected by remote sensors of autonomous mobile robots. Such a map can be used to plan traversable paths and estimate navigation speed quantitatively in real time for robots capable of performing autonomous tasks over rough terrain environments. The proposed method consists of three parts: a DTM partition module which divides the DTM into equally spaced patches, a terrain information module which extracts the slope and roughness of the partitioned patches using the curve fitting and the fractal-based triangular prism method, and a traversability analysis module which assesses traversability incorporating with extracted terrain information and fuzzy inference to construct a TM. The potential of the proposed method is validated via simulation works over a set of fractal DTMs.

A initial cluster center selection in FCM algorithm using the Genetic Algorithms (유전 알고리즘을 이용한 FCM 알고리즘의 초기 군집 중심 선택)

  • 오종상;정순원;박귀태
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1996.10a
    • /
    • pp.290-293
    • /
    • 1996
  • This paper proposes a scheme of initial cluster center selection in FCM algorithm using the genetic algorithms. The FCM algorithm often fails in the search for global optimum because it is local search techniques that search for the optimum by using hill-climbing procedures. To solve this problem, we search for a hypersphere encircling each clusters whose parameters are estimated by the genetic algorithms. Then instead of a randomized initialization for fuzzy partition matrix in FCM algorithm, we initialize each cluster center by the center of a searched hypersphere. Our experimental results show that the proposed initializing scheme has higher probabilities of finding the global or near global optimal solutions than the traditional FCM algorithm.

  • PDF

Nearest neighbor and validity-based clustering

  • Son, Seo H.;Seo, Suk T.;Kwon, Soon H.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.337-340
    • /
    • 2004
  • The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

Facial Expression Control of 3D Avatar by Hierarchical Visualization of Motion Data (모션 데이터의 계층적 가시화에 의한 3차원 아바타의 표정 제어)

  • Kim, Sung-Ho;Jung, Moon-Ryul
    • The KIPS Transactions:PartA
    • /
    • v.11A no.4
    • /
    • pp.277-284
    • /
    • 2004
  • This paper presents a facial expression control method of 3D avatar 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 spare from about 2,400 captured facial frames. 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 11 clusters from the space of 2,400 facial expressions. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. When the user zooms in (zoom is discrete), it means that the user wants to see mort details. So, the system creates more clusters for the new level of zoom-in. Every time the level of zoom-in increases, the system doubles the number of clusters. The user selects new key frames along the navigation path of the previous level. At the maximum zoom-in, the user completes facial expression control specification. At the maximum, the user can go back to previous level by zooming out, and update the navigation path. We let users use the system to control facial expression of 3D avatar, and evaluate the system based on the results.

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.