• Title/Summary/Keyword: Optimal Object Selection

Search Result 53, Processing Time 0.021 seconds

Evolutionary Computation for the Real-Time Adaptive Learning Control(I) (실시간 적응 학습 제어를 위한 진화연산(I))

  • Chang, Sung-Ouk;Lee, Jin-Kul
    • Proceedings of the KSME Conference
    • /
    • 2001.06b
    • /
    • pp.724-729
    • /
    • 2001
  • This paper discusses the composition of the theory of reinforcement learning, which is applied in real-time learning, and evolutionary strategy, which proves its the superiority in the finding of the optimal solution at the off-line learning method. The individuals are reduced in order to learn the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because the learning process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes. In the future, studies are needed on the proof of the theory through experiments and the characteristic considerations of the robustness against the outside disturbances.

  • PDF

A Study on Algorithm Selection and Comparison for Improving the Performance of an Artificial Intelligence Product Recognition Automatic Payment System

  • Kim, Heeyoung;Kim, Dongmin;Ryu, Gihwan;Hong, Hotak
    • International Journal of Advanced Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.230-235
    • /
    • 2022
  • This study is to select an optimal object detection algorithm for designing a self-checkout counter to improve the inconvenience of payment systems for products without existing barcodes. To this end, a performance comparison analysis of YOLO v2, Tiny YOLO v2, and the latest YOLO v5 among deep learning-based object detection algorithms was performed to derive results. In this paper, performance comparison was conducted by forming learning data as an example of 'donut' in a bakery store, and the performance result of YOLO v5 was the highest at 96.9% of mAP. Therefore, YOLO v5 was selected as the artificial intelligence object detection algorithm to be applied in this paper. As a result of performance analysis, when the optimal threshold was set for each donut, the precision and reproduction rate of all donuts exceeded 0.85, and the majority of donuts showed excellent recognition performance of 0.90 or more. We expect that the results of this paper will be helpful as the fundamental data for the development of an automatic payment system using AI self-service technology that is highly usable in the non-face-to-face era.

Optimization of color filters selection to estimate surface spectral reflectance of Munsell colors (물체의 분광반사율 추정을 위한 최적필터의 선정)

  • 이승희;이을환;유미옥;노상철;안석출
    • Journal of the Korean Graphic Arts Communication Society
    • /
    • v.16 no.3
    • /
    • pp.121-131
    • /
    • 1998
  • The object color does not look same under the different light source. It depends on the surface spectral reflectance and the spectral distribution of light source. Therefore we should find the surface spectral reflectance of object color and the spectral distribution of light source for color reproduction. Using Wiener estimation, we can estimate the spectral reflectance from low dimensional images obtained with multi-band image acquisition system. The kind and the number of imaging filters have the effect on the estimation of the spectral reflectance. Therefore it is important that optimal filters are selected to minimize the error of the result. In this paper, we describe methods to select optimal filters with minimum error between measured and estimated surface spectral reflectance and to estimate surface spectral reflectance of Munsell color chart from six multi-band images by using Wiener estimation.

  • PDF

A Study on Rendezvous Point between the Mobile Robot and Predicted Moving Objects (경로예측이 가능한 이동물체와 이동로봇간의 Rendezvous Point에 관한 연구)

  • Youn, Jung-Hoon;Lee, Kee-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.84-86
    • /
    • 2001
  • A new navigation method is developed and implemented for mobile robot. The mobile robot navigation problem has traditionally been decomposed into the path planning and path following. Unlike tracking-based system, which minimize intercept time and moved mobile robot distance for optimal rendezvous point selection. To research of random moving object uses algorithm of Adaptive Control using Auto-regressive Model. A fine motion tracking object's trajectory is predicted of Auto-regressive Algorithm. Thus, the mobile robot can travel faster than the target wi thin the robot's workspace. The can select optimal rendezvous point of various intercept time.

  • PDF

Optimization of color filters selection to estimate surface spectral reflectance of Munsell colors (물체의 분광반사 추정을 위한 최적필터의 선정)

  • 이승희;김종필;이을환;노상철;안석출
    • Proceedings of the Korean Printing Society Conference
    • /
    • 1998.10a
    • /
    • pp.1-6
    • /
    • 1998
  • The object color does not look same under the different light source. It depends on the surface spectral reflectance and the spectral distribution of light source. Therefore we should find the surface spectral reflectance of object color and the spectral distribution of light source for color reproduction. Using Winer estimation, we can reconstruct the spectral reflectance from low dimensional images obtained with a few filters. The kind and the number of filters have the effect on the estimation of the spectral reflectance. Therefore it is important that optimal filters are selected to minimize the error of the result. In this paper, we describe methods to select optimal filters with minimum error between measured and estimated surface spectral reflectance and to estimate surface spectral reflectance of Munsell color from six band images by using Wiener estimation.

  • PDF

Optimal Design of Torque Motor using an Improved Niching Genetic Algorithm (개선된 니칭 유전 알고리즘을 이용한 토크모터의 최적설계)

  • Kim, Jae-Kwang;Cho, Dong-Hyeok;Jung, Hyun-Kyo;Lee, Cheol-Gyun
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.50 no.7
    • /
    • pp.323-330
    • /
    • 2001
  • Niching method enables the genetic algorithm(GA) to be applied to the problems that require the location of multiple solutions in the search space, but these methods have fatal disadvantages. The main disadvantage is that the method requires too much calculation of object function. In this paper, a niching method using restricted competition selection(RCS) combined with a pattern search method(PSM) is proposed to identify multiple niches more efficiently and fast in a multimodal domain. The validity of the proposed method is verified by the simulation of test functions and the optimal design of an torque motor.

  • PDF

An Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud

  • Liu, Shukun;Jia, Weijia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4776-4798
    • /
    • 2015
  • The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

A Study on Integrated Binding Service Strategy Based on Name/property in Wide-Area Object Computing Environments (광역 객체 컴퓨팅 환경에서 이름/속성기반의 통합 바이딩 서비스 방안)

  • Jeong, Chang-Won;Oh, Sung-Kwun;Joo, Su-Chong
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.241-248
    • /
    • 2002
  • With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

Object Classification Method Using Dynamic Random Forests and Genetic Optimization

  • Kim, Jae Hyup;Kim, Hun Ki;Jang, Kyung Hyun;Lee, Jong Min;Moon, Young Shik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.5
    • /
    • pp.79-89
    • /
    • 2016
  • In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees.

Selection to the Optimal Windows Transmittance of Office Building on Sky Conditions (천공상태에 따른 오피스 창호의 적정 투과율 선정)

  • 임오연;김병수
    • Korean Institute of Interior Design Journal
    • /
    • no.38
    • /
    • pp.225-232
    • /
    • 2003
  • The purpose of this study is to select the optimal and minimum transmittance for visual amenity in office buildings. This study progressed as follows. The first, we select 5 films with various transmittance based on the current film makers whose films being used on the windows of office building nowadays and the case study of construction. And then we choose 6 kinds of transmittance as evaluation object including plain glass. The second, we made a mock-up models having different transmittance on the southern windows with model of real scale office building. The third, we select 17 pairs of adjectives for the evaluation of visual comfort on interior or exterior conditions with transmittance factor. The fourth, subjective evaluation experiment was done using selected evaluation adjectives and the result was analyzed. The results are as follows : the minimum transmittance appropriate for the office building is 30%∼40% and the optimal transmittance range is 40%∼60%.