# Efficient Hierarchical Markov Random Fields for Object Detection on a Mobile Robot

Source: [Efficient Hierarchical Markov Random Fields for Object Detection on a Mobile Robot](<https://www.sota2.com/research/paper/68fa606c1e209131ce9ef459>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T19:39:40.668Z

Authors: Colin S. Lea, Jason J. Corso

Published: 2011-11-07T14:46:16.000Z

## Abstract

Object detection and classification using video is necessary for intelligent planning and navigation on a mobile robot. However, current methods can be too slow or not sufficient for distinguishing multiple classes. Techniques that rely on binary (foreground/background) labels incorrectly identify areas with multiple overlapping objects as single segment. We propose two Hierarchical Markov Random Field models in efforts to distinguish connected objects using tiered, binary label sets. Near-realtime performance has been achieved using efficient optimization methods which runs up to 11 frames per second on a dual core 2.2 Ghz processor. Evaluation of both models is done using footage taken from a robot obstacle course at the 2010 Intelligent Ground Vehicle Competition.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1111.1599>)

[PDF](<https://arxiv.org/pdf/1111.1599.pdf>)