• International Journal of Aeronautical and Space Sciences
• /
• v.15 no.2
• /
• pp.183-189
• /
• 2014

Pseudo-spectral method typically converges at an exponential rate. However, it requires a special set of fixed collocation points (CPs) to get highly accurate formulas for partial integration and differentiation. In this study, computational nodes for defining the discrete variables of states and controls are built independently of the CPs. The state and control variables at each CP, which are required to transcribe an NOCP into the corresponding NLP, are interpolated, using those variables allocated at each node. Additionally, Lagrange interpolation and spline interpolation are investigated, to provide a guideline for selecting a favorable interpolation method. The proposed techniques are applied to the solution of an NOCP using equally spaced nodes, and the computed results are compared to those using the standard PS approach, to validate the usefulness of the proposed methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.12
• /
• pp.1253-1259
• /
• 2008

This paper presents a landing controller and guidance law for net-recovery of fixed-wing unmanned aerial vehicles. A linear quadratic controller was designed using the system identification result of the unmanned aerial vehicle. A pursuit guidance law is applied to guide the vehicle to a recovery net with imaginary landing points on the desired approach path. The landing performance of a pure pursuit guidance, a constant pseudo pursuit guidance, and a variable pseudo pursuit guidance is compared. Numerical simulation using an unmanned aerial vehicle model was performed to verify the performance of the proposed landing guidance law.

• Journal of Korean Society for Quality Management
• /
• v.32 no.1
• /
• pp.113-129
• /
• 2004

The reliability of the product can be improved by making the product less sensitive to noises. Especially, it Is important to make products robust against various noise factors encountered in production and field environments. In this paper, the phenomenon of degradation assumes a simple random coefficient degradation model to present analysis procedures of degradation data for robust experimental design. To alleviate weak points of previous studies, such as Taguchi's, Wasserman's, and pseudo failure time methods, novel techniques for analysis of degradation data using the cross array that regards amount of degradation as a dynamic characteristic for time are proposed. Analysis approach for degradation data using robust experimental design are classified by assumptions on parametric or nonparametric degradation rate(or slope). Also, a simulation study demonstrates the superiority of proposed methods over some previous works.

• Journal of Korea Multimedia Society
• /
• v.5 no.5
• /
• pp.599-607
• /
• 2002

The octree model, a hierarchical volume description of 3D objects, nay be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition and other applications. We present 2D projected image and made pseudo gray image of object using octree model and multi level boundary search algorithm. We present algorithm for finding feature points of 2D and 3D image and finding matched points using geometric transformation. The algorithm is made of data base, it will be widely applied to 3D object modeling and efficient feature points application for basic 3D object research.

• Korean Journal of Mathematics
• /
• v.18 no.4
• /
• pp.441-464
• /
• 2010

In this paper, we introduce an iterative method for finding common elements of the set of solutions to a general system of variational inequalities for inverse-strongly accretive mappings and of the set of fixed points of strict pseudo-contractions in a real Banach space. The results presented in this paper mainly improve and extend the corresponding results announced by many others.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.42.6-42
• /
• 2002

Kohonen's self organizing feature map (SOFM) converts arbitrary dimensional patterns into one or two dimensional arrays of nodes. Among the many competitive learning algorithms, SOFM proposed by Kohonen is considered to be powerful in the sense that it not only clusters the input pattern adaptively but also organize the output node topologically. SOFM is usually used for a preprocessor or cluster. It can perform dimensional reduction of input patterns and obtain a topology-preserving map that preserves neighborhood relations of the input patterns. The traditional SOFM algorithm[1] is a competitive learning neural network that maps inputs to discrete points that are called nodes on a lattice...

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.715-723
• /
• 2009

The aim of this paper is to present an explicit iteration method for finding a common fixed point of a finite family of strictly pseudocon-tractive mappings defined on q-uniformly smooth and uniformly convex Banach spaces.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.406-408
• /
• 2001

기본적인 투영기법인 평행투영, 원근투영 기법과 Octree 모델을 사용하여 임의의 시각방향에서 모델의 2차원 투영영상을 생성하고 노드표면을 시각방향으로 평행 투영하여 이들 벡터의 곱의 절대값을 사용하여 2차원 투영영상을 Pseudo gray로 표현해 본다. 또한 평행투영과 원근투영 하에서 2차원상의 모델에서 3차원 모델의 특징점을 찾을 수 있는 기법을 제안하고 두 개의 모델 영상에 적용해 증명해 보았다. 이 기법은 3차원 물체 인식에 중요한 정보로 유용하게 사용 될 수 있다.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.315-321
• /
• 2004

SAR 영상을 처리하는 과정에 있어 기준점을 취득하는 일은 매우 어렵고 시간과 비용이 많이 소모된다. 본 연구에서는 기준점 취득문제를 해결하기 위해서 단일기준점으로부터 가상기준점을 생성하여 위성제도를 모델링하고 이를 이용하여 수치고도모형을 생성하는 기법을 제시하였다. 가상기준점을 이용하여 생성된 수치고도모형의 정확도를 평가하기 위해서 추가적으로 10개의 기준점을 이용하여 수치고도모형을 생성하였다. 각각 생성된 수치고도모형을 수치지도로부터 생성된 수치고도모형과 비교하여 정확도를 평가하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1676-1689
• /
• 2014

At present, the Content-Based Image Retrieval (CBIR) system has become a hot research topic in the computer vision field. In the CBIR system, the accurate extractions of low-level features can reduce the gaps between high-level semantics and improve retrieval precision. This paper puts forward a new retrieval method aiming at the problems of high computational complexities and low precision of global feature extraction algorithms. The establishment of the new retrieval method is on the basis of the SIFT and Harris (APISH) algorithm, and the salient region of interest points (SRIP) algorithm to satisfy users' interests in the specific targets of images. In the first place, by using the IPDSH and SRIP algorithms, we tested stable interest points and found salient regions. The interest points in the salient region were named as salient interest points. Secondary, we extracted the pseudo-Zernike moments of the salient interest points' neighborhood as the feature vectors. Finally, we calculated the similarities between query and database images. Finally, We conducted this experiment based on the Caltech-101 database. By studying the experiment, the results have shown that this new retrieval method can decrease the interference of unstable interest points in the regions of non-interests and improve the ratios of accuracy and recall.