User:Saweiner

From REU@MU
Revision as of 21:55, 6 June 2018 by Saweiner (Talk | contribs)

Jump to: navigation, search

Project Description

Throughout Marquette University's 10-week summer REU program, Computation Across the Disciplines, I will be researching applications of graph theory to computer vision and image segmentation problems. More specifically, I hope to be able to utilize the graph-cut technique in order to isolate images of the heart and its components from CT scans provided by local hospitals. I will be working under the guidance of Dr. Naveen Bansal.

Week 1 (5/29 - 6/1)

Tuesday 5/29

  • Attended REU orientation
  • Met briefly with Dr. Bansal to begin planning the summer's research

Wednesday 5/30

  • Read introduction to Neural Networks: a Comprehensive Foundation
  • Met with Dr. Bansal and graduate student to begin learning about statistical applications to image segmentation

Thursday 5/31

  • Met with graduate student to obtain preliminary research publications
  • Met with Dr. Bansal to clarify research goals and outline the structure of the project
  • Read several research articles and located five articles for further reading

Friday 6/1

  • Familiarized myself with several graph-theoretic terms and concepts, in preparation for future research
  • Completed Fast Approximate Energy Minimization via Graph Cuts (Boykov et al.)
  • Located and obtained the Ford-Fulkerson publication on flow networks in Memorial Library

Week 2 (6/4 - 6/8)

Monday 6/4

  • Completed Interactive Graph Cuts for Optimal Boundary & Region Segmentation of Objects in N-D Images (Boykov et al.)
  • Completed An Omptimal Graph Theoretic Approach to Data Clustering: Theory and Its Applications to Image Segmentation (Wu et al.)
  • Began Graph Cuts and Efficient N-D Image Segmentation (Boykov et al.)

Tuesday 6/5

  • Completed Graph Cuts and Efficient N-D Image Segmentation (Boykov et al.)
  • Completed Normalized Cuts and Image Segmentation (Shi et al.)

Wednesday 6/6

  • Began writing code for GraphCuts algorithm, completed about 330 lines