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

David J. Burr

dblp:96/172 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 1992
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-authorSystems, architecture and hardware · 2Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 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.

Artificial intelligence
5 papers
Speech recognition and synthesis · 48% Image recognition and object detection · 47% 3D vision · 5%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Hardware accelerators and domain-specific architectures · 57% Parallel and multicore computing · 43%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 50% Image and video processing · 50%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis
acoustic modeling
0.011987
Speech Recognition Experiments with Perceptrons · NIPS 1987
Computer vision › Image recognition and object detection
character recognition
0.011983
Designing a Handwriting Reader · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Computer vision › Image recognition and object detection
handwriting recognition
0.011983
Designing a Handwriting Reader · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Image and video processing › image registration
elastic matching
0.011981
Elastic Matching of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Geometric modeling and processing
shape matching
0.011981
Elastic Matching of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Information retrieval › document processing
document analysis
0.011983
Designing a Handwriting Reader · IEEE Trans. Pattern Anal. Mach. Intell. 1983
Computer vision › 3D vision › motion estimation
motion correspondence
0.011981
Elastic Matching of Line Drawings · IEEE Trans. Pattern Anal. Mach. Intell. 1981
Algorithms and data structures › sequence algorithms › string algorithms
string matching
0.011981
An Integrated Multiprocessing Array for Time Warp Pattern Matching · ISCA 1981

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

warp-based matching · 0.0dynamic time warping · 0.0time warp · 0.0perceptron · 0.0non-euclidean error signal · 0.0dynamic elastic model · 0.0backpropagation · 0.0dictionary lookup · 0.0dictionary look-up · 0.0
YearPublicationVenuePosition
1992 Comparison of Gaussian and neural network classifiers on vowel recognition using the discrete cosine transform
abstract
The results of some experiments using a discrete cosine transform (DCT) to represent vowel spectra for classification by a neural network are described. The results are compared to a Gaussian classifier trained on the same database. The results show that the DCT classifies vowels using fewer coefficients than the cepstrum. The neural network classifier performs better than the Gaussian classifier, especially with large input feature sets consisting of delta coefficients and formant/pitch features. Best performance using these features was 58.2%. This compares well with other results reported for these data.>
David J. Burr
ICASSP1
1987 Speech Recognition Experiments with Perceptrons
David J. Burr
NIPS1
1987 Minkowski-r Back-Propagation: Learning in Connectionist Models with Non-Euclidian Error Signals
Stephen Jose Hanson, David J. Burr
NIPS2
1983 Designing a Handwriting Reader
abstract
Computer recognition of cursive handwriting is complisated by the lack of letter separation. In an attempt to gain insight on the cursive problem, the simpler problem of recognizing separated hand-written letters is addressed here. A warp-based character matching technique is employed with dictionary lookup, using a 16 000 word vocabulary. Cooperative users achieve high recognition accuracy with this on-line system, which is easily tailored to the individual. Possible extensions to cursive writing are discussed.
David J. Burr
IEEE Trans. Pattern Anal. Mach. Intell.1
1983 Dynamic Time Warp Pattern Matching Using an Integrated Multiprocessing Array
abstract
Dynamic time warping is a well-established technique for time alignment and comparison of speech and image patterns. This paper decribes the architecture, algorithms, and design of a CMOS integrated processing array used for computing the dynamic time warp algorithm. Emphasis is placed on speech recognition applications because of the real-time constraints imposed by isolated and continuous speech recognition.
Neil Weste, David J. Burr, Bryan D. Ackland
IEEE Trans. Computers2
1981 A high speed array computer for dynamic time warping
abstract
Dynamic time warping is an established technique for time alignment and comparison of speech segments in speech recognition. This paper describes a CMOS integrated array processor for computing the dynamic time warp algorithm. It allows many popular variations including LPC and frequency domain representations of speech. High speed is obtained by extensive pipelining, parallel computation, and simultaneous matching of multiple patterns. A realistic application using 40 nine-component LPC vectors per word permits 10,000 word comparisons per second or, equivalently, real time recognition of a 10,000 word vocabulary.
David J. Burr, Bryan D. Ackland, Neil Weste
ICASSP1
1981 An Integrated Multiprocessing Array for Time Warp Pattern Matching
Bryan D. Ackland, Neil Weste, David J. Burr
ISCA3
1981 Elastic Matching of Line Drawings
abstract
Recently a dynamic elastic model [1] was proposed for automatic image matching. Examples were shown applying the model to dot patterns and gray scale pictures. This paper extends the model to line drawings. Examples are shown on handprint and animation, suggesting the use of dynamic matching for shape recognition and for motion correspondence.
David J. Burr
IEEE Trans. Pattern Anal. Mach. Intell.1