Review Article

Conditional Random Fields for Image Labeling

Table 1

Quantitative comparison on Leuven dataset of [1]. The table compares the average time per image and performance (object and stereo labeling accuracy) of joint object and stereo algorithms, using graph cut + range-move (GC + Range ()), an extension of cost-volume filtering, and [1]’s dense CRF with higher-order terms and filter-based inference (with and without cost-volume filtered unary, and using different approaches). HO means higher-order terms of [1] in the table.

AlgorithmTime (s)Object (% correct)Stereo (% correct)

GC + Range () [4]24.695.9476.97
GC + Range () [4]49.995.9477.31
GC + Range () [4]74.495.9477.46
Extended CostVol ([39] filter)4.295.2077.18
Dense + HO ([39] filter)3.195.2478.89
Dense_HO ([58] filter)2.195.0678.21
Dense + HO + CostVol ([58] filter)6.394.9879.00