TY - GEN
T1 - Optimization of facade segmentation based on layout priors
AU - Fathalla, Radwa
AU - Vogiatzis, George
N1 - © 2017 Springer Publishing.
PY - 2017
Y1 - 2017
N2 - We propose an algorithm that provides a pixel-wise classification of building facades. Building facades provide a rich environment for testing semantic segmentation techniques. They come in a variety of styles affecting appearance and layout. On the other hand, they exhibit a degree of stability in the arrangement of structures across different instances. Furthermore, a single image is often composed of a repetitive architectural pattern. We integrate appearance, layout and repetition cues in a single energy function, that is optimized through the TRW-S algorithm to provide a classification of superpixels. The appearance energy is based on scores of a Random Forrest classifier. The feature space is composed of higher-level vectors encoding distance to structure clusters. Layout priors are obtained from locations and structural adjacencies in training data. In addition, priors result from translational symmetry cues acquired from the scene itself through clustering via the α -expansion graphcut algorithm. We are on par with state-of-the-art. We are able to fine tune classifications at the superpixel level, while most methods model all architectural features with bounding rectangles.
AB - We propose an algorithm that provides a pixel-wise classification of building facades. Building facades provide a rich environment for testing semantic segmentation techniques. They come in a variety of styles affecting appearance and layout. On the other hand, they exhibit a degree of stability in the arrangement of structures across different instances. Furthermore, a single image is often composed of a repetitive architectural pattern. We integrate appearance, layout and repetition cues in a single energy function, that is optimized through the TRW-S algorithm to provide a classification of superpixels. The appearance energy is based on scores of a Random Forrest classifier. The feature space is composed of higher-level vectors encoding distance to structure clusters. Layout priors are obtained from locations and structural adjacencies in training data. In addition, priors result from translational symmetry cues acquired from the scene itself through clustering via the α -expansion graphcut algorithm. We are on par with state-of-the-art. We are able to fine tune classifications at the superpixel level, while most methods model all architectural features with bounding rectangles.
UR - http://www.scopus.com/inward/record.url?scp=85028517479&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-64689-3_16
DO - 10.1007/978-3-319-64689-3_16
M3 - Conference publication
AN - SCOPUS:85028517479
SN - 978-3-3196-4688-6
T3 - Lecture Notes in Computer Science
SP - 196
EP - 207
BT - Computer Analysis of Images and Patterns - 17th International Conference, CAIP 2017, Proceedings
A2 - Felsberg, M.
A2 - Heyden, A.
A2 - Krüger, N.
PB - Springer
CY - Cham, CH
T2 - 17th International Conference on Computer Analysis of Images and Patterns, CAIP 2017
Y2 - 22 August 2017 through 24 August 2017
ER -