• Journal of Digital Contents Society
• /
• v.16 no.4
• /
• pp.575-581
• /
• 2015

This paper presents the development of certain highly efficient and accurate method for computing tangent curves for three-dimensional vector fields. Unlike conventional methods, such as Runge-Kutta method, for computing tangent curves which produce only approximations, the method developed herein produces exact values on the tangent curves based upon piecewise linear variation over a tetrahedral domain in 3D. This new method assumes that the vector field is piecewise linearly defined over a tetrahedron in 3D domain. It is also required to decompose the hexahedral cell into five or six tetrahedral cells for three-dimensional vector fields. The critical points can be easily found by solving a simple linear system for each tetrahedron. This method is to find exit points by producing a sequence of points on the curve with the computation of each subsequent point based on the previous. Because points on the tangent curves are calculated by the explicit solution for each tetrahedron, this new method provides correct topology in visualizing 3D vector fields.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.619-622
• /
• 2001

In this paper, an efficient approach to classification of transient and harmonic disturbances in power systems is proposed. First, the Stop-and-Go CA CFAR Detector is utilized to detect a disturbance from the power signals which are mixed with other disturbances and noise. Then, (i) Wigner Distribution, SVD(Singular Value Decomposition) and Fisher´s Criterion (ii) DWT and Fisher´s Criterion, are applied to extract an efficient feature vector. For the classification procedure, a combined neural network classifier is proposed to classify each corresponding disturbance class. Finally, the 10 class data simulated by Matlab power system blockset are used to demonstrate the performance of the proposed classification system.

• Smart Structures and Systems
• /
• v.10 no.4_5
• /
• pp.393-410
• /
• 2012

The 610 m high Canton Tower (formerly named Guangzhou New Television Tower) is currently considered as a benchmark problem for structural health monitoring (SHM) of high-rise slender structures. In the benchmark study task I, a set of 24-hour ambient vibration measurement data has been available for the output-only system identification study. In this paper, the vector autoregressive models (ARV) method is adopted in the operational modal analysis (OMA) for this TV tower. The identified natural frequencies, damping ratios and mode shapes are presented and compared with the available results from some other research groups which used different methods, e.g., the data-driven stochastic subspace identification (SSI-DATA) method, the enhanced frequency domain decomposition (EFDD) algorithm, and an improved modal identification method based on NExT-ERA technique. Furthermore, the environmental effects on the estimated modal parameters are also discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.387-389
• /
• 2012

초분광영상은 사람이 볼 있는 가시광선 영역부터 자외선 파장 대역까지 수십에서 수천 개의 데이터를 가지고 있는 고차원 데이터이다. 그렇기 때문에 초분광영상을 이용한 연구에는 많은 저장 공간과 고사양의 성능을 필요로 한다. 따라서 초분광영상의 차원을 감소시켜 데이터용량을 줄이고, 처리속도를 향상시키기 위한 연구들이 이루어지고 있다. 기존에 자주 사용되던 방법인 PCA와 ICA는 차원축소를 위하여 고유벡터를 계산하고 이를 이용하여 축을 변경하여 차원축소를 한다. 하지만 초분광영상에서는 이러한 방법으로 차원을 축소할 시 정확도가 감소한다. 따라서 본 논문에서는 특징 밴드를 추출하고 이를 이용하여 차원축소를 하는 SPVD 알고리즘을 제안한다. SPVD(Spectral pair vector decomposition) 알고리즘은 d개의 그룹으로 나누고 각 그룹들의 양벡터 각과 음벡터 각을 계산한 후 이를 이용하여 차원축소를 한다. 실험 결과 PCA는 61차원에서 70.05%, ICA는 71차원에서 63.03% 정확도를 보이는데 비해 SPVD 알고리즘은 3차원에서 83% 정확도를 보였다.

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

변화탐지를 위하여 기존에 사용하던 화소차 혹은 화소비 변화탐지 기법은 단밴드의 영상을 사용하므로 다중분광 자료를 활용하기 어렵고 변화지역의 유형을 추출하는데 적절하지 못하다는 단점이 있다. 후분류 변화탐지 기법은 다중분팡 영상의 활용이 가능하고 변화지역의 변화 유형을 파악할 수 있지만 변화탐지 성과가 분류 결과의 정확도에 의해 크게 영향을 받는다. 이에 반해 CVA(Change Vector Analysis) 변화탐지는 여러 밴드의 다중분광 영상을 이용하여 변화지역을 탐지할 뿐 아니라 피복 변화의 경향을 파악할 수 있어 보다 효율적인 기법으로 평가받고 있다. 기본적인 CVA 변화탐지는 일반적으로 다중분광 영상의 red 밴드와 infrared 밴드의 영상을 조합하여 변화탐지를 수행하여 식생 및 인공물의 변화를 탐지한다. 본 연구에서는 단순한 red/NIR 밴드간의 조합 외에 식생의 특성을 계수로 변환하는 PDA(Pattern Decomposition Analysis) 변환 및 Tasseled Cap 변환 결과를 이용한 CVA 변화탐지를 수행하고 각 결과의 정확도를 비교하여 보다 효율적인 식생 변화탐지 기법을 제안하고자 하였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.15-24
• /
• 2009

Compressed sensing addresses the recovery of a sparse vector from its few linear measurements. Recently, the success for the vector case has been extended to the matrix case. Compressed sensing of low-rank matrices solves the ill-posed inverse problem with fie low-rank prior. The problem can be formulated as either the rank minimization or the low-rank approximation. In this paper, we survey recently proposed efficient algorithms to solve these two formulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.469-480
• /
• 1997

For moving image coding, the variable size of region coding based on local motion is more efficient than fixed size of region coding. It can be applied well to complex motions and is more stable for wide motions because images are segmented according to local motions. In this paper, new image coding method using the segmentation of motion vectors is proposed. First, motion vector field is smoothed by filtering and segmented by smoothed motion vectors. The region growing method is used for decomposition of regions, and merging of regions is decided by motion vector and prediction errors of the region. Edge of regions is excluded because of the correlation of image, and neighbor motion vectors are used evaluation of current block and construction of region. The results of computer simulation show the proposed method is superior than the existing methods in aspect of coding efficiency.

• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.85-89
• /
• 2010

This paper proposes a new QRD-LS adaptive algorithm with computational complexity of O(N). The main idea of proposed algorithm(D-QR-RLS) is based on the fact that the computation for the unit vector of is made from the process during Givens Rotation. The performance of the algorithm is evaluated through computer simulation of FIR system identification problem. As verified by simulation results, this algorithm exhibits a good performance. And, we can see the proposed algorithm converges to optimal coefficient vector theoretically.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.03a
• /
• pp.97-104
• /
• 2008

Most of engine control systems for helicopter turboshaft engines are equipped with dual sensors. For the system with dual redundancy, analytic methods are used to detect faults based on the system dynamical model. Helicopter engine dynamics are affected by aerodynamic torque induced from the dynamics of the main rotor. In this paper an engine model including the rotor dynamics is constructed for the T700-GE-700 turboshaft engine powering UH-60 helicopter. The singular value decomposition(SVD) method is applied to the developed model in order to detect sensor faults. The SVD method which do not need an additional computation to generate residual uses the characteristics that the system outputs in direction of the left singular vector if an input is applied in direction of the right singular vector. Simulations show that the SVD method works well in detecting and isolating the sensor faults.

• Kyungpook Mathematical Journal
• /
• v.57 no.4
• /
• pp.601-612
• /
• 2017

Let Q be the frame g-loop quiver, i.e. a generalized ADHM quiver obtained by replacing the two loops into g loops. The vector space M of representations of Q admits an involution ${\ast}$ if orthogonal and symplectic structures on the representation spaces are endowed. We prove equivalence between semisimplicity of representations of the ${\ast}-invariant$ subspace N of M and the orbit-closedness with respect to the natural adjoint action on N. We also explain this equivalence in terms of King's stability [8] and orthogonal decomposition of representations.