• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2141-2155
• /
• 2020

In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

• Wind and Structures
• /
• v.11 no.3
• /
• pp.209-220
• /
• 2008

Flutter derivatives provide the basis of predicting the critical wind speed in flutter and buffeting analysis of long-span cable-supported bridges. Many studies have been performed on the methods and applications of identification of flutter derivatives of bridge decks under wind action. In fact, strong wind, especially typhoon, is always accompanied by heavy rain. Then, what is the effect of rain on flutter derivatives and flutter critical wind speed of bridges? Unfortunately, there have been no studies on this subject. This paper makes an initial study on this problem. Covariance-driven Stochastic Subspace Identification (SSI in short) which is capable of estimating the flutter derivatives of bridge decks from their steady random responses is presented first. An experimental set-up is specially designed and manufactured to produce the conditions of rain and wind. Wind tunnel tests of a quasi-streamlined thin plate model are conducted under conditions of only wind action and simultaneous wind-rain action, respectively. The flutter derivatives are then extracted by the SSI method, and comparisons are made between the flutter derivatives under the two different conditions. The comparison results tentatively indicate that rain has non-trivial effects on flutter derivatives, especially on and $H_2$ and $A_2$thus the flutter critical wind speeds of bridges.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.357-357
• /
• 2000

In this study, we consider a multi-input multi-output styrene polymerization reactor system for which the monomer conversion and the weight average molecular weight are controlled by manipulating the jacket inlet temperature and the feed flow rate. The reactor system is identified by using a linear subspace identification method and then the output feedback model predictive controller is constructed on the basis of the identified model. Here we use the Best Linear Unbiased Estimation (BLUE) filter as a stochastic estimator instead of the Kalman filter. The BLUE filter observes the state successfully without any a priori information of initial states. In contrast to the Kalman filter, the BLUE filter eliminates the offset by observing the state of the augmented system regardless of a priori information of the initial state for an integral white noise augmented system. A BLUE filter has a finite impulse response (FIR) structure which utilizes finite measurements and inputs on the most recent time interval [i-N, i] in order to avoid long processing times.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.3
• /
• pp.35-46
• /
• 2013

In order to develop an accurate analytical model for domestic electricity demand forecasting, we propose a prediction method of the electric power demand pattern by combining SMO classification techniques and a dimension reduction conceptualized subspace clustering techniques suitable for high-dimensional data cluster analysis. In terms of electricity demand pattern prediction, hourly electricity load patterns and the demographic and geographic characteristics can be analyzed by integrating the wireless load monitoring data as well as sub-regional unit of census information. There are composed of a total of 18 characteristics clusters in the prediction result for the sub-regional demand pattern by using census information and power load of Seoul metropolitan area. The power demand pattern prediction accuracy was approximately 85%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.813-829
• /
• 2022

In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches.

• Korean Journal of Remote Sensing
• /
• v.33 no.5_1
• /
• pp.547-557
• /
• 2017

In this paper, a new spectral unmixing based target detection algorithm is proposed which adopted Iterative Error Analysis as a tool for extraction of background endmembers by using the target spectrum to be detected as initial endmember. In the presented method, the number of background endmembers is automatically decided during the IEA by stopping the iteration when the maximum change in abundance of the target is less than a given threshold value. The proposed algorithm does not have the dependence on the selection of image endmembers in the model-based approaches such as Orthogonal Subspace Projection and the target influence on the background statistics in the stochastic approaches such as Matched Filter. The experimental result with hyperspectral image data where various real and simulated targets are implanted shows that the proposed method is very effective for the detection of both rare and non-rare targets. It is expected that the proposed method can be effectively used for mineral detection and mapping as well as target object detection.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.9
• /
• pp.933-941
• /
• 2014

This paper provides a comparison between the Krylov subspace method (KSM) and modal truncation method (MTM), which are typical projection-based model order reduction methods. The frequency responses are compared to determine the numerical accuracies and efficiencies. In order to compare the numerical accuracies of the KSM and MTM, the frequency responses and relative errors according to the order of the reduced model and frequency of interest are studied. Subsequently, a numerical examination shows whether a reduced order can be determined automatically with the help of an error convergence indicator. As for the numerical efficiency, the computation time needed to generate the projection matrix and the solution time to perform a frequency response analysis are compared according to the reduced order. A finite element model for a car suspension is considered as an application example of the numerical comparison.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2179-2188
• /
• 2015

Recently, many researches have been done to solve the challenging problem of Blind Source Separation (BSS) problems in the underdetermined cases, and the “Two-step” method is widely used, which estimates the mixing matrix first and then extracts the sources. To estimate the mixing matrix, conventional algorithms such as Single-Source-Points (SSPs) detection only exploits the sparsity of original signals. This paper proposes a new underdetermined mixing matrix estimation method for time-delayed mixtures based on the receiver prior exploitation. The prior information is extracted from the specific structure of the complex-valued mixing matrix, which is used to derive a special criterion to determine the SSPs. Moreover, after selecting the SSPs, Agglomerative Hierarchical Clustering (AHC) is used to automaticly cluster, suppress, and estimate all the elements of mixing matrix. Finally, a convex-model based subspace method is applied for signal separation. Simulation results show that the proposed algorithm can estimate the mixing matrix and extract the original source signals with higher accuracy especially in low SNR environments, and does not need the number of sources before hand, which is more reliable in the real non-cooperative environment.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.5
• /
• pp.7-12
• /
• 2011

In this papwer, we propose a new feature extraction method, named as Class-augmented Kernel Principal Component Analysis (CA-KPCA), which can extract nonlinear features for classification. Among the subspace method that was being widely used for feature extraction, Class-augmented Principal Component Analysis (CA-PCA) is a recently one that can extract features for a accurate classification without computational difficulties of other methods such as Linear Discriminant Analysis (LDA). However, the features extracted by CA-PCA is still restricted to be in a linear subspace of the original data space, which limites the use of this method for various problems requiring nonlinear features. To resolve this limitation, we apply a kernel trick to develop a new version of CA-PCA to extract nonlinear features, and evaluate its performance by experiments using data sets in the UCI Machine Learning Repository.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.560-570
• /
• 2013

In this paper, we propose transceiver design strategies for the two-cell multiple-input multiple-output (MIMO) interfering broadcast channel where inter-cell interference (ICI) exists in addition to inter-user interference (IUI). We first formulate the generalized zero-forcing interference alignment (ZF-IA) method based on the alignment of IUI and ICI in multi-dimensional subspace. We then devise a minimum weighted-mean-square-error (WMSE) method based on "regularizing" the precoders and decoders of the generalized ZF-IA scheme. In contrast to the existing weighted-sum-rate-maximizing transceiver, our method does not require an iterative calculation of the optimal weights. Because of this, the proposed scheme, while not designed specially to maximize the sum-rate, is computationally efficient and achieves a faster convergence compared to the known weighed-sum-rate maximizing scheme. Through analysis and simulation, we show the effectiveness of the proposed regularized ZF-IA scheme.