While Graph Cuts are used for image segmentation, there exist two problems: how to get better initial information of
foreground and background and how to improve the executing efficiency of Graph Cuts algorithm. To solve the first
problem, path morphology and line segment matching algorithm are performed to get initial background information at
the same time as getting initial foreground information, so non-road pixels similar with road pixels in gray value or
texture are avoided being segmented as road points. To cope with the second problem, push-relabel strategy is chosen
and its parallelized version based on NVIDIA CUDA platform is performed in this paper. Our strategy is performed on
dense built-up area and suburban district and proved to be effective in both accuracy and efficiency.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.