首页 > 其他分享 >COMP90086 Computer Vision

COMP90086 Computer Vision

时间:2024-09-05 15:51:49浏览次数:10  
标签:patches extension COMP90086 should will Computer report your Vision

COMP90086 Computer Vision, 2024 Semester 2

Assignment 2: Patch matching with neural networks

Introduction

Finding correspondences between keypoints is a critical step in many computer vision applications. It can be used to align images when constructing a panorama from lots of separate photogtraps, and it is used to find point correspondences between keypoints detetected in multiple views of a scene.

This assignment uses a dataset generated from many views of the Trevi fountain in Rome. Finding correspondences between detected keypoints is a critical step in the pipeline for reconstructing a 3D representation of the fountain from individual photographs.

The dataset in this assignment is generated as a set of pairs of image patches taken centred at detected  keypoints. The image patches are 64x64 pixels each and each training sample is made of two patches  placed side by side to make a 128x64 image. For half the training set (10,000 examples in the ’1good’ subdirectory) the two patches are from two separate views of the same keypoint. For the other half (10,000 examples in the ’0bad’ subdirectory) the two patches are from two different keypoints. Figure 1 shows an example of each of these. The validation directory is similarly structured but contains four times as many non-matching pairs (2000 examples in ’0bad’) as matching pairs (500 examples in  ’1good’).

 

Figure 1: Corresponding (left) and non-corresponding (right) pairs of image patches

Your task is to create and train some neural networks that can tackle the problem of determining whether the two patches correspond or not.

1. Baseline Neural Network [2 pt]

Run the baseline neural network 代 写COMP90086 Computer Vision implementation in the provided python notebook and in your report, you should include the loss and accuracy curves for the training and validation sets in your report and discuss what these imply about the baseline model.

The validation set contains more bad examples than good.  Why might this be a sensible way of testing for the task of finding feature correspondences?  Should the training environment also reflect this imbalance?

2. Regularizing your Neural Network [2pt]

To regularize the network, your should try adding a regularization layer (see the Keras documenation for these layers). Try adding a Dropout() layer after Flatten() and try different rate values to see what the effect of this parameter is.  Include the loss and accuracy plots in your report for three different choices of the rate parameter.  Describe the changes you see in these loss and accuracy plots in your report and suggest what the best choice of rate value is from the three you have reported.

3. Convolutional Neural Network [3pt]

Design a Convolutional Neural Network to solve this challenge.  If you use Conv2D() layers imme- diately after the LayerNormalization layer these convolutions will apply identically to both image patches in each input sample. Try using one or two Conv2D() layers with relu activations. You should explore the value of having different numbers of filters, kernel sizes, and strides before the Flatten() layer.

Briefly describe the set of settings you tried in your report in a table (this should be around 10 settings). For each setting, report the final training loss and accuracy as well as the validation loss and accuracy.

Include a discussion of the results of these experiments in your report. Identify your best performing design and discuss why you think this may have been best.

Submission

You should make two submissions on the LMS: your code and a short written report explaining your method and results. The response to each question should be no more than 500 words.

Submission will be made via the Canvas LMS. Please submit your code and written report separately under the Assignment 2 link on Canvas.

•  Your code submission should include the Jupyter Notebook (please use the provided template) with your code and any imagefiles we will need to run your code. Please include the cell output in your notebook submission if possible.

•  Your written report should be a .pdf with your answers to each of the questions.  The report should address the questions posed in this assignment and include any images, diagrams, or tables required by the question.

Evaluation

Your submission will be marked on the correctness of your code/method, including the quality and ef- ficiency of your code. You should use built-in Python functions where appropriate and use descriptive variable names. Your written report should clearly address the questions, and include all of the specific outputs required by the question (e.g., images, diagrams, tables, or responses to sub-questions).

Late submission

The submission mechanism will stay open for one week after the submission deadline. Late submis- sions will be penalised at 10% of the total possible mark per 24-hour period after the original deadline. Submissions will be closed 7 days (168 hours) after the published assignment deadline, and no further submissions will be accepted after this point.

To request an extension on this assignment, please see the FEIT extension policy and follow the steps below:

• To request an extension of 1-3 days (without AAP), complete the declaration form at the website above and upload it to Canvas under Assignment 2 extension request.

• To request a longer extension (without AAP), please apply for Special Consideration.

• If you have an AAP, please request an extension by completing the Assignment 2 extension request form. on Canvas and uploading your AAP.

Please note that we can only accept extension requests via Canvas up until the assignment deadline. Late extension requests can only be granted through Special Consideration.  The longest extension granted on this assignment is 7 days (5 working days + weekend).

 

 

标签:patches,extension,COMP90086,should,will,Computer,report,your,Vision
From: https://www.cnblogs.com/qq--99515681/p/18398628

相关文章

  • [Paper Reading] Sapiens: Foundation for Human Vision Models
    名称link时间:24.08机构:MetaRealityLabsTL;DR放出一个human-centric视觉任务的fundationmodel,该模型在3亿样本(Humans-300M)上进行无监督预训练,实验证明在human-centric视觉任务(2dpose估计/深度估计/body-part-seg等)效果相对于没有预训练有明显提升。MethodHuman300M数......
  • Vision Pro开发实践(结合24黑马idea)
    这是我参与创作者计划的第1篇文章开篇之前写过一篇文章,主要介绍visionPro基本信息、操作和基础适配的文章:http://sd.jd.com/article/30242?shareId=152384&isHideShareButton=1恰逢2024黑客马拉松举行,我结合本次参赛的一个idea,介绍一下visionOS的开发实践,希望能为大家在进行“空间......
  • 联合远景2010介绍《Joint Vision 2010》
    ......
  • Vision Pro开发实践(结合24黑马idea)
    这是我参与创作者计划的第1篇文章开篇之前写过一篇文章,主要介绍visionPro基本信息、操作和基础适配的文章:http://sd.jd.com/article/30242?shareId=152384&isHideShareButton=1恰逢2024黑客马拉松举行,我结合本次参赛的一个idea,介绍一下visionOS的开发实践,希望能为大家在进行......
  • HivisionIDPhotos :一款开源的轻量级且高效的AI证件照制作工具
    HivisionIDPhotos是一款开源的轻量级且高效的AI证件照制作工具,它通过AI算法实现了对多种用户拍照场景的识别、抠图以及证件照生成。这款工具能够根据不同的尺寸规格生成标准证件照和排版照,适用于护照、签证等多种用途。HivisionIDPhotos的主要特点包括轻量级抠图、生成标准证......
  • 2024年数字经济与计算机科学国际学术会议(DECS2024) 2024 International Conference on
    文章目录一、会议详情二、重要信息三、大会介绍四、出席嘉宾五、征稿主题六、咨询一、会议详情二、重要信息大会官网:https://ais.cn/u/vEbMBz提交检索:EICompendex、IEEEXplore、Scopus大会时间:2024年9月20-22日大会地点:中国-厦门终轮截稿日期:2024年9月16日(早投......
  • FIT1047 Introduction to computer systems, networks and security
    FIT1047 Introductiontocomputersystems, networksand security-S2 2024Assignment2– Processesand MARIE ProgrammingPurposeProcessesandprogramsarewhatmakescomputers do what we want them to do. Inthefirst partofthisassig......
  • YOLOv9独家改进:一种高效移动应用的卷积加性自注意Vision Transformer
    ......
  • FIT1047 Introduction to computer systems, networks and security
    FACULTYOFINFORMATIONTECHNOLOGYFIT1047Introductiontocomputersystems,networksandsecurity–S22024Assignment2–ProcessesandMARIEProgrammingPurposeProcessesandprogramsarewhatmakecomputersdowhatwewantthemtodo.Inthefirstp......
  • CF1980F1 & F2 Field Division
    前言纪念一下独立做出来的\(2400\)的题Easyversion思路先说\(Easy\)版本的我们走路的方式只有可能是这种样子:(出处:luoguuserFiraCode)不想手绘图了即对列排序后,所形成的一个行编号上升的序列所以\(Easy\)就很简单了,对于每一列的最大值,如果大于当前前缀最大值,则......