• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.264-272
• /
• 1998

This paper proposes a fault detection and recovery mechanism for a fault-tolerant Mini-MAP system, and provides detailed techniques for its implementation. This paper considers the fault-tolerant Mini-MAP system which has dual layer structure from the LLC sublayer down to the physical layer to cope with the faults of those layers. For a good fault detection, a redundant and hierarchical fault supervision architecture is proposed and its implementation technique for a stable detection operation is provided. Information for the fault location is provided from data reported with a fault detection and obtained by an additional network diagnosis. The faults are recovered by the stand-by sparing method applied for a dual network composed of two equivalent networks. A network switch mechanism is proposed to achieve a reliable and stable network function. A fault-tolerant Mini-MAP system is implemented by applying the proposed fault detection and recovery mechanism.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05a
• /
• pp.106-109
• /
• 2004

Many reported methods assume that the faces in an image or an image sequence have been identified and localization. Face detection from image is a challenging task because of variability in scale, location, orientation and pose. In this paper, we present an efficient linear discriminant for multi-view face detection. Our approaches are based on linear discriminant. We define training data with fisher linear discriminant to efficient learning method. Face detection is considerably difficult because it will be influenced by poses of human face and changes in illumination. This idea can solve the multi-view and scale face detection problem poses. Quickly and efficiently, which fits for detecting face automatically. In this paper, we extract face using fisher linear discriminant that is hierarchical models invariant pose and background. We estimation the pose in detected face and eye detect. The purpose of this paper is to classify face and non-face and efficient fisher linear discriminant..

• Journal of information and communication convergence engineering
• /
• v.11 no.1
• /
• pp.24-29
• /
• 2013

In this paper, we propose a fuzzy inference model for a navigation algorithm for a mobile robot that intelligently searches goal location in unknown dynamic environments. Our model uses sensor fusion based on situational commands using an ultrasonic sensor. Instead of using the "physical sensor fusion" method, which generates the trajectory of a robot based upon the environment model and sensory data, a "command fusion" method is used to govern the robot motions. The navigation strategy is based on a combination of fuzzy rules tuned for both goal-approach and obstacle-avoidance based on a hierarchical behavior-based control architecture. To identify the environments, a command fusion technique is introduced where the sensory data of the ultrasonic sensors and a vision sensor are fused into the identification process. The result of experiment has shown that highlights interesting aspects of the goal seeking, obstacle avoiding, decision making process that arise from navigation interaction.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.305-312
• /
• 2005

In the cluster analysis, Hotelling's $T^2$ can be used to estimate the unknown number of clusters based on the idea of multiple comparison procedure. Especially, its threshold is obtained according to the probability of committing the type one error. Examples are used to compare Hotelling's $T^2$ with other classical location test statistics such as Sum-of-Squared Error and Wilks' $\Lambda$ The hierarchical clustering is used to reveal the underlying structure of the data. Also related criteria are reviewed in view of both the between variance and the within variance.

• Journal of the Korean Institute of Rural Architecture
• /
• v.25 no.2
• /
• pp.35-42
• /
• 2023

This study investigated and analyzed the village space and architectural characteristics of Eoeun Village, Samgye-myeon, Imsil-gun, Jeonbuk. The space of the village was formed based on the idea of feng shui, and the Confucian hierarchical idea determined the location, size, and structure of the building. Recently, clan villages in rural areas have been dismantled and damaged due to population outflow and urbanization. In this situation, Eoeun Village, which preserves the traditional space and residential form at the time of the village's creation, is considered to be worth preserving and studying.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.353-364
• /
• 2002

In this paper, a new onto-digital stereo object-tracking system using hierarchical digital algorithms and optical BPEJTC is proposed. This proposed system can adaptively track a moving target by controlling the convergence of stereo camera. firstly, the target is detected through the background matching of the sequential input images by using optical BPEJTC and then the target area is segmented by using the target projection mask which is composed by hierarchical digital processing of image subtraction, logical operation and morphological filtering. Secondly, the location's coordinate of the moving target object for each of the sequential input frames can be extracted through carrying out optical BPEJTC between the reference image of the target region mask and the stereo input image. Finally, the convergence and pan/tilt of stereo camera can be sequentially controlled by using these target coordinate values and the target can be kept in tracking. Also, a possibility of real-time implementation of the adaptive stereo object tracking system is suggested through optically implementing the proposed target extraction and convergence control algorithms.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.22 no.4
• /
• pp.215-228
• /
• 2019

HDF5 data format is used to effectively store and distribute large volume of Geostationary Ocean Color Imager(GOCI) satellite data. The Korea Ocean Satellite Center has developed and provided a GOCI Data Processing System(GDPS) for general users who are not familiar with HDF5 format. Nevertheless, it is not easy to merge and process Hierarchical Data Format version5(HDF5) data that requires an understanding of satellite data characteristics, needs to learn how to use GDPS, and stores location and attribute information separately. Therefore, the open source R and rhdf5, data.table, and matrixStats packages were used to develop algorithm that could easily utilize satellite data in HDF5 format without the need for the process of using GDPS.

• Development and Reproduction
• /
• v.20 no.2
• /
• pp.135-140
• /
• 2016

Genomic DNAs isolated from crucian carp of four rivers, belonging to the family Cyprinidae was amplified by seven oligonucleotides primers. In the present study, we employed hierarchical clustering method in order to reveal genetic distances and variations. Crucian carp was acquired from Hangang river (CAH), Geumgang river (CAG), Nakdonggang river (CAN) and Yeongsangang river (CAY). The primer BION-12 generated the most loci (a total of 50) with an average of 10 in the CAY population. The primer BION-10 generated the least loci (a total of 19), with an average of 3.8 in the CAG population, in comparison to the other primers used. Seven oligonucleotides primers made 16.7 average no. per primer of specific loci in the CAH population, 7.4 in the CAG population, 8.6 in the CAN population and 0.9 in the CAY population, respectively. The specific loci generated by oligonucleotides primers revealed inter-individual-specific characteristics, thus disclosing DNA polymorphisms. The dendrogram obtained by the seven oligonucleotides primers indicates four genetic clusters. The genetic distance that displayed significant molecular differences was between individuals no.06 and no.08 from the CAG population (genetic distance = 0.036), while the genetic distance among the five individuals that displayed significant molecular differences was between individuals no.08 and no.09 from the CAG population (genetic distance = 0.088). With regard to average bandsharing value (BS) results, individuals from CAY population ($0.985{\pm}0.009$) exhibited higher bandsharing values than did individuals from CAH population ($0.779{\pm}0.049$) (P<0.05). Relatively, individuals of CAY population were fairly closely related to that of CAN location (genetic distance between two populations<0.016).

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.139-144
• /
• 2007

The mobile terminal's frequent changes to the access point introduce significant network overhead in mobile IP networks. To solve this problem, we introduce a hierarchical structure with consideration given to the dynamic value of neighbor scope in IP regional registration[1]. When a mobile terminal moves within the neighbor given by the scope value, it makes registration locally without registration with its home agent. We analyze the algorithm mathematically and show the numerical results. As a result, optimization of the scope value for the localized registration under the hierarchical structure makes the proposed scheme outperform the standard mobile IP protocol[2]. This can be explained from the fact that there is only local registration for terminal's movement within the scope region. Moreover, as the signaling cost for home agent increases, the proposed scheme becomes more advantageous.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.