• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.29-34
• /
• 2014

We introduce a number of antenna optimization problem for the zero-forcing beamforming (ZFBF) scheme to enhance energy-efficiency (EE) of the multiple-input-multiple-output broadcast channel. For proposed optimization problem, we assume an instantaneous channel gain of the ZFBF scheme as an average channel gain, given by $N_a-K+1$, in order to reduce a computational complexity of finding the number of active antennas $N_a$. Then, we convert a fractional-form objective function into a subtractive-form, and find a solution of $N_a$ and the maximum EE by an iterative process. Simulation results show that the maximum EE value obtained by proposed algorithm is almost identical to the optimal EE value by the exhaustive search method.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.8-15
• /
• 2002

This Paper proposes designing and implementing the database system storing the medical images. This system collects the medical image when doctors operate and diagnose the patients using the endoscope in the orthopedics, then stores the medical image data to database. Therefore. system avoids duplicated medical data, retrieves and updates the medical data effectively. The medical image data can be shared to the multiple users and application programs. This system consists of the five components. that is, the input module acquiring the medical image from the endoscope. the modulo storing the medical image. the database design and implementation storms the patient's disease history and the medical image data, user friendly interface design and implementation, and the simple data retrieval engine. The features of the system are followed. The image catcher program using DirectShow is portable any image catcher board And because the image catcher algorithm is implemented as a public module, The throughput can be increased during the development of video and audio contents on internet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.984-995
• /
• 1996

Data errors according to the various noises caused in the satellite communication links are corrected by the Viterbi decoding algorithm which has extreme error correcting capability. In this paper, we designed and implemented a convolutional encoder and Viterbi decoder ASIC which is used to encode the input data at the transmit side and correct the errors of the received data at the receive side for use in the VSAT communication system. And this chip may be used in any BPSK, QPSK, or OQPSK transmission system. The ambiguity resolver corrects PSK modem ambiguities by delaying, interting, and/or exchanging code symbol to restore their original sequence and polarity. In case of previous decoding system, ambiguity state(AS) of data is resolved by external control logic and extra redundancy data are needed to resolve AS. But, by adopting decoder proposed in this paper, As of data is resolved automatically by internal logic of decoder in case of continuous mode, and by external As line withoug extra redudancy data in burst mode case. So, decoding parts are simple in continuous mode and transmission efficiency is increased in bust mode. The features of this chip are full duplex operation with independent transmit and receive control and clocks, start/stop inputs for use in burst mode systems, loopback function to verify encoder and decoder, and internal or external control to resolve ambinguity state. For verification of the function and performance of a fabricated ASIC chip, we equiped this chip in the Central and Remote Earth Station of VSAT system, and did the performance test using the commerical INTELSAT VII under the real satellite link environmens. The results of test were demonstrated the superiority of performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.753-758
• /
• 2017

The ray-shooting problem is to find the first intersection point on the surface of given geometric objects where a ray moving along a straight line hits. Since rays are usually given in the form of queries, this problem is typically solved as follows. First, a data structure for a collection of objects is constructed as preprocessing. Then, the answer for each query ray is quickly computed using the data structure. In this paper, we consider the ray-shooting problem about the set of vertical line segments on the x-axis. We present a new data structure called a convex layer tree for n vertical line segments given by input. This is a tree structure consisting of layers of convex hulls of vertical line segments. It can be constructed in O(n log n) time and O(n) space and is easy to implement. We also present an algorithm to solve each query in O(log n) time using this data structure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.367-370
• /
• 2015

This paper proposes an improve method of the detection performance of traffic lights for autonomous driving cars. Earlier detection methods used to adopt color thresholding, template matching and based learning maching methods, but its have some problems such as recognition rate decreasing, slow processing time. The proposed method uses both detection mask and morphological preprocessing. Firstly, input color images are converted to YCbCr image in order to strengthen its illumination, and horizontal edge components are extracted in the Y Channel. Secondly, the region of interest is detected according to morphological characteristics of the traffic lights. Finally, the traffic signal is detected based on color distributions. The proposed method showed that the detection rate and processing time improved rather than the conventional algorithm about some surrounding environments.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1147-1159
• /
• 1996

In this paper. we develop an efficient algorithm which vectorize the table input for mixed document recognition system. It is necessary to separate character and line for recognizing the character in the table. For recognizing table, we have to recognize the character which is blocked by table line and develop the efficient rectorization method for table line. For vectorizing table, we develop several methods. The first method is to extract table line part using 8-dircction chaincodes. The second method is to extract horizontal and vertical lines using histogram of lines. The third one is to extract diagonal lines of table by using the cross points of horizontal and verticallines. Finally we also develop the table vectorization method which finds the regularity characteristics of horizontal and vertical lines composing table, In the paper, we sugest a regularity method for efficient table vectorization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.140-148
• /
• 2004

Natural images can be classified into edge or flat region. Edges have also various shapes such as long edge, texture and so on. Because the conventional deinterlacing methods commonly use one specific algorithm, they are faced with the difficulty that does not adapt various shapes of images. In this paper, a selective deinterlacing method based on the characteristics of local region of image is proposed. An input image is classified into three regions; flat region, complex edge, long edge. And then for each region, the proper method is assigned according to the characteristic of the local feature. For long edge region, the modified $NEDI(New Edge Directed Interpolation)^{[1]}$ method that interpolates long edge very well is used. The linear $filter^{[2]}$ that enhances high frequency components is used for complex edge, and the bilinear interpolation method is applied to flat region. The proposed method shows improved performance in PSNR and subjective evaluation compared with previous algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1184-1193
• /
• 2006

Image interpolation has been widely used and studied in the various fields of image processing. There are many approaches of varying complexity and robustness. In this paper, a new distance weight is proposed for the conventional linear interpolation. In comparison with the conventional linear weight, the new distance weight uses a quadratic or cubic polynomial equation to reflect that the interpolated value should be influenced more by the value of closer pixels in an input image. In this paper, the new adaptive linear (NAL) interpolation, which considers patterns near the interpolated value, is also proposed. This algorithm requires a pattern weight, which is used to determine the ratio of reflection on local patterns, to obtain an interpolated image that exhibits better quality at various magnification factors (MF). In the computer simulation, not only did the NAL interpolation exhibit much lower computational complexity than conventional bicubic interpolation, it also improved peak signal-to-noise ratios (PSNR).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8C
• /
• pp.522-528
• /
• 2011

The iterative detection and decoding (IDD) has been shown to dramatically improve the bit error rate (BER) performance of the multiple-input multiple-output (MIMO) communication systems. However, these techniques require a high computational complexity since it is required to compute the soft decisions for each bit. In this paper, we show IDD comprised of sphere decoder with low-density parity check (LDPC) codes and present the tree search strategy, called a layer symbol search (LSS), to obtain soft decisions with a low computational complexity. In addition, an adaptive early termination is proposed to reduce the computational complexity during an iteration between an inner sphere decoder and an outer LDPC decoder. It is shown that the proposed approach can achieve the performance similar to an existing algorithm with 70% lower computational complexity compared to the conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.711-720
• /
• 2012

In this paper, we introduce the implementation of driver fatigue monitering system and its result. Input video device is selected commercially available web-cam camera. Haar transform is used to face detection and adopted illumination normalization is used for arbitrary illumination conditions. Facial image through illumination normalization is extracted using Haar face features easily. Eye candidate area through illumination normalization can be reduced by anthropometric measurement and eye detection is performed by PCA and Circle Mask mixture model. This methods achieve robust eye detection on arbitrary illumination changing conditions. Drowsiness state is determined by the level on illumination normalize eye images by a simple calculation. Our system alarms and operates seatbelt on vibration through controller area network(CAN) when the driver's doze level is detected. Our algorithm is implemented with low computation complexity and high recognition rate. We achieve 97% of correct detection rate through in-car environment experiments.