Comparison of belief propagation and graph-cut approaches for contextual classification of 3D lidar point cloud data
暂无分享,去创建一个
[1] Vladimir Kolmogorov,et al. An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Stefan Hinz,et al. Semantic point cloud interpretation based on optimal neighborhoods, relevant features and efficient classifiers , 2015 .
[3] F. Rottensteiner,et al. Classification of urban LiDAR data using conditional random field and random forests , 2013, Joint Urban Remote Sensing Event 2013.
[4] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[5] Martial Hebert,et al. Contextual classification with functional Max-Margin Markov Networks , 2009, CVPR.
[6] William T. Freeman,et al. Understanding belief propagation and its generalizations , 2003 .
[7] William T. Freeman,et al. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[8] O. Barinova,et al. NON-ASSOCIATIVE MARKOV NETWORKS FOR 3D POINT CLOUD CLASSIFICATION , 2010 .
[9] Jr. G. Forney,et al. The viterbi algorithm , 1973 .
[10] Olga Veksler,et al. Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..
[11] Andrew McCallum,et al. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.
[12] C. Mallet,et al. AIRBORNE LIDAR FEATURE SELECTION FOR URBAN CLASSIFICATION USING RANDOM FORESTS , 2009 .
[13] Konrad Schindler,et al. FAST SEMANTIC SEGMENTATION OF 3D POINT CLOUDS WITH STRONGLY VARYING DENSITY , 2016 .