• Title/Summary/Keyword: Moving squared algorithm

Search Result 6, Processing Time 0.029 seconds

Motion Artifact Reduction Algorithm for Interleaved MRI using Fully Data Adaptive Moving Least Squares Approximation Algorithm (완전 데이터 적응형 MLS 근사 알고리즘을 이용한 Interleaved MRI의 움직임 보정 알고리즘)

  • Nam, Haewon
    • Journal of Biomedical Engineering Research
    • /
    • v.41 no.1
    • /
    • pp.28-34
    • /
    • 2020
  • In this paper, we introduce motion artifact reduction algorithm for interleaved MRI using an advanced 3D approximation algorithm. The motion artifact framework of this paper is data corrected by post-processing with a new 3-D approximation algorithm which uses data structure for each voxel. In this study, we simulate and evaluate our algorithm using Shepp-Logan phantom and T1-MRI template for both scattered dataset and uniform dataset. We generated motion artifact using random generated motion parameters for the interleaved MRI. In simulation, we use image coregistration by SPM12 (https://www.fil.ion.ucl.ac.uk/spm/) to estimate the motion parameters. The motion artifact correction is done with using full dataset with estimated motion parameters, as well as use only one half of the full data which is the case when the half volume is corrupted by severe movement. We evaluate using numerical metrics and visualize error images.

Optimal Straight Line Path of a Moving Facility (이동설비의 최적 직선 경로)

  • Sherali, Hanif D.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.1
    • /
    • pp.72-79
    • /
    • 1989
  • In this paper we consider the problem of finding an optimal straight line path of moving facility which interacts with a set of existing facilities fixed within a given rectangular area. We present a simple algorithm for rectilinear metric which greatly improves the pervious method and also propose algorithms for Euclidean and squared Euclidean distances.

  • PDF

Heuristic algorithm to raise efficiency in clustering (군집의 효율향상을 위한 휴리스틱 알고리즘)

  • Lee, Seog-Hwan;Park, Seung-Hun
    • Journal of the Korea Safety Management & Science
    • /
    • v.11 no.3
    • /
    • pp.157-166
    • /
    • 2009
  • In this study, we developed a heuristic algorithm to get better efficiency of clustering than conventional algorithms. Conventional clustering algorithm had lower efficiency of clustering as there were no solid method for selecting initial center of cluster and as they had difficulty in search solution for clustering. EMC(Expanded Moving Center) heuristic algorithm was suggested to clear the problem of low efficiency in clustering. We developed algorithm to select initial center of cluster and search solution systematically in clustering. Experiments of clustering are performed to evaluate performance of EMC heuristic algorithm. Squared-error of EMC heuristic algorithm showed better performance for real case study and improved greatly with increase of cluster number than the other ones.

Vision-based Potato Detection and Counting System for Yield Monitoring

  • Lee, Young-Joo;Kim, Ki-Duck;Lee, Hyeon-Seung;Shin, Beom-Soo
    • Journal of Biosystems Engineering
    • /
    • v.43 no.2
    • /
    • pp.103-109
    • /
    • 2018
  • Purpose: This study has been conducted to develop a potato yield monitoring system, consisting of a segmentation algorithm to detect potatoes scattered on a soil surface and a counting system to count the number of potatoes and convert the data from two-dimensional images to masses. Methods: First, a segmentation algorithm was developed using top-hat filtering and processing a series of images, and its performance was evaluated in a stationary condition. Second, a counting system was developed to count the number of potatoes in a moving condition and calculate the mass of each using a mass estimation equation, where the volume of a potato was obtained from its two-dimensional image, and the potato density and a correction factor were obtained experimentally. Experiments were conducted to segment potatoes on a soil surface for different potato sizes. The counting system was tested 10 times for 20 randomly selected potatoes in a simulated field condition. Furthermore, the estimated total mass of the potatoes was compared with their actual mass. Results: For a $640{\times}480$ image size, it took 0.04 s for the segmentation algorithm to process one frame. The root mean squared deviation (RMSD) and average percentage error for the measured mass of potatoes using this counting system were 12.65 g and 7.13%, respectively, when the camera was stationary. The system performance while moving was the best in L1 (0.313 m/s), where the RMSD and percentage error were 6.92 g and 7.79%, respectively. For 20 newly prepared potatoes and 10 replication measurements, the counting system exhibited a percentage error in the mass estimation ranging from 10.17-13.24%. Conclusions: At a travel speed of 0.313 m/s, the average percentage error and standard deviation of the mass measurement using the counting system were 12.03% and 1.04%, respectively.

A Study on the Postprocessing of Channel Estimates in LTE System (LTE 시스템 채널 추정치의 후처리 기법 연구)

  • Yoo, Kyung-Yul
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.1
    • /
    • pp.205-213
    • /
    • 2011
  • The Long Term Evolution (LTE) system is designed to provide a high quality data service for fast moving mobile users. It is based on the Orthogonal Frequency Division Multiplexing (OFDM) and relies its channel estimation on the training samples which are systematically built within the transmitting data. Either a preamble or a lattice type is used for the distribution of training samples and the latter suits better for the multipath fading channel environment whose channel frequency response (CFR) fluctuates rapidly with time. In the lattice-type structure, the estimation of the CFR makes use of the least squares estimate (LSE) for each pilot samples, followed by an interpolation both in time-and in frequency-domain to fill up the channel estimates for subcarriers corresponding to data samples. All interpolation schemes should rely on the pilot estimates only, and thus, their performances are bounded by the quality of pilot estimates. However, the additive noise give rise to high fluctuation on the pilot estimates, especially in a communication environment with low signal-to-noise ratio. These high fluctuations could be monitored in the alternating high values of the first forward differences (FFD) between pilot estimates. In this paper, we analyzed statistically those FFD values and propose a postprocessing algorithm to suppress high fluctuations in the noisy pilot estimates. The proposed method is based on a localized adaptive moving-average filtering. The performance of the proposed technique is verified on a multipath environment suggested on a 3GPP LTE specification. It is shown that the mean-squared error (MSE) between the actual CFR and pilot estimates could be reduced up to 68% from the noisy pilot estimates.

Exploring the Sentiment Analysis of Electric Vehicles Social Media Data by Using Feature Selection Methods (속성선택방법을 이용한 전기자동차 소셜미디어 데이터의 감성분석 연구)

  • Costello, Francis Joseph;Lee, Kun Chang
    • Journal of Digital Convergence
    • /
    • v.18 no.2
    • /
    • pp.249-259
    • /
    • 2020
  • This study presents a recently obtained social media data set based upon the case study of Electric Vehicles (EV) and looks to implement a sentiment analysis (SA) in order to gain insights. This study uses two methods in order to fully analyze the public's sentiment on EVs. First, we implement a SA tool in which we used to extract the sentiment of comments. Next we labeled the data with these sentiments obtained and classified them. While performing classification we found the problem of dimensionality and also explored the use of feature selection (FS) models in order to reduce the data set's dimensionality. We found that the use of three FS models (Chi Squared, Information Gain and ReliefF) showed the most promising results when used alongside a logistic and support vector machines classification algorithm. the contributions of this paper are in providing an real-world example of social media text analytics which can be adopted in many other areas of research and business. Moving forward researchers can use the methodological approach in this paper to further refine and improve their own case uses in text analytics.