• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1149-1155
• /
• 2007

In this paper, we propose a new overlap and add speech synthesis method which demonstrates improved continuity performance. The proposed method uses a weighted phase error function and minimizes the wave discontinuity of the synthesis signal, rather than the phase discontinuity, to estimate the mid-point phase. Experimental results show that the proposed method improves the continuity between the synthesized signals relative to the existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.1
• /
• pp.1-11
• /
• 2016

We investigate compressive sensing techniques to estimate sparse channel in Orthogonal Frequency Division Multiplexing(OFDM) systems. In the case of large channel delay spread, compressive sensing may not be applicable because it is affected by length of measurement vectors. In this paper, we increase length of measurement vector adding pilot information to OFDM data block. The increased measurement vector improves probability of finding path delay set and Mean Squared Error(MSE) performance. Simulation results show that signal recovery performance of a proposed scheme is better than conventional schemes.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.5
• /
• pp.1753-1761
• /
• 2014

Due to the inherent inhomogeneous and anisotropy nature of the composite materials, the detection of internal defects in these materials with non-destructive techniques is an important requirement both for quality checks during the production phase and in service inspection during maintenance operations. The estimation of the time-of-arrival (TOA) and/or time-of-flight (TOF) of the ultrasonic echoes is essential in ultrasonic non-destructive testing (NDT). In this paper, we used split-spectrum processing (SSP) combined with matching pursuit signal decomposition (MPSD) to develop a dedicated ultrasonic detection system. SSP algorithm is used for Signal-to-Noise Ratio (SNR) enhancement, and the MPSD algorithm is used to decompose backscattered signals into a linear expansion of chirplet echoes and estimate the chirplet parameters. Therefore, the combination of SSP and MPSD (SSP-MPSD) presents a powerful technique for ultrasonic NDT. The SSP algorithm is achieved by using Gaussian band pass filters. Then, MPSD algorithm uses the Maximum Likelihood Estimation. The good performance of the proposed method is experimentally verified using ultrasonic traces acquired from three specimens of carbon fibre reinforced polymer multi-layered composite materials (CFRP).

• Journal of the Korean Society of Clothing and Textiles
• /
• v.45 no.1
• /
• pp.17-27
• /
• 2021

The pursuit of a healthier life has created life style changes through exercise; in addition, an athleisure look as well as a combination of everyday clothes and sportswear has rapidly spread through sharing based on image-based SNS. Fashion related images shown in an image-based SNS are considered important resources for grasping micro-needs with regard to the sensibility of consumers. Therefore, this study analyzes the design characteristics of an athleisure look shown in image-based SNS. In order to analyze the athleisure look, images of the entire garment were collected and classified to enable content analysis methods that analyzed the design characteristics of each type. As a result, types were classified as sporty-athleisure, modern-athleisure, high-end athleisure, retro-athleisure, and romantic-athleisure. Looking at the characteristics of the athleisure look, it was shown that the design characteristics of each type were well expressed through differences in the direction, material, and details by matching between the items used. This study can be used in design development processes by deriving the characteristics of athleisure looks through an analysis of fashion images that appear in image-based SNS.

• Journal of Preventive Medicine and Public Health
• /
• v.36 no.3
• /
• pp.255-262
• /
• 2003

Objectives : We carried out tests for neurobehavior by using WHO-NCTB (neurobehavioral core test battery) and Perdue pegboard score test to identify differences between lacunar infarction cases and controls. Methods : Among the subjects who underwent MRI between February 2001 and March 2002 in a university hospital located in Seoul and who were diagnosed only as lacunar infarction without any intracranial disease, 46 patients were selected as cases (male: 21, female: 25). Controls were selected who had no cerebrovascular disease on MRI by matching age (5 years), gender, and education (2 years) in a ratio of 1:1 , Among WHO-NCTB, the following 5 tests and Perdue pegboard score test were used to categorize the study subjects: digit and symbol matching, simple reaction time, Benton visual retention, digit span, and Pursuit aiming test, Results : Among the above 6 tests of neurobehavior, lacunar infarction cases showed lower score than controls except for the simple reaction time test. As the controlling variables of multivariate analysis in the stepwise regression analysis, the followings were selected due to their significant association: age, education, BMI, gender, drinking, exercise, add systolic blood pressure. From multivariate regression analysis, there was significant difference (p<0.05) between lacunar infarction cases and controls in digit and symbol matching, Benton visual retention, digit span, pursuit aiming, and Perdue pegboard score test, but not in the score of simple reaction time test. Conclusions : We suggest that the above 5 tests for neurobehavior, with the exception of the simple reaction time test, might be used as the basis for recommendation of further treatment and other neurological tests by the earlier defection for neurological abnormality in lacunar infarction.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.289-307
• /
• 2010

The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the signal. In this regard, it generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence-termed as the worst-case coherence and the average coherence-among the columns of a design matrix. It utilizes these two measures of coherence to provide an in-depth analysis of a simple, model-order agnostic one-step thresholding (OST) algorithm for model selection and proves that OST is feasible for exact as well as partial model selection as long as the design matrix obeys an easily verifiable property, which is termed as the coherence property. One of the key insights offered by the ensuing analysis in this regard is that OST can successfully carry out model selection even when methods based on convex optimization such as the lasso fail due to the rank deficiency of the submatrices of the design matrix. In addition, the paper establishes that if the design matrix has reasonably small worst-case and average coherence then OST performs near-optimally when either (i) the energy of any nonzero entry of the signal is close to the average signal energy per nonzero entry or (ii) the signal-to-noise ratio in the measurement system is not too high. Finally, two other key contributions of the paper are that (i) it provides bounds on the average coherence of Gaussian matrices and Gabor frames, and (ii) it extends the results on model selection using OST to low-complexity, model-order agnostic recovery of sparse signals with arbitrary nonzero entries. In particular, this part of the analysis in the paper implies that an Alltop Gabor frame together with OST can successfully carry out model selection and recovery of sparse signals irrespective of the phases of the nonzero entries even if the number of nonzero entries scales almost linearly with the number of rows of the Alltop Gabor frame.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3498-3511
• /
• 2016

We investigate the channel state information (CSI) in multi-input multi-output (MIMO) cooperative networks that employ the amplify-and-forward transmission scheme. Least squares and expectation conditional maximization have been proposed in the system. However, neither of these two approaches takes advantage of channel sparsity, and they cause estimation performance loss. Unlike linear channel estimation methods, several compressed channel estimation methods are proposed in this study to exploit the sparsity of the MIMO cooperative channels based on the theory of compressed sensing. First, the channel estimation problem is formulated as a compressed sensing problem by using sparse decomposition theory. Second, the lower bound is derived for the estimation, and the MIMO relay channel is reconstructed via compressive sampling matching pursuit algorithms. Finally, based on this model, we propose a novel algorithm so called sparsity adaptive expectation maximization (SAEM) by using Kalman filter and expectation maximization algorithm so that it can exploit channel sparsity alternatively and also track the true support set of time-varying channel. Kalman filter is used to provide soft information of transmitted signals to the EM-based algorithm. Various numerical simulation results indicate that the proposed sparse channel estimation technique outperforms the previous estimation schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.5015-5038
• /
• 2018

In this paper, a novel spectral-spatial joint sparse representation algorithm for hyperspectral image classification is proposed based on multi-layer superpixels in various scales. Superpixels of various scales can provide complete yet redundant correlated information of the class attribute for test pixels. Therefore, we design a joint sparse model for a test pixel by sampling similar pixels from its corresponding superpixels combinations. Firstly, multi-layer superpixels are extracted on the false color image of the HSI data by principal components analysis model. Secondly, a group of discriminative sampling pixels are exploited as reconstruction matrix of test pixel which can be jointly represented by the structured dictionary and recovered sparse coefficients. Thirdly, the orthogonal matching pursuit strategy is employed for estimating sparse vector for the test pixel. In each iteration, the approximation can be computed from the dictionary and corresponding sparse vector. Finally, the class label of test pixel can be directly determined with minimum reconstruction error between the reconstruction matrix and its approximation. The advantages of this algorithm lie in the development of complete neighborhood and homogeneous pixels to share a common sparsity pattern, and it is able to achieve more flexible joint sparse coding of spectral-spatial information. Experimental results on three real hyperspectral datasets show that the proposed joint sparse model can achieve better performance than a series of excellent sparse classification methods and superpixels-based classification methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.251-256
• /
• 2009

In this paper, we propose a new method with the improved continuity performance of overlap and add speech signal synthesis method using damping harmonic amplitude parameter. The existing method uses the average value of past and current parameters for the sinusoidal amplitude used as the weight of phase error function. But, the proposed method extracts the more accurate sinusoidal amplitude by using a correlation between the original signals and the synthesized signals for the sinusodal amplitude used as the weights. To verify the performance of the proposed method, we observed the average differential error value between the synthesized signals.

• Journal of Digital Contents Society
• /
• v.18 no.2
• /
• pp.347-356
• /
• 2017

It is well-known that the face recognition method via sparse representation has been proved very robust and showed good performance. Its weakness is, however, that its time complexity is very high because it should solve $L_1$-minimization problem to find the sparse solution. In this paper, we propose to use the ROMP(Regularized Orthogonal Matching Pursuit) method for the sparse solution, which solves the $L_2$-minimization problem with regularization condition using the greed strategy. In experiments, we shows that the proposed method is comparable to the existing best $L_1$-minimization solver, Homotopy, but is 60 times faster than Homotopy. Also, we proposed C-SCI method for classification. The C-SCI method is very effective since it considers the sparse solution only without reconstructing the test data. It is shown that the C-SCI method is comparable to, but is 5 times faster than the existing best classification method.