Coarse-to-Fine Dynamic Programming

No abstract is available for this paper.

• Publication year

  2001

• Venue

  IEEE Transactions on Pattern Analysis and Machine Intelligence

• Publication date

  2001-12-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/34.977562
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Omnifont Open-Vocabulary OCR System for English and Arabic

  1999cited by this paper
• Dynamic Programming Generation of Curves on Brain Surfaces

  1998cited by this paper
• A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes

  1998cited by this paper
• SANDROS: a dynamic graph search algorithm for motion planning

  1998cited by this paper
• Dynamic programming algorithms for maximum likelihood decoding

  1998cited by this paper
• Detection and Remediation Technologies for Mines and Minelike Targets II

  1997cited by this paper
• Grammatical approach to mine detection

  1997cited by this paper
• New Prospects in Line Detection by Dynamic Programming

  1996cited by this paper
• Handwritten Word Recognition Using Segmentation-Free Hidden Markov Modeling and Segmentation-Based Dynamic Programming Techniques

  1996cited by this paper
• Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours

  1995cited by this paper
• Efficient search and hierarchical motion planning by dynamically maintaining single-source shortest paths trees

  1995cited by this paper
• Heuristic image decoding using separable source models

  1994cited by this paper
• Document image decoding using Markov source models

  1993cited by this paper
• New heuristic algorithms for efficient hierarchical path planning

  1991cited by this paper
• ON COMPLEXITY OF TRELLIS STRUCTURE OF LINEAR BLOCK CODES

  1990cited by this paper
• A hierarchical strategy for path planning among moving obstacles [mobile robot]

  1989cited by this paper
• Large-vocabulary speaker-independent continuous speech recognition: the sphinx system

  1988cited by this paper
• On large-vocabulary speaker-independent continuous speech recognition

  1988cited by this paper
• Minimal trellises for block codes

  1988cited by this paper
• Multiresolution path planning for mobile robots

  1986cited by this paper
• Heuristics : intelligent search strategies for computer problem solving

  1984influential reference
• A Maximum Likelihood Approach to Continuous Speech Recognition

  1983cited by this paper
• Principles of Artificial Intelligence

  1980cited by this paper
• Efficient maximum likelihood decoding of linear block codes using a trellis

  1978cited by this paper
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths

  1968influential reference
• Calculus of Variations

  1954cited by this paper

• A Dynamic Programming Approach for the Brachistochrone Problem

  2025cites this paper
• Experimental Curves Segmentation Using Variable Resolution

  2023cites this paper
• Using an $$A^*$$ A ∗ -based framework for decomposing combinatorial optimization problems to employ NISQ computers

  2023cites this paper
• Dynamic Programming Based Rapid Energy Management of Hybrid Electric Vehicles with Constraints on Smooth Driving, Battery State-of-Charge and Battery State-of-Health

  2022cites this paper
• Coarse-To-Fine And Cross-Lingual ASR Transfer

  2021cites this paper
• Efficient hybrid multiobjective optimization of pressure swing adsorption

  2021cites this paper
• Mathematical optimization of rolling stock rotations

  2017cites this paper
• Image-to-Markup Generation with Coarse-to-Fine Attention

  2016cites this paper
• The Spurious Path Problem in Abstraction

  2015cites this paper
• Shape Retrieval With Geometrically Characterized Contour Partitions

  2015cites this paper
• Fast and accurate video annotation using dense motion hypotheses

  2014cites this paper
• A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem

  2014cites this paper
• 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, Wroclaw, Poland, September 11, 2014

  2014cites this paper
• Autofocus for a multiscale gigapixel camera.

  2013cites this paper
• Analysis of Micro-Macro Transformations of Railway Networks

  2013cites this paper
• Coarse-to-Fine Semantic Video Segmentation Using Supervoxel Trees

  2013cites this paper
• Efficient inference algorithms for near-deterministic systems

  2013cites this paper
• Korf's Conjecture and the Future of Abstraction-Based Heuristics

  2013cites this paper
• MAP Inference in Chains using Column Generation

  2012cites this paper
• Iterative Viterbi A* Algorithm for K-Best Sequential Decoding

  2012cites this paper
• Hierarchical multiresolution models for fast object detection

  2012cites this paper
• Dual Decomposition for Natural Language Processing

  2011cites this paper
• A temporally abstracted Viterbi algorithm

  2011cites this paper
• Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models

  2011cites this paper
• A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths

  2011influential citation
• Dynamic Programming and Graph Algorithms in Computer Vision

  2011influential citation
• Hierarchical Methods for Optimal Long-Term Planning

  2011cites this paper
• Approximate inference in graphical models using lp relaxations

  2010cites this paper
• Computational Methods for Meiotic Recombination Inference

  2010influential citation
• Dyna: Extending Datalog for Modern AI

  2010cites this paper
• Clusters and Coarse Partitions in LP Relaxations

  2008cites this paper
• Coarse-to-Fine Search Techniques

  2008cites this paper
• Hybrid Hierarchical Motion Planning

  2008cites this paper
• Learning and Recognition of Time-Series Data Based on Self-Organizing Incremental Neural Network

  2008cites this paper
• An entagled Bayesian gestalt : Mean-field, Monte- Carlo and Quantum Inference in Hierarchical Perception

  2008cites this paper
• The Generalized A* Architecture

  2007influential citation
• Hierarchical motion planning under uncertainty

  2007cites this paper
• Object tracking by energy maximization

  2006cites this paper
• On the resolution of local ambiguity in visual recognition: Modeling by tree-structured Markov random fields

  2005cites this paper
• Hierarchical dynamic programming for robot path planning

  2005cites this paper
• Improvement in TF-IDF scheme for Web pages based on the contents of their hyperlinked neighboring pages

  2005cites this paper
• Inferring score level musical information from low-level musical data

  2005cites this paper
• This Document Gives Full References to the Papers Cited in the Slides for Robert Holte's Aaai 2005 Tutorial " Where Do Heuristics Come from ? (the Use of Abstraction to Speed up Search) " , plus a Few Extra References

  2005cites this paper
• Fast Elastic Image Matching Algorithm Based on Coarse-to-Fine DP

  2004influential citation
• Stereo Disparity Estimation in Moment Space

  2003cites this paper
• A Coarse-to-Fine Deformable Contour Optimization Framework

  2003influential citation
• Evidence-based object tracking via global energy maximization

  2003cites this paper
• Interactive shape models

  2003cites this paper
• Feature tracking in an energy maximization framework

  2003cites this paper
• Evidence-based object tracking via global energy maximization

  2003cites this paper
• Dynamic programming and the graphical representation of error-correcting codes

  2001cites this paper
• Content-Based Image Retrieval ( CBIR ) of Biomedical Images A report to the Board of Scientific Counselors September 26-27 , 2002 Communications Engineering

  year unknowncites this paper