• 제목/요약/키워드: Minimax model

검색결과 39건 처리시간 0.026초

Generative Adversarial Network를 이용한 손실된 깊이 영상 복원 (Depth Image Restoration Using Generative Adversarial Network)

  • 나준엽;심창훈;박인규
    • 방송공학회논문지
    • /
    • 제23권5호
    • /
    • pp.614-621
    • /
    • 2018
  • 본 논문에서는 generative adversarial network (GAN)을 이용한 비감독 학습을 통해 깊이 카메라로 깊이 영상을 취득할 때 발생한 손실된 부분을 복원하는 기법을 제안한다. 제안하는 기법은 3D morphable model convolutional neural network (3DMM CNN)와 large-scale CelebFaces Attribute (CelebA) 데이터 셋 그리고 FaceWarehouse 데이터 셋을 이용하여 학습용 얼굴 깊이 영상을 생성하고 deep convolutional GAN (DCGAN)의 생성자(generator)와 Wasserstein distance를 손실함수로 적용한 구별자(discriminator)를 미니맥스 게임기법을 통해 학습시킨다. 이후 학습된 생성자와 손실 부분을 복원해주기 위한 새로운 손실함수를 이용하여 또 다른 학습을 통해 최종적으로 깊이 카메라로 취득된 얼굴 깊이 영상의 손실 부분을 복원한다.

Torusity Tolerance Verification using Swarm Intelligence

  • Prakasvudhisarn, Chakguy;Kunnapapdeelert, Siwaporn
    • Industrial Engineering and Management Systems
    • /
    • 제6권2호
    • /
    • pp.94-105
    • /
    • 2007
  • Measurement technology plays an important role in discrete manufacturing industry. Probe-type coordinate measuring machines (CMMs) are normally used to capture the geometry of part features. The measured points are then fit to verify a specified geometry by using the least squares method (LSQ). However, it occasionally overestimates the tolerance zone, which leads to the rejection of some good parts. To overcome this drawback, minimum zone approaches defined by the ANSI Y14.5M-1994 standard have been extensively pursued for zone fitting in coordinate form literature for such basic features as plane, circle, cylinder and sphere. Meanwhile, complex features such as torus have been left to be dealt-with by the use of profile tolerance definition. This may be impractical when accuracy of the whole profile is desired. Hence, the true deviation model of torus is developed and then formulated as a minimax problem. Next, a relatively new and simple population based evolutionary approach, particle swarm optimization (PSO), is applied by imitating the social behavior of animals to find the minimum tolerance zone torusity. Simulated data with specified torusity zones are used to validate the deviation model. The torusity results are in close agreement with the actual torusity zones and also confirm the effectiveness of the proposed PSO when compared to those of the LSQ.

Response prediction of laced steel-concrete composite beams using machine learning algorithms

  • Thirumalaiselvi, A.;Verma, Mohit;Anandavalli, N.;Rajasankar, J.
    • Structural Engineering and Mechanics
    • /
    • 제66권3호
    • /
    • pp.399-409
    • /
    • 2018
  • This paper demonstrates the potential application of machine learning algorithms for approximate prediction of the load and deflection capacities of the novel type of Laced Steel Concrete-Composite (LSCC) beams proposed by Anandavalli et al. (Engineering Structures 2012). Initially, global and local responses measured on LSCC beam specimen in an experiment are used to validate nonlinear FE model of the LSCC beams. The data for the machine learning algorithms is then generated using validated FE model for a range of values of the identified sensitive parameters. The performance of four well-known machine learning algorithms, viz., Support Vector Regression (SVR), Minimax Probability Machine Regression (MPMR), Relevance Vector Machine (RVM) and Multigene Genetic Programing (MGGP) for the approximate estimation of the load and deflection capacities are compared in terms of well-defined error indices. Through relative comparison of the estimated values, it is demonstrated that the algorithms explored in the present study provide a good alternative to expensive experimental testing and sophisticated numerical simulation of the response of LSCC beams. The load carrying and displacement capacity of the LSCC was predicted well by MGGP and MPMR, respectively.

재난 구호품의 효과적 분배를 위한 혼합정수계획 모형 (A Mixed-Integer Programming Model for Effective Distribution of Relief Supplies in Disaster)

  • 김흥섭
    • 산업경영시스템학회지
    • /
    • 제44권1호
    • /
    • pp.26-36
    • /
    • 2021
  • The topic of this study is the field of humanitarian logistics for disaster response. Many existing studies have revealed that compliance with the golden time in response to a disaster determines the success or failure of relief activities, and logistics costs account for 80% of the disaster response cost. Besides, the agility, responsiveness, and effectiveness of the humanitarian logistics system are emphasized in consideration of the disaster situation's characteristics, such as the urgency of life-saving and rapid environmental changes. In other words, they emphasize the importance of logistics activities in disaster response, which includes the effective and efficient distribution of relief supplies. This study proposes a mathematical model for establishing a transport plan to distribute relief supplies in a disaster situation. To determine vehicles' route and the amount of relief for cities suffering a disaster, it mainly considers the urgency, effectiveness (restoration rate), and uncertainty in the logistics system. The model is initially developed as a mixed-integer nonlinear programming (MINLP) model containing some nonlinear functions and transform into a Mixed-integer linear programming (MILP) model using a logarithmic transformation and piecewise linear approximation method. Furthermore, a minimax problem is suggested to search for breakpoints and slopes to define a piecewise linear function that minimizes the linear approximation error. A numerical experiment is performed to verify the MILP model, and linear approximation error is also analyzed in the experiment.

Assessment of compressive strength of high-performance concrete using soft computing approaches

  • Chukwuemeka Daniel;Jitendra Khatti;Kamaldeep Singh Grover
    • Computers and Concrete
    • /
    • 제33권1호
    • /
    • pp.55-75
    • /
    • 2024
  • The present study introduces an optimum performance soft computing model for predicting the compressive strength of high-performance concrete (HPC) by comparing models based on conventional (kernel-based, covariance function-based, and tree-based), advanced machine (least square support vector machine-LSSVM and minimax probability machine regressor-MPMR), and deep (artificial neural network-ANN) learning approaches using a common database for the first time. A compressive strength database, having results of 1030 concrete samples, has been compiled from the literature and preprocessed. For the purpose of training, testing, and validation of soft computing models, 803, 101, and 101 data points have been selected arbitrarily from preprocessed data points, i.e., 1005. Thirteen performance metrics, including three new metrics, i.e., a20-index, index of agreement, and index of scatter, have been implemented for each model. The performance comparison reveals that the SVM (kernel-based), ET (tree-based), MPMR (advanced), and ANN (deep) models have achieved higher performance in predicting the compressive strength of HPC. From the overall analysis of performance, accuracy, Taylor plot, accuracy metric, regression error characteristics curve, Anderson-Darling, Wilcoxon, Uncertainty, and reliability, it has been observed that model CS4 based on the ensemble tree has been recognized as an optimum performance model with higher performance, i.e., a correlation coefficient of 0.9352, root mean square error of 5.76 MPa, and mean absolute error of 4.1069 MPa. The present study also reveals that multicollinearity affects the prediction accuracy of Gaussian process regression, decision tree, multilinear regression, and adaptive boosting regressor models, novel research in compressive strength prediction of HPC. The cosine sensitivity analysis reveals that the prediction of compressive strength of HPC is highly affected by cement content, fine aggregate, coarse aggregate, and water content.

Fuzzy-ART Basis Equalizer for Satellite Nonlinear Channel

  • Lee, Jung-Sik;Hwang, Jae-Jeong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제2권1호
    • /
    • pp.43-48
    • /
    • 2002
  • This paper discusses the application of fuzzy-ARTMAP neural network to compensate the nonlinearity of satellite communication channel. The fuzzy-ARTMAP is the class of ART(adaptive resonance theory) architectures designed fur supervised loaming. It has capabilities not fecund in other neural network approaches, that includes a small number of parameters, no requirements fur the choice of initial weights, automatic increase of hidden units, and capability of adding new data without retraining previously trained data. By a match tracking process with vigilance parameter, fuzzy-ARTMAP neural network achieves a minimax teaming rule that minimizes predictive error and maximizes generalization. Thus, the system automatically leans a minimal number of recognition categories, or hidden units, to meet accuracy criteria. As a input-converting process for implementing fuzzy-ARTMAP equalizer, the sigmoid function is chosen to convert actual channel output to the proper input values of fuzzy-ARTMAP. Simulation studies are performed over satellite nonlinear channels. QPSK signals with Gaussian noise are generated at random from Volterra model. The performance of proposed fuzzy-ARTMAP equalizer is compared with MLP equalizer.

다중제약을 고려한 최적 버스운행계획 알고리즘 개발 (Development of Optimal Bus Scheduling Algorithm with Multi-constraints)

  • 이호상;박종헌;조성훈;윤병조
    • 대한교통학회지
    • /
    • 제24권7호
    • /
    • pp.129-138
    • /
    • 2006
  • 서울시는 지난 2004년 7월부터 버스에 준공영제(공공관리, 민영운영)개념을 도입한 후 노선별로 불필요한 운행을 최소화하고 승객편익 및 이용수요 증대를 위해 배차 최적화 모형을 연구. 개발하였다 본 연구는 이러한 노력의 결과물로서 서울시 버스 운영체계에 맞는 노선별 운행대수. 근로조건, 최대 재차인원. 최대/최소 배차간격 등을 제약 조건으로 하고 승객의 대기시간을 최소화하는 Heuristic 배차최적화 모형을 개발하였다. 모형의 적용성을 검증하기 위해 운행 중인 노선에 적용한 결과, 같은 운행대수라도 첨두시 배차간격이 좁혀져 승객편익이 증대되었다. 따라서 개발모형은 여러 제약조건을 고려한 최적 배차계획 수립 및 적용을 가능케 하여 버스운영 효율화에 기여할 것으로 판단된다.

KTX열차와 일반열차 간 접속대기를 고려한 복선구간 열차시각표 재수립 모형의 기본설계 (An Exploratory Development of Railway-timetable Rescheduling Model Considering Transferring Service between KTX and Conventional Train on a Double Line Track)

  • 김재희;오석문
    • 한국산학기술학회논문지
    • /
    • 제10권6호
    • /
    • pp.1337-1345
    • /
    • 2009
  • 철도 네트워크에서는 정해진 선로를 운행하는 열차의 특성상 일부 열차의 지연이 다른 열차의 스케줄에 영향을 미쳐 열차 간 경합이 발생할 수 있고, 이는 전체 네트워크에 파급되어 혼선을 유발할 수 있다. 따라서 혼선된 열차 시각표를 빠른 시간 내에 재수립하는 것은 매우 중요한 문제가 된다. 이 문제는 동일 방향으로 진행 중인 열차가 선행열차를 추월하거나 다수의 노선이 하나로 수렴하는 경우에 열차의 진행 순서를 정하는 등의 문제로 이해될 수 있다. 그러나 이 문제를 위한 국내의 연구는 활발하지 못하며, 특히 일반열차와 고속열차(KTX)가 하나의 선로를 공유함으로써 두 열차 간의 연계가 필요한 한국 철도의 복잡한 현실까지 고려하지 못하고 있는 실정이다. 이에 본 연구에서는 열차 지연시간의 합을 최소화할 수 있는 최적화 모형을 제시하고자 한다. 제시된 모형을 일반열차와 KTX 열차가 혼재하는 경부선 복선 구간에 적용한 결과 열차 환승을 고려한 열차 시각표 재수립이 가능함을 확인하였다.

능형회귀에서의 로버스트한 k의 선택 방법 (Robust selection rules of k in ridge regression)

  • 임용빈
    • 응용통계연구
    • /
    • 제6권2호
    • /
    • pp.371-381
    • /
    • 1993
  • 표준화된 중회귀모형에서 다중공선성(multicollinearity)이 존재할 때, 공선성(collinearity)의 영향을 완화하기 위해서 능형회귀가 사용된다. 반응변수의 예측을 위한 기준으로서 반응변 수의 예측치의 평균제곱합(MSE)을 설명변수의 관심영역 R에서 적분한(IMSE) $J_w(k)$ 기 준이 Lim, Choi & Park(1980)에 의해 소개되었다. $C_k$기준이 설명변수의 관심영역 R상 에서의 가중치 함수인 w(x)가 각각의 자료점에서 등확률 1/n을 갖는 경우의 IMSE 기준인 $J_n(k)$ 기준과 동치라는 관계를 이용함으로 $C_k$ 기준에 대해서 Myers(1986)에 의해 주어진 k의 선택방법 보다 더 합리적이라 기대되는 k의 선택방법이 제시되었다. 다음으로 관심이 있는 모든 기준들에 대해서 상대적으로 효율이 좋은 능형회귀추정량 $\beta(k)$를 선택하기 위해서, 관심이 있는 기준들 간의 가장 나쁜 효율을 최대화한다는 의미에서 MiniMax 원칙을 채택하여 관심이 있는 기준들에 대해서 로버스트한 k의 선택방법을 제시 하였다.

  • PDF