首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
代写data编程、代做Java/Python程序设计
项目预算:
开发周期:
发布时间:
要求地区:
Homework 7
Computer Vision, Spring 2024
Due Date: April 26, 2024
Total Points: 20
This homework contains two programming challenges. All submissions are due at
midnight on April 26, 2024, and should be submitted according to the instructions
in the document “Guidelines for Programming Assignments.pdf”.
runHw7.py will be your main interface for executing and testing your code.
Parameters for the different programs or unit tests can also be set in that file.
Before submission, make sure you can run all your programs with the command
python runHw7.py with no errors.
The numpy package is optimized for operations involving matrices and
vectors. Avoid using loops (e.g., for, while) whenever possible—looping can
result in long running code. Instead, you should “vectorize” loops to optimize
your code for performance. In many cases, vectorization also results in more
compact code (fewer lines to write!).
Challenge 1: In this challenge you are asked to develop an optical flow system. You
are given a sequence of 6 images (flow1.png – flow6.png) of a dynamic scene. Your
task is to develop an algorithm that computers optical flow estimates at each image
point using the 5 pairs (1&2, 2&3, 3&4, 4&5, 5&6) of consecutive images.
Optical flow estimates can be computed using the optical flow constraint equation
and Lucas-Kanade solution presented in class. For smooth motions, this algorithm
should produce robust flow estimates. However, given that the six images were
taken with fairly large time intervals in between consecutive images, the brightness
and temporal derivatives used by the algorithm are expected to be unreliable.
Therefore, you are advised to implement a different (and simpler) optical flow
algorithm. Given two consecutive images (say 1 and 2), establish correspondences
between points in the two images using template matching. For each image point in
the first image, take a small window (say 7x7) around the point and use it as the
template to find the same point in the second image. While searching for the
corresponding point in the second image, you can confine the search to a small
window around the pixel in the second image that has the same coordinates as the
2
one in the first image. The center of the 7x7 image window in the second image that
is maximally correlated with the 7x7 window in the first image is assumed to be the
corresponding point. The vector between two corresponding points is the optical
flow (u,v).
Write a program computeFlow that computes optical flow between two gray-level
images, and produces the optical flow vector field as a “needle map” of a given
resolution, overlaid on the first of the two images.
result = computeFlow(img1, img2, win_radius, template_radius,
grid_MN)
You need to choose a value for the grid spacing that gives good results without
taking excessively long to compute. (6 points)
For debugging purposes use the test case in debug1a. In this synthetic case, the flow
field consists of horizontal vectors of the same magnitude (translational motion
parallel to the image plane). Note that in the real case, foreshortening effects,
occlusions, and reflectance variations (as well as noise) complicate the result.
(2 point)
Challenge 2: Your task is to develop a vision system that tracks the location of an
object across video frames. Object tracking is a challenging problem since an
object’s appearance, pose and scale tend to change as time progresses. In class we
have discussed three popular tracking methods: template-based tracking,
histogram-based tracking and detection-based tracking. In this challenge, we will
assume the color distribution of an object stays relatively constant over time.
Therefore, we will track an object using its color histogram.
A color histogram describes the color distribution of a color image. The color
histogram that you will need to compute is defined as follows. Each bin of the color
histogram represents a range of colors, and the number of votes in each bin
indicates the number of pixels that have the colors within the corresponding color
range.
Be careful, in the initialization of your program, you should generate a color map
from the region of interest (ROI), and compute all subsequent color histograms
based on the same color map. It is only meaningful to compare two histograms
computed based on the same color map. Use the provided function chooseTarget
to drag a rectangle around a tracking target.
3
Write a program named trackingTester that estimates the location of an object in
video frames.
trackingTester(data_params, tracking_params)
trackingTester should draw a box around the target in each video frame, and
save all the annotated video frames as PNGs into a subfolder given in
data_params.out_dir.
After generating the annotated video frames, use the provided function
generateVideo to create a video file containing all the frames.
(12 points)
Include all the code you have written, as well as the resulting video files, but
DO NOT include the three tracking datasets and the individual output frames
in your submission.
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
代做 program、代写 c++设计程...
2024-12-23
comp2012j 代写、代做 java 设...
2024-12-23
代做 data 编程、代写 python/...
2024-12-23
代做en.553.413-613 applied s...
2024-12-23
代做steady-state analvsis代做...
2024-12-23
代写photo essay of a deciduo...
2024-12-23
代写gpa analyzer调试c/c++语言
2024-12-23
代做comp 330 (fall 2024): as...
2024-12-23
代写pstat 160a fall 2024 - a...
2024-12-23
代做pstat 160a: stochastic p...
2024-12-23
代做7ssgn110 environmental d...
2024-12-23
代做compsci 4039 programming...
2024-12-23
代做lab exercise 8: dictiona...
2024-12-23
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!