• Journal of the Korean Society of Industry Convergence
• /
• v.6 no.1
• /
• pp.23-29
• /
• 2003

This paper proposes an efficient feature extraction of the images by using independent component analysis(ICA) based on neural networks of the hybrid learning algorithm. The proposed learning algorithm is the fixed point(FP) algorithm based on Newton method and moment. The Newton method, which uses to the tangent line for estimating the root of function, is applied for fast updating the inverse mixing matrix. The moment is also applied for getting the better speed-up by restraining an oscillation due to compute the tangent line. The proposed algorithm has been applied to the 10,000 image patches of $12{\times}12$-pixel that are extracted from 13 natural images. The 144 features of $12{\times}12$-pixel and the 160 features of $16{\times}16$-pixel have been extracted from all patches, respectively. The simulation results show that the extracted features have a localized characteristics being included in the images in space, as well as in frequency and orientation. And the proposed algorithm has better performances of the learning speed than those using the conventional FP algorithm based on Newton method.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.221-228
• /
• 2013

The method of upper and lower solutions and the generalized quasilinearization technique is developed for the existence and approximation of solutions to boundary value problems for higher order fractional differential equations of the type $^c\mathcal{D}^qu(t)+f(t,u(t))=0$, $t{\in}(0,1),q{\in}(n-1,n],n{\geq}2$ $u^{\prime}(0)=0,u^{\prime\prime}(0)=0,{\ldots},u^{n-1}(0)=0,u(1)={\xi}u({\eta})$, where ${\xi},{\eta}{\in}(0,1)$, the nonlinear function f is assumed to be continuous and $^c\mathcal{D}^q$ is the fractional derivative in the sense of Caputo. Existence of solution is established via the upper and lower solutions method and approximation of solutions uses the generalized quasilinearization technique.

• The Korean Journal of Applied Statistics
• /
• v.1 no.1
• /
• pp.57-67
• /
• 1987

In time series analysis, we usually require the assumption that time series are stationary. But we may often encounter time series whose parameter values subject to change. Inthis paper w propose a method which can detect the variance change point in anAR(1) model which is subjct to changesat non-predictable time points. Proposed method is compared with other methods using the simulated and real data.

• Korean Journal of Remote Sensing
• /
• v.30 no.6
• /
• pp.817-827
• /
• 2014

In the satellite remote sensing, the operational environment of the satellite sensor causes image degradation during the image acquisition. The degradation results in noise and blurring which badly affect identification and extraction of useful information in image data. This study proposes a maximum a posteriori (MAP) estimation using Point-Jacobian iteration to restore a degraded image. The proposed method assumes a Gaussian additive noise and Markov random field of spatial continuity. The proposed method employs a neighbor window of spoke type which is composed of 8 line windows at the 8 directions, and a boundary adjacency measure of Mahalanobis square distance between center and neighbor pixels. For the evaluation of the proposed method, a pixel-wise classification was used for simulation data using various patterns similar to the structure exhibited in high resolution imagery and an unsupervised segmentation for the remotely-sensed image data of 1 mspatial resolution observed over the north area of Anyang in Korean peninsula. The experimental results imply that it can improve analytical accuracy in the application of remote sensing high resolution imagery.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.1 no.1
• /
• pp.83-90
• /
• 2000

DEA is a newly developed analyzing tool to measure efficiency evaluation of decision making units (DMU). It compares DMU by radial Projection on the efficient frontier. The purpose of this study is to show reference point approach used for searching solution in multiple objective linear Programming can be usefully used to determine flexible efficient frontier of each DMU In reference point approach, the minimization of ASF Produces an efficient points in frontier and enhances the usefulness of DEA by Providing flexibility in DEA and optimally allocating resources to DMU. Various DEA models can be supported by reference point method by changing the projection direction in order to choose the targets units, standards costs and management benching-marking.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.4 no.1
• /
• pp.27-35
• /
• 1986

Following results about Y,M,C Mask are obtained by the Indirect-Screen Color Separation Method. We make use of experimental system which are in use for the student education. In the Camera-Back Method of reflection copy, the results are summerized as follows.

• Korean Journal of Mathematics
• /
• v.20 no.1
• /
• pp.77-89
• /
• 2012

Using fixed point method, we prove the Hyers-Ulam stability of the orthogonally additive functional equation (0.1) $f(2x+y)=2f(x)+f(y)$ and of the orthogonally quadratic functional equation (0.2) $2f(\frac{x}{2}+y)+2f(\frac{x}{2}-y)=f(x)+4f(y)$ for all $x$, $y$ with $x{\perp}y$ in orthogonality spaces.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.143-162
• /
• 1999

In this paper we consider the second order generalized difference scheme for the two-point boundary value problem and ob-tain optimal order error estimates in $L^\infty$ and $W^{1,\infty}$ The results in this paper perfect the theory of the second order generalized difference method.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.10-17
• /
• 2009

Surface detection and parameter estimation in point cloud is a relevant subject in CAD/CAM, reverse engineering, computer vision, coordinate metrology and digital factory. In this paper we present a software for a fully automatic surface detection and parameter estimation in unordered, incomplete and error-contaminated point cloud with a large number of data points. The software consists of three algorithmic modules each for object identification, point segmentation, and model fitting, which work interactively. Our newly developed algorithms for orthogonal distance fitting(ODF) play a fundamental role in each of the three modules. The ODF algorithms estimate the model parameters by minimizing the square sum of the shortest distances between the model feature and the measurement points. We demonstrate the performance of the software on a variety of point clouds generated by laser radar, computer tomography, and stripe-projection method.