Road Extraction Using SVM and Image Segmentation
(2004)

In this paper, a unique approach for road extraction utilizing pixel spectral information for classification and image segmentation-derived object features was developed. In this approach, road extraction was performed in two steps. In the first step, support vector machine (SVM) was employed merely to classify the image into two groups of categories: a road group and a non-road group. For this classification, support vector machine (SVM) achieved higher accuracy than Gaussian maximum likelihood (GML). In the second step, the road group image was segmented into geometrically homogeneous objects using a region growing technique based on a similarity criterion, with higher weighting on shape factors over spectral criteria. A simple thresholding on the shape index and density features derived from these objects was performed to extract road features, which were further processed by thinning and vectorization to obtain road centerlines. The experiment showed the proposed approach worked well with images comprised by both rural and urban area features. Introduction Road information not only plays a central role in the transportation application, but also is an important data layer in Geographical Information Systems (GIS). Automated road extraction can save time and labor to a great degree in updating a road spatial database. Various road extraction approaches have been developed. Xiong (2001) grouped these methods into five categories: ridge finding, heuristic reasoning, dynamic programming, statistical inference, and map matching. In ridge finding, edge operators are performed on images to derive edge magnitude and direction, followed by a thresholding and thinning process to obtain ridge pixels (Nevatia and Babu, 1980; Treash and Amaratunga, 2000). Alternatively, gradient direction profile analysis can be performed to generate edge pixels (Gong and Wang, 1997). Ridge points are linked to produce the road segments. Heuristic reasoning is a knowledge-based method in which a series of pre-set rules on road characteristics such as shape index, the distance between image primitives, fragments trend, and contextual information are employed to detect and connect image primitives or antiparallel linear edges to road segments (McKeown, et al., 1985; Zhu and Yeh, 1986). In the dynamic programming method, roads are modeled with a set of mathematical equations on the derivatives of gray values and select characteristics of roads, such as smooth curves, homogeneous surface, narrow linear features, and relatively constant width. Dynamic programming is employed to solve the optimization problem Road Extraction Using SVM and Image Segmentation Mingjun Song and Daniel Civco (Gruen and Li, 1995). In the statistical inference method, linear features are modeled as a Markov point process or a geometric-stochastic model on the road width, direction, intensity and background intensity, and maximum a posteriori probability is used to estimate the road network (Barzohar and Cooper, 1996; Stoica, et al., 2000). In a map matching method, existing road maps are used as starting point to update the road network. In general, two steps are involved: first, a mapimage matching algorithm is employed to match the roads on the map to the image; second, new roads are searched based on the assumption that they are connected to existing roads (Stilla, 1995). Xiong’s classification on road extraction methods is only a generalization, and some other methods may combine different techniques. Active contour models, known as snakes, are also used in road extraction (Gruen and Li, 1997; Agouris, et al., 2001). A snake is a spline with minimized energy driven by internal spline and external image forces (Park, et al., 2001). In general, external image forces are represented by the gradient magnitude of an image, which attracts snakes to contours with strong edges. Internal forces are given by a continuity term and a curvature term expressed by the differences of adjacent snaxels, which are vertex nodes of the snake, with weights coming from training data, which control the shape and smoothness of the snakes. Through the optimization, the snake evolves from its initial position to desired position with minimized energy. Park and Kim (2001) used template matching to extract road segments in which a road template was formed around the road seed, and an adaptive least squares matching algorithm was used to detect a target window with similar transformation. This method assumes a small difference in brightness values between template and target windows. Most of these road extraction methods require some road seeds as starting points, which are in general provided by users, and road segments evolve under a certain model. Sometimes control points are needed to correct the evolution of roads (Zhao, et al., 2002). Further, these methods use black-and-white aerial photographs or the panchromatic band of high-resolution satellite images and therefore the geometric characteristics of roads alone play a critical role. Boggess (1993) used a classification method incorporating texture and neural networks to extract roads by classifying roads and other features from Landsat TM imagery, but obtained numerous false-inclusions. Roberts, et al. (2001) developed a spectral mixture library using hyperspectral images to extract roads, but the use of spectral information alone does not capture the spatial properties of these curvilinear features. P H OTO G R A M M E T R I C E N G I N E E R I N G & R E M OT E S E N S I N G December 2004 1 3 6 5 Center for Land use Education and Research, Department of Natural Resources Management and Engineering, The University of Connecticut U-4087, 1376 Storrs Road, Storrs, CT 06269-4087 (mingjun.song@uconn.edu, daniel.civco@ uconn.edu). Photogrammetric Engineering & Remote Sensing Vol. 70, No. 12, December 2004, pp. 1365–1371. 0099-1112/04/7012–1365/$3.00/0 © 2004 American Society for Photogrammetry and Remote Sensing LFX-536.qxd 11/9/04 16:13 Page 1365