• Title/Summary/Keyword: forward search algorithm

Search Result 53, Processing Time 0.022 seconds

Landmark recognition in indoor environments using a neural network (신경회로망을 이용한 실내환경에서의 주행표식인식)

  • 김정호;유범재;오상록;박민용
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.306-309
    • /
    • 1996
  • This paper presents a method of landmark recognition in indoor environments using a neural-network for an autonomous mobile robot. In order to adapt to image deformation of a landmark resulted from variations of view-points and distances, a multi-labeled template matching(MLTM) method and a dynamic area search method(DASM) are proposed. The MLTM is. used for matching an image template with deformed real images and the DASM is proposed to detect correct feature points among incorrect feature points. Finally a feed-forward neural-network using back-propagation algorithm is adopted for recognizing the landmark.

  • PDF

Development of Algorithm for Fault Diagnosis (고장진단 알고리즘 개발)

  • Seo, Gyu-Seok;Ok, Chi-Yun;Baek, Young-Sik;Kim, Jung-Nyun
    • Proceedings of the KIEE Conference
    • /
    • 2003.11a
    • /
    • pp.248-250
    • /
    • 2003
  • Recently, electric power system's situation grows gradually so Fault Diagnosis is being complicated and is felt difficult. And ability that operator who is using electric power system must do correct judgment of power system state, and can cope at fault of power system state is required. Therefore, large size power system is divided into predefined minimum module, and define each module accident type. We use and compare defined accident type, we can know easily accident that happen forward. Therefore, large size power system using module that is defined to each section common accident type search in this paper. Therefore, large size power system using module that is defined to each section, we search for common accident type. And when accident in electric power system happens, I wish to explain about process that can do fault diagnosis in more easy and fast time, because using accident type that it is verified in front.

  • PDF

Calculation of Top Event Probability of Fault Tree using BDD (BDD를 이용한 사고수목 정상사상확률 계산)

  • Cho, Byeong Ho;Yum, Byeoungsoo;Kim, Sangahm
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.654-662
    • /
    • 2016
  • As the number of gates and basic events in fault trees increases, it becomes difficult to calculate the exact probability of the top event. In order to overcome this difficulty the BDD methodology can be used to calculate the exact top event probability for small and medium size fault trees in short time. Fault trees are converted to BDD by using CUDD library functions and a failure path search algorithm is proposed to calculate the exact top event probability. The backward search algorithm is more efficient than the forward one in finding failure paths and in the calculation of the top event probability. This backward search algorithm can reduce searching time in the identification of disjoint failure paths from BDD and can be considered as an effective tool to find the cut sets and the minimal cut sets for the given fault trees.

Topic Sensitive_Social Relation Rank Algorithm for Efficient Social Search (효율적인 소셜 검색을 위한 토픽기반 소셜 관계 랭크 알고리즘)

  • Kim, Young-An;Park, Gun-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.5
    • /
    • pp.385-393
    • /
    • 2013
  • In the past decade, a paradigm shift from machine-centered to human-centered and from technology-driven to user-driven has been witnessed. Consequently, Social search is getting more social and Social Network Service (SNS) is a popular Web service to connect and/or find friends, and the tendency of users interests often affects his/her who have similar interests. If we can track users' preferences in certain boundaries in terms of Web search and/or knowledge sharing, we can find more relevant information for users. In this paper, we propose a novel Topic Sensitive_Social Relationship Rank (TS_SRR) algorithm. We propose enhanced Web searching idea by finding similar and credible users in a Social Network incorporating social information in Web search. The Social Relation Rank between users are Social Relation Value, that is, for a different topics, a different subset of the above attributes is used to measure the Social Relation Rank. We observe that a user has a certain common interest with his/her credible friends in a Social Network, then focus on the problem of identifying users who have similar interests and high credibility, and sharing their search experiences. Thus, the proposed algorithm can make social search improve one step forward.

Task based design of modular robot manipulator using efficient genetic algorithms

  • Han, Jeongheon;Chung, Wankyun;Youm, Youngil;Kim, Seungho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.243-246
    • /
    • 1996
  • Modular robot manipulator is a robotic system assembled from discrete joints and links into one of many possible manipulator configurations. This paper describes the design method of newly developed modular robot manipulator and the methodology of a task based reconfiguration of it. New locking mechanism is proposed and it provides quick coupling and decoupling. A parallel connection method is devised and it makes modular robot manipulator working well and the number of components on each module reduced. To automatically determine a sufficient or optimal arrangement of the modules for a given task, we also devise an algorithm that automatically generates forward and inverse manipulator kinematics, and we propose an algorithm which maps task specifications to the optimized manipulator configurations. Efficient genetic algorithms are generated and used to search for a optimal manipulator from task specifications. A few of design examples are shown.

  • PDF

Object Extraction technique Using Belief Propagation Stereo Algorithm of Bidirectional Search based on Brightness (밝기기반 양방향 탐색기법의 신뢰전파 스테레오 알고리즘을 이용한 물체 추출 기법)

  • Choi, Young-Seok;Choi, Kyung-Seok;Kang, Hyun-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.313-314
    • /
    • 2007
  • In this paper, we suggest robust object extraction algorithm taking advantage of efficient Belief Propagation method. It does not get a disparity information because of uniform region and occlusion region etc. on initial depth map that use forward direction disparity information although is object area. Therefore, We run parallel backward disparity information and brightness information for certain object extraction.

  • PDF

Corridor Navigation of the Mobile Robot Using Image Based Control

  • Han, Kyu-Bum;Kim, Hae-Young;Baek, Yoon-Su
    • Journal of Mechanical Science and Technology
    • /
    • v.15 no.8
    • /
    • pp.1097-1107
    • /
    • 2001
  • In this paper, the wall following navigation algorithm of the mobile robot using a mono vision system is described. The key points of the mobile robot navigation system are effective acquisition of the environmental information and fast recognition of the robot position. Also, from this information, the mobile robot should be appropriately controlled to follow a desired path. For the recognition of the relative position and orientation of the robot to the wall, the features of the corridor structure are extracted using the mono vision system, then the relative position, the offset distance and steering angle of the robot from the wall, is derived for a simple corridor geometry. For the alleviation of the computation burden of the image processing, the Kalman filter is used to reduce search region in the image space for line detection. Next, the robot is controlled by this information to follow the desired path. The wall following control scheme by the PD control scheme is composed of two control parts, the approaching control and the orientation control, and each control is performed by steering and forward-driving motion of the robot. To verify the effectiveness of the proposed algorithm, the real time navigation experiments are performed. Through the result of the experiments, the effectiveness and flexibility of the suggested algorithm are verified in comparison with a pure encoder-guided mobile robot navigation system.

  • PDF

Case-based Optimization Modeling (사례 기반의 최적화 모형 생성)

  • 장용식;이재규
    • Journal of Intelligence and Information Systems
    • /
    • v.8 no.2
    • /
    • pp.51-69
    • /
    • 2002
  • In the supply chain environment on the web, collaborative problem solving and case-based modeling has been getting more important, because it is difficult to cope with diverse problem requirements and inefficient to manage many models as well. Hence, the approach on case-based modeling is required. This paper provides a framework that generates a goal model based on multiple cases, modeling knowledge, and forward chaining and it also develops a search algorithm through sensitivity analysis to reduce the modeling effort.

  • PDF

Self-optimizing feature selection algorithm for enhancing campaign effectiveness (캠페인 효과 제고를 위한 자기 최적화 변수 선택 알고리즘)

  • Seo, Jeoung-soo;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.4
    • /
    • pp.173-198
    • /
    • 2020
  • For a long time, many studies have been conducted on predicting the success of campaigns for customers in academia, and prediction models applying various techniques are still being studied. Recently, as campaign channels have been expanded in various ways due to the rapid revitalization of online, various types of campaigns are being carried out by companies at a level that cannot be compared to the past. However, customers tend to perceive it as spam as the fatigue of campaigns due to duplicate exposure increases. Also, from a corporate standpoint, there is a problem that the effectiveness of the campaign itself is decreasing, such as increasing the cost of investing in the campaign, which leads to the low actual campaign success rate. Accordingly, various studies are ongoing to improve the effectiveness of the campaign in practice. This campaign system has the ultimate purpose to increase the success rate of various campaigns by collecting and analyzing various data related to customers and using them for campaigns. In particular, recent attempts to make various predictions related to the response of campaigns using machine learning have been made. It is very important to select appropriate features due to the various features of campaign data. If all of the input data are used in the process of classifying a large amount of data, it takes a lot of learning time as the classification class expands, so the minimum input data set must be extracted and used from the entire data. In addition, when a trained model is generated by using too many features, prediction accuracy may be degraded due to overfitting or correlation between features. Therefore, in order to improve accuracy, a feature selection technique that removes features close to noise should be applied, and feature selection is a necessary process in order to analyze a high-dimensional data set. Among the greedy algorithms, SFS (Sequential Forward Selection), SBS (Sequential Backward Selection), SFFS (Sequential Floating Forward Selection), etc. are widely used as traditional feature selection techniques. It is also true that if there are many risks and many features, there is a limitation in that the performance for classification prediction is poor and it takes a lot of learning time. Therefore, in this study, we propose an improved feature selection algorithm to enhance the effectiveness of the existing campaign. The purpose of this study is to improve the existing SFFS sequential method in the process of searching for feature subsets that are the basis for improving machine learning model performance using statistical characteristics of the data to be processed in the campaign system. Through this, features that have a lot of influence on performance are first derived, features that have a negative effect are removed, and then the sequential method is applied to increase the efficiency for search performance and to apply an improved algorithm to enable generalized prediction. Through this, it was confirmed that the proposed model showed better search and prediction performance than the traditional greed algorithm. Compared with the original data set, greed algorithm, genetic algorithm (GA), and recursive feature elimination (RFE), the campaign success prediction was higher. In addition, when performing campaign success prediction, the improved feature selection algorithm was found to be helpful in analyzing and interpreting the prediction results by providing the importance of the derived features. This is important features such as age, customer rating, and sales, which were previously known statistically. Unlike the previous campaign planners, features such as the combined product name, average 3-month data consumption rate, and the last 3-month wireless data usage were unexpectedly selected as important features for the campaign response, which they rarely used to select campaign targets. It was confirmed that base attributes can also be very important features depending on the type of campaign. Through this, it is possible to analyze and understand the important characteristics of each campaign type.

A Study on the Emoticon Extraction based on Facial Expression Recognition using Deep Learning Technique (딥 러닝 기술 이용한 얼굴 표정 인식에 따른 이모티콘 추출 연구)

  • Jeong, Bong-Jae;Zhang, Fan
    • Korean Journal of Artificial Intelligence
    • /
    • v.5 no.2
    • /
    • pp.43-53
    • /
    • 2017
  • In this paper, the pattern of extracting the same expression is proposed by using the Android intelligent device to identify the facial expression. The understanding and expression of expression are very important to human computer interaction, and the technology to identify human expressions is very popular. Instead of searching for the emoticons that users often use, you can identify facial expressions with acamera, which is a useful technique that can be used now. This thesis puts forward the technology of the third data is available on the website of the set, use the content to improve the infrastructure of the facial expression recognition accuracy, in order to improve the synthesis of neural network algorithm, making the facial expression recognition model, the user's facial expressions and similar e xpressions, reached 66%.It doesn't need to search for emoticons. If you use the camera to recognize the expression, itwill appear emoticons immediately. So this service is the emoticons used when people send messages to others, and it can feel a lot of convenience. In countless emoticons, there is no need to find emoticons, which is an increasing trend in deep learning. So we need to use more suitable algorithm for expression recognition, and then improve accuracy.