A new Method for line matching is presented in this paper. It utilizes binary relations of geometric attributes. Four procedures are introduced in sequence as follows. First of all

it's necessary to define a series of binary relations between two segments and calculate the local similarity of two line segment pairs respectively from two images. The second step is to filter preliminarily out the local similarity with threshold values and get the candidate segment sets by stepwise Cartesian product operation. Thirdly

the global similarities of all of candidate segment sets need to be calculated. Finally

the final matched line segment sets can be obtained based on the local and global similarities. The Method is insensitive to the changing of line segment's endpoint position and length and the selection of two threshold values. Also it's robust and invariant to rotation

scaling and translation. In the meanwhile

it takes line segment's directions into full consideration

thus improving the matching accuracy. Algorithmic analysis and experimental Results have proved that the Method is reasonable

efficient and reliable.