• International journal of advanced smart convergence
• /
• 제6권4호
• /
• pp.67-72
• /
• 2017

Deep learning neural network becomes very popular nowadays due to the reason that it can learn a very complex dataset such as the image dataset. Although deep learning neural network can produce high accuracy on the image dataset, it needs a lot of time to reach the convergence stage. To solve the issue, we have proposed a scaling method to improve the neural network to achieve the convergence stage in a shorter time than the original method. From the result, we can observe that our algorithm has higher performance than the other previous work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권2호
• /
• pp.693-709
• /
• 2018

In this paper, we propose a compact Convolutional Neural Network (CNN)-based tracker in conjunction with a particle filter architecture, in which the CNN model operates as an accurate candidates estimator, while the particle filter predicts the target motion dynamics, lowering the overall number of calculations and refines the resulting target bounding box. Experiments were conducted on the Online Object Tracking Benchmark (OTB) [34] dataset and comparison analysis in respect to other state-of-art has been performed based on accuracy and precision, indicating that the proposed algorithm outperforms all state-of-the-art trackers included in the OTB dataset, specifically, TLD [16], MIL [1], SCM [36] and ASLA [15]. Also, a comprehensive speed performance analysis showed average frames per second (FPS) among the top-10 trackers from the OTB dataset [34].

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.18-21
• /
• 2005

The impact of the interannual climatic variability on the vegetation sensitively appears in the timing of phenological events such as green-up, mature, and senescence. Therefore, an accurate and temporally high-resolution NDVI dataset will be required for analysis on the interannual variability of the climate-vegetation relationship. We constructed a daily 8km NDVI dataset over Eurasia based on the 8km tiled data of Pathfinder A VHRR Land (PAL) Global daily product. Cloud contamination was successfully reduced by Temporal Window Operation (TWO), which is a method to find optimized upper envelop line of the NDVI seasonal change. Based on the daily NDVI time series from 1982 to 2000, an accurate (daily) interannual change of the phenological events will be analyzed.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2004년도 The 3rd Annual Conference for The Korean Society for Bioinformatics Association of Asian Societies for Bioinformatics 2004 Symposium
• /
• pp.279-285
• /
• 2004

In the disease association study, the tagSNP selection problem is important at the view of time and cost. We developed the new tagSNP selection system that has also facilities for the haplotype reconstruction and missing data processing. In our system, we improved biological meanings using LD coefficients as well as dynamic programming method. And our system has capability of processing large -scale dataset, such as the total SNPs on a chromosome. We have tested our system with various dataset from daly et al., patil et al., HapMap Project, artificial dataset, and so on.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권10호
• /
• pp.571-576
• /
• 2003

XML Web Service based on internet can cause problems on transmission speed and data error. Also system analysis results simulated by several different research groups can hardly have reliability because of error data that come from improperly managed files. In order to solve this problems, algorithm sever using XML Web Service is shared on the internet so widely that various application programs based on basic analysis module with a united IO can be developed. And also XML Dataset DB is interacted with XML Web Service, which prevents propagation of error data. It causes to improve reliabilityon the load flow analysis result and solve the problems on data error or transmission speed that can possibly come from internet.

• 대한의용생체공학회:의공학회지
• /
• 제41권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.

• 한국컴퓨터정보학회논문지
• /
• 제21권11호
• /
• pp.121-126
• /
• 2016

In recommender systems based on collaborative filtering, measuring similarity is very critical for determining the range of recommenders. Data sparsity problem is fundamental in collaborative filtering systems, which is partly solved by Jaccard coefficient combined with traditional similarity measures. This study proposes a new coefficient for improving performance of Jaccard coefficient by compensating for its drawbacks. We conducted experiments using datasets of various characteristics for performance analysis. As a result of comparison between the proposed and the similarity metric of Pearson correlation widely used up to date, it is found that the two metrics yielded competitive performance on a dense dataset while the proposed showed much better performance on a sparser dataset. Also, the result of comparing the proposed with Jaccard coefficient showed that the proposed yielded far better performance as the dataset is denser. Overall, the proposed coefficient demonstrated the best prediction and recommendation performance among the experimented metrics.

• 로봇학회논문지
• /
• 제1권1호
• /
• pp.66-72
• /
• 2006

In face recognition, learning speed of face is very important since the system should be trained again whenever the size of dataset increases. In existing methods, training time increases rapidly with the increase of data, which leads to the difficulty of training with a large dataset. To overcome this problem, we propose SVDD (Support Vector Domain Description)-based learning method that can learn a dataset of face rapidly and incrementally. In experimental results, we show that the training speed of the proposed method is much faster than those of other methods. Moreover, it is shown that our face recognition system can improve the accuracy gradually by learning faces incrementally at real environments with illumination changes.

• 한국멀티미디어학회논문지
• /
• 제22권10호
• /
• pp.1133-1141
• /
• 2019

Most of the previous studies for bark recognition have focused on the extraction of LBP-like statistical features. Deep learning approach was not well studied because of the difficulty of acquiring large volume of bark image dataset. To overcome the bark dataset problem, this study utilizes the MobileNet which was trained with the ImageNet dataset. This study proposes two approaches. One is to extract features by the pixel-wise convolution and classify the features with SVM. The other is to tune the weights of the MobileNet by flexibly freezing layers. The experimental results with two public bark datasets, BarkTex and Trunk12, show that the proposed methods are effective in bark recognition. Especially the results of the flexible tunning method outperform state-of-the-art methods. In addition, it can be applied to mobile devices because the MobileNet is compact compared to other deep learning models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.832-854
• /
• 2019

Action recognition has been studied in computer vision field for years. We present an effective approach to recognize actions using a dimension reduction method, which is applied as a crucial step to reduce the dimensionality of feature descriptors after extracting features. We propose to use sparse matrix and randomized kd-tree to modify it and then propose modified Local Fisher Discriminant Analysis (mLFDA) method which greatly reduces the required memory and accelerate the standard Local Fisher Discriminant Analysis. For feature encoding, we propose a useful encoding method called mix encoding which combines Fisher vector encoding and locality-constrained linear coding to get the final video representations. In order to add more meaningful features to the process of action recognition, the convolutional neural network is utilized and combined with mix encoding to produce the deep network feature. Experimental results show that our algorithm is a competitive method on KTH dataset, HMDB51 dataset and UCF101 dataset when combining all these methods.