A Flexible New Technique for Camera
Calibration
Zhengyou Zhang
December 2, 1998
(updated on December 14, 1998)
(updated on March 25, 1999)
(updated on Aug. 10, 2002; a typo in Appendix B)
(updated on Aug. 13, 2008; a typo in Section 3.3)
(last updated on
Problem Set 4, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 7PM, Sunday, October 16th 2016, on Canvas.
Number of pages: 4
Note on the format of your submission: Please create a folder and name it using this
format: PS4_Lastname_Firstname. Put all y
Problem Set 5, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 6PM, Sunday, October 23rd 2016, on Canvas.
Number of pages: 5
Note on the format of your submission: Please create a folder and name it using this
format: PS5_Lastname_Firstname. Put all y
Problem Set 8, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 9:00AM, Monday, November 21st 2016, on Canvas.
Number of pages: 6
Note on the format of your submission: Please create a folder named using this format:
PS8_Lastname_Firstname. Put all you
Problem Set 2, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 6PM, Sunday, September 25th 2016, on Canvas.
Number of pages: 7
Extra Credits: Up to 4 Points.
Note on the format of your submission: Please put your two .py file in a folder, zip
(compre
Problem Set 7, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 11:59PM, Friday, November 11th 2016, on Canvas.
Number of pages: 4
Note on the format of your submission: Please create a .py file and name it using this
format: PS7_Lastname_Firstname. De
Problem Set 6, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 9AM, Monday, October 31st 2016, on Canvas.
Number of pages: 7
Note on the format of your submission: Please update the enclosed .py file using this
format: PS6_Lastname_Firstname. Your fil
Problem Set 1, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 6PM, Friday, September 16th 2016, on Canvas.
Number of pages: 3
Note on the format of your file: Please create a new .py file in the editor. Name your file using
this format: PS1_Lastname_
Problem Set 0, CSCI1101, Sections 1 and 5, Fall 2016
Due: on Friday, September 2nd 2016, at 9AM on Canvas.
Number of pages: 2
Note: For tasks number 1 and 2 below, you dont need to turn anything in.
Task 1: Sign up on Piazza right now. The link
Problem Set 3, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 6PM, Saturday, October 1st 2016, on Canvas.
Number of pages: 5
Note on the format of your submission: Please put all your .py files in a folder, zip
(compress) the folder, and name the com
Problem Set 9, CSCI1101, Sections 1 and 5, Fall 2016
Due: at 6:00PM, Friday, December 9th 2016, on Canvas.
Number of pages: 2
Note on the format of your submission: Download the file PS9_Lastname_Firstname.py. Please
make sure you change the file name t
Math 221- Fall 2015
Solutions to Practice problems
Instructor: Dr. Juliana Erlijman
Date: October 9, 2016
Problem 1. Prove the following, for x Z:
3 | (x 2) 3 | (x2 x + 1)
Proof: Apply first the Division Algorithm to x and 3:
x = 3q + r for some r, q Z an
Math 221- Fall 2016
Solutions to assignment 5
Instructor: Dr. Juliana Erlijman
Due date: November 2, 2016 (at the beginning of class)
Problem 1.
(a) Use that 10n 1 (mod 11) for any even positive integer n and that
10n 1 (mod 11) for any odd positive integ
Math 221- Fall 2016
Solution to assignment 1
Instructor: Dr. Juliana Erlijman
Due date: September 21, 2016 (at the beginning of class)
Part 1
Problem 1. Determine which of the following sentences are statements. For
the ones that are statements, determine
Math 221- Fall 2016
Solutions to assignment 6
Instructor: Dr. Juliana Erlijman
Due date: November 9, 2016 (at the beginning of class)
Part 1
Problem 1. Determine whether the following congruences have solutions,
and solve if they do:
(a) 1713x 871 (mod 20
Math 221- Fall 2016
Solutions to assignment 2
Instructor: Dr. Juliana Erlijman
Due date: September 28, 2016 (at the beginning of class)
Part 1
Problem 1. Find a counterexample for each of the following mathematical
propositions:
(a) x R, x3 x = 0 = x [0,
Math 221- Fall 2016
Solutions to assignment 3
Instructor: Dr. Juliana Erlijman
Due date: October 5, 2016 (at the beginning of class)
Part 1
Problem 1. Prove the following, for a, b, c Z:
ac | bc c 6= 0 = a|b
Proof:
ac|bc = bc = qac for some q Z
= bc qac =
Math 221- Fall 2016
Another example on Diophantine equations
Instructor: Dr. Juliana Erlijman
Due Date: October 7, 2016
Given the following the following Diophantine equation:
143x 15y = 200
determine whether there are integer solutions, and in the affirm
Math 221- Fall 2016
Assignment 6
Instructor: Dr. Juliana Erlijman
Date: November 2, 2016
Due date: November 9, 2016 (at the beginning of class)
Part 1
Problem 1. Determine whether the following congruences have solutions,
and solve if they do:
(a) 1713x 8
Math 221- Fall 2016
Practice Problems
Instructor: Dr. Juliana Erlijman
Date: October 7, 2016
Problem 1. Prove the following, for x Z:
3 | (x 2) 3 | (x2 x + 1)
(Hint: Recall that you have to prove two parts: and . Use the
Division Algorithm for x and 3.)
P
# List Play
L = [1,2,3,4,5,6,7,8,9,10]
print len(L)
for n in range(len(L):
if L[n] % 2 = 0:
print L[n]
print
for n in range(len(L):
if L[n]%2 = 1:
L[n] = L[n]*n #if n is an odd number multiply it by the position
print L
M=[1,2,3],[4,5,6]
t=0
for i in rang
n=int(raw_input("enter a number:
")
import random
SQ=[random.randint(0,20) for x in range(n)] for y in range (n)]
for i in range (n):
print
for j in range(n):
print "%4i" %SQ[i][j],
for y in range(n):
j = 1
while (n/2+j) <= n-1:
temp = SQ[y][n/2+j]
SQ[y][
#Odd or Even Function
#entering a number
def Odd_or_Even (num):
if num%2=0:
return "Even"
else:
return "Odd"
number=input("Enter a number")
answer=Odd_or_Even(number)
print answer
#range increments
for n in range (2,11,2):
print n
for n in range (1,10,3):
L=[1,2,3,4,5]
item = 3
def binarysearch(L):
first = 0
last = len(L) - 1
found = False
while first <= last and not found:
mid = (first+last)/2
if L[mid] = item:
found = True
return found
else:
if item < L[mid]:
last = mid-1
return found
else:
first = mid+1
import sys
# The minMax function returns the min and max
#elements in the list
def minMax(L):
minValue = sys.maxint
maxValue = -1*sys.maxint()
for i in rnage(0,len(L):
if L[i] < minValue:
minValue = L[i]
elif L[i] > maxValue:
maxValue = L[i]
return [minVa
x=[1,3,5,6,9]
for n in range (0, len(x), 2):
print x[n] #within the range
# print n gives you a new range from 0,4
#print n
s=raw_input("Enter a number")
print range(len(s)
largest = s[0]
for n in range(1,len(s):
if s[n]>largest:
largest = s[n]
print larg
#Add Function
def adder(n1,n2):
n_sum=n1+n2
return n_sum #only exists inside the function
num1=input("Enter a number")
num2=input("Enter another number")
num_sum=adder(num1, num2)
print "The sum is ", num_sum
#loop
my_string = raw_input('Enter a string: ')
my_string = my_string.lower() #make string all lowercase
vowel_count = 0
for counter in range (0,len(my_string): #length of string #counter is a
variable
if my_string[counter] = 'a' or \
my_string[counter] =