• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.10-19
• /
• 1999

Cellular Automata Neural Systems(CANS) are neural networks based on biological development and evolution. Each neuron of CANS has local connection and acts as a form of pulse according to the dynamics of the chaotic neuron. CANS are generated from initial cells according to the CA rule. In the previous study, to obtain the useful ability of CANS, we make the pattern of initial cells evolve. However, it is impossible to represent all solution space, so we propose an evolving method of CA rule to overcome this defect in this paper. DNA coding has the redundancy and overlapping of gene and is apt for the representation of the rule. In this paper, we show the general expression of CA rule and propose translation method from DNA code to CA rule. The effectiveness of the proposed scheme was verified by applying it to the navigation problem of autonomous mobile robot.

• Journal of Broadcast Engineering
• /
• v.25 no.5
• /
• pp.734-741
• /
• 2020

This article proposes a new pedestrian avoidance algorithm for social robots that coexist and communicate with humans and do not induce stress caused by invasion of psychological safety distance(Social Distance). To redefine the pedestrian model, pedestrians are clustered according to the pedestrian's gait characteristics(straightness, speed) and a social distance is defined for each pedestrian cluster. After modeling pedestrians(obstacles) with the social distances, integrated navigation algorithm is completed by applying the newly defined pedestrian model to commercial obstacle avoidance and path planning algorithms. To show the effectiveness of the proposed algorithm, two commercial obstacle avoidance & path planning algorithms(the Dynamic Window Approach (DWA) algorithm and the Timed Elastic Bands (TEB) algorithm) are used. Four cases were experimented in applying and non-applying the new pedestrian model, respectively. Simulation results show that the proposed algorithm can significantly reduce the stress index of pedestrians without loss of traveling time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1677-1684
• /
• 2010

Recently, due to the development of mobile phone and supply of smart phone, many contents have been developed. Especially, since the small-sized cameras are equiped in mobile devices, people are interested in the image based contents development, and it also becomes important part in their practical use. Among them, the character recognition system can be widely used in the applications such as blind people guidance systems, automatic robot navigation systems, automatic video retrieval and indexing systems, automatic text translation systems. Therefore, this paper proposes a system that is able to extract text area from the natural images captured by smart phone camera. The individual characters are recognized and result is output in voice. Text areas are extracted using Adaboost algorithm and individual characters are recognized using error back propagated neural network.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.375-381
• /
• 2005

Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.51-58
• /
• 2008

In this paper, we propose a place modeling based on the distribution of scale-invariant features, and a place recognition method that recognizes places by comparing the place model in a database with the extracted features from input data. The proposed method is based on the assumption that every place can be represented by unique feature distributions that are distinguishable from others. The proposed method uses global information of each place where one place is represented by one distribution model. Therefore, the main contribution of the proposed method is that the time cost corresponding to the increase of the number of places grows linearly without increasing exponentially. For the performance evaluation of the proposed method, the different number of frames and the different number of features are used, respectively. Empirical results illustrate that our approach achieves better performance in space and time cost comparing to other approaches. We expect that the Proposed method is applicable to many ubiquitous systems such as robot navigation, vision system for blind people, wearable computing, and so on.

• Journal of the HCI Society of Korea
• /
• v.10 no.2
• /
• pp.45-55
• /
• 2015

In recent years, keypoint recognition and tracking technologies are considered as crucial task in many practical systems for markerless augmented reality. The keypoint recognition and technologies are widely studied in many research areas, including computer vision, robot navigation, human computer interaction, and etc. Moreover, due to the rapid growth of mobile market related to augmented reality applications, several effective keypoint-based matching and tracking methods have been introduced by considering mobile embedded systems. Therefore, in this paper, we extensively analyze the recent research trends on keypoint-based recognition and tracking with several core components: keypoint detection, description, matching, and tracking. Then, we also present one of our research related to mobile augmented reality, named mobile tour guide system, by real-time recognition and tracking of tour maps on mobile devices.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.4084-4104
• /
• 2021

Visual place recognition (VPR) is a fundamental yet challenging task of mobile robot navigation and localization. The existing VPR methods are usually based on some pairwise similarity of image descriptors, so they are sensitive to visual appearance change and also computationally expensive. This paper proposes a simple yet effective four-step method that achieves adaptive convolutional neural network (CNN) landmark matching for VPR. First, based on the features extracted from existing CNN models, the regions with higher significance scores are selected as landmarks. Then, according to the coordinate positions of potential landmarks, landmark matching is improved by removing mismatched landmark pairs. Finally, considering the significance scores obtained in the first step, robust image retrieval is performed based on adaptive landmark matching, and it gives more weight to the landmark matching pairs with higher significance scores. To verify the efficiency and robustness of the proposed method, evaluations are conducted on standard benchmark datasets. The experimental results indicate that the proposed method reduces the feature representation space of place images by more than 75% with negligible loss in recognition precision. Also, it achieves a fast matching speed in similarity calculation, satisfying the real-time requirement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.548-549
• /
• 2015

무인 잠수정은 자율 무인잠수정(이하 'AUV' 또는 '자율무인잠수정'을 혼용)과 원격조정잠수정(이하 'ROV'로 지칭)으로 분류를 할 수 있다. ROV는 테더 게이블로 인한 작업 범위의 한계와 운동성능 효율이 떨어지는 단점을 지니고 있어, 테더 케이블이 필요 없는 AUV에 대한 필요성이 증대되고 있다. 추측 항법 시스템인 관성 항법 시스템(inertial navigation system, 이하 'INS'로 지칭)은 외부 도움없이 관성측정 장치(inertial measurement unit, 이하 'IMU'로 지칭)를 활용하여 구성된 시스템을 말한다. IMU는 자이로 스코프(gyroscope), 가속도계(accelerometer), 지자기(magnetic)센서로 구성된 측정 장치로 3개의 센서를 사용하여 상호 보정을 통한 기동 체의 위치, 속도 및 자세 정보를 제공한다. 복합항법시스템은 추측항법시스템이 가지는 누적오차와 측위 항법시스템이 가지는 외부환경에 대한 단점을 상호 보완하는 방법으로 연구가 진행 중이다. 하지만 심해서 또는 해양의 특성에 따라 측위 시스템이 사용되지 못하기 때문에 추측 항법시스템의 다양한 관성 센서를 활용한 상로 보완과 신호처리 방법을 통한 연구 개발이 진행 중이다. 다양한 센서 정보를 통합하는 목적으로 칼만 필터와 같은 최적 필터기법이 보편적으로 사용되고 있다. 칼만 필터는 확률 선형 시스템에 대하여 공정잡음 및 측정 잡음이 가우시안 확률 분포를 따를 때 최적의 추정자가 된다. 또한 가우시안 조건을 만족하지 않는 경우에도 선형 추정자 중에 추정 오차의 분산이 가장 작은 추정자이다. 칼만 필터가 최상의 성능을 발휘 하려면 공정잡음과 측정 잡음의 실제 값을 정확히 알아내는 것이 중요하다. 잡음 수준에 대한 정보가 부정확 할 경우 칼만 필터는 발산 할 수 있기 때문에 시스템에서 잡음 수준의 공산은 칼만 필터의 최적 이득을 결정하는 중요한 요소로 추정치에 큰 영향을 준다. 따라서 칼만 필터를 추측항법시스템에 적용 시킬 경우 실제 모텔의 잡음 공분산을 정확히 추정할 수 있는 기법이 요구된다. 추측항법시스템은 다양한 센서를 활용하기 때문에 움직이는 기동 표적에 적용시 잡음공분상이 변하기 때문에 항법시스템이 저하 될 수 있다. 본 연구에서는 다양한 센서를 융합하여 해양 생체 로봇의 정밀 자세 제어가 가능한 시스템을 제안하고자 한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.975-976
• /
• 1993

This talk presents the overview of the author's research and development activities on fuzzy inference hardware. We involved it with two distinct approaches. The first approach is to use application specific integrated circuits (ASIC) technology. The fuzzy inference method is directly implemented in silicon. The second approach, which is in its preliminary stage, is to use more conventional microprocessor architecture. Here, we use a quantitative technique used by designer of reduced instruction set computer (RISC) to modify an architecture of a microprocessor. In the ASIC approach, we implemented the most widely used fuzzy inference mechanism directly on silicon. The mechanism is beaded on a max-min compositional rule of inference, and Mandami's method of fuzzy implication. The two VLSI fuzzy inference chips are designed, fabricated, and fully tested. Both used a full-custom CMOS technology. The second and more claborate chip was designed at the University of North Carolina(U C) in cooperation with MCNC. Both VLSI chips had muliple datapaths for rule digital fuzzy inference chips had multiple datapaths for rule evaluation, and they executed multiple fuzzy if-then rules in parallel. The AT & T chip is the first digital fuzzy inference chip in the world. It ran with a 20 MHz clock cycle and achieved an approximately 80.000 Fuzzy Logical inferences Per Second (FLIPS). It stored and executed 16 fuzzy if-then rules. Since it was designed as a proof of concept prototype chip, it had minimal amount of peripheral logic for system integration. UNC/MCNC chip consists of 688,131 transistors of which 476,160 are used for RAM memory. It ran with a 10 MHz clock cycle. The chip has a 3-staged pipeline and initiates a computation of new inference every 64 cycle. This chip achieved an approximately 160,000 FLIPS. The new architecture have the following important improvements from the AT & T chip: Programmable rule set memory (RAM). On-chip fuzzification operation by a table lookup method. On-chip defuzzification operation by a centroid method. Reconfigurable architecture for processing two rule formats. RAM/datapath redundancy for higher yield It can store and execute 51 if-then rule of the following format: IF A and B and C and D Then Do E, and Then Do F. With this format, the chip takes four inputs and produces two outputs. By software reconfiguration, it can store and execute 102 if-then rules of the following simpler format using the same datapath: IF A and B Then Do E. With this format the chip takes two inputs and produces one outputs. We have built two VME-bus board systems based on this chip for Oak Ridge National Laboratory (ORNL). The board is now installed in a robot at ORNL. Researchers uses this board for experiment in autonomous robot navigation. The Fuzzy Logic system board places the Fuzzy chip into a VMEbus environment. High level C language functions hide the operational details of the board from the applications programme . The programmer treats rule memories and fuzzification function memories as local structures passed as parameters to the C functions. ASIC fuzzy inference hardware is extremely fast, but they are limited in generality. Many aspects of the design are limited or fixed. We have proposed to designing a are limited or fixed. We have proposed to designing a fuzzy information processor as an application specific processor using a quantitative approach. The quantitative approach was developed by RISC designers. In effect, we are interested in evaluating the effectiveness of a specialized RISC processor for fuzzy information processing. As the first step, we measured the possible speed-up of a fuzzy inference program based on if-then rules by an introduction of specialized instructions, i.e., min and max instructions. The minimum and maximum operations are heavily used in fuzzy logic applications as fuzzy intersection and union. We performed measurements using a MIPS R3000 as a base micropro essor. The initial result is encouraging. We can achieve as high as a 2.5 increase in inference speed if the R3000 had min and max instructions. Also, they are useful for speeding up other fuzzy operations such as bounded product and bounded sum. The embedded processor's main task is to control some device or process. It usually runs a single or a embedded processer to create an embedded processor for fuzzy control is very effective. Table I shows the measured speed of the inference by a MIPS R3000 microprocessor, a fictitious MIPS R3000 microprocessor with min and max instructions, and a UNC/MCNC ASIC fuzzy inference chip. The software that used on microprocessors is a simulator of the ASIC chip. The first row is the computation time in seconds of 6000 inferences using 51 rules where each fuzzy set is represented by an array of 64 elements. The second row is the time required to perform a single inference. The last row is the fuzzy logical inferences per second (FLIPS) measured for ach device. There is a large gap in run time between the ASIC and software approaches even if we resort to a specialized fuzzy microprocessor. As for design time and cost, these two approaches represent two extremes. An ASIC approach is extremely expensive. It is, therefore, an important research topic to design a specialized computing architecture for fuzzy applications that falls between these two extremes both in run time and design time/cost. TABLEI INFERENCE TIME BY 51 RULES {{{{Time }}{{MIPS R3000 }}{{ASIC }}{{Regular }}{{With min/mix }}{{6000 inference 1 inference FLIPS }}{{125s 20.8ms 48 }}{{49s 8.2ms 122 }}{{0.0038s 6.4㎲ 156,250 }} }}