• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.7 s.361
• /
• pp.59-69
• /
• 2007

In this paper, we propose a MIMO-OFDMA (Multi Input Multi Output-Orthogonal Frequency Division Multiple Access) system based on Grassmannian beamforming for performance improvement of downlink real-time traffic transmission in harsh channel conditions with low CIR (Carrier-to-Interference Ratio). In the proposed system to reduce feedback information for the beamforming, we also apply Grassmannian Beamforming. Furthermore, we propose antenna selection scheme which performs the beamforming with more useful transmit antennas. In the proposed system, the optimal combination of transmit antennas with maximum MRT (Maximum Ratio Transmission) beamforming gain, is selected. Simulation results reveal that the proposed MIMO-OFDMA system achieves significant improvement of spectral efficiency in low CIR region as compared to a typical open-loop MIMO-OFDMA system using pseudo-orthogonal space time block code.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.81-91
• /
• 1994

A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.548-554
• /
• 2003

Interoperability is ole the most important factors for a successful integration of the speech network. To accomplish communication between endpoints employing different speech coders, decoder and encoder of each endpoint coder should be placed in tandem. However, tandem coder often produces problems such as poor speech quality, high computational load, and additional transmission delay. In this paper, we propose an efficient transcoding algorithm that can provide interoperability to the networks employing ITU-T G.723.1［1］and TIA IS-127 EVRC［2］speech coders. The proposed transcoding algorithm is composed of four parts: LSP conversion, open-loop pitch conversion, fast adaptive codebook search, and fast fixed codebook search. Subjective and objective quality evaluation confirmed that the speech quality produced by the proposed transcoding algorithm was equivalent to, or better than the tandem coding, while it had shorter processing delay and less computational complexity, which is certified implementing on TMS320C62x.

• Journal of IKEEE
• /
• v.20 no.1
• /
• pp.31-44
• /
• 2016

This paper presents a hole-filling algorithm based on extrapolating spatial-temporal background information used in view synthesis for free-viewpoint television. A new background codebook is constructed and updated in order to extract reliable temporal background information. In addition, an estimation of spatial local background values is conducted to discriminate an adaptive boundary between the background region and the foreground region as well as to update the information about the hole region. The holes then are filled by combining the spatial background information and the temporal background information. In addition, an exemplar-based inpainting technique is used to fill the rest of holes, in which a priority function using background-depth information is defined to determine the order in which the holes are filled. The experimental results demonstrated that the proposed algorithm outperformed the other comparative methods about average 0.3-0.6 dB, and that it synthesized satisfactory views regardless of video characteristics and type of hole region.

• Journal of IKEEE
• /
• v.14 no.4
• /
• pp.317-323
• /
• 2010

The video surveillance system is adopted in many places due to its efficiency and constancy in monitoring a specific area over a long period of time. However, many surveillance systems composed of a single static camera often produce unsatisfactory results due to their lack of field of view. In this paper, we present a video surveillance system based on wide baseline stereo cameras to overcome the limitation. We adopt the codebook algorithm and mathematical morphology to robustly model the foreground pixels of the moving object in the scene and calculate the trajectory of the moving object via 3D reconstruction. The experimental results show that the proposed system detects a moving object and generates a top view trajectory successfully to track the location of the object in the world coordinates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.170-176
• /
• 2009

It has been known that multiuser MIMO systems have better performance than single-user MIMO systems. However, multiuser MIMO systems should eliminate inter-user interferences which are generated by allocating data to multiple users simultaneously There is zero-forcing beamforming (ZFBF) as scheme used widely among algorithms to eliminate inter-user interferences. But, it needs many feedback bits since BS knows quite exact channel state information to use this scheme in real systems. Random beamforming (RBF) was proposed to cope with a defect of ZFBF[1]. RBF is a multiuser scheme to send data to users who have optimal performance with predetermined codebook, each receiver feeds back a index of codeword which has optimal performance within the codebook and its CQI information. [1] assumes that the BS knows perfect CQI information of each receiver but CQI information should be quantized in the real systems. Therefore, in this paper, efficient CQI quantization scheme for RBF system is proposed.

• Journal of the Korean Society for information Management
• /
• v.38 no.4
• /
• pp.153-171
• /
• 2021

This study suggested a method of utilizing METS based on DDI metadata to manage, preserve, and service datasets. DDI is a standard for statistical data processing, and there are currently two versions of DDI Codebook (DDI-C) and DDI Lifecycle (DDI-L). In this study, the main elements of DDI-C were mainly used. First the structures and elements of METS and DDI-C were first analyzed. And the mapping of the major elements of METS and DDI-C. The standard was finally taken as METS, the format to express it. Since METS and DDI-C do not show a perfect 1:1 mapping, the DDI-C element that best matches each element of the standard METS was selected. As a result, a new dataset management transmission standard METS using DDI-C metadata elements was designed and presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.895-906
• /
• 1993

In this paper, MTSVQ(Multirate Tree-Structured Vector Quantization) is introduced for subband image coding. Original images are decomposed into a number of subband components, and multiresolution codebook is designed by MTSVQ algorithm. Optimal bit allocation among the subband components becomes the problem selecting the particular pruned subtree of MTSVQ which has the desired rate and distortion.

• MALSORI
• /
• no.62
• /
• pp.133-147
• /
• 2007

In this paper, we introduce a phone vector discrete HMM(PVDHMM) that decodes a phone sequence string, and demonstrates the applicability to spoken document retrieval. The PVDHMM treats a phone recognizer or large vocabulary continuous speech recognizer (LVCSR) as a vector quantizer whose codebook size is equal to the size of its phone set. We apply the PVDHMM to decode the phone sequence strings and compare the outputs with those of a continuous speech recognizer(CSR). Also we carry out spoken document retrieval experiment through PVDHMM word spotter on the phone sequence strings which are generated by phone recognizer or LVCSR and compare its results with those of retrieval through the phone-based vector space model.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.9-12
• /
• 2001

Learning vector quantization (LVQ) is a supervised learning technique that uses class information to move the vector quantizer slightly, so as to improve the quality of the classifier decision regions. In this paper we propose a selection method of initial codebook vectors for a teaming vector quantization (LVQ3) using support vector machines (SVM). The method is experimented with artificial and real design data sets and compared with conventional methods of the condensed nearest neighbor (CNN) and its modifications (mCNN). From the experiments, it is discovered that the proposed method produces higher performance than the conventional ones and then it could be used efficiently for designing nonparametric classifiers.