• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.655-669
• /
• 2010

In this paper we propose new primal-dual interior point methods (IPMs) for $P_*(\kappa)$ linear complementarity problems (LCPs) and analyze the iteration complexity of the algorithm. New search directions and proximity measures are defined based on a class of kernel functions, $\psi(t)=\frac{t^2-1}{2}-{\int}^t_1e{^{q(\frac{1}{\xi}-1)}d{\xi}$, $q\;{\geq}\;1$. If a strictly feasible starting point is available and the parameter $q\;=\;\log\;\(1+a{\sqrt{\frac{2{\tau}+2{\sqrt{2n{\tau}}+{\theta}n}}{1-{\theta}}\)$, where $a\;=\;1\;+\;\frac{1}{\sqrt{1+2{\kappa}}}$, then new large-update primal-dual interior point algorithms have $O((1\;+\;2{\kappa})\sqrt{n}log\;n\;log\;{\frac{n}{\varepsilon}})$ iteration complexity which is the best known result for this method. For small-update methods, we have $O((1\;+\;2{\kappa})q{\sqrt{qn}}log\;{\frac{n}{\varepsilon}})$ iteration complexity.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.1
• /
• pp.37-48
• /
• 2011

Sensor networks monitor the environment, collect sensed data, and relay the data back to a collection point. Although sensor nodes have very limited hardware resources, they require an operating system that can provide efficient resource management and various application environments. In addition, the wireless sensor networks require the code update previously deployed to patch bugs in program and to improve performance of kernel service routines and application programs. This paper presents EPRCU (Easy to Perform Remote Code Update), a new operating system for wireless sensor nodes, which has enhanced functionalities to perform remote code update. To achieve an efficient code update, the EPRCU provides dynamic memory allocation and program memory management. It supports the event-driven kernel, which uses priority-based scheduling with the application of aging techniques. Therefore, the proposed operating system is not only easy to perform wireless communication with the remote code update but also suitable for various sensor network applications.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.235-249
• /
• 2013

It is well known that each kernel function defines primal-dual interior-point method (IPM). Most of polynomial-time interior-point algorithms for linear optimization (LO) are based on the logarithmic kernel function ([9]). In this paper we define new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has $\mathcal{O}(({\log}\;p)^{\frac{5}{2}}\sqrt{n}{\log}\;n\;{\log}\frac{n}{\epsilon})$ and $\mathcal{O}(q^{\frac{3}{2}}({\log}\;p)^3\sqrt{n}{\log}\;\frac{n}{\epsilon})$ iteration complexity for large- and small-update methods, respectively. These are currently the best known complexity results for such methods.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.345-354
• /
• 2003

An incremental kernel principal component analysis(IKPCA) is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis(KPCA) is that the computation becomes prohibitive when the data set is large. Another problem is that, in order to update the eigenvectors with another data, the whole eigenvectors should be recomputed. IKPCA overcomes this problem by incrementally updating the eigenspace model. IKPCA is more efficient in memory requirement than a batch KPCA and can be easily improved by re-learning the data. In our experiments we show that IKPCA is comparable in performance to a batch KPCA for the classification problem on nonlinear data set.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.279-292
• /
• 2013

It is well known that each kernel function defines a primal-dual interior-point method(IPM). Most of polynomial-time interior-point algorithms for linear optimization(LO) are based on the logarithmic kernel function([2, 11]). In this paper we define a new eligible kernel function and propose a new search direction and proximity function based on this function for LO problems. We show that the new algorithm has ${\mathcal{O}}((log\;p){\sqrt{n}}\;log\;n\;log\;{\frac{n}{\epsilon}})$ and ${\mathcal{O}}((q\;log\;p)^{\frac{3}{2}}{\sqrt{n}}\;log\;{\frac{n}{\epsilon}})$ iteration bound for large- and small-update methods, respectively. These are currently the best known complexity results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1377-1389
• /
• 2016

This paper presents a target model update scheme for the mean-shift tracking with background weighted histogram. In the scheme, the target candidate histogram is corrected by considering the back-projection weight of each pixel in the kernel after the best target candidate in the current frame image is chosen. In each frame, the target model is updated by the weighted average of the current target model and the corrected target candidate. We compared our target model update scheme with the previous ones by applying several test sequences. The experimental results showed that the object tracking accuracy was greatly improved by using the proposed scheme.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.361-368
• /
• 2004

The purpose of this study is to propose a new on-line nonlinear PCA(OL-NPCA) method for a nonlinear feature extraction from the incremental data. Kernel PCA(KPCA) is widely used for nonlinear feature extraction, however, it has been pointed out that KPCA has the following problems. First, applying KPCA to N patterns requires storing and finding the eigenvectors of a N${\times}$N kernel matrix, which is infeasible for a large number of data N. Second problem is that in order to update the eigenvectors with an another data, the whole eigenspace should be recomputed. OL-NPCA overcomes these problems by incremental eigenspace update method with a feature mapping function. According to the experimental results, which comes from applying OL-NPCA to a toy and a large data problem, OL-NPCA shows following advantages. First, OL-NPCA is more efficient in memory requirement than KPCA. Second advantage is that OL-NPCA is comparable in performance to KPCA. Furthermore, performance of OL-NPCA can be easily improved by re-learning the data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.244-245
• /
• 2007

• ETRI Journal
• /
• v.38 no.3
• /
• pp.579-588
• /
• 2016

To improve the ability to determine a vehicle's movement information even in a challenging environment, a hybrid approach called non-Gaussian square rootunscented particle filtering (nGSR-UPF) is presented. This approach combines a square root-unscented Kalman filter (SR-UKF) and a particle filter (PF) to determinate the vehicle state where measurement noises are taken as a finite Gaussian kernel mixture and are approximated using a sparse Gaussian kernel density estimation method. During an outage-free GPS period, the updated mean and covariance, computed using SR-UKF, are estimated based on a GPS observation update. During a complete GPS outage, nGSR-UPF operates in prediction mode. Indeed, because the inertial sensors used suffer from a large drift in this case, SR-UKF-based importance density is then responsible for shifting the weighted particles toward the high-likelihood regions to improve the accuracy of the vehicle state. The proposed method is compared with some existing estimation methods and the experiment results prove that nGSR-UPF is the most accurate during both outage-free and complete-outage GPS periods.