from math import sqrt
from intrsc import intersections_from_angl_dist
-import linef as linef
-import ransac as ransac
-import manual as manual
+import linef
+import params
+import ransac
+import manual_lines as manual
from geometry import l2ad
# TODO comments, refactoring, move methods to appropriate modules
def find(lines, size, l1, l2, bounds, hough, show_all, do_something, logger):
- logger("finding the grid")
new_lines1 = map(lambda l: Line.from_ad(l, size), lines[0])
new_lines2 = map(lambda l: Line.from_ad(l, size), lines[1])
for l1 in new_lines1:
return sqrt(x * x + y * y)
for n_tries in xrange(3):
+ logger("finding the diagonals")
model = Diagonal_model(points)
- diag_lines = ransac.ransac_multi(6, points, 2, 800, model=model)
+ diag_lines = ransac.ransac_multi(6, points, 2,
+ params.ransac_diagonal_iter, model=model)
diag_lines = [l[0] for l in diag_lines]
centers = []
cen_lin = []
if show_all:
import matplotlib.pyplot as pyplot
- import Image
+ from PIL import Image
def plot_line_g((a, b, c), max_x):
find_y = lambda x: - (c + a * x) / b
image_p = Image.fromstring('RGB', size_f, buff, 'raw')
do_something(image_p, "finding diagonals")
+ logger("finding the grid")
data = sum(points, [])
# TODO what if lines are missing?
sc = float("inf")