Linear Correction and Matching Method for 3D Line Structure Reconstruction

Algorithm 2

Steps of refining line matching result.

Input: Bisection point of line , line , , local neighborhood radius , sampling number , similarity threshold , and proportional threshold
Output: Flag bit （if , it is the correct match）
(1)	Calculate the polar , according to and find the intersection sets and formed with , and , respectively.
(2)	Determine the segmented local neighborhood:
First, find two lines and with distance on both sides of .
for c = 0 : 2
end
Save the determined neighborhood
for i = 1 : m−1
for c = 0 : 2
store the neighborhood around in
end
end
(3)	Distinguish left and right neighborhoods:
From , the left neighborhood and the right neighborhood of are determined.
(4)	Calculate the similarity of lines:
Random sampling of local neighborhoods to obtain a new set , , , ,
num = 0;
for i = 1 : K
if
num++
Flag = true
else
Flag = false
end
end
end
(5)	Return