• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.773-776
• /
• 1998

In this paper, we propose an efficient multi-view images coding algorithm which finds the optimal texture from the restricted number of multi-view images. The X-Y plane of the normalized object space is divided into triangular patches. The depth value of the node is determined by applying the block based disparity compensation method and then the texture of the each patch is extracted by applying the affine transformation patch is extracted by applying the affine transformation based disparity compensation method to the multi-view images. We restricted the number of images contributed to determining the texture comapred to traditional methods which use all the multi-view images in the texture extraction. Experimental results show that the SNR of images encoded by the proposed algorithm is better than that of imaes encoded by the traditional method by the amount about 0.2dB for the test sets of multi-view images called dragon, kid, city and santa. The recovered images from the encoded data by the proposed method show the better visual images than the recovered images from the encoded data by the traditional methods.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.106-114
• /
• 1994

A new merging technique is adopted for combining rectangular parallelepipes produced by 2-D rectangular code into more intuitive 30D volume elements. Rectangular parallelepiped codes (RP codes) can be used in volume-based representation of a three-dimensional object. We proposed more regularity-conserving 2-D rectangular coding scheme to merge rectangular cells represented by RP codes in three-dimensional space. After being constructed from modified 2-D rectangular code, 3-D RP codes are merged in the two orthogonal directions using new merging algorithm. The shape of merged 3-D object reconstructed by proposed algorithm is shown to be much closer to the original object shape than that of conventional RP codes. The storage requirement of merged object can be also reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.208-223
• /
• 2015

To solve the problem of face recognition with complex changes and further improve the efficiency, a new near-infrared face recognition algorithm which fuses E-GV-LBP and FKNN algorithm is proposed. Firstly, it transforms near infrared face image by Gabor wavelet. Then, it extracts LBP coding feature that contains space, scale and direction information. Finally, this paper introduces an improved FKNN algorithm which is based on spatial domain. The proposed approach has brought face recognition more quickly and accurately. The experiment results show that the new algorithm has improved the recognition accuracy and computing time under the near-infrared light and other complex changes. In addition, this method can be used for face recognition under visible light as well.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.295-297
• /
• 2007

We design a new rate-3/2 full-diversity orthogonal space-time block code (STBC) for QPSK and 2 transmit antennas (TX) and 4 transmit antennas (TX) by enlarging the signalling set from the set of quaternions used in the Alamouti[I] and extendedcode and using additional members of the set of orthogonal matrices or Quasi-orthogonal matrices and higher than rate-5/4. Selective power scaling of information symbols is used to guarantee full-diversity while maximizing the coding gain (CG) and minimizing the transmitted signal peak-to-minimum power ratio (PMPR). The optimum power scaling factor is derived analytically and shown to outpetform schemes based only on constellation rotation while still enjoying a low-complexity maximum likelihood (ML) decoding algorithm.

• Journal of information and communication convergence engineering
• /
• 제4권2호
• /
• pp.75-78
• /
• 2006

This work presents a low complexity maximum-likelihood decoder for signal detection in VBLAST-STBC system, which employs non-square O-STBC code rate 3/4. Stacking received symbols from different symbol duration and applying QR decomposition result in the special format of upper triangular matrix R so that the proposed decoder is able to provide not only ML-like BER performance but also very low computational load. The low computational load and ML-like BER performance properties of the proposed decoder are verified by computer simulations.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.250-256
• /
• 2011

A two-way relaying (TWR) system is analyzed, where two source terminals with unequal numbers of antennas exchange data via an amplify-and-forward relay terminal with a single antenna. In the system considered herein, the link quality between the sources and relay can generally be asymmetric due to the nonidentical antenna configuration, power allocation, and relay location. In such a general setup, accurate bounds on the average sum rate (ASR) are derived when beamforming or orthogonal space time block coding is employed at the sources. We show that the proposed bounds are almost indistinguishable from the exact ASR under various system configurations. It is also observed that the ASR performance of the TWR system with unequal numbers of source antennas is more sensitive to the relay location than to the power allocation.

• Journal of Communications and Networks
• /
• 제9권1호
• /
• pp.75-83
• /
• 2007

Orthogonal frequency division multiplexing (OFDM) systems with multiple transmit antennas can exploit space-time block coding on each subchannel for reliable data transmission. Spacetime coded OFDM systems, however, are very sensitive to time variant channels because the channels need to be static over multiple OFDM symbol periods. In this paper, we propose to mitigate the channel variations in the frequency domain using a linear filter in the frequency domain that exploits the sparse structure of the system matrix in the frequency domain. Our approach has reduced complexity compared with alternative approaches based on time domain block-linear filters. Simulation results demonstrate that our proposed frequency domain block-linear filter reduces computational complexity by more than a factor of ten at the cost of small performance degradation, compared with a time domain block-linear filter.

• 한국통신학회논문지
• /
• 제35권6C호
• /
• pp.547-553
• /
• 2010

In this paper, novel approximated closed-form expressions of the SER(Symbol Error Rate) and BER(Bit Error Rate) are presented for the multi-input multi-output space-time block coding(MIMO-STBC) system employing two transmit and N receive antenna(s) in Rayleigh fading channels. Assuming a zero-forcing equalizer and a single-symbol maximum-likelihood (ML) decoder, the formulas are derived for the SER and BER, and then their approximated counterparts are also derived. In the derivation of the approximated expressions, acurve-fitting model is adopted that can eliminate the integral operators in the exact expressions.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.1006-1010
• /
• 1995

This paper describes Sexual Reproduction Genetic Algorithm(SRGA) for function optimization. In SRGA, each individual utilize a diploid chromosome structure. Sex cells(gametes) are produced through artificial meiosis in which crossover and mutation occur. The proposed method has two selection operators, one, individual selection which selects the individual to fertilize, and the other, gamete selection which makes zygote for offspring production. We consider the effects of multi-selection and diploidy on search performance. SRGA improves local and global search(exploitation and exploration) and show optimum tracking performance in nonstationary environments. Gray coding is incorporated to transforming the search space and Genic uniform distribution method is proposed to alleviate the problem of premature convergence.

• 한국음향학회지
• /
• 제21권4호
• /
• pp.156-156
• /
• 2002

We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for representing speech signals of a given speaker The speech segments are assumed to be generated by a linear combination of the basis functions, thus the distribution of speech segments of a speaker is modeled by adapting the basis functions so that each source component is statistically independent. The learned basis functions are oriented and localized in both space and frequency, bearing a resemblance to Gabor wavelets. These features are speaker dependent characteristics and to assess their efficiency we performed speaker identification experiments and compared our results with the conventional Fourier-basis. Our results show that the proposed method is more efficient than the conventional Fourier-based features in that they can obtain a higher speaker identification rate.