Markov Random Field based small obstacle discovery over images
Authors:
- 1 May 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10504729,p. 494-500
Abstract
Small obstacles of the order of 0.5-3cms and homogeneous scenes often pose a problem for indoor mobile robots. These obstacles cannot be clearly distinguished even with the state of the art depth sensors or laser range finders using existing vision based algorithms. With the advent of sophisticated image processing algorithms like SLIC [1] and LSD [9], it is possible to extract rich information from an image which led us to develop a novel architecture to detect very small obstacles on the floor using a monocular camera. This information is further processed using a Markov Random Field based graph cut formalism that precisely segments the floor and detects obstacles which are extremely low. We show robust and accurate obstacle detection and floor segmentation in diverse environments over a large variety of objects found indoors. In our case, low lying obstacles, changing floor patterns and extremely homogeneous environments are properly classified which leads to a drastic decrease in the number of obstacles that may not be classified by existing robotic vision algorithms.Keywords
This publication has 8 references indexed in Scilit:
- A Bayes filter based adaptive floor segmentation with homography and appearance cues2012
- Mobile robot monocular vision navigation based on road region and boundary estimation2012
- Label propagation in videos indoors with an incremental non-parametric model update2011
- Region Classification for Robust Floor Detection in Indoor EnvironmentsLecture Notes in Computer Science, 2009
- LSD: A Fast Line Segment Detector with a False Detection ControlIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Robust Ground Plane Detection with Normalized Homography in Monocular Sequences from a Robot Platform2006
- Efficient Graph-Based Image SegmentationInternational Journal of Computer Vision, 2004
- What energy functions can be minimized via graph cuts?IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004