首页
编程语言
数据库
网络开发
Algorithm算法
移动开发
系统相关
金融统计
人工智能
其他
首页
>
> 详细
代写program、C/C++程序语言代做
Coursework 2 (Group) – Scene Recognition
Brief
This is a group coursework: please work in teams of four people.
Due date: Wednesday 10th January, 16:00.
Development data download: training.zip in the coursework (CW) folder
Testing data download: testing.zip in the CW folder
Required files: report.pdf; code.zip; run1.txt; run2.txt; run3.txt
Credit: 25% of overall module mark
Overview
The goal of this project is to introduce you to image recognition. Specifically, we will examine the
task of scene recognition starting with very simple methods -- tiny images and nearest neighbour
classification -- and then move on to techniques that resemble the state-of-the-art.
This coursework will run following the methodology used in many current scientific benchmarking
competitions/evaluations. You will be provided with a set of labelled development images from
which you are allowed to develop and tune your classifiers. You will also be provided with a set of
unlabelled images for which you will be asked to produce predictions of the correct class.
Details
You will need to write software that classifies scenes into one of 15 categories. We want you to
implement three different classifiers as described below. You will then need to run each classifier
against all the test images and provide a prediction of the class for each image.
Data
The training data consists of 100 images for each of the 15 scene classes. These are arranged in
directories named according to the class name. The test data consists of 2985 images. All the
images are provided in JPEG format. All the images are grey-scale, so you don't need to consider
colour.
Objective measure
The key classification performance indicator for this task is average precision; this is literally the
proportion of number of correct classifications to the total number of predictions (i.e. 2985).
Run conditions
As mentioned above, you need to develop and run three different classifiers. We'll refer to the
application of a classifier to the test data as a "run".
Run #1: You should develop a simple k-nearest-neighbour classifier using the "tiny image" feature.
The "tiny image" feature is one of the simplest possible image representations. One simply crops
each image to a square about the centre, and then resizes it to a small, fixed resolution (we
recommend 16x16). The pixel values can be packed into a vector by concatenating each image
row. It tends to work slightly better if the tiny image is made to have zero mean and unit length.
You can choose the optimal k-value for the classifier.
Run #2: You should develop a set of linear classifiers (an ensemble of 15 one-vs-all classifiers)
using a bag-of-visual-words feature based on fixed size densely-sampled pixel patches. We
recommend that you start with 8x8 patches, sampled every 4 pixels in the x and y directions. A
sample of these should be clustered using K-Means to learn a vocabulary (try ~500 clusters to
start). You might want to consider mean-centring and normalising each patch before
clustering/quantisation. Note: we're not asking you to use SIFT features here - just take the pixels
from the patches and flatten them into a vector & then use vector quantisation to map each patch
to a visual word.
Run #3: You should try to develop the best classifiers you can! You can choose whatever feature,
encoding and classifier you like. Potential features: the GIST feature; Dense SIFT; Dense SIFT in a
Gaussian Pyramid; Dense SIFT with spatial pooling (commonly known as PHOW - Pyramid
Histogram of Words), etc. Potential classifiers: Naive bayes; non-linear SVM (perhaps using a linear
classifier with a Homogeneous Kernel Map), ...
Run prediction format
The predictions for each run must be written to a text file named runX.txt (where X is the run
number) with the following format:
For example:
...
0.jpg tallbuilding
1.jpg forest
2.jpg mountain
3.jpg store
4.jpg store
5.jpg bedroom
...
Restrictions
• You are not allowed to use the testing images for anything other than producing the final
predictions They must not be used for either training or learning feature encoding.
The report
The report must be no longer than 4 sides of A4 with the given Latex format for CW2, and must be
submitted electronically as a PDF. The report must include:
• The names and ECS user IDs of the team members
• A description of the implementation of the classifiers for the three runs, including information on
how they were trained and tuned, and the specific parameters used for configuring the feature
extractors and classifiers. We expect that your "run 3" section will be considerably longer than the
descriptions of runs 1 & 2.
• A short statement detailing the individual contributions of the team members to the coursework.
What to hand in
You need to submit to ECS Handin the following items:
• The group report (as a PDF document in the CVPR format same as CW2; max 4 A4 sides, no
appendix)
• Your code enclosed in a zip file (including everything required to build/run your software and to
train and use your classifiers; please don't include binaries or any of the images!)
• The run prediction files for your three runs (named "run1.txt", "run2.txt" and "run3.txt").
• A plain text file listing the user ids (e.g. xx1g20) of the members of your team; one per line.
Marking and feedback
Marks will be awarded for:
• Successful completion of the task.
• Well structured and commented code.
• Evidence of professionalism in implementation and reporting.
• Quality and contents of the report.
• The quality/soundness/complexity of approach used for run 3.
Marks will not be based on the actual performance of your approach (although you can expect to
lose marks if runs 1 and 2 are way off our expectations or you fail to follow the submission
instructions). We will open the performance rankings for run 3. !"#$
Standard ECS late submission penalties apply.
Individual feedback will be given to each team covering the above points. We will also give overall
feedback on the approaches taken in class when we announce the winner!
Useful links
• Matlab
o Image processing toolbox tutorials
o Recommended: VLFeat
§ Example of using VLFeat to perform classification
o Linear and non-linear SVMs
• Python
o numpy, PIL, sklearn (Scikit-learn), OpenCV, etc.
• C and C++
o OpenCV
o Recommended: VLFeat
o Example of using VLFeat to perform classification (Note this code is Matlab, but most of the
functionality is available in the C/C++ API)
• Java
o Recommended: OpenIMAJ
§ Chapter 12 of the tutorial deals with image classification
o BoofCV
Questions
If you have any problems/questions, use the Q&A channel on Teams
联系我们
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-21:00
微信:codinghelp
热点文章
更多
辅导 acfi 312 business strat...
2024-05-20
辅导 acfi 312 business strat...
2024-05-20
讲解 accounting 424 intermed...
2024-05-20
辅导 stats 3860b/9155b assig...
2024-05-20
讲解 comp4424/comp5424 it in...
2024-05-20
辅导 assessment 2 - practica...
2024-05-20
讲解 communication 425 commu...
2024-05-20
讲解 cs 3800 homework 1 spri...
2024-05-20
讲解 mecm30013 marketing com...
2024-05-20
讲解 comp2212 programming la...
2024-05-20
辅导 question 3: stata exerc...
2024-05-20
辅导 g5029 limits of computa...
2024-05-20
讲解 maf203 business finance...
2024-05-20
辅导 ecs776p image processin...
2024-05-20
讲解 operations management 2...
2024-05-20
辅导 lubs5988m research desi...
2024-05-20
辅导 ma 2034 worksheet 4 spr...
2024-05-20
辅导 marketing analytics spr...
2024-05-20
讲解 comu2030 communication ...
2024-05-20
辅导 qbus2820 assignment 2辅...
2024-05-20
热点标签
qf5202a
apd1292h
218327
ma2608
econ7040
qbus6840
tk2153
mth322
comu2030
lubs5988m
maf203
g5029
comp4424/comp5424
cs 04450
fit9131
ecs776p
mecm30013
qbus2820
chc5223
comp2k
comp2212
econ0040
ebu4201
stsci 4060
ierg2080
ai4003
eco320
soft3202
n1577
n1587
elec9731
125.701
econ333
fina211
dts002tc
n1574
ecn6620
mth208
ifb209tc
accg8126
mgt6128
cse101
sesm6050
fin2020
bpln0025
phys5032
comp809
comp30023
swen30006
fit3152
mec208
fit2004
econ20120
cpt304
econ2101
econ0051
engi4547
econ1048
eengm2510
fit1008
7033mkt
ec2066
cct380h5f
man00019m
mech265001
fit9137
n1542
csc4140
math6119
comp1710
fina864
csys5020
busi4412
math5007
2702ict
dts204tc
comp2003j
cosc2673
ecmt2150
bff3121–
comu7000
stat6118
comp814
acc202
ematm0067
bit233
600543
comp3400
cpt210
inf6028
bman30702
math0002
msci242l
mgt11001
com00177m
bman71282
fit2001
econ7030
159.342 ‐ operating
mang6134
math1005/math6005
geog5404m
comp1710/6780
infs 2042
159.341
econ7310
comp10002
comp3221
cpt206
ecmt1010
socs0030
data7201
data2x01
mn-3507
mat246h1
ib2d90
ib3j80
acc207
comp90007
compx518-24a
fit1050
info1111
acct2201
buad801
compsci369
cse 332s
info1110
math1033
scie1000
eeee2057
math4063
cmt219
econ5074
fit3094
finm081
econ2005
cpt202
ec333
econ0001
eng5009
csse2310/csse7231
cpt204
elec4630
comp2017
ma117
dts104tc
640481
csit128
eco000109m
finc5090
ggr202h5f
nbs8295
4ssmn902
chc6171
dsa1002
ebu6304
mec206
comp1021
iom209
com6511
ma416
csci-ua.202
bism7202
idepg001
cpt106
comp1212
ecom209
5aaob204
citx1401
econ0028
bsan3204
comp9123
fnce3000
fmhu5002
psyc10003
fina2222
be631-6-sp/1
finc2011
37989
math1062
mn-3526
itp122
cmt218
qbus6820
ecmt1020
aem4060
acb1120
comp2123
econ2151
ecmt6006
inmr77
com 5140
ocmp5328
comp1039
bus0117
soft3202/comp9202
basc0057
had7002h
cmt309
asb-3715
联系我们
- QQ: 99515681 微信:codinghelp
© 2024
www.7daixie.com
站长地图
程序辅导网!