• Title/Summary/Keyword: Filtering Algorithm

Search Result 1,427, Processing Time 0.033 seconds

The Effect of Data Size on the k-NN Predictability: Application to Samsung Electronics Stock Market Prediction (데이터 크기에 따른 k-NN의 예측력 연구: 삼성전자주가를 사례로)

  • Chun, Se-Hak
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.239-251
    • /
    • 2019
  • Statistical methods such as moving averages, Kalman filtering, exponential smoothing, regression analysis, and ARIMA (autoregressive integrated moving average) have been used for stock market predictions. However, these statistical methods have not produced superior performances. In recent years, machine learning techniques have been widely used in stock market predictions, including artificial neural network, SVM, and genetic algorithm. In particular, a case-based reasoning method, known as k-nearest neighbor is also widely used for stock price prediction. Case based reasoning retrieves several similar cases from previous cases when a new problem occurs, and combines the class labels of similar cases to create a classification for the new problem. However, case based reasoning has some problems. First, case based reasoning has a tendency to search for a fixed number of neighbors in the observation space and always selects the same number of neighbors rather than the best similar neighbors for the target case. So, case based reasoning may have to take into account more cases even when there are fewer cases applicable depending on the subject. Second, case based reasoning may select neighbors that are far away from the target case. Thus, case based reasoning does not guarantee an optimal pseudo-neighborhood for various target cases, and the predictability can be degraded due to a deviation from the desired similar neighbor. This paper examines how the size of learning data affects stock price predictability through k-nearest neighbor and compares the predictability of k-nearest neighbor with the random walk model according to the size of the learning data and the number of neighbors. In this study, Samsung electronics stock prices were predicted by dividing the learning dataset into two types. For the prediction of next day's closing price, we used four variables: opening value, daily high, daily low, and daily close. In the first experiment, data from January 1, 2000 to December 31, 2017 were used for the learning process. In the second experiment, data from January 1, 2015 to December 31, 2017 were used for the learning process. The test data is from January 1, 2018 to August 31, 2018 for both experiments. We compared the performance of k-NN with the random walk model using the two learning dataset. The mean absolute percentage error (MAPE) was 1.3497 for the random walk model and 1.3570 for the k-NN for the first experiment when the learning data was small. However, the mean absolute percentage error (MAPE) for the random walk model was 1.3497 and the k-NN was 1.2928 for the second experiment when the learning data was large. These results show that the prediction power when more learning data are used is higher than when less learning data are used. Also, this paper shows that k-NN generally produces a better predictive power than random walk model for larger learning datasets and does not when the learning dataset is relatively small. Future studies need to consider macroeconomic variables related to stock price forecasting including opening price, low price, high price, and closing price. Also, to produce better results, it is recommended that the k-nearest neighbor needs to find nearest neighbors using the second step filtering method considering fundamental economic variables as well as a sufficient amount of learning data.

Detection of Abnormal Leakage and Its Location by Filtering of Sonic Signals at Petrochemical Plant (비정상 음향신호 필터링을 통한 플랜트 가스누출 위치 탐지기법)

  • Yoon, Young-Sam;Kim, Cheol
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.36 no.6
    • /
    • pp.655-662
    • /
    • 2012
  • Gas leakage in an oil refinery causes damage to the environment and unsafe conditions. Therefore, it is necessary to develop a technique that is able to detect the location of the leakage and to filter abnormal gas-leakage signals from normal background noise. In this study, the adaptation filter of the finite impulse response (FIR) least mean squares (LMS) algorithm and a cross-correlation function were used to develop a leakage-predicting program based on LABVIEW. Nitrogen gas at a high pressure of 120 kg/$cm^2$ and the assembled equipment were used to perform experiments in a reverberant chamber. Analysis of the data from the experiments performed with various hole sizes, pressures, distances, and frequencies indicated that the background noise occurred primarily at less than 1 kHz and that the leakage signal appeared in a high-frequency region of around 16 kHz. Measurement of the noise sources in an actual oil refinery revealed that the noise frequencies of pumps and compressors, which are two typical background noise sources in a petrochemical plant, were 2 kHz and 4.5 kHz, respectively. The fact that these two signals were separated clearly made it possible to distinguish leakage signals from background noises and, in addition, to detect the location of the leakage.

A City Path Travel Time Estimation Method Using ATMS Travel Time and Pattern Data (ATMS 교통정보와 패턴데이터를 이용한 도시부도로 통행시간 추정방안 연구)

  • KIM, Sang Bum;KIM, Chil Hyun;YOO, Byung Young;KWON, Yong Seok
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.3
    • /
    • pp.315-321
    • /
    • 2015
  • ATMS calculates section travel time using two-way communication system called DSRC(Dedicated Short Range Communications) which collects data of RSE (Road Side Equipment) and Hi-pass OBU (On-board Unit). Travel time estimation in urban area involves uncertainty due to the interrupted flow. This study not only analyzed real-time data but also considered pattern data. Baek-Je-Ro street in Jeon-Ju city was selected as a test site. Existing algorithm was utilized for data filtering and pattern data building. Analysis results repoted that travel time estimation with 20% of real-time data and 80% of pattern data mixture gave minimum average difference of 37.5 seconds compare to the real travel time at the 5% significant level. Results of this study recommend usage of intermixture between real time data and pattern data to minimize error for travel time estimation in urban area.

Parameter Analysis for Time Reduction in Extracting SIFT Keypoints in the Aspect of Image Stitching (영상 스티칭 관점에서 SIFT 특징점 추출시간 감소를 위한 파라미터 분석)

  • Moon, Won-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of Broadcast Engineering
    • /
    • v.23 no.4
    • /
    • pp.559-573
    • /
    • 2018
  • Recently, one of the most actively applied image media in the most fields such as virtual reality (VR) is omni-directional or panorama image. This image is generated by stitching images obtained by various methods. In this process, it takes the most time to extract keypoints necessary for stitching. In this paper, we analyze the parameters involved in the extraction of SIFT keypoints with the aim of reducing the computation time for extracting the most widely used SIFT keypoints. The parameters considered in this paper are the initial standard deviation of the Gaussian kernel used for Gaussian filtering, the number of gaussian difference image sets for extracting local extrema, and the number of octaves. As the SIFT algorithm, the Lowe scheme, the originally proposed one, and the Hess scheme which is a convolution cascade scheme, are considered. First, the effect of each parameter value on the computation time is analyzed, and the effect of each parameter on the stitching performance is analyzed by performing actual stitching experiments. Finally, based on the results of the two analyses, we extract parameter value set that minimize computation time without degrading.

Effective Morphological Layer Segmentation Based on Edge Information for Screen Image Coding (스크린 이미지 부호화를 위한 에지 정보 기반의 효과적인 형태학적 레이어 분할)

  • Park, Sang-Hyo;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.12
    • /
    • pp.38-47
    • /
    • 2013
  • An image coding based on MRC model, a kind of multi-layer image model, first segments a screen image into foreground, mask, and background layers, and then compresses each layer using a codec that is suitable to the layer. The mask layer defines the position of foreground regions such as textual and graphical contents. The colour signal of the foreground (background) region is saved in the foreground (background) layer. The mask layer which contains the segmentation result of foreground and background regions is of importance since its accuracy directly affects the overall coding performance of the codec. This paper proposes a new layer segmentation algorithm for the MRC based image coding. The proposed method extracts text pixels from the background using morphological top hat filtering. The application of white or black top hat transformation to local blocks is controlled by the information of relative brightness of text compared to the background. In the proposed method, the boundary information of text that is extracted from the edge map of the block is used for the robust decision on the relative brightness of text. Simulation results show that the proposed method is superior to the conventional methods.

Comparison of Volumes between Four-Dimensional Computed Tomography and Cone-Beam Computed Tomography Images using Dynamic Phantom (호흡동조전산화단층촬영과 콘빔전산화단층촬영의 팬텀 영상 체적비교)

  • Kim, Seong-Eun;Won, Hui-Su;Hong, Joo-Wan;Chang, Nam-Jun;Jung, Woo-Hyun;Choi, Byeong-Don
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.28 no.2
    • /
    • pp.123-130
    • /
    • 2016
  • Purpose : The aim of this study was to compare the differences between the volumes acquired with four-dimensional computed tomography (4DCT)images with a reconstruction image-filtering algorithm and cone-beam computed tomography (CBCT) images with dynamic phantom. Materials and Methods : The 4DCT images were obtained from the computerized imaging reference systems (CIRS) phantom using a computed tomography (CT) simulator. We analyzed the volumes for maximum intensity projection (MIP), minimum intensity projection (MinIP) and average intensity projection (AVG) of the images obtained with the 4DCT scanner against those acquired from CBCT images with CT ranger tools. Results : Difference in volume for node of 1, 2 and 3 cm between CBCT and 4DCT was 0.54~2.33, 5.16~8.06, 9.03~20.11 ml in MIP, respectively, 0.00~1.48, 0.00~8.47, 1.42~24.85 ml in MinIP, respectively and 0.00~1.17, 0.00~2.19, 0.04~3.35 ml in AVG, respectively. Conclusion : After a comparative analysis of the volumes for each nodal size, it was apparent that the CBCT images were similar to the AVG images acquired using 4DCT.

  • PDF

Low-complexity Adaptive Loop Filters Depending on Transform-block Region (변환블럭의 영역에 따른 저복잡도 적응 루프 필터)

  • Lim, Woong;Nam, Jung-Hak;Sim, Dong-Gyu;Jung, Kwang-Soo;Cho, Dae-Sung;Choi, Byung-Doo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.5
    • /
    • pp.46-54
    • /
    • 2011
  • In this paper, we propose a low-complexity loop filtering method depending on transform-block regions. Block adaptive loop filter (BALF) was developed to improve about 10% in compression performance for the next generation video coding. The BALF employs the Wiener filter that makes reconstructed frames close to the original ones and transmits filter-related information. However, the BALF requires high computational complexity, while it can achieve high compression performance because the block adaptive loop filter is applied to all the pixels in blocks. The proposed method is a new loop filter that classifies pixels in a block into inner and boundary regions based on the characteristics of the integer transform and derives optimum filters for each region. Then, it applies the selected filters for the inner and/or boundary regions. The decoder complexity can be adjusted by selecting region-dependent filter to be used in the decoder side. We found that the proposed algorithm can reduce 35.5% of computational complexity with 2.56% of compression loss, in case that only boundary filter is used.

Fast Detection of Power Lines Using LIDAR for Flight Obstacle Avoidance and Its Applicability Analysis (비행장애물 회피를 위한 라이다 기반 송전선 고속탐지 및 적용가능성 분석)

  • Lee, Mijin;Lee, Impyeong
    • Spatial Information Research
    • /
    • v.22 no.1
    • /
    • pp.75-84
    • /
    • 2014
  • Power lines are one of the main obstacles causing an aircraft crash and thus their realtime detection is significantly important during flight. To avoid such flight obstacles, the use of LIDAR has been recently increasing thanks to its advantages that it is less sensitive to weather conditions and can operate in day and night. In this study, we suggest a fast method to detect power lines from LIDAR data for flight obstacle avoidance. The proposed method first extracts non-ground points by eliminating the points reflected from ground surfaces using a filtering process. Second, we calculate the eigenvalues for the covariance matrix from the coordinates of the generated non-ground points and obtain the ratio of eigenvalues. Based on the ratio of eigenvalues, we can classify the points on a linear structure. Finally, among them, we select the points forming horizontally long straight as power-line points. To verify the algorithm, we used both real and simulated data as the input data. From the experimental results, it is shown that the average detection rate and time are 80% and 0.2 second, respectively. If we would improve the method based on the experiment results from the various flight scenario, it will be effectively utilized for a flight obstacle avoidance system.

Assessment of Forest Biomass using k-Neighbor Techniques - A Case Study in the Research Forest at Kangwon National University - (k-NN기법을 이용한 산림바이오매스 자원량 평가 - 강원대학교 학술림을 대상으로 -)

  • Seo, Hwanseok;Park, Donghwan;Yim, Jongsu;Lee, Jungsoo
    • Journal of Korean Society of Forest Science
    • /
    • v.101 no.4
    • /
    • pp.547-557
    • /
    • 2012
  • This study purposed to estimate the forest biomass using k-Nearest Neighbor (k-NN) algorithm. Multiple data sources were used for the analysis such as forest type map, field survey data and Landsat TM data. The accuracy of forest biomass was evaluated with the forest stratification, horizontal reference area (HRA) and spatial filtering. Forests were divided into 3 types such as conifers, broadleaved, and Korean pine (Pinus koriansis) forests. The applied radii of HRA were 4 km, 5 km and 10 km, respectively. The estimated biomass and mean bias for conifers forest was 222 t/ha and 1.8 t/ha when the value of k=8, the radius of HRA was 4 km, and $5{\times}5$ modal was filtered. The estimated forest biomass of Korean pine was 245 t/ha when the value of k=8, the radius of HRA was 4km. The estimated mean biomass and mean bias for broadleaved forests were 251 t/ha and -1.6 t/ha, respectively, when the value of k=6, the radius of HRA was 10 km. The estimated total forest biomass by k-NN method was 799,000t and 237 t/ha. The estimated mean biomass by ${\kappa}NN$method was about 1t/ha more than that of filed survey data.

Object Segmentation for Detection of Moths in the Pheromone Trap Images (페로몬 트랩 영상에서 해충 검출을 위한 객체 분할)

  • Kim, Tae-Woo;Cho, Tae-Kyung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.12
    • /
    • pp.157-163
    • /
    • 2017
  • The object segmentation approach has the merit of reducing the processing cost required to detect moths of interest, because it applies a moth detection algorithm to the segmented objects after segmenting the objects individually in the moth image. In this paper, an object segmentation method for moth detection in pheromone trap images is proposed. Our method consists of preprocessing, thresholding, morphological filtering, and object labeling processes. Thresholding in the process is a critical step significantly influencing the performance of object segmentation. The proposed method can threshold very elaborately by reflecting the local properties of the moth images. We performed thresholding using global and local versions of Ostu's method and, used the proposed method for the moth images of Carposina sasakii acquired on a pheromone trap placed in an orchard. It was demonstrated that the proposed method could reflect the properties of light and background on the moth images. Also, we performed object segmentation and moth classification for Carposina sasakii images, where the latter process used an SVM classifier with training and classification steps. In the experiments, the proposed method performed the detection of Carposina sasakii for 10 moth images and achieved an average detection rate of 95% of them. Therefore, it was shown that the proposed technique is an effective monitoring method of Carposina sasakii in an orchard.