Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christos Boukis

dblp:25/1412 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-authorArtificial intelligence and machine learning · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Speech recognition and synthesis · 50% Learning paradigms · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › semi-supervised learning › pseudo-labeling
dynamic thresholding
0.112011
Convex Combination of Multiple Statistical Models With Application to VAD · IEEE Trans. Speech Audio Process. 2011
Natural language and speech › Speech recognition and synthesis › speech analysis
voice activity detection
0.112011
Convex Combination of Multiple Statistical Models With Application to VAD · IEEE Trans. Speech Audio Process. 2011

Methods — techniques the papers use, named apart from their topics

two-sided gamma distribution · 0.1laplacian distribution · 0.1gaussian distribution · 0.1decision smoothing · 0.1
YearPublicationVenuePosition
2011 Multi-Sensor Voice Activity Detection Based on Multiple Observation Hypothesis Testing
Theodore Petsatodis, Fotios Talantzis, Christos Boukis, Zheng-Hua Tan, Ramjee Prasad
INTERSPEECH3
2011 Convex Combination of Multiple Statistical Models With Application to VAD
abstract
This paper proposes a robust voice activity detector (VAD) based on the observation that the distribution of speech captured with far-field microphones is highly varying, depending on the noise and reverberation conditions. The proposed VAD employs a convex combination scheme comprising three statistical distributions - a Gaussian, a Laplacian, and a two-sided Gamma - to effectively model captured speech. This scheme shows increased ability to adapt to dynamic acoustic environments. The contribution of each distribution to this convex combination is automatically adjusted based on the statistical characteristics of the instantaneous audio input. To further improve the performance of the system, an adaptive threshold is introduced, while a decision-smoothing scheme caters to the intra-frame correlation of speech signals. Extensive experiments under realistic scenarios support the proposed approach of combining several models for increased adaptation and performance.
Theodore Petsatodis, Christos Boukis, Fotios Talantzis, Zheng-Hua Tan, Ramjee Prasad
IEEE Trans. Speech Audio Process.2
2007 Collaborative Adaptive Learning using Hybrid Filters
abstract
A novel stable and robust algorithm for training of finite impulse response adaptive filters is proposed. This is achieved based on a convex combination of the least mean square (LMS) and a recently proposed generalised normalised gradient descent (GNGD) algorithm. In this way, the desirable fast convergence and stability of GNGD is combined with the robustness and small steady state misadjustment of LMS. Simulations on linear and nonlinear signals in the prediction setting support the analysis.
Danilo P. Mandic, Phebe Vayanos, Christos Boukis, Beth Jelfs, Su Lee Goh, Temujin Gautama, Tomasz M. Rutkowski
ICASSP (3)3
2006 Using Hierarchical Filters to Detect Sparseness in Unknown Channels
Christos Boukis, Lazaros Polymenakos
KES (3)1
2006 An Online Method for Detecting Nonlinearity Within a Signal
Beth Jelfs, Phebe Vayanos, Mo Chen 0006, Su Lee Goh, Christos Boukis, Temujin Gautama, Tomasz M. Rutkowski, Tony Kuh, Danilo P. Mandic
KES (3)5
2006 A novel algorithm for the adaptation of the pole of Laguerre filters
abstract
This letter proposes a novel stochastic gradient algorithm for the online adaptation of the pole position in Laguerre filters. The proposed algorithm exploits the inherent relationship between the values of the filter coefficients and the value of the Laguerre pole. This leads to an unbiased solution and, hence, a more accurate estimate of the error gradient. Simulations in a system identification setting support the analysis
Christos Boukis, Danilo P. Mandic, Anthony G. Constantinides, Lazaros Polymenakos
IEEE Signal Process. Lett.1
2003 A gradient adaptive step size algorithm for IIR filters
abstract
The output error method, a fundamental technique for the updating of the coefficients of an adaptive IIR filter, is modified by introducing a time varying step size. The adaptation of this term is based on a gradient descent technique. This scheme can be considered as an extension of the algorithms presented in Benveniste et al. (1990) and Mathews et al. (1993) to IIR filters. The novel algorithm does not require any a priori knowledge of the statistical characteristics of the input signal and the unknown channel, since its step size converges automatically to its optimal value. This algorithm has the ability to converge in time-varying environments, which makes it suitable for processing of nonstationary signals.
Christos Boukis, Danilo P. Mandic, Eftychios V. Papoulis, Anthony G. Constantinides
ICASSP (6)1
2003 A normalized mixed-norm adaptive filtering algorithm robust under impulsive noise interference
abstract
A normalized robust mixed-norm (NRMN) algorithm for system identification in the presence of impulsive noise is introduced. The standard robust mixed-norm (RMN) algorithm, despite its ability to cope with impulsive noise by virtue of combining the first and second error norm in the cost function it minimizes, exhibits slow convergence, requires a stationary operating environment, and employs a constant step-size which needs to be determined a-priori. To overcome these limitations, the proposed NRMN algorithm introduces a time varying learning rate which is derived based upon the dynamics of the input signal, and thus no longer requires a stationary environment, a major drawback of the RMN algorithm. The normalized step-size is bounded from above and a parameter is introduced within its upper-bound, which provides a trade-off between the convergence rate and the steady-state coefficient error. The analysis and experimental results show that the proposed NRMN exhibits increased convergence rate and substantially reduces the steady-state coefficient error, as compared to the least absolute deviation (LAD) and RMN algorithms.
Danilo P. Mandic, Eftychios V. Papoulis, Christos Boukis
ICASSP (6)3