• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.473-479
• /
• 2012

In this paper, blind equalization technique using Gaussian two-cluster model is proposed. The proposed approach, by modeling the received M-QAM signals as Gaussian distributed two-cluster, minimizes the computational complexity and enhances the reliability of the signal estimates. In addition, by using a nonlinear estimator with variable parameters to estimate the transmitted signal, and by selectively applying the reduced constellation and the original constellation when estimating the signals, the reliability of the signal estimation was further improved. As a result, the proposed approach has improved the performance while reducing the complexity of the equalizer. Through computer simulations for blind equalization of higher-order signals of 64-QAM, it was confirmed that the proposed method showed better performance than traditional approaches.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.70.1-70.1
• /
• 2021

We examine the HI gas kinematics and distributions of galaxy pairs in group or cluster environments from high-resolution Australian Square Kilometer Array Pathfinder (ASKAP) WALLABY pilot observations. We use 32 well-resolved close pair galaxies from the Hydra, Norma, and NGC 4636, two clusters and a group of which are identified by their spectroscopy information and additional visual inspection. We perform profile decomposition of HI velocity profiles of the galaxies using a new tool, BAYGAUD which allows us to separate a line-of-sight velocity profile into an optimal number of Gaussian components based on Bayesian MCMC techniques. Then, we construct super profiles via stacking of individual HI velocity profiles after aligning their central velocities. We fit a model which consists of double Gaussian components to the super profiles, and classify them as kinematically cold and warm HI gas components with respect to their velocity dispersions, narrower or wider 𝜎, respectively. The kinematically cold HI gas reservoir (M_cold/M_HI) of the paired galaxies is found to be relatively higher than that of unpaired control samples in the clusters and the group, showing a positive correlation with the HI mass in general. Additionally, we quantify the gravitational instability of the HI gas disk of the sample galaxies using their Toomre Q parameters and HI morphological disturbances. While no significant difference is found for the Q parameter values between the paired and unpaired galaxies, the paired galaxies tend to have larger HI asymmetry values which are derived using their moment0 map compared to those of the non-paired control sample galaxies in the distribution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.772-780
• /
• 2008

K-means is one of the simplest unsupervised learning algorithms that solve the clustering problem. However K-means suffers the basic shortcoming: the number of clusters k has to be known in advance. In this paper, we propose extensions of X-means, which can estimate the number of clusters using Bayesian information criterion(BIC). We introduce two different versions of algorithm: modified X-means(MX-means) and generalized X-means(GX-means), which employ one full covariance matrix for one cluster and so can estimate the number of clusters efficiently without severe over-fitting which X-means suffers due to its spherical cluster assumption. The algorithms start with one cluster and try to split a cluster iteratively to maximize the BIC score. The former uses K-means algorithm to find a set of optimal clusters with current k, which makes it simple and fast. However it generates wrongly estimated centers when the clusters are overlapped. The latter uses EM algorithm to estimate the parameters and generates more stable clusters even when the clusters are overlapped. Experiments with synthetic data show that the purposed methods can provide a robust estimate of the number of clusters and cluster parameters compared to other existing top-down algorithms.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.157-166
• /
• 2003

This paper deals with the problem of channel identification for Single Input Multiple Output (SIMO) slow fading channels using clustering algorithms. Due to the intrinsic memory of the discrete-time model of the channel, over short observation periods, the received data vectors of the SIMO model are spread in clusters because of the AWGN noise. Each cluster is practically centered around the ideal channel output labels without noise and the noisy received vectors are distributed according to a multivariate Gaussian distribution. Starting from the Markov SIMO channel model, simultaneous maximum ikelihood estimation of the input vector and the channel coefficients reduce to one of obtaining the values of this pair that minimizes the sum of the Euclidean norms between the received and the estimated output vectors. Viterbi algorithm can be used for this purpose provided the trellis diagram of the Markov model can be labeled with the noiseless channel outputs. The problem of identification of the ideal channel outputs, which is the focus of this paper, is then equivalent to designing a Vector Quantizer (VQ) from a training set corresponding to the observed noisy channel outputs. The Linde-Buzo-Gray (LBG)-type clustering algorithms [1] could be used to obtain the noiseless channel output labels from the noisy received vectors. One problem with the use of such algorithms for blind time-varying channel identification is the codebook initialization. This paper looks at two critical issues with regards to the use of VQ for channel identification. The first has to deal with the applicability of this technique in general; we present theoretical results for the conditions under which the technique may be applicable. The second aims at overcoming the codebook initialization problem by proposing a novel approach which attempts to make the first phase of the channel estimation faster than the classical codebook initialization methods. Sample simulation results are provided confirming the effectiveness of the proposed initialization technique.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.