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.

Dinoj Surendran

dblp:75/4292 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2010
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-authorArtificial intelligence and machine learning · 3 · 3 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.

Computer graphics and multimedia
1 paper
Image and video processing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
gradient-domain image processing
0.112010
Distributed gradient-domain processing of planar and spherical images · ACM Trans. Graph. 2010
Image and video processing › omnidirectional image processing
spherical image processing
0.112010
Distributed gradient-domain processing of planar and spherical images · ACM Trans. Graph. 2010
Distributed systems › distributed data processing
distributed image processing
0.012010
Distributed gradient-domain processing of planar and spherical images · ACM Trans. Graph. 2010

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

streaming computation · 0.2spherical parameterization with bounded distortion · 0.2latency hiding · 0.2band partitioning · 0.2
YearPublicationVenuePosition
2010 Distributed gradient-domain processing of planar and spherical images
abstract
Gradient-domain processing is widely used to edit and combine images. In this article we extend the framework in two directions. First, we adapt the gradient-domain approach to operate on a spherical domain, to enable operations such as seamless stitching, dynamic-range compression, and gradient-based sharpening over spherical imagery. An efficient streaming computation is obtained using a new spherical parameterization with bounded distortion and localized boundary constraints. Second, we design a distributed solver to efficiently process large planar or spherical images. The solver partitions images into bands, streams through these bands in parallel within a networked cluster, and schedules computation to hide the necessary synchronization latency. We demonstrate our contributions on several datasets including the Digitized Sky Survey, a terapixel spherical scan of the night sky.
Michael M. Kazhdan, Dinoj Surendran, Hugues Hoppe
ACM Trans. Graph.2
2008 Can voice quality improve mandarin tone recognition?
abstract
We investigate several measures of voice quality (VQ) to improve tone recognition in Mandarin Chinese. We find that band energy measures such as spectral balance (Sluijter and van Heuven, 1996) work better than measures based on glottal flow estimation and harmonic-formant differences. We also determine a set of bands and measures that improve tone classification accuracy on broadcast news speech to 64.1% from 60.4% when added to a traditional pitch-duration-intensity set of features. Most improvement is for the neutral tone, for which the F score increases from 0.345 to 0.619.
Dinoj Surendran, Gina-Anne Levow
ICASSP1
2006 Dialog act tagging with support vector machines and hidden Markov models
abstract
We use a combination of linear support vector machines and hidden markov models for dialog act tagging in the HCRC MapTask corpus, and obtain better results than those previously reported. Support vector machines allow easy integration of sparse highdimensional text features and dense low-dimensional acoustic features, and produce posterior probabilities usable by sequence labelling algorithms. The relative contribution of text and acoustic features for each class of dialog act is analyzed. 1.
Dinoj Surendran, Gina-Anne Levow
INTERSPEECH1
2006 Automating the Creation of Interactive Glyph-supplemented Scatterplots for Visualizing Algorithm Results
Dinoj Surendran
HLT-NAACL1
2005 Tone recognition in Mandarin using focus
abstract
Native speakers of Mandarin produce and perceive tones in ways that depend on the focus with which each word is produced [1]. This paper gives one approach to improving tone recognition algorithms using focus, by training different support vector machines on syllables conditional on their position with respect to the focused word in a sentence. In a four-way tone classification task on focus-labelled laboratory Mandarin speech data collected by Xu [2], error rates improve from 15.2% without using focus to 8.7% when using focus. Using the fact that tones on syllables in focused words are especially easy to recognize, we propose a tone recognition algorithm that makes use of focus without requiring focus labels in either training or test set. The algorithm has an error rate of 9.8% on this data set.
Dinoj Surendran, Gina-Anne Levow
INTERSPEECH1