Knowledge-Based Building Region Extraction Using Patch-Based Graph Cut

This study proposes a knowledge-based handcrafted building region extraction algorithm that can accurately identify the building and its background from street image at pixel level. The proposed algorithm leverages a customized patch-based graph cut inspired by human visual perception mechanisms. At the patch-based graph cut, the similarity of patches is measured by the cutting-edge deep neural networks (DNNs). The graph settings are based on the knowledge that buildings are captured at the center of the image owing to their main subject. Our experiment, which employed 300 images included in well-known open dataset, demonstrated that the proposed method employing GrabCut for a pixel-level segmentation significantly increased the comprehensive accuracy of building region extraction, which is measured by intersection over union (IoU), by 12.29% or more compared with the conventional knowledge-based method using color segmentation. This stems from the fact that the proposed method presents the more accurate building and background candidates by 8.57% or more. In addition, the GrabCut-based proposed method represented a similar accuracy to the state-of-the-art DNN-based semantic segmentation based on a transformer architecture. Further comparisons and discussions are provided in this paper to clarify the effectiveness of the proposed method.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Information and Systems
Published
2025-06-18
DOI
https://doi.org/10.1587/transinf.2025pcp0006
Primary Topic
Automated Road and Building Extraction
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Knowledge-Based Building Region Extraction Using Patch-Based Graph Cut

Takuya Futagami, Noboru Hayasaka
IEICE Transactions on Information and Systems
Automated Road and Building Extraction
article

Knowledge-Based Building Region Extraction Using Patch-Based Graph Cut

Takuya Futagami, Noboru Hayasaka
article en

Abstract

This study proposes a knowledge-based handcrafted building region extraction algorithm that can accurately identify the building and its background from street image at pixel level. The proposed algorithm leverages a customized patch-based graph cut inspired by human visual perception mechanisms. At the patch-based graph cut, the similarity of patches is measured by the cutting-edge deep neural networks (DNNs). The graph settings are based on the knowledge that buildings are captured at the center of the image owing to their main subject. Our experiment, which employed 300 images included in well-known open dataset, demonstrated that the proposed method employing GrabCut for a pixel-level segmentation significantly increased the comprehensive accuracy of building region extraction, which is measured by intersection over union (IoU), by 12.29% or more compared with the conventional knowledge-based method using color segmentation. This stems from the fact that the proposed method presents the more accurate building and background candidates by 8.57% or more. In addition, the GrabCut-based proposed method represented a similar accuracy to the state-of-the-art DNN-based semantic segmentation based on a transformer architecture. Further comparisons and discussions are provided in this paper to clarify the effectiveness of the proposed method.

IEICE Transactions on Information and SystemsVol. E109.D(1)
Doshisha University (JP), Osaka Electro-Communication University (JP), Aichi Gakuin University (JP)
Openalex Percentile: Top 83%
Automated Road and Building Extraction
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.