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

Harish Krishnamoorthi

dblp:84/7819 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 5 first-authorArtificial intelligence and machine learning · 1Systems, architecture and hardware · 1

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.

Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Audio and music processing
linear prediction
0.112011
Similarities and Differences Between Warped Linear Prediction and Laguerre Linear Prediction · IEEE Trans. Speech Audio Process. 2011
Audio and music processing › linear prediction
warped linear prediction
0.112011
Similarities and Differences Between Warped Linear Prediction and Laguerre Linear Prediction · IEEE Trans. Speech Audio Process. 2011

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

whitening constraint · 0.1reflection coefficient analysis · 0.1
YearPublicationVenuePosition
2013 Sinusoidal component selection based on partial loudness criteria
abstract
Sinusoidal models are widely used in parametric speech and audio coding schemes. A common requirement in these applications is to select only a subset of components that provide the greatest perceptual benefit particularly at low bitrates. Usually, perceptual sinusoidal component selection algorithms make use of greedy algorithms that are computationally expensive. In this paper, we present a new algorithm that selects sinusoidal components based on the partial loudness model proposed by Moore & Glasberg. We compare the performance of the proposed algorithm in terms of perceptual benefit and computational complexity to other existing sinusoidal selection algorithms.
Harish Krishnamoorthi, Andreas Spanias
ICASSP1
2011 Similarities and Differences Between Warped Linear Prediction and Laguerre Linear Prediction
abstract
Linear prediction has been successfully applied in many speech and audio processing systems. This paper presents the similarities and differences between two classes of linear prediction schemes, namely, Warped Linear Prediction (WLP) and Laguerre Linear Prediction (LLP). It is shown that both systems are closely related. In particular, we show that the LLP is in fact a WLP system where the optimization procedure is adapted such that the whitening property is automatically incorporated. The adaptation consists of a new linear constraint on the parameters. Furthermore, we show that an optimized WLP scheme where whitening is achieved by prefiltering before estimating the optimal coefficients results in a filter having all except the last reflection coefficient equal to those of the optimal LLP filter.
Albertus C. den Brinker, Harish Krishnamoorthi, E. A. Verbitskiy
IEEE Trans. Speech Audio Process.2
2010 An auditory-domain based speech enhancement algorithm
abstract
Typically, speech enhancement algorithms minimize a suitable error criterion in the spectral or time domain. Although the error criterions have included perceptual properties such as masking thresholds, non-uniform frequency resolution and sensitivity of the auditory system, these are only done heuristically and the error criterion does not explicitly include an auditory model in their formulation. In this paper, we propose an auditory-domain based speech enhancement algorithm that minimizes the distortion between the auditory representation of the estimated and desired signal. Simulation results indicate that the proposed algorithm performs effectively under different noise conditions and also results in a lower average loudness error.
Harish Krishnamoorthi, Andreas Spanias, Visar Berisha, Homin Kwon, Harvey D. Thornburg
ICASSP1
2009 Low-complexity sinusoidal component selection using loudness patterns
abstract
Sinusoidal modeling of audio at low-bit rates involves selecting a limited number of parameters according to a quantitative or perceptual criterion. Most perceptual sinusoidal component selection strategies are computationally intensive and not suitable for real-time applications. In this paper, a computationally efficient sinusoidal selection algorithm based on a novel hybrid loudness estimation scheme is presented. The hybrid scheme first estimates efficiently the loudness of a multi-tone signal from the loudness patterns of its constituent sinusoidal components. Then it refines this estimate by performing a full evaluation of loudness but only in select critical bands. Experimental results show that the proposed technique maintains a low perceptual sinusoidal synthesis error at a much lower computational complexity.
Harish Krishnamoorthi, Visar Berisha, Andreas Spanias, Homin Kwon
ICASSP1
2009 A Sensor Network for Real-time Acoustic Scene Analysis
abstract
Acoustic scene analysis can be used to extract relevant information in applications such as homeland security, surveillance and environmental monitoring. Wireless sensor networks have been of particular interest in monitoring acoustic scenes. Sensors embedded in such a network typically operate under several constraints such as low power and limited bandwidth. In this paper, we consider resource-efficient acoustic sensing tasks that extract and transmit relevant information to a central station where information assessment can be conducted. We propose a series of acoustic scene analysis tasks that are performed in a hierarchical manner. Hierarchical tasks include sound and speech discrimination, estimation of the number of speakers from the acquired sound, gender and emotional state, and ultimately voice monitoring and key word spotting. We apply support vector machine and Gaussian mixture model algorithms on sound features. A real-time implementation is accomplished using crossbow motes interfaced with a TI DSP board. A series of experiments are presented to characterize the performance of the algorithms under different conditions.
Homin Kwon, Harish Krishnamoorthi, Visar Berisha, Andreas Spanias
ISCAS2
2009 A Frequency/Detector Pruning Approach for Loudness Estimation
abstract
In this letter, we propose a frequency and detector pruning approach for reducing the computational complexity associated with loudness estimation. The frequency pruning approach exploits the principles of psychoacoustics such that the total neural activity is preserved. The detector pruning approach evaluates the excitation/loudness patterns at nonuniform sample locations and employs signal interpolation techniques to obtain their corresponding high resolution estimates. Comparative results with the Moore and Glasberg loudness estimation process reveal that the proposed pruning approach for loudness estimation performs consistently well for different types of audio signals with a significant reduction in the computational complexity.
Harish Krishnamoorthi, Andreas Spanias, Visar Berisha
IEEE Signal Process. Lett.1
2008 A low-complexity loudness estimation algorithm
abstract
Audio processing applications such as rate determination, bandwidth extension, compression, and noise reduction make use of loudness metrics. Most loudness estimation algorithms are computationally expensive and often not suitable for real time applications. In this paper, we present a low-complexity loudness estimation algorithm applicable to both steady and time-varying sounds. The model computes an estimate of the excitation pattern by simultaneously pruning the frequency components and detector locations. Comparative results indicate that the proposed algorithm performs consistently well for different types of audio signals at a reduced complexity.
Harish Krishnamoorthi, Visar Berisha, Andreas Spanias
ICASSP1