<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">ARS</journal-id><journal-title-group><journal-title>Advances in Remote Sensing</journal-title></journal-title-group><issn pub-type="epub">2169-267X</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ars.2014.34019</article-id><article-id pub-id-type="publisher-id">ARS-52719</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject></subj-group></article-categories><title-group><article-title>
 
 
  Road Vector Map Change Monitoring Based on High Resolution Remote Sensing Images
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>ing</surname><given-names>Yang</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Lulin</surname><given-names>Zhang</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Haitao</surname><given-names>Wang</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Yong</surname><given-names>Zhang</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>School of Remote Sensing and Information Engineering, Wuhan University, Wuhan, China</addr-line></aff><aff id="aff2"><addr-line>Hubei Institute of Photogrammetry and Remote Sensing, Wuhan, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>yangting0808@163.com(IY)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>28</day><month>11</month><year>2014</year></pub-date><volume>03</volume><issue>04</issue><fpage>272</fpage><lpage>279</lpage><history><date date-type="received"><day>24</day>	<month>October</month>	<year>2014</year></date><date date-type="rev-recd"><day>24</day>	<month>November</month>	<year>2014</year>	</date><date date-type="accepted"><day>23</day>	<month>December</month>	<year>2014</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Some studies about road vector map change detection were done in this paper. Firstly, on the basis of old road vector data, the original high resolution remote sensing image was cut into segments. Then, gray analysis and edge extraction of those segments were done so that changes of roads could be detected. Finally, according to the vector data and gray information of roads which were not changed, road templates were extracted and saved automatically. This method was performed on the World View high resolution image of certain parts in the country. The detection result shows that detection correctness is 79.56% and completeness can reach 97.72%. Moreover, the extracted road templates are essentials for the template matching method of road extraction.
 
</p></abstract><kwd-group><kwd>Road Vector</kwd><kwd> High Resolution Remote Sensing Image</kwd><kwd> Edge Extraction</kwd><kwd> Change Monitoring</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Nowadays, researchers tend to study the road information on remote sensing images from two aspects, road extraction and road change detection.</p><p>Considerable work on the study of road extraction has been done by domestic and foreign scholars. The ribbon snake and ziplock snake methods were used for extracting road line by Laptev I [<xref ref-type="bibr" rid="scirp.52719-ref1">1</xref>] . Xiangyun Hu [<xref ref-type="bibr" rid="scirp.52719-ref2">2</xref>] and S. R. Park and T. Kim [<xref ref-type="bibr" rid="scirp.52719-ref3">3</xref>] used the least squares template to detect road. After obtaining the center points of road line according to parallel lines information, the candidate points were extracted with a self-organizing road map (SORM) to connect to the road network [<xref ref-type="bibr" rid="scirp.52719-ref4">4</xref>] . As proposed by Q. P. Zhang [<xref ref-type="bibr" rid="scirp.52719-ref5">5</xref>] , the road cluster is automatically identified using a fuzzy classifier based on a set of predefined road surface membership functions. An iterative and localized Radon transform is developed for the extraction of road, which is grouped into a road network. M. Wang, C. J. Luo, C. W. Zhou, et al. [<xref ref-type="bibr" rid="scirp.52719-ref6">6</xref>] studied road geometry model as a recognition of the road and M. Barzohar and D. B. Cooper [<xref ref-type="bibr" rid="scirp.52719-ref7">7</xref>] build geometric-probabilistic models for road image generation. Z. J. Huang, J. F. Zhang and F. J, Xu [<xref ref-type="bibr" rid="scirp.52719-ref8">8</xref>] presented a multi-stage method, consisting of automatic information extraction and semi- automatic post-processing, which aimed to extract better road information from images. Although a lot of researches on the roads have been done, it is still difficult to extract various types of road completely because of the complexity of the road information.</p><p>In view of the difficulty of extracting the road, many researchers consider using existing road information to detect the change of road information. As pointed by [<xref ref-type="bibr" rid="scirp.52719-ref9">9</xref>] , there are two modes of road change detection: the first is detecting after change detection, and the second is detecting in synchronization with the image registration. Matching remote sensing images with the existing road vectors can be of help to detect the change of road information, according to M. Dong, H. T. Zhang, X. K. Zhu, et al. [<xref ref-type="bibr" rid="scirp.52719-ref10">10</xref>] . Also, H. J. Ma and N. Lu [<xref ref-type="bibr" rid="scirp.52719-ref11">11</xref>] implemented extraction of road segments in the earthquake disaster area by matching the new images with the old ones.</p><p>Road change detection includes two types, namely disappearance of the existed road and extraction of the new road. The method proposed by this paper mainly solves the change detection of the old roads. At the same time, this method extracts the road template library, which provides important information for detection and extraction of new roads.</p><p>The images and vectors used in this paper are processed by the method of automatic registration proposed by L. P. Lu, Y. Zhang, P. J. Tao, et al. [<xref ref-type="bibr" rid="scirp.52719-ref12">12</xref>] . In addition, in this paper, the Hough transform based on the infinite symmetric exponential filter (ISEF) is presented to gain road edges, and then road change detection follows.</p></sec><sec id="s2"><title>2. Change Detection Method</title><p>This section introduces the detection algorithm for old vectors based on new high resolution remote sensing image. The specific process flow chart is shown as followed in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><sec id="s2_1"><title>2.1. Douglas Peucker Algorithm for Vector Compression</title><p>The purpose of curve compression is to reduce the number of points required to present the line within the allowable error limit. Based on the idea of the curve compression, Douglas Peucker algorithm [<xref ref-type="bibr" rid="scirp.52719-ref13">13</xref>] was adopted in this paper. With referenced <xref ref-type="fig" rid="fig2">Figure 2</xref>, the compression of the vector P<sub>1</sub>P<sub>n</sub> is described as follows,</p><p>1) Calculate all the distances from vector nodes (P<sub>2</sub>, P<sub>3</sub>, …, P<sub>n−1</sub>) to line P<sub>1</sub>P<sub>n</sub>;</p><p>2) Find the farthest point P<sub>i</sub> and record the distance (D<sub>i</sub>) from P<sub>i</sub> to line P<sub>1</sub>P<sub>n</sub>;</p><p>3) Keep point P<sub>1 </sub>and point P<sub>n</sub> and remove all other points if D<sub>i </sub>is less than the given threshold;</p><p>4) Iterate steps (1)-(3) for P<sub>1</sub>P<sub>i</sub> and P<sub>i</sub>P<sub>n </sub>respectively if D<sub>i</sub> is more than given threshold.</p><p>The threshold is set to 3 pixels in this paper.</p></sec><sec id="s2_2"><title>2.2. Coordinate Transformation for Segment</title><p>The original image is divided into segments based on vector segment’s bounding rectangle. After coordinate transformation, the horizontal axis parallels with the direction of vector segment and vertical axis is perpendicular to the direction of vector. In the new coordinates, direction of roads is approximately closer to horizontal axis, which provides convenient conditions for extracting edges and detecting changes.</p></sec><sec id="s2_3"><title>2.3. ISEFHough Edge Extraction</title><sec id="s2_3_1"><title>2.3.1. ISEF Filtering Algorithm</title><p>The purpose of image preprocessing is to weaken false edges generated by the image noise and enhance right edge information. M. Sharifi, M. Fathy, M. T. Mahmoudi [<xref ref-type="bibr" rid="scirp.52719-ref14">14</xref>] discussed the advantages and disadvantages of some edge detection algorithms and showed that the infinite symmetric exponential filter (ISEF) exhibited better performances under noisy conditions. ISEF derives from IIR exponential smoothing filter, but it is not sensitive to noise and easy recursive. It can calculate the direction of edge while detecting edges [<xref ref-type="bibr" rid="scirp.52719-ref15">15</xref>] . Besides, ISEF extract less false edges and keep more significant ones, which are just what we need.</p><p>One-dimensional ISEF can be written as,</p><disp-formula id="scirp.52719-formula254"><label>(1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x5.png"  xlink:type="simple"/></disp-formula><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Process flow chart of road change detection</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x6.png"/></fig><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Vector compression</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x7.png"/></fig><p>where, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/5-2630115x8.png" xlink:type="simple"/></inline-formula>and</p><disp-formula id="scirp.52719-formula255"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x9.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.52719-formula256"><label>(3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x10.png"  xlink:type="simple"/></disp-formula><p>Exponential filter can be implemented using recursive algorithm, and for two-dimensional images: define the input image as s<sub>0</sub>(x, y), a two-dimensional exponential filter as f(x, y) and the output image as s(x, y), so</p><disp-formula id="scirp.52719-formula257"><label>(4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x11.png"  xlink:type="simple"/></disp-formula><p>Thanks to the separability of two-dimensional exponential filter, s(x,y) can be expressed as,</p><disp-formula id="scirp.52719-formula258"><label>(5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x12.png"  xlink:type="simple"/></disp-formula></sec><sec id="s2_3_2"><title>2.3.2. ISEFHough Line Extraction Algorithm</title><p>Hough transform edge detection takes advantage of voting statistics method, which avoids false edges caused by partial occlusion. ISEFHough not only extracts road edges, but also accurately computes gradient direction of edge points. s<sub>x</sub>(x, y), s<sub>y</sub>(x, y) can be derived from the Formula (5),as follows,</p><disp-formula id="scirp.52719-formula259"><label>(6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x13.png"  xlink:type="simple"/></disp-formula><p>Therefore, it can be obtained that</p><p>Gradient Magnitude:</p><disp-formula id="scirp.52719-formula260"><label>(7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x14.png"  xlink:type="simple"/></disp-formula><p>Gradient Angle:</p><disp-formula id="scirp.52719-formula261"><label>(8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/5-2630115x15.png"  xlink:type="simple"/></disp-formula><p>The straight line detection algorithm is described as follows,</p><p>1) Calculate the partial derivatives s<sub>x</sub>(x, y), s<sub>y</sub>(x, y) of each pixel, according to the Formula (6).</p><p>2) Compute the Gradient Magnitude and Gradient Angle in accordance with the Formulas (6)-(7), and find edge point by determine whether the obtained point has maximum magnitude along the gradient direction.</p><p>3) Discretize parameter space (k, b), forming a two-dimensional M &#215; N matrix accumulation para[i, j]. First, this accumulation matrix is initialized to zero for all the cells. Then, for each edge point, according to y = k &#215; x + b, use increment iteration to obtain para[i, j]. Finally, do non maximum suppression for para[i, j].</p><p>4) If the value para[i, j] corresponding to the final vote (k, b) is less than a given threshold T, determine that there is no edge points. Otherwise, draw a straight line at the edge of the image space.</p><p><xref ref-type="fig" rid="fig3">Figure 3</xref> shows the results of ISEFHough line extraction process. In this experiment, ISEF is decomposed into forward and reverse recursive filtering in row and column respectively, which is used for preprocessing and <xref ref-type="fig" rid="fig3">Figure 3</xref>(b) shows the filter result of <xref ref-type="fig" rid="fig3">Figure 3</xref>(a). Compute the Gradient Magnitude and Gradient Angle for each pixel, and then do Non-maximum suppression processing for edge extraction. <xref ref-type="fig" rid="fig3">Figure 3</xref>(c) shows the edge extraction result. And <xref ref-type="fig" rid="fig3">Figure 3</xref>(d) is the final result with road edge line by ISEFHough extraction.</p></sec></sec><sec id="s2_4"><title>2.4. Vector Change Determination</title><p>Whether the road vector has changed or not can be determined with the help of extracted edge information in Section 2.3. The changes in vector unit and the entire road are discussed in this paper. For a vector unit, it is considered that the unit is not changed if the corresponding segment is with bilateral information in the horizontal direction (or nearly horizontal), in addition calculating percentage of the entire length nRoadRatio that its length occupies. For an entire road vector, if the accumulation (SumRoadRatio) of the unchanged vector’s ration</p><fig-group id="fig3"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Results of ISEFHough line extraction process. (a) Original image; (b) Filter image by ISEF; (c) Edge image by ISEF edge extraction; (d) Road edge line by ISEFHough extraction.</title></caption><fig id ="fig3_1"><label>(b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x16.png"/></fig><fig id ="fig3_2"><label>(c)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x17.png"/></fig><fig id ="fig3_3"><label>(d)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x18.png"/></fig><fig id ="fig3_4"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x19.png"/></fig></fig-group><p>(nRoadRatio) is larger than a certain threshold (set as 0.6 in the experiment), it is considered to have not changed; otherwise, considered to have changed.</p><p>Single vector unit (S) change detection process is described as follows,</p><disp-formula id="scirp.52719-formula262"><graphic  xlink:href="http://html.scirp.org/file/5-2630115x20.png"  xlink:type="simple"/></disp-formula><p>//ExtractLine(Segment) Function of extracting segment’s edge information, and //determining whether is bilateral edge.</p><p>//nChange(p) Judgement of vector’s state of change, FLASE represents unchanged, //TURE shows changed</p><p>Single road vector R change detection process is described as follows,</p><disp-formula id="scirp.52719-formula263"><graphic  xlink:href="http://html.scirp.org/file/5-2630115x21.png"  xlink:type="simple"/></disp-formula><p>//s<sub>i</sub> denote subsets of R</p><p>//n denotes the number of subset of R</p><p>//nRoadRatio(s) denote percentages of the entire length that subsets’ length occupies</p><p>//SumRoadRatio represents the sum of the ratio of unchanged road vectors</p><p>//threshold represents the threshold value of length ratio (set to 0.6 in this experiment)</p></sec><sec id="s2_5"><title>2.5. Template Generation</title><p>As for unchanged vector unit, the b calculated as the steps described in Section 2.3.2 is as half-width for road template, and direction of vector as template direction. Define one of vector’s end points as base point, and set the average of the gray values along the perpendicular direction of vector as the corresponding template gray value. <xref ref-type="fig" rid="fig4">Figure 4</xref> shows the template generation method.</p></sec></sec><sec id="s3"><title>3. Experimental Analysis</title><p>In this study, 0.5 m panchromatic WorldView images of a domestic area are used to detect change state of the old road vector. WorldView data include 1.85 m resolution multi-spectral image data and 0.5 m panchromatic</p><fig id="fig4"  position="float"><label><xref ref-type="fig" rid="fig4">Figure 4</xref></label><caption><title> Template generation method</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x22.png"/></fig><p>image data, which are characterized with the advantages of spectrum and high resolution. And this experiment only takes use of high resolution by using panchromatic image as experimental data. The analysis of the problems existed in experiment and the corresponding solutions were described in this article.</p><sec id="s3_1"><title>3.1. Images of Different Road Types</title><p>In high resolution images, urban main roads and suburban roads are considered as elongated homogeneous regions with almost constant width, but the gray information of blocks’ road images exhibit considerable variation because of occlusions of trees and buildings, which destroys road’s bilateral information.</p><p>In this study, the pyramid images are applied to detect change of different road types. It is found that: in the case of high resolution, segment images in urban include less buildings information, making it easier to detect the bilateral edges; When resolution is lowered appropriately, the extracted roads is under better continuity, but fail to extract local road edges when resolution is reduced too much. Comprehensively, choosing the appropriate resolution can effectively reduce detection error rates. In this experiment, the appropriate resolution reduced 3 times compared to the original image is chosen.</p></sec><sec id="s3_2"><title>3.2. Occlusions of Road</title><p>Whether in the urban or rural, the roads may be subject to different degrees of occlusion. Shelter materials are mainly surrounding buildings and block of trees along both sides in the suburbs.</p><p>In the case of occlusion, general edge detection operators (Gradient, Canny operator, et al) mainly extract the edges of shelter materials but not straight road edges. The advantage of Hough transform is able to overcome the difficulties caused by partial occlusion and extract the correct linear road edges, as shown in <xref ref-type="fig" rid="fig5">Figure 5</xref>.</p></sec><sec id="s3_3"><title>3.3. Display and Analysis of Experimental Result</title><p><xref ref-type="fig" rid="fig6">Figure 6</xref> shows the results of experiment, where red lines stand for unchanged road vectors and green lines for changed ones.</p><p>The detected result of the whole images shows in <xref ref-type="table" rid="table1">Table 1</xref>,</p><p>The definitions of completeness and correctness are presented in the following.</p><disp-formula id="scirp.52719-formula264"><graphic  xlink:href="http://html.scirp.org/file/5-2630115x23.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.52719-formula265"><graphic  xlink:href="http://html.scirp.org/file/5-2630115x24.png"  xlink:type="simple"/></disp-formula><p>Experimental result shows that the correctness is 79.56%, and the completeness reaches 97.72%. Study of image information indicates that the reasons for the cause of the error appears in the followed three aspects: 1) Occlusions of roads; 2) Original vectors’ offsets to the correct position; 3) Contrast between road images and background is not obvious. It is can be inferred that the proposed approach to road change detection is practical.</p></sec></sec><sec id="s4"><title>4. Conclusions and Prospects</title><p>The ISEFHough road change detection method provides a simple and reliable way for updating vector data</p><fig-group id="fig5"><label><xref ref-type="fig" rid="fig5">Figure 5</xref></label><caption><title> Road edges extraction under partial occlusion. (a) Original image; (b) Edges from general edge detection operators; (c) Edges from ISEFHough edge extraction operator.</title></caption><fig id ="fig5_1"><label>(b)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x25.png"/></fig><fig id ="fig5_2"><label>(c)</label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x26.png"/></fig><fig id ="fig5_3"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x27.png"/></fig></fig-group><fig id="fig6"  position="float"><label><xref ref-type="fig" rid="fig6">Figure 6</xref></label><caption><title> Result of experiment</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/5-2630115x28.png"/></fig><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> The result of ISEFHough change detection</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >Occlusion</th><th align="center" valign="middle" >Detected roads</th><th align="center" valign="middle" >Correctly detected roads</th><th align="center" valign="middle" >Actually changed</th><th align="center" valign="middle" >Correctly detected changed roads</th><th align="center" valign="middle" >Correctness</th><th align="center" valign="middle" >Completeness</th></tr></thead><tr><td align="center" valign="middle" >No occlusion</td><td align="center" valign="middle" >1956</td><td align="center" valign="middle" >1636</td><td align="center" valign="middle" >87</td><td align="center" valign="middle" >85</td><td align="center" valign="middle" >83.64%</td><td align="center" valign="middle" >97.70%</td></tr><tr><td align="center" valign="middle" >Partial occlusion</td><td align="center" valign="middle" >256</td><td align="center" valign="middle" >124</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >48.43%</td><td align="center" valign="middle" >100%</td></tr><tr><td align="center" valign="middle" >Total</td><td align="center" valign="middle" >2212</td><td align="center" valign="middle" >1760</td><td align="center" valign="middle" >88</td><td align="center" valign="middle" >86</td><td align="center" valign="middle" >79.56%</td><td align="center" valign="middle" >97.72%</td></tr></tbody></table></table-wrap><p>based on high resolution remote sensing images. In this paper, the size of experimental data is 1.7 GB, with 2212 vectors which divide images into 4761 segments. It only takes 46 s to complete the whole process, including getting subset, coordinate transformation, filtering, Hough edges extraction and road change detection. Besides, the whole process is automatically done without manually setting parameters.</p><p>There are also several shortcomings in the ISEFHough road change detection method. We can know from the result of experiment, even Hough can avoid the situation of partial occlusion, but still extract false road edges in the case of the complete occlusion. Therefore, it is desirable to add some auxiliary information (such as DEM, DOM, etc.) in the post-processing, or to combine other methods (such as dividing the interested area, generating the shape factor of the interested area, etc.) to extract better road edges with less errors.</p></sec><sec id="s5"><title>Acknowledgements</title><p>This work was supported by the National Basic Research Program of China (973 Program) with No. 2012CB 719900. We also thank Lu Luping for providing old vector files.</p></sec></body><back><ref-list><title>References</title><ref id="scirp.52719-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Laptev, I., Mayer, H., Lindeberg, T., et al. (2000) Automatic Extraction of Roads from Aerial Images Based on Scale Space and Snakes. Machine Vision and Applications, 12, 23-31. http://dx.doi.org/10.1007/s001380050121</mixed-citation></ref><ref id="scirp.52719-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Hu, X.Y. (2001) Automatic Extraction of Linear Features and Housing from Aerial Remote Sensing Images. Wuhan University, Wuhan.</mixed-citation></ref><ref id="scirp.52719-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Park, S.R. and Kim, T. (2001) Semi-Automatic Road Extraction Algorithm from Ikonos Images Using Template Matching. 22nd Asian Conference on Remote Sensing, 5, 1209-1213.</mixed-citation></ref><ref id="scirp.52719-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Doucette, P., Agouris, P. and Stefanidis, A. (2004) Automated Road Extraction from High Resolution Multispectral Imagery. Photogrammetric Engineering &amp; Remote Sensing, 70, 1405-1416.  
http://dx.doi.org/10.14358/PERS.70.12.1405</mixed-citation></ref><ref id="scirp.52719-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, Q.P. (2006) Automated Road Network Extraction from High Spatial Resolution Multi-Spectral Imagery. University of Calgary, Calgary.</mixed-citation></ref><ref id="scirp.52719-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Wang, M., Luo, C.J., Zhou, C.W., et al. (2005) Extraction of Road Network from High Resolution Remote Sensed Imagery with the Combination of Gaussian Markov Random Field Texture Model and Support Vector Machine. Journal of Remote Sensing, 9, 271-276.</mixed-citation></ref><ref id="scirp.52719-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Barzohar, M. and Cooper, D.B. (1996) Automatic Finding of Main Roads in Aerial Images by Using Geometric-Stochastic Models and Estimation. Pattern Analysis and Machine Intelligence, 18, 707-721.  
http://dx.doi.org/10.1109/34.506793</mixed-citation></ref><ref id="scirp.52719-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Huang, Z.J., Zhang, J.F. and Xu, F.J. (2014) A Multi-Stage Method to Extract Road from High Resolution Satellite Image. IOP Conference Series: Earth and Environmental Science, 17, Article ID: 012207.</mixed-citation></ref><ref id="scirp.52719-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Li, D.R. (2003) Change Detection from Remote Sensing Images. Geomatics and Information Science of Wuhan University, 28, 7-12</mixed-citation></ref><ref id="scirp.52719-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Dong, M., Zhang, H.T., Zhu, X.K., et al. (2009) Change Detection of Road Networks Based on Remote Sensing Image. Geomatics and Information Science of Wuhan University, 34, 178-182.</mixed-citation></ref><ref id="scirp.52719-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Ma, H.J. and Lu, N. (2013) Rapid Extraction of Earthquake Road Damages Based on Sidelines from Remote Sensing Images. Earthquake, 33, 71-78.</mixed-citation></ref><ref id="scirp.52719-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Lu, L.P., Zhang, Y., Tao, P.J., et al. (2013) Estimation of Transformation Parameters between Centre-Line Vector Road Maps and High Resolution Satellite Images. The Photogrammetric Record, 28, 130-144.  
http://dx.doi.org/10.1111/phor.12015</mixed-citation></ref><ref id="scirp.52719-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Douglas, D.H. and Peucker, T.K. (1973) Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature. The Canadian Cartographer, 10, 112-122.  
http://dx.doi.org/10.3138/FM57-6770-U75U-7727</mixed-citation></ref><ref id="scirp.52719-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Sharifi, M., Fathy, M. and Mahmoudi, M.T. (2002) A Classified and Comparative Study of Edge Detection Algorithms. International Conference on Information Technology: Coding and Computing, 8-10 April 2002, 117-120.</mixed-citation></ref><ref id="scirp.52719-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Li, Y.S. and Yang, L. (2004) A New Hough Line Detection Algorithm Based on Exponential Filter. Sciencepaper Online, Beijing.</mixed-citation></ref></ref-list></back></article>