Abstract
Making use of a Markovian boundary generation model, a dynamic programming algorithm is presented for estimating short boundary segments. Certain choices for the transition probabilities associated with the underlying Markov process are presented, and a method is described for analyzing the performance of the dynamic programming algorithm when each of these is used. Finally the short segment estimator is incorporated into a complete boundary estimation algorithm and examples of its performance are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
