• Title/Summary/Keyword: Linear search algorithm

Search Result 199, Processing Time 0.023 seconds

Design of a Korean Speech Recognition Platform (한국어 음성인식 플랫폼의 설계)

  • Kwon Oh-Wook;Kim Hoi-Rin;Yoo Changdong;Kim Bong-Wan;Lee Yong-Ju
    • MALSORI
    • /
    • no.51
    • /
    • pp.151-165
    • /
    • 2004
  • For educational and research purposes, a Korean speech recognition platform is designed. It is based on an object-oriented architecture and can be easily modified so that researchers can readily evaluate the performance of a recognition algorithm of interest. This platform will save development time for many who are interested in speech recognition. The platform includes the following modules: Noise reduction, end-point detection, met-frequency cepstral coefficient (MFCC) and perceptually linear prediction (PLP)-based feature extraction, hidden Markov model (HMM)-based acoustic modeling, n-gram language modeling, n-best search, and Korean language processing. The decoder of the platform can handle both lexical search trees for large vocabulary speech recognition and finite-state networks for small-to-medium vocabulary speech recognition. It performs word-dependent n-best search algorithm with a bigram language model in the first forward search stage and then extracts a word lattice and restores each lattice path with a trigram language model in the second stage.

  • PDF

Microcell Sectorization for Channel Management in a PCS Network by Tabu Search (광마이크로셀 이동통신망에서의 채널관리를 위한 동적 섹터결정)

  • Lee, Cha-Young;Yoon, Jung-Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.2
    • /
    • pp.155-164
    • /
    • 2000
  • Recently Fiber-optic Micro-cellular Wireless Network is considered to solve frequent handoffs and local traffic unbalance in microcellular systems. In this system, central station which is connected to several microcells by optical fiber manages the channels. We propose an efficient sectorization algorithm which dynamically clusters the microcells to minimize the blocked and handoff calls and to balance the traffic loads in each cell. The problem is formulated as an integer linear programming. The objective is to minimize the blocked and handoff calls. To solve this real time sectorization problem the Tabu Search is considered. In the tabu search intensification by Swap and Delete-then-Add (DTA) moves is implemented by short-term memory embodied by two tabu lists. Diversification is considered to investigate proper microcells to change their sectors. Computational results show that the proposed algorithm is highly effective. The solution is almost near the optimal solution and the computation time of the search is considerably reduced compared to the optimal procedure.

  • PDF

A Computationally Efficient Time Delay and Doppler Estimation for the LFM Signal (LFM 신호에 대한 효과적인 시간지연 및 도플러 추정)

  • 윤경식;박도현;이철목;이균경
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.8
    • /
    • pp.58-66
    • /
    • 2001
  • In this paper, a computationally efficient time delay and doppler estimation algorithm is proposed for active sonar with Linear Frequency Modulated (LFM) signal. To reduce the computational burden of the conventional estimation algorithm, an algebraic equation is used which represents the relationship between the time delay and doppler in cross-ambiguity function of the LFM signal. The algebraic equation is derived based on the Fast maximum Likelihood (FML) method. Using this algebraic relation, the time delay and doppler are estimated with two 1-D search instead of the conventional 2-D search. The estimation errors of the proposed algorithm are analyzed for various SNR's. The simulation result demonstrates the good performance of the proposed algorithm.

  • PDF

A Hybrid Algorithm for Identifying Multiple Outlers in Linear Regression

  • Kim, Bu-yong;Kim, Hee-young
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.1
    • /
    • pp.291-304
    • /
    • 2002
  • This article is concerned with an effective algorithm for the identification of multiple outliers in linear regression. It proposes a hybrid algorithm which employs the least median of squares estimator, instead of the least squares estimator, to construct an Initial clean subset in the stepwise forward search scheme. The performance of the proposed algorithm is evaluated and compared with the existing competitor via an extensive Monte Carlo simulation. The algorithm appears to be superior to the competitor for the most of scenarios explored in the simulation study. Particularly it copes with the masking problem quite well. In addition, the orthogonal decomposition and Its updating techniques are considered to improve the computational efficiency and numerical stability of the algorithm.

Application of Genetic Algorithm for Large-Scale Multiuser MIMO Detection with Non-Gaussian Noise

  • Ran, Rong
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.2
    • /
    • pp.73-78
    • /
    • 2022
  • Based on experimental measurements conducted on many different practical wireless communication systems, ambient noise has been shown to be decidedly non-Gaussian owing to impulsive phenomena. However, most multiuser detection techniques proposed thus far have considered Gaussian noise only. They may therefore suffer from a considerable performance loss in the presence of impulsive ambient noise. In this paper, we consider a large-scale multiuser multiple-input multiple-output system in the presence of non-Gaussian noise and propose a genetic algorithm (GA) based detector for large-dimensional multiuser signal detection. The proposed algorithm is more robust than linear multi-user detectors for non-Gaussian noise because it uses a multi-directional search to manipulate and maintain a population of potential solutions. Meanwhile, the proposed GA-based algorithm has a comparable complexity because it does not require any complicated computations (e.g., a matrix inverse or derivation). The simulation results show that the GA offers a performance gain over the linear minimum mean square error algorithm for both non-Gaussian and Gaussian noise.

A Study on the Application of Database Management Systems to the Design of Structures -Cast of Reinforced Concrete Structure- (구조물 설계에 있어서 데이터베이스 관리 시스템의 응용에 관한 연구 -철근콘크리트 구조물 설계를 중심으로-)

  • 장주흠;윤성수;김한중;이정재
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.40 no.3
    • /
    • pp.103-112
    • /
    • 1998
  • In this study, database schema which is capable of maintaining various design-knowledge and applicable to the structural designs has been presented. Futhermore, by utilizing the database system, RECODSS (REinforced COncrete Design Support System) was developed as well. Knowledge-base that were formulated from the document is constructed by applying the concrete standard specifications of Korea from 1989. The basic drawing was prepared by $AutoCAD^TM$. As an inference in the preliminary design, the certainty function and the interpolation function were presented. The certainty function is made by assuming linear relations between each data while referencing $MYCIN^TM$ (expert systems). Nevertheless, the interpolation function was made by utilizing the linear Lagrange interpolation. For the search of the design-knowledge, fast search algorithm and full-text search algorithm were used, however, the design engine was programmed with C language. RECODSS was applied for designing a slab and a beam member. And the results were compared with the existing results. In conclusion, RECODSS was able to efficiently manage various design knowledge and to introduce stable design results.

  • PDF

Blind linear/nonlinear equalization for heavy noise-corrupted channels

  • Han, Soo- Whan;Park, Sung-Dae
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.3
    • /
    • pp.383-391
    • /
    • 2009
  • In this paper, blind equalization using a modified Fuzzy C-Means algorithm with Gaussian Weights (MFCM_GW) is attempted to the heavy noise-corrupted channels. The proposed algorithm can deal with both of linear and nonlinear channels, because it searches for the optimal channel output states of a channel instead of estimating the channel parameters in a direct manner. In contrast to the common Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in its search procedure. The selected channel states by MFCM_GW are always close to the optimal set of a channel even the additive white Gaussian noise (AWGN) is heavily corrupted in it. Simulation studies demonstrate that the performance of the proposed method is relatively superior to existing genetic algorithm (GA) and conventional FCM based methods in terms of accuracy and speed.

Analysis of trusses by total potential optimization method coupled with harmony search

  • Toklu, Yusuf Cengiz;Bekdas, Gebrail;Temur, Rasim
    • Structural Engineering and Mechanics
    • /
    • v.45 no.2
    • /
    • pp.183-199
    • /
    • 2013
  • Current methods of analysis of trusses depend on matrix formulations based on equilibrium equations which are in fact derived from energy principles, and compatibility conditions. Recently it has been shown that the minimum energy principle, by itself, in its pure and unmodified form, can well be exploited to analyze structures when coupled with an optimization algorithm, specifically with a meta-heuristic algorithm. The resulting technique that can be called Total Potential Optimization using Meta-heuristic Algorithms (TPO/MA) has already been applied to analyses of linear and nonlinear plane trusses successfully as coupled with simulated annealing and local search algorithms. In this study the technique is applied to both 2-dimensional and 3-dimensional trusses emphasizing robustness, reliability and accuracy. The trials have shown that the technique is robust in two senses: all runs result in answers, and all answers are acceptable as to the reliability and accuracy within the prescribed limits. It has also been shown that Harmony Search presents itself as an appropriate algorithm for the purpose.

A Study of Sub-Pixel Detection for Hyperspectral Image Using Linear Spectral Unmixing Algorithm (Linear Spectral Unmixing 기법을 이용한 하이퍼스펙트럴 영상의 Sub-Pixel Detection에 관한 연구)

  • 김대성;조영욱;한동엽;김용일
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.04a
    • /
    • pp.161-166
    • /
    • 2003
  • Hyperspectral imagery have high spectral resolution and provide the potential for more accurate and detailed information extraction than any other type of remotely sensed data. In this paper, the "Linear Spectral Unmixing" model which is one solution to overcome the limit of spatial resolution for remote sensing data was introduced and we applied the algorithm to hyperspectral image. The result was not good because of some problems such as image calibration and used endmembers. Therefore, we analyzed the cause and had a search for a solution.

  • PDF

Optimized Polynomial Neural Network Classifier Designed with the Aid of Space Search Simultaneous Tuning Strategy and Data Preprocessing Techniques

  • Huang, Wei;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.2
    • /
    • pp.911-917
    • /
    • 2017
  • There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.