• Title/Summary/Keyword: computer based estimation

Search Result 1,366, Processing Time 0.045 seconds

A Study on Automatic Missing Value Imputation Replacement Method for Data Processing in Digital Data (디지털 데이터에서 데이터 전처리를 위한 자동화된 결측 구간 대치 방법에 관한 연구)

  • Kim, Jong-Chan;Sim, Chun-Bo;Jung, Se-Hoon
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.2
    • /
    • pp.245-254
    • /
    • 2021
  • We proposed the research on an analysis and prediction model that allows the identification of outliers or abnormality in the data followed by effective and rapid imputation of missing values was conducted. This model is expected to analyze efficiently the problems in the data based on the calibrated raw data. As a result, a system that can adequately utilize the data was constructed by using the introduced KNN + MLE algorithm. With this algorithm, the problems in some of the existing KNN-based missing data imputation algorithms such as ignoring the missing values in some data sections or discarding normal observations were effectively addressed. A comparative evaluation was performed between the existing imputation approaches such as K-means, KNN, MEI, and MI as well as the data missing mechanisms including MCAR, MAR, and NI to check the effectiveness/efficiency of the proposed algorithm, and its superiority in all aspects was confirmed.

A TIME DETERMINATION MODEL INCORPORATING RISK MANAGEMENT BASED ON MALAYSIAN CASE STUDIES

  • Sim Nee Ting;Chung Thing Chong
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.642-648
    • /
    • 2009
  • Determining the total duration for a construction project is an integral part of project management in the construction industry. This is to ensure the project and all its associated activities can be carried out and completed within the time frame stipulated. There are several commonly used scheduling methods and techniques in project management, some of which involves manual calculation while others involve computer software. This paper looks into the various time determination methods, extracting out their differences and similarities. It also seeks to draw out the problems when determining time for projects, especially those encountered of case studies. Based on the results from the case studies, there were delays on certain projects even though time determination had been carried out rigorously prior to the commencement of the projects. This paper seeks to develop a time determination model, which incorporates risk management techniques into the calculations in order to improve the method for time estimation to minimize the chances of project delay.

  • PDF

Active Trajectory Tracking Control of AMR using Robust PID Tunning

  • Tae-Seok Jin
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.27 no.4_1
    • /
    • pp.753-758
    • /
    • 2024
  • Trajectory tracking of the AMR robot is one research for the AMR robot navigation. For the control system of the Autonomous mobile robot(AMR) being in non-honolomic system and the complex relations among the control parameters, it is d ifficult to solve the problem based on traditional mathematics model. In this paper, we presents a simple and effective way of implementing an adaptive tracking controller based on the PID for AMR robot trajectory tracking. The method uses a non-linear model of AMR robot kinematics and thus allows an accurate prediction of the future trajectories. The proposed controller has a parallel structure that consists of PID controller with a fixed gain. The control law is constructed on the basis of Lyapunov stability theory. Computer simulation for a differentially driven non-holonomic AMR robot is carried out in the velocity and orientation tracking control of the non-holonomic AMR. The simulation results of wheel type AMR robot platform show that the proposed controller is more robust than the conventional back-stepping controller to show the effectiveness of the proposed algorithm.

Study of Spectral Reflectance Reconstruction Based on an Algorithm for Improved Orthogonal Matching Pursuit

  • Leihong, Zhang;Dong, Liang;Dawei, Zhang;Xiumin, Gao;Xiuhua, Ma
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.4
    • /
    • pp.515-523
    • /
    • 2016
  • Spectral reflectance is sparse in space, and while the traditional spectral-reconstruction algorithm does not make full use of this characteristic sparseness, the compressive sensing algorithm can make full use of it. In this paper, on the basis of analyzing compressive sensing based on the orthogonal matching pursuit algorithm, a new algorithm based on the Dice matching criterion is proposed. The Dice similarity coefficient is introduced, to calculate the correlation coefficient of the atoms and the residual error, and is used to select the atoms from a library. The accuracy of Spectral reconstruction based on the pseudo-inverse method, Wiener estimation method, OMP algorithm, and DOMP algorithm is compared by simulation on the MATLAB platform and experimental testing. The result is that spectral-reconstruction accuracy based on the DOMP algorithm is higher than for the other three methods. The root-mean-square error and color difference decreases with an increasing number of principal components. The reconstruction error decreases as the number of iterations increases. Spectral reconstruction based on the DOMP algorithm can improve the accuracy of color-information replication effectively, and high-accuracy color-information reproduction can be realized.

Design and Implementation of WBI System for Test and Diagnoses based on WWW (WWW기반에서 테스트 및 진단을 위한 WBI 시스템의 설계 및 구현)

  • Kim, Du-Gyu;Lee, Jae-Mu
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.12
    • /
    • pp.938-946
    • /
    • 2001
  • A web support open environment in which flexibility that allows it to be applied in the education field has gradually evolved but the WBI(Web Based Instruction) which compose it have many limitations and problems, as far as learning efficiency is concerned. In particular, existing web-based estimation systems just give information on whether learner's replies are 'correct' or 'incorrect' and offer the learners evaluations of results in terms of scores. Therefore it is difficult for the learners to get more detailed information about their shortcomings and errors. What is needed for the learners is that web based instruction systems diagnose learner's comprehension status, providing c causes: Why did the learners make the errors\ulcorner In this paper, we propose the development of a web-based instruction system that learners can access with their browsers at any time and no matter where they are. Our system has a facility that analyses learner's weak points and diagnoses error cause, giving advice to learners and more detailed error information than existing systems. By accumulating user behaviors, relevant individualized information on the learners can be given.

  • PDF

Single Image Dehazing Based on Depth Map Estimation via Generative Adversarial Networks (생성적 대립쌍 신경망을 이용한 깊이지도 기반 연무제거)

  • Wang, Yao;Jeong, Woojin;Moon, Young Shik
    • Journal of Internet Computing and Services
    • /
    • v.19 no.5
    • /
    • pp.43-54
    • /
    • 2018
  • Images taken in haze weather are characteristic of low contrast and poor visibility. The process of reconstructing clear-weather image from a hazy image is called dehazing. The main challenge of image dehazing is to estimate the transmission map or depth map for an input hazy image. In this paper, we propose a single image dehazing method by utilizing the Generative Adversarial Network(GAN) for accurate depth map estimation. The proposed GAN model is trained to learn a nonlinear mapping between the input hazy image and corresponding depth map. With the trained model, first the depth map of the input hazy image is estimated and used to compute the transmission map. Then a guided filter is utilized to preserve the important edge information of the hazy image, thus obtaining a refined transmission map. Finally, the haze-free image is recovered via atmospheric scattering model. Although the proposed GAN model is trained on synthetic indoor images, it can be applied to real hazy images. The experimental results demonstrate that the proposed method achieves superior dehazing results against the state-of-the-art algorithms on both the real hazy images and the synthetic hazy images, in terms of quantitative performance and visual performance.

Artificial Intelligence Based Medical Imaging: An Overview (AI 의료영상 분석의 개요 및 연구 현황에 대한 고찰)

  • Hong, Jun-Yong;Park, Sang Hyun;Jung, Young-Jin
    • Journal of radiological science and technology
    • /
    • v.43 no.3
    • /
    • pp.195-208
    • /
    • 2020
  • Artificial intelligence(AI) is a field of computer science that is defined as allowing computers to imitate human intellectual behavior, even though AI's performance is to imitate humans. It is grafted across software-based fields with the advantages of high accuracy and speed of processing that surpasses humans. Indeed, the AI based technology has become a key technology in the medical field that will lead the development of medical image analysis. Therefore, this article introduces and discusses the concept of deep learning-based medical imaging analysis using the principle of algorithms for convolutional neural network(CNN) and back propagation. The research cases application of the AI based medical imaging analysis is used to classify the various disease(such as chest disease, coronary artery disease, and cerebrovascular disease), and the performance estimation comparing between AI based medical imaging classifier and human experts.

Real-time multi-GPU-based 8KVR stitching and streaming on 5G MEC/Cloud environments

  • Lee, HeeKyung;Um, Gi-Mun;Lim, Seong Yong;Seo, Jeongil;Gwak, Moonsung
    • ETRI Journal
    • /
    • v.44 no.1
    • /
    • pp.62-72
    • /
    • 2022
  • In this study, we propose a multi-GPU-based 8KVR stitching system that operates in real time on both local and cloud machine environments. The proposed system first obtains multiple 4 K video inputs, decodes them, and generates a stitched 8KVR video stream in real time. The generated 8KVR video stream can be downloaded and rendered omnidirectionally in player apps on smartphones, tablets, and head-mounted displays. To speed up processing, we adopt group-of-pictures-based distributed decoding/encoding and buffering with the NV12 format, along with multi-GPU-based parallel processing. Furthermore, we develop several algorithms such as equirectangular projection-based color correction, real-time CG overlay, and object motion-based seam estimation and correction, to improve the stitching quality. From experiments in both local and cloud machine environments, we confirm the feasibility of the proposed 8KVR stitching system with stitching speed of up to 83.7 fps for six-channel and 62.7 fps for eight-channel inputs. In addition, in an 8KVR live streaming test on the 5G MEC/cloud, the proposed system achieves stable performances with 8 K@30 fps in both indoor and outdoor environments, even during motion.

Efficient Algorithms for Motion Parameter Estimation in Object-Oriented Analysis-Synthesis Coding (객체지향 분석-함성 부호화를 위한 효율적 움직임 파라미터 추정 알고리듬)

  • Lee Chang Bum;Park Rae-Hong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.6
    • /
    • pp.653-660
    • /
    • 2004
  • Object-oriented analysis-synthesis coding (OOASC) subdivides each image of a sequence into a number of moving objects and estimates and compensates the motion of each object. It employs a motion parameter technique for estimating motion information of each object. The motion parameter technique employing gradient operators requires a high computational load. The main objective of this paper is to present efficient motion parameter estimation techniques using the hierarchical structure in object-oriented analysis-synthesis coding. In order to achieve this goal, this paper proposes two algorithms : hybrid motion parameter estimation method (HMPEM) and adaptive motion parameter estimation method (AMPEM) using the hierarchical structure. HMPEM uses the proposed hierarchical structure, in which six or eight motion parameters are estimated by a parameter verification process in a low-resolution image, whose size is equal to one fourth of that of an original image. AMPEM uses the same hierarchical structure with the motion detection criterion that measures the amount of motion based on the temporal co-occurrence matrices for adaptive estimation of the motion parameters. This method is fast and easily implemented using parallel processing techniques. Theoretical analysis and computer simulation show that the peak signal to noise ratio (PSNR) of the image reconstructed by the proposed method lies between those of images reconstructed by the conventional 6- and 8-parameter estimation methods with a greatly reduced computational load by a factor of about four.

An Efficient Parallelization Implementation of PU-level ME for Fast HEVC Encoding (고속 HEVC 부호화를 위한 효율적인 PU레벨 움직임예측 병렬화 구현)

  • Park, Soobin;Choi, Kiho;Park, Sang-Hyo;Jang, Euee Seon
    • Journal of Broadcast Engineering
    • /
    • v.18 no.2
    • /
    • pp.178-184
    • /
    • 2013
  • In this paper, we propose an efficient parallelization technique of PU-level motion estimation (ME) in the next generation video coding standard, high efficiency video coding (HEVC) to reduce the time complexity of video encoding. It is difficult to encode video in real-time because ME has significant complexity (i.e., 80 percent at the encoder). In order to solve this problem, various techniques have been studied, and among them is the parallelization, which is carefully concerned in algorithm-level ME design. In this regard, merge estimation method using merge estimation region (MER) that enables ME to be designed in parallel has been proposed; but, parallel ME based on MER has still unconsidered problems to be implemented ideally in HEVC test model (HM). Therefore, we propose two strategies to implement stable parallel ME using MER in HM. Through experimental results, the excellence of our proposed methods is shown; the encoding time using the proposed method is reduced by 25.64 percent on average of that of HM which uses sequential ME.