• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 9,662
Next 10 →

Maximum likelihood linear regression for speaker adaptation of continuous density hidden Markov models

by C. J. Leggetter, P. C. Woodland , 1995
"... ..."
Abstract - Cited by 818 (7 self) - Add to MetaCart
Abstract not found

Contour Tracking By Stochastic Propagation of Conditional Density

by Michael Isard, Andrew Blake , 1996
"... . In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent s ..."
Abstract - Cited by 661 (23 self) - Add to MetaCart
. In Proc. European Conf. Computer Vision, 1996, pp. 343--356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent

The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding

by Thomas J. Richardson, RĂ¼diger L. Urbanke , 2001
"... In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract - Cited by 574 (9 self) - Add to MetaCart
In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly

Performance of optical flow techniques

by J. L. Barron, D. J. Fleet, S. S. Beauchemin - INTERNATIONAL JOURNAL OF COMPUTER VISION , 1994
"... While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential, ..."
Abstract - Cited by 1325 (32 self) - Add to MetaCart
While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential

The Vector Field Histogram -- Fast Obstacle Avoidance For Mobile Robots

by J. Borenstein, Y. Koren - IEEE JOURNAL OF ROBOTICS AND AUTOMATION , 1991
"... A new real-time obstacle avoidance method for mobile robots has been developed and implemented. This method, named the vector field histogram(VFH), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward the target. The VFH method uses a ..."
Abstract - Cited by 484 (24 self) - Add to MetaCart
suitable sector from among all polar histogram sectors with a low polar obstacle density, and the steering of the robot is aligned with that direction. Experimental results from a mobile robot traversing densely cluttered obstacle courses in smooth and continuous motion and at an average speed of 0.6 0.7m

MAP Estimation of Continuous Density HMM: Theory and Applications

by Jean-luc Gauvain, Chin-hui Lee - In: Proceedings of DARPA Speech and Natural Language Workshop , 1992
"... We discuss maximum a posteriori estimation of continuous density hidden Markovmodels(CDHMM).The classical MLE reestimation algorithms, namely the forward-backward algorithm and the segmental k-means algorithm, are expanded and reestimation formulas are given for HMM with Gaussian mixture observation ..."
Abstract - Cited by 31 (6 self) - Add to MetaCart
We discuss maximum a posteriori estimation of continuous density hidden Markovmodels(CDHMM).The classical MLE reestimation algorithms, namely the forward-backward algorithm and the segmental k-means algorithm, are expanded and reestimation formulas are given for HMM with Gaussian mixture

Continuous Density Queries for Moving Objects

by Xing Hao, Xiaofeng Meng, Jianliang Xu
"... Monitoring dense areas, where the density of moving ob-jects is higher than the given threshold, has many applica-tions like traffic control, bandwidth management, and col-lision probability evaluation. Although many studies have been done on density queries for moving objects in highly dynamic scen ..."
Abstract - Add to MetaCart
scenarios, they all focused on how to answer snap-shot density queries. In this paper, we focus on continuously monitoring dense regions for moving objects. Based on the notion of safe interval, we propose effective algorithms to evaluate and keep track of dense regions. Experimental re-sults show that our

Central Gaussian semigroups of measures with continuous density

by A. Bendikov, L. Saloff-Coste - J. Funct. Anal , 1999
"... This paper investigates the existence and properties of symmetric central Gaussian semigroups ( t ) t>0 which are absolutely continuous and have a continuous density x 7! t (x), t > 0, with respect to Haar measure on groups of the form R n K where K is compact connected locally connecte ..."
Abstract - Cited by 10 (8 self) - Add to MetaCart
This paper investigates the existence and properties of symmetric central Gaussian semigroups ( t ) t>0 which are absolutely continuous and have a continuous density x 7! t (x), t > 0, with respect to Haar measure on groups of the form R n K where K is compact connected locally

MAP Estimation of Continuous Density HMM: Theory and Applications

by Jean-luc Gauvain T, Chin-hui Lee
"... We discuss maximum a posteriori estimation of continuous density hidden Markov models (CDHMM). The classical MLE reestimation algorithms, namely the forward-backward algorithm and the segmental k-means algorithm, are expanded and reestimation formulas are given for HMM with Gaussian mixture observat ..."
Abstract - Add to MetaCart
We discuss maximum a posteriori estimation of continuous density hidden Markov models (CDHMM). The classical MLE reestimation algorithms, namely the forward-backward algorithm and the segmental k-means algorithm, are expanded and reestimation formulas are given for HMM with Gaussian mixture

Parameterisation of a Stochastic Model for Human Face Identification

by F. S. Samaria, F. S. Samaria *t, A.C. Harter, Old Addenbrooke's Site , 1994
"... Recent work on face identification using continuous density Hidden Markov Models (HMMs) has shown that stochastic modelling can be used successfully to encode feature information. When frontal images of faces are sampled using top-bottom scanning, there is a natural order in which the features appe ..."
Abstract - Cited by 398 (0 self) - Add to MetaCart
Recent work on face identification using continuous density Hidden Markov Models (HMMs) has shown that stochastic modelling can be used successfully to encode feature information. When frontal images of faces are sampled using top-bottom scanning, there is a natural order in which the features
Next 10 →
Results 1 - 10 of 9,662
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University