• Title/Summary/Keyword: Intelligence Optimization

Search Result 384, Processing Time 0.033 seconds

Research on Artificial Intelligence Based De-identification Technique of Personal Information Area at Video Data (영상데이터의 개인정보 영역에 대한 인공지능 기반 비식별화 기법 연구)

  • In-Jun Song;Cha-Jong Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.19 no.1
    • /
    • pp.19-25
    • /
    • 2024
  • This paper proposes an artificial intelligence-based personal information area object detection optimization method in an embedded system to de-identify personal information in video data. As an object detection optimization method, first, in order to increase the detection rate for personal information areas when detecting objects, a gyro sensor is used to collect the shooting angle of the image data when acquiring the image, and the image data is converted into a horizontal image through the collected shooting angle. Based on this, each learning model was created according to changes in the size of the image resolution of the learning data and changes in the learning method of the learning engine, and the effectiveness of the optimal learning model was selected and evaluated through an experimental method. As a de-identification method, a shuffling-based masking method was used, and double-key-based encryption of the masking information was used to prevent restoration by others. In order to reuse the original image, the original image could be restored through a security key. Through this, we were able to secure security for high personal information areas and improve usability through original image restoration. The research results of this paper are expected to contribute to industrial use of data without personal information leakage and to reducing the cost of personal information protection in industrial fields using video through de-identification of personal information areas included in video data.

Developing Novel Algorithms to Reduce the Data Requirements of the Capture Matrix for a Wind Turbine Certification (풍력 발전기 평가를 위한 수집 행렬 데이터 절감 알고리즘 개발)

  • Lee, Jehyun;Choi, Jungchul
    • New & Renewable Energy
    • /
    • v.16 no.1
    • /
    • pp.15-24
    • /
    • 2020
  • For mechanical load testing of wind turbines, capture matrix is constructed for various range of wind speeds according to the international standard IEC 61400-13. The conventional method wastes considerable amount of data by its invalid data policy -segment data into 10 minutes then remove invalid ones. Previously, we have suggested an alternative way to save the total amount of data to build a capture matrix, but the efficient selection of data has been still under question. The paper introduces optimization algorithms to construct capture matrix with less data. Heuristic algorithm (simple stacking and lowest frequency first), population method (particle swarm optimization) and Q-Learning accompanied with epsilon-greedy exploration are compared. All algorithms show better performance than the conventional way, where the distribution of enhancement was quite diverse. Among the algorithms, the best performance was achieved by heuristic method (lowest frequency first), and similarly by particle swarm optimization: Approximately 28% of data reduction in average and more than 40% in maximum. On the other hand, unexpectedly, the worst performance was achieved by Q-Learning, which was a promising candidate at the beginning. This study is helpful for not only wind turbine evaluation particularly the viewpoint of cost, but also understanding nature of wind speed data.

An Improvement of Particle Swarm Optimization with A Neighborhood Search Algorithm

  • Yano, Fumihiko;Shohdohji, Tsutomu;Toyoda, Yoshiaki
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.1
    • /
    • pp.64-71
    • /
    • 2007
  • J. Kennedy and R. Eberhart first introduced the concept called as Particle Swarm Optimization (PSO). They applied it to optimize continuous nonlinear functions and demonstrated the effectiveness of the algorithm. Since then a considerable number of researchers have attempted to apply this concept to a variety of optimization problems and obtained reasonable results. In PSO, individuals communicate and exchange simple information with each other. The information among individuals is communicated in the swarm and the information between individuals and their swarm is also shared. Finally, the swarm approaches the optimal behavior. It is reported that reasonable approximate solutions of various types of test functions are obtained by employing PSO. However, if more precise solutions are required, additional algorithms and/or hybrid algorithms would be necessary. For example, the heading vector of the swarm can be slightly adjusted under some conditions. In this paper, we propose a hybrid algorithm to obtain more precise solutions. In the algorithm, when a better solution in the swarm is found, the neighborhood of a certain distance from the solution is searched. Then, the algorithm returns to the original PSO search. By this hybrid method, we can obtain considerably better solutions in less iterations than by the standard PSO method.

Prototype-based Classifier with Feature Selection and Its Design with Particle Swarm Optimization: Analysis and Comparative Studies

  • Park, Byoung-Jun;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.2
    • /
    • pp.245-254
    • /
    • 2012
  • In this study, we introduce a prototype-based classifier with feature selection that dwells upon the usage of a biologically inspired optimization technique of Particle Swarm Optimization (PSO). The design comprises two main phases. In the first phase, PSO selects P % of patterns to be treated as prototypes of c classes. During the second phase, the PSO is instrumental in the formation of a core set of features that constitute a collection of the most meaningful and highly discriminative coordinates of the original feature space. The proposed scheme of feature selection is developed in the wrapper mode with the performance evaluated with the aid of the nearest prototype classifier. The study offers a complete algorithmic framework and demonstrates the effectiveness (quality of solution) and efficiency (computing cost) of the approach when applied to a collection of selected data sets. We also include a comparative study which involves the usage of genetic algorithms (GAs). Numerical experiments show that a suitable selection of prototypes and a substantial reduction of the feature space could be accomplished and the classifier formed in this manner becomes characterized by low classification error. In addition, the advantage of the PSO is quantified in detail by running a number of experiments using Machine Learning datasets.

An Improved MAP-Elites Algorithm via Rotational Invariant Operator in Differential Evolution for Continuous Optimization (연속 최적화를 위한 개선된 MAP-Elites 알고리즘)

  • Tae Jong Choi
    • Smart Media Journal
    • /
    • v.13 no.2
    • /
    • pp.129-135
    • /
    • 2024
  • In this paper, we propose a new approach that enhances the continuous optimization performance of the MAP-Elites algorithm. The existing self-referencing MAP-Elites algorithm employed the "DE/rand/1/bin" operator from the differential evolution algorithm, which, due to its lack of rotational invariance, led to a degradation in optimization performance when there were high correlations among variables. The proposed algorithm replaces the "DE/rand/1/bin" operator with the "DE/current-to-rand/1" operator. This operator, possessing rotational invariance, ensures robust performance even in cases where there are high correlations among variables. Experimental results confirm that the proposed algorithm performs better than the comparison algorithms.

Deep neural networks trained by the adaptive momentum-based technique for stability simulation of organic solar cells

  • Xu, Peng;Qin, Xiao;Zhu, Honglei
    • Structural Engineering and Mechanics
    • /
    • v.83 no.2
    • /
    • pp.259-272
    • /
    • 2022
  • The branch of electronics that uses an organic solar cell or conductive organic polymers in order to yield electricity from sunlight is called photovoltaic. Regarding this crucial issue, an artificial intelligence-based predictor is presented to investigate the vibrational behavior of the organic solar cell. In addition, the generalized differential quadrature method (GDQM) is utilized to extract the results. The validation examination is done to confirm the credibility of the results. Then, the deep neural network with fully connected layers (DNN-FCL) is trained by means of Adam optimization on the dataset whose members are the vibration response of the design-points. By determining the optimum values for the biases along with weights of DNN-FCL, one can predict the vibrational characteristics of any organic solar cell by knowing the properties defined as the inputs of the mentioned DNN. To assess the ability of the proposed artificial intelligence-based model in prediction of the vibrational response of the organic solar cell, the authors monitored the mean squared error in different steps of the training the DNN-FCL and they observed that the convergency of the results is excellent.

Scheduling of Artificial Intelligence Workloads in Could Environments Using Genetic Algorithms (유전 알고리즘을 이용한 클라우드 환경의 인공지능 워크로드 스케줄링)

  • Seokmin Kwon;Hyokyung Bahn
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.3
    • /
    • pp.63-67
    • /
    • 2024
  • Recently, artificial intelligence (AI) workloads encompassing various industries such as smart logistics, FinTech, and entertainment are being executed on the cloud. In this paper, we address the scheduling issues of various AI workloads on a multi-tenant cloud system composed of heterogeneous GPU clusters. Traditional scheduling decreases GPU utilization in such environments, degrading system performance significantly. To resolve these issues, we present a new scheduling approach utilizing genetic algorithm-based optimization techniques, implemented within a process-based event simulation framework. Trace driven simulations with diverse AI workload traces collected from Alibaba's MLaaS cluster demonstrate that the proposed scheduling improves GPU utilization compared to conventional scheduling significantly.

Relative humidity prediction of a leakage area for small RCS leakage quantification by applying the Bi-LSTM neural networks

  • Sang Hyun Lee;Hye Seon Jo;Man Gyun Na
    • Nuclear Engineering and Technology
    • /
    • v.56 no.5
    • /
    • pp.1725-1732
    • /
    • 2024
  • In nuclear power plants, reactor coolant leakage can occur due to various reasons. Early detection of leaks is crucial for maintaining the safety of nuclear power plants. Currently, a detection system is being developed in Korea to identify reactor coolant system (RCS) leakage of less than 0.5 gpm. Typically, RCS leaks are detected by monitoring temperature, humidity, and radioactivity in the containment, and a water level in the sump. However, detecting small leaks proves challenging because the resulting changes in the containment humidity and temperature, and the sump water level are minimal. To address these issues and improve leak detection speed, it is necessary to quantify the leaks and develop an artificial intelligence-based leak detection system. In this study, we employed bidirectional long short-term memory, which are types of neural networks used in artificial intelligence, to predict the relative humidity in the leakage area for leak quantification. Additionally, an optimization technique was implemented to reduce learning time and enhance prediction performance. Through evaluation of the developed artificial intelligence model's prediction accuracy, we expect it to be valuable for future leak detection systems by accurately predicting the relative humidity in a leakage area.

An Optimization of Resource Scheduling in the Cluster Computing Environment (클러스터 컴퓨팅 환경에서 자원 스케줄링의 최적화)

  • Lee, Hun Soon;Kim, Chang Soo
    • Annual Conference of KIPS
    • /
    • 2016.10a
    • /
    • pp.56-57
    • /
    • 2016
  • 본 논문에서는 클러스터 컴퓨팅 환경에서 가용한 자원의 추이를 고려한 자원 스케줄링 최적화 방법을 제안한다. 제안하는 스케줄링 방법은 데이터 인텐시브 응용의 특성인 자원 추가에 따른 처리 성능의 선형적 확장성을 활용하는데, 사용자가 작업 수행을 위해 명시한 자원이 가용하지 않은 경우에 해당 자원이 가용해질 때까지 기다리는 것이 아니라 가용한 자원 상황 추이를 고려하여 융통성 있는 자원 할당을 하게 함으로써 자원 조각화를 최소화한다. 시물레이션을 통한 실험으로 제안하는 방법이 기존 방법에 비해 자원 활용률과 처리량 측면에서 우수함을 검증하였다.

Optimal Structural Design Using Artificial Intelligence Techniques (인공지능 기술을 이용한 최적 구조설계)

  • 양영순;유원선;한상민
    • Computational Structural Engineering
    • /
    • v.11 no.3
    • /
    • pp.213-228
    • /
    • 1998
  • 구조설계 과정에서 설계대안을 효율적으로 생성하여 평가하면서, 특히 다목적 환경 속에서 최적구조의 위상과 부재의 치수까지 동시에 결정할 수 있는 새로운 방식을 제시하고자 한다. 설계자가 설계대안을 생성하기 위해 설계자의 경험과 노하우를 체계적으로 구축해 놓고 이를 적절한 시기에 활용할 수 있게 하는 방법으로는 인공지능 기술의 하나인 사례기반 추론 기법을 사용하였다. 이와 더불어, 설계대안들 간의 효율적인 비교와 평가를 위해서 구조물의 계층적인 면을 고려한 새로운 유전적인 표현법을 개발하였다. 여기에 기존의 유전적 표현법을 변경시켜 생긴 여분의 효과와 계층적인 특징을 가지는 Structured Genetic Algorithm(StrGA)를 변형시켜서 사례기반 추론에 의해 생성된 설계대안들을 표현하였다. 일반적인 구조설계 과정에서는 구조물을 평가하는 기준이 여러 개가 존재하므로, 모든 대안들을 동시에 최적화 하는 과정에 Multicriteria Optimization for Genetic Algorithm(MOGA)를 병합하였다. 본 논문에서는 인공지능 기술을 이용하여 구조물의 위상설계를 할 수 있는 새로운 방법을 제안하여 그 유용성을 truss 설계문제에 대해 검토하였다.

  • PDF