The Experts below are selected from a list of 297 Experts worldwide ranked by ideXlab platform
J. Sorensen - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchical pattern classification for high performance text-independent speaker verification systems
Proceedings of ICASSP '94. IEEE International Conference on Acoustics Speech and Signal Processing, 1994Co-Authors: J. Sorensen, M. SavicAbstract:A new algorithm, the hierarchical speaker verification algorithm, is introduced. This algorithm employs a set of unique mapping functions determined from an enrolment utterance that characterize the target voice as a multidimensional martingale Random Walk Process. For sufficiently long verification utterances, the central limit theorem insures that the accumulated scores for the target speaker will be distributed normally about the origin. Impostor speakers, which violate the martingale property, are distributed arbitrarily and widely scattered in the verification space. Excerpts of verification performance experiments are given and extensions to the algorithm for handling noisy channels and speaker template aging are discussed.
-
Hierarchical pattern classification for high performance text- independent speaker verification systems
ICASSP IEEE International Conference on Acoustics Speech and Signal Processing - Proceedings, 1994Co-Authors: J. Sorensen, Milan SavićAbstract:A new algorithm, the hierarchical speaker verification \nalgorithm, is introduced. This algorithm employs a set of \nunique mapping functions determined from an enrollment \nutterance that characterize the target voice as a \nmultidimensional martingale Random Walk Process. For \nsufficiently long verification utterances, the central limit \ntheorem insures that the accumulated scores for the target \nspeaker will be distributed normally about the origin. Impostor\nspeakers, which violate the martingale property, are \ndistributed arbitrarily and widely scattered in the \nverification space. Excerpts of verification performance \nexperiments are given and extensions to the algorithm for \nhandling noisy channels and speaker template aging are \ndiscussed. (Author abstract) 14 Refs.
M. Savic - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchical pattern classification for high performance text-independent speaker verification systems
Proceedings of ICASSP '94. IEEE International Conference on Acoustics Speech and Signal Processing, 1994Co-Authors: J. Sorensen, M. SavicAbstract:A new algorithm, the hierarchical speaker verification algorithm, is introduced. This algorithm employs a set of unique mapping functions determined from an enrolment utterance that characterize the target voice as a multidimensional martingale Random Walk Process. For sufficiently long verification utterances, the central limit theorem insures that the accumulated scores for the target speaker will be distributed normally about the origin. Impostor speakers, which violate the martingale property, are distributed arbitrarily and widely scattered in the verification space. Excerpts of verification performance experiments are given and extensions to the algorithm for handling noisy channels and speaker template aging are discussed.
Milan Savić - One of the best experts on this subject based on the ideXlab platform.
-
Hierarchical pattern classification for high performance text- independent speaker verification systems
ICASSP IEEE International Conference on Acoustics Speech and Signal Processing - Proceedings, 1994Co-Authors: J. Sorensen, Milan SavićAbstract:A new algorithm, the hierarchical speaker verification \nalgorithm, is introduced. This algorithm employs a set of \nunique mapping functions determined from an enrollment \nutterance that characterize the target voice as a \nmultidimensional martingale Random Walk Process. For \nsufficiently long verification utterances, the central limit \ntheorem insures that the accumulated scores for the target \nspeaker will be distributed normally about the origin. Impostor\nspeakers, which violate the martingale property, are \ndistributed arbitrarily and widely scattered in the \nverification space. Excerpts of verification performance \nexperiments are given and extensions to the algorithm for \nhandling noisy channels and speaker template aging are \ndiscussed. (Author abstract) 14 Refs.
Selahattin Maden - One of the best experts on this subject based on the ideXlab platform.
-
THE LIMIT BEHAVIOUR OF SEMI-MARKOVIAN Random Walk ProcessES WITH REFLECTING AND DELAYING BARRIERS
2020Co-Authors: Selahattin MadenAbstract:In this paper, a semi-Markovian Random Walk Process with reflecting barrier on the zero-level and delaying barrier on the I²(I²g0)-level is constructed. Furthermore, the limit theorems for the sequence of this type Processes have been proved and one example has been given.
-
the laplace transform for the ergodic distribution of a semi markovian Random Walk Process with reflecting and delaying barriers
Ordu Üniversitesi Bilim ve Teknoloji Dergisi, 2016Co-Authors: Selahattin MadenAbstract:In this paper, a semi-Markovian Random Walk Process with reflecting barrier on the zero-level and delaying barrier on the ) 0 ( -level is constructed and the the Laplace transform for the ergodic distribution of this Process is expressed by means of the probability characteristics of Random Walk {
-
the laplace transform of a boundary functional of the semi markovian Random Walk Process with two delaying barriers
Ordu Üniversitesi Bilim ve Teknoloji Dergisi, 2016Co-Authors: Selahattin Maden, Bahar Shamilova, Gulizar MirzoyevaAbstract:In this study, a step Process of semi-Markovian Random Walk with delaying barriers at and levels () and first falling moment of the Process into the delaying barrier at -level, , are mathematically constructed, in this case when the Random Walk happens according to the Laplace’s distribution. It is given a simple form of the Laplace transformation of the distribution of the Random variable. Also the simple formulas for expectation and variance of are obtained by the means of this Laplace transformation.
-
On the Semi-Markovian Random Walk Process with Reflecting and Delaying Barrriers
Turkish Journal of Mathematics, 2001Co-Authors: Selahattin MadenAbstract:In this paper, a semi-Markovian Random Walk Process X(t) with reflecting barrier on the zero-level and delaying barrier on the β(β > 0)-level and the first falling moment of the Process into the delaying barrier, (γ), are considered. Some probability characteristics of γ, such as its distribution function, moment generating function and expected value are calculated.
Abdallah Shami - One of the best experts on this subject based on the ideXlab platform.
-
physical topology discovery scheme for wireless sensor networks using Random Walk Process
Global Communications Conference, 2016Co-Authors: Tianqi Yu, Xianbin Wang, Abdallah ShamiAbstract:Wireless sensor networks (WSNs) are widely considered as the most important information gathering platform in enabling Internet of Things (IoT). In order to evolve the traditional WSNs for low-power and low-loss IoT applications, time slotted channel hopping (TSCH) MAC protocol has been proposed to tackle the single channel and inefficient medium access drawbacks through improved network topology awareness. However, the problem of maintaining the physical topology of a WSN at the server end remains unresolved. In this paper, we propose a novel physical topology discovery scheme for WSNs by exploitation of Random Walk Process and iterative multilateration localization algorithm. Explicitly, information specific to the sensor nodes, including IDs and neighbor tables, are collected in the Random Walk Process. The physical topology is then reconstructed at the server end based on the collected information and the iterative multilateration localization algorithm. Simulation results indicate that the average location offset between the established topology and the ground- truth topology can be as low as 1.26m.
-
GLOBECOM - Physical Topology Discovery Scheme for Wireless Sensor Networks Using Random Walk Process
2016 IEEE Global Communications Conference (GLOBECOM), 2016Co-Authors: Tianqi Yu, Xianbin Wang, Abdallah ShamiAbstract:Wireless sensor networks (WSNs) are widely considered as the most important information gathering platform in enabling Internet of Things (IoT). In order to evolve the traditional WSNs for low-power and low-loss IoT applications, time slotted channel hopping (TSCH) MAC protocol has been proposed to tackle the single channel and inefficient medium access drawbacks through improved network topology awareness. However, the problem of maintaining the physical topology of a WSN at the server end remains unresolved. In this paper, we propose a novel physical topology discovery scheme for WSNs by exploitation of Random Walk Process and iterative multilateration localization algorithm. Explicitly, information specific to the sensor nodes, including IDs and neighbor tables, are collected in the Random Walk Process. The physical topology is then reconstructed at the server end based on the collected information and the iterative multilateration localization algorithm. Simulation results indicate that the average location offset between the established topology and the ground- truth topology can be as low as 1.26m.