• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.3
• /
• pp.68-74
• /
• 2001

A lane detection based on a road model or feature all needs correct acquirement of information on the lane in an image. It is inefficient to implement a lane detection algorithm through the full range of an image when it is applied to a real road in real time because of the calculating time. This paper defines two (other proper terms including"modes") for detecting lanes on a road. First is searching mode that is searching the lane without any prior information of a road. Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It allows to extract accurately and efficiently the edge candidate points of a lane without any unnecessary searching. By means of inverse perspective transform which removes the perspective effect on the edge candidate points, we transform the edge candidate information in the Image Coordinate System(ICS) into the plan-view image in the World Coordinate System(WCS). We define a linear approximation filter and remove faulty edge candidate points by using it. This paper aims at approximating more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.e fitting.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1E
• /
• pp.20-24
• /
• 2001

We propose the computation reduction method of real root method that is mainly used in the CELP(Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSF[1]. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. But, the important characteristic of LSF is that most of coefficients are occurred in specific frequency region. So, the searching frequency region is ordered by each coefficient's distribution. And coefficients are searched in ordered frequency region. Transformation time can be reduced by this method than the sequential searching method in frequency region. When we compare this proposed method with the conventional real root method, the experimental result is that the searching time was reduced about 46% in average.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.785-786
• /
• 2008

In this paper, we propose a fast Motion Estimation (ME) algorithm for low computational complexity based on spatial correlations. The proposed algorithm uses the motion vector of neighboring blocks, to decide the location of initial searching point. The number of searching point decreases by changing the location of initial searching point. Experimental results show that the proposed algorithm reduces searching points about $7{\sim}13%$ and increases PSNR about $0.1{\sim}0.5$(dB) compared with conventional algorithm.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.31-34
• /
• 1999

In this paper, the improved initial cell searching algorithm is proposed for 3GPP W-CDMA system. The key objective of the proposed algorithm is to utilize the reliability of the first stage of cell searching algorithm in order to accomplish the second stage. So the proposed algorithm makes the mobile station transfers to the second stage from the first stage, just after the slot synchronization is declared successively at the same time-offset. In order to compare the proposed algorithm with the conventional one, the simulations are accomplished for cell search algorithm for 3GPP W-CDMA systems in the multipath Rayleigh fading channel. Some parameters are also presented for the better performance in the initial cell searching algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2451-2454
• /
• 2003

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses met scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, speech, spectrogram analysis, searching time reduced about 37.5％, 46.21％, 46.3％, 51.29％ in average, computational amount is reduced about 44.76％, 49.44％, 47.03％, 57.40％. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.11-19
• /
• 2015

The mobile and ubiquitous environment is experiencing a rapid development of information and communications technology as it provides an ever increasing flow of information. Particularly, GIS is now widely applied in daily life due to its high accuracy and functionality. GIS information is utilized through the tiling method, which divides and manages large-scale map information. The tiling method manages map information and additional information to allow overlay, so as to facilitate quick access to tiled data. Unlike past studies, this paper proposes a new architecture and algorithms for tile searching and indexing management to optimize map information and additional information for GIS mobile applications. Since this involves the processing of large-scale information and continuous information changes, information is clustered for rapid processing. In addition, data size is minimized to overcome the constrained performance associated with mobile devices. Our system has been implemented in actual services, leading to a twofold increase in performance in terms of processing speed and mobile bandwidth.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.4
• /
• pp.260-263
• /
• 2008

In this paper we propose Personal Information Management System for Library Database. It manages personal search pattern for the given user and provide specific book list for library book search system. With the proposed system, the conventional overlap searching time will be decreased with personalized information and search history. This system manages the individual data according to personal searching pattern, sequence and usability. Therefore, the user can locate necessary book information more accurately with their distinct interest and search history.

• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.168-177
• /
• 2012

The search for relevant and actionable information is a key to achieving clinical and research goals in biomedicine. Biomedical information exists in different forms: as text and illustrations in journal articles and other documents, in images stored in databases, and as patients' cases in electronic health records. This paper presents ways to move beyond conventional text-based searching of these resources, by combining text and visual features in search queries and document representation. A combination of techniques and tools from the fields of natural language processing, information retrieval, and content-based image retrieval allows the development of building blocks for advanced information services. Such services enable searching by textual as well as visual queries, and retrieving documents enriched by relevant images, charts, and other illustrations from the journal literature, patient records and image databases.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.1
• /
• pp.62-69
• /
• 2011

A novel QEGT codebook index searching algorithm for long tenn evolution (LTE) system is proposed. The proposed algorithm divides the Q precoding vectors into M groups, and selects the optimal precoding vector from the selected group at the receiver. This algorithm reduced the calculation for searching the optimal precoding vector index compared to the previous algorithms. The index searching algorithm is implemented for TI's TMS320C6713 DSP board. When the number of transmit antenna is 4, the number of clock cycles is reduced to 25%.

• Proceeding of EDISON Challenge
• /
• 2016.03a
• /
• pp.183-189
• /
• 2016

In this paper, an optimization study on a helicopter rotor blade cross-section was made. Generalization was made to the baseline cross-section to simplify the analysis. To have better performance in aeroelastic response, with the aerodynamic center being the origin of the baseline, the distance between aerodynamic center and shear center, and the distance between mass center and shear center of the blade were minimized. For efficient searching of optimum solutions over the design space, grid search method, which is a method of graphical search was used. Two design variables, radius of balancing weight at leading edge, and offset of the spar from leading edge were selected for the study. Cubic spline interpolation method was used to accommodate searching of the optimum solution. 2-Leveled searching system was devised in accordance with the interpolation method. Optimum solution was found to show 6% decrease in both distance between aerodynamic center and shear center, and mass center and shear center to the baseline.