• International Journal of Contents
• /
• v.9 no.4
• /
• pp.1-10
• /
• 2013

The electroencephalogram (EEG) time series is a measure of electrical activity received from multiple electrodes placed on the scalp of a human brain. It provides a direct measurement for characterizing the dynamic aspects of brain activities. These EEG signals are formed from a series of spatial and temporal data with multiple dimensions. Missing data could occur due to fault electrodes. These missing data can cause distortion, repudiation, and further, reduce the effectiveness of analyzing algorithms. Current methodologies for EEG analysis require a complete set of EEG data matrix as input. Therefore, an accurate and reliable imputation approach for missing values is necessary to avoid incomplete data sets for analyses and further improve the usage of performance techniques. This research proposes a new method to automatically recover random consecutive missing data from real world EEG data based on Linear Dynamical System. The proposed method aims to capture the optimal patterns based on two main characteristics in the coevolving EEG time series: namely, (i) dynamics via discovering temporal evolving behaviors, and (ii) correlations by identifying the relationships between multiple brain signals. From these exploits, the proposed method successfully identifies a few hidden variables and discovers their dynamics to impute missing values. The proposed method offers a robust and scalable approach with linear computation time over the size of sequences. A comparative study has been performed to assess the effectiveness of the proposed method against interpolation and missing values via Singular Value Decomposition (MSVD). The experimental simulations demonstrate that the proposed method provides better reconstruction performance up to 49% and 67% improvements over MSVD and interpolation approaches, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.1959-1975
• /
• 2011

Adaptive Bit Loading (ABL) in Multiple-Input Multiple-Output Orthogonal Frequency-Division Multiplexing (MIMO-OFDM) is often used to achieve the desired Bit Error Rate (BER) performance in wireless systems. In this paper, we discuss some of the bit loading algorithms, compare them in terms of the BER performance, and present an effective and concise Adaptive Grouped Loading (AGL) algorithm. Furthermore, we propose a "weight factor" for loading algorithm to converge rapidly to the final solution for various data rate with variable Signal to Noise Ratio (SNR) gaps. In particular, we consider the bit loading in near optimal Singular Value Decomposition (SVD) based MIMO-OFDM system. While using SVD based system, the system requires perfect Channel State Information (CSI) of channel transfer function at the transmitter. This scenario of SVD based system is taken as an ideal case for the comparison of loading algorithms and to show the actual enhancement achievable by our AGL algorithm. Irrespective of the CSI requirement imposed by the mode of the system itself, ABL demands high level of feedback. Grouped Loading (GL) would reduce the feedback requirement depending upon the group size. However, this also leads to considerable degradation in BER performance. In our AGL algorithm, groups are formed with a number of consecutive sub-channels belonging to the same transmit antenna, with individual gains satisfying predefined criteria. Simulation results show that the proposed "weight factor" leads a loading algorithm to rapid convergence for various data rates with variable SNR gap values and AGL requires much lesser CSI compared to GL for the same BER performance.

• Structural Engineering and Mechanics
• /
• v.27 no.5
• /
• pp.625-638
• /
• 2007

The damage detection process may appear difficult to be implemented for truss structures because not all degrees of freedom in the numerical model can be experimentally measured. In this context, the damage locating vector (DLV) method, introduced by Bernal (2002), is a useful approach because it is effective when operating with an arbitrary number of sensors, a truncated modal basis and multiple damage scenarios, while keeping the calculation in a low level. In addition, the present paper also evaluates the noise influence on the accuracy of the DLV method. In order to verify the DLV behavior under different damages intensities and, mainly, in presence of measurement noise, a parametric study had been carried out. Different excitations as well as damage scenarios are numerically tested in a continuous Warren truss structure subjected to five noise levels with a set of limited measurement sensors. Besides this, it is proposed another way to determine the damage locating vectors in the DLV procedure. The idea is to contribute with an alternative option to solve the problem with a more widespread algebraic method. The original formulation via singular value decomposition (SVD) is replaced by a common solution of an eigenvector-eigenvalue problem. The final results show that the DLV method, enhanced with the alternative solution proposed in this paper, was able to correctly locate the damaged bars, using an output-only system identification procedure, even considering small intensities of damage and moderate noise levels.

• Journal of Advanced Navigation Technology
• /
• v.20 no.3
• /
• pp.258-264
• /
• 2016

In this paper, we propose a computationally efficient direction of arrival (DoA) estimation algorithm based on propagator method with non-uniform array. While the co-prime array techniques can improve the resolution of DoA, they generally lead to high computational complexity as the length of the coarray aperture. To reduce the complexity we use the propagator method that does not require singular value decomposition (SVD). Through simulations, we compare MUSIC with uniform lineary array, propagator method with uniform linear array, MUSIC with co-prime array, and the proposed scheme and observe that the performance of the proposed scheme is significantly better than MUSIC or propagator method with uniform linear array while it is slightly worse than computationally much more expensive co-prime array MUSIC scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.383-388
• /
• 2005

Depth recovery in robot vision is an essential problem to infer the three dimensional geometry of scenes from a sequence of the two dimensional images. In the past, many studies have been proposed for the depth estimation such as stereopsis, motion parallax and blurring phenomena. Among cues for depth estimation, depth from lens translation is based on shape from motion by using feature points. This approach is derived from the correspondence of feature points detected in images and performs the depth estimation that uses information on the motion of feature points. The approaches using motion vectors suffer from the occlusion or missing part problem, and the image blur is ignored in the feature point detection. This paper presents a novel approach to the defocus technique based depth from lens translation using sequential SVD factorization. Solving such the problems requires modeling of mutual relationship between the light and optics until reaching the image plane. For this mutuality, we first discuss the optical properties of a camera system, because the image blur varies according to camera parameter settings. The camera system accounts for the camera model integrating a thin lens based camera model to explain the light and optical properties and a perspective projection camera model to explain the depth from lens translation. Then, depth from lens translation is proposed to use the feature points detected in edges of the image blur. The feature points contain the depth information derived from an amount of blur of width. The shape and motion can be estimated from the motion of feature points. This method uses the sequential SVD factorization to represent the orthogonal matrices that are singular value decomposition. Some experiments have been performed with a sequence of real and synthetic images comparing the presented method with the depth from lens translation. Experimental results have demonstrated the validity and shown the applicability of the proposed method to the depth estimation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1545-1550
• /
• 2006

In this paper, we propose a method for applying the CLEAN algorithm to an minimum variance distortionless response(MVDR) to estimate the location of multiple targets distributed in the ocean. The CLEAN algorithm is easy to implement in a linear processor, yet not in a nonlinear processor. In the proposed method, the CSDM of a Dirty map is separated into the CSDM of a Clean beam and the CSDM of the Residual, then an individual ambiguity surface(AMS) is generated. As such, the CLEAN algorithm can be applied to an MVDR, a nonlinear processor. To solve the ill-conditioned problem related to the matrix inversiion by an MVDR when using the CLEAN algorithm, Singular value decomposition(SVD) is carried out, then the reciprocal of small eigenvalues is replaced with zero. Experimental results show that the proposed method improves the performance of an MVDR.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.3
• /
• pp.9-16
• /
• 2004

This paper provides an observer-based Η$\infty$ output feedback controller design method for descriptor systems with time-varying delay by just one LMI(linear matrix inequality) condition. The sufficient condition for the existence of controller and the controller design method are presented by perfect LMI approach which can be solved efficiently by convex optimization. The design procedure involves solving an LMI. Since the obtained condition can be expressed as an LMI form all variables including feedback gain and observer gain can be calculated simultaneously by Schur complement changes of variables, and singular value decomposition. Moreover, The proposed controller design algorithm can be extended to the observer-based robust Η$\infty$ output feedback controller design method for descriptor systems with parameter uncertainty and time delay. An example is given to illustrate the results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.1-7
• /
• 2007

In this paper, we analyze geometrical relations of 3D shape reconstruction from 2D images taken under anne projection. The purpose of this research is to contribute to more accurate 3-D reconstruction under noise distribution by analyzing geometrically the 2D to 3D relationship. In situation for no missing feature points (FPs) or no noise in 2D image plane, the accurate solution of 3D shape reconstruction is blown to be provided by Singular Yalue Decomposition (SVD) factorization. However, if several FPs not been observed because of object occlusion and image low resolution, and so on, there is no simple solution. Moreover, the 3D shape reconstructed from noise-distributed FPs is peturbed because of the influence of the noise. This paper focuses on analysis of geometrical properties which can interpret the missing FPs even though the noise is distributed on other FPs.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.159-166
• /
• 2012

There are several ways such as GPS(Global Positioning System) and INS (Inertial Navigation System) to track the location of moving vehicle. The GPS has the advantages of having non-accumulative error even if it brings about errors. In order to obtain the position information, we need to receive at least 3 satellites information. But, the weak point is that GPS is not useful when the 혠 signal is weak or it is in the incommunicable region such as tunnel. In the case of INS, the information of the position and posture of mobile with several Hz~several hundreds Hz data speed is recorded for velocity, direction. INS shows a very precise navigational performance for a short period, but it has the disadvantage of increasing velocity components because of the accumulated error during integration over time. In this paper, sensor fusion algorithm is applied to both of INS and GPS for the position information to overcome the drawbacks. The proposed system gets an accurate position information from experiment using SVD in a non-accessible GPS terrain.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.44 no.1
• /
• pp.59-66
• /
• 2007

In this paper, we consider the non-fragile robust guaranteed cost state feedback controllers design method for descriptor systems with parameter uncertainties and static state feedback controller with multiplicative uncertainty. The sufficient condition of controller existence, the design method of non-fragile robust guaranteed cost controller, the measure of non-fragility in controller, the upper bound of guaranteed cost performance measure to minimize the guaranteed cost are presented via LMI(linear matrix inequality) technique. Also, the sufficient condition can be rewritten as LMI form in terms of transformed variables through singular value decomposition, some changes of variables, and Schur complements. Therefore, the obtained non-fragile robust guaranteed cost controller satisfies the asymptotic stability and minimizes the guaranteed cost for the closed loop descriptor systems with parameter uncertainties and controller fragility. Finally, a numerical example is given to illustrate the design method.