TY - GEN
T1 - Evolutionary segment selection for higher-order conditional random fields in semantic image segmentation
AU - Habibie, Novian
AU - Dewanto, Vektor
AU - Chandra, Jogie
AU - Ikhwantri, Fariz
AU - Santoso, Harry Budi
AU - Jatmiko, Wisnu
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2016/2/19
Y1 - 2016/2/19
N2 - One promising approach for pixel-wise semantic segmentation is based on higher-order Conditional Random Fields (CKFs). We aim to selectively choose segments for the higher-order CRFs in semantic segmentation. To this end, we formulate the selection as an optimization problem. We propose three optimization criteria in relation to the selected segments, namely: a) averaged goodness, b) coverage area and c) non-overlapped area. Essentially, we desire to have best segments with maximum coverage area and maximum non-overlapped area. We apply two evolutionary optimization algorithms, namely: the genetic algorithm (GA) and the particle swarm optimization (PSO). The goodness of segments is estimated using the Latent Dirichlet Allocation approach. Experiment results show that semantic segmentation with GA-or-PSO-selected segments yields competitive semantic segmentation accuracy in comparison to that of naively using all segments. Moreover, the fewer number of segments used in semantic segmentation speeds up its computation time up to six times faster.
AB - One promising approach for pixel-wise semantic segmentation is based on higher-order Conditional Random Fields (CKFs). We aim to selectively choose segments for the higher-order CRFs in semantic segmentation. To this end, we formulate the selection as an optimization problem. We propose three optimization criteria in relation to the selected segments, namely: a) averaged goodness, b) coverage area and c) non-overlapped area. Essentially, we desire to have best segments with maximum coverage area and maximum non-overlapped area. We apply two evolutionary optimization algorithms, namely: the genetic algorithm (GA) and the particle swarm optimization (PSO). The goodness of segments is estimated using the Latent Dirichlet Allocation approach. Experiment results show that semantic segmentation with GA-or-PSO-selected segments yields competitive semantic segmentation accuracy in comparison to that of naively using all segments. Moreover, the fewer number of segments used in semantic segmentation speeds up its computation time up to six times faster.
UR - http://www.scopus.com/inward/record.url?scp=84964466763&partnerID=8YFLogxK
U2 - 10.1109/ICACSIS.2015.7415150
DO - 10.1109/ICACSIS.2015.7415150
M3 - Conference contribution
AN - SCOPUS:84964466763
T3 - ICACSIS 2015 - 2015 International Conference on Advanced Computer Science and Information Systems, Proceedings
SP - 249
EP - 255
BT - ICACSIS 2015 - 2015 International Conference on Advanced Computer Science and Information Systems, Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Conference on Advanced Computer Science and Information Systems, ICACSIS 2015
Y2 - 10 October 2015 through 11 October 2015
ER -