13
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Obstacle Detection in Hybrid Cross-Country Environment Based on Markov Random Field for Unmanned Ground Vehicle

      , , , ,
      Discrete Dynamics in Nature and Society
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          In order to detect the obstacle from the large amount of 3D LIDAR data in hybrid cross-country environment for unmanned ground vehicle, a new graph approach based on Markov random field was presented. Firstly, the preprocessing method based on the maximum blurred line is applied to segment the projection of every laser scan line in x-yplane. Then, based on K -means clustering algorithm, the same properties of the line are combined. Secondly, line segment nodes are precisely positioned by using corner detection method, and the next step is to take advantage of line segment nodes to build an undirected graph for Markov random field. Lastly, the energy function is calculated by means of analyzing line segment features and solved by graph cut. Two types of line mark are finally classified into two categories: ground and obstacle. Experiments prove the feasibility of the approach and show that it has better performance and runs in real time.

          Related collections

          Most cited references12

          • Record: found
          • Abstract: found
          • Article: not found

          An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision.

          After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style "push-relabel" methods and algorithms based on Ford-Fulkerson style "augmenting paths." We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Junior: The Stanford entry in the Urban Challenge

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Bayesian clustering using hidden Markov random fields in spatial population genetics.

              We introduce a new Bayesian clustering algorithm for studying population structure using individually geo-referenced multilocus data sets. The algorithm is based on the concept of hidden Markov random field, which models the spatial dependencies at the cluster membership level. We argue that (i) a Markov chain Monte Carlo procedure can implement the algorithm efficiently, (ii) it can detect significant geographical discontinuities in allele frequencies and regulate the number of clusters, (iii) it can check whether the clusters obtained without the use of spatial priors are robust to the hypothesis of discontinuous geographical variation in allele frequencies, and (iv) it can reduce the number of loci required to obtain accurate assignments. We illustrate and discuss the implementation issues with the Scandinavian brown bear and the human CEPH diversity panel data set.
                Bookmark

                Author and article information

                Journal
                Discrete Dynamics in Nature and Society
                Discrete Dynamics in Nature and Society
                Hindawi Limited
                1026-0226
                1607-887X
                2015
                2015
                : 2015
                :
                : 1-8
                Article
                10.1155/2015/540968
                d12945f9-4114-4a9c-8b4c-a0cb623c3048
                © 2015

                http://creativecommons.org/licenses/by/3.0/

                History

                Comments

                Comment on this article