HMM topology for boundary refinement in automatic speech segmentation

Akdemir, E.
Çiloğlu, Tolga
A boundary refinement method using a new hidden Markov model (HMM) topology is proposed for automatic phonetic speech segmentation. The proposed method has the ability to work at high frame rates and the training and boundary refinement stages are easy and fast. The method is data driven and can be adapted to any speech segmentation problem provided that a training set is available. Given an initial segmentation obtained by forced alignment using an HMM based phone recogniser, 20% decrease in boundary errors is achieved.


CBFEM-MPI: A Parallelized Version of Characteristic Basis Finite Element Method for Extraction of 3-D Interconnect Capacitances
Ozgun, Ozlem; Mittra, Raj; Kuzuoğlu, Mustafa (Institute of Electrical and Electronics Engineers (IEEE), 2009-02-01)
In this paper, we present a novel, non-iterative domain decomposition method, which has been parallelized by using the message passing interface (MPI) library, and used to efficiently extract the capacitance matrixes of 3-D interconnect structures, by employing characteristic basis functions (CBFs) in the context of the finite element method (FEM). In this method, which is Failed CBFEM-MPI, the computational domain is partitioned into a number of nonoverlapping subdomains in which the CBFs are constructed b...
Pre-processing inputs for optimally-configured time-delay neural networks
Taşkaya Temizel, Tuğba; Ahmad, K (Institution of Engineering and Technology (IET), 2005-02-01)
A procedure for pre-processing non-stationary time series is proposed for modelling with a time-delay neural network (TDNN). The procedure stabilises the mean of the series and uses a fast Fourier transform to determine the TDNN input size. Results of applying this procedure on five well-known data sets are compared with existing hybrid neural network techniques, demonstrating improved prediction performance.
Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics
Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03)
A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
Derivation of length extension formulas for complementary sets of sequences using orthogonal filterbanks
Candan, Çağatay (Institution of Engineering and Technology (IET), 2006-11-23)
A method for the construction of complementary sets of sequences using polyphase representation of orthogonal filterbanks is presented. It is shown that the case of two-channel filterbanks unifies individually derived length extension formulas for complementary sequences into a common framework and the general M-channel case produces novel formulas for the extension of complementary sets of sequences. The presented technique can also be used to generate polyphase and multilevel sequences.
Multipath Characteristics of Frequency Diverse Arrays Over a Ground Plane
Cetintepe, Cagri; Demir, Şimşek (Institute of Electrical and Electronics Engineers (IEEE), 2014-07-01)
This paper presents a theoretical framework for an analytical investigation of multipath characteristics of frequency diverse arrays (FDAs), a task which is attempted for the first time in the open literature. In particular, transmitted field expressions are formulated for an FDA over a perfectly conducting ground plane first in a general analytical form, and these expressions are later simplified under reasonable assumptions. Developed formulation is then applied to a uniform, linear, continuous-wave opera...
Citation Formats
E. Akdemir and T. Çiloğlu, “HMM topology for boundary refinement in automatic speech segmentation,” ELECTRONICS LETTERS, pp. 1086–1087, 2010, Accessed: 00, 2020. [Online]. Available: