WnCC - Seasons of Code
Seasons of Code is a programme launched by WnCC along the lines of the Google Summer of Code. It provides one with an opprtunity to learn and participate in a variety of interesting projects under the mentorship of the very best in our institute.
List of Running Projects
- L.A.M.A. AI using Reinforcement Learning
- Intrusion Detection system
- Competitive coding
- Why The Hype Around GANs
- 3D reconstruction using 2D images
- Computer Vision Workbench
- 3D Object Classification using Mesh Neural Network
- Lossless high entropy compression algorithm
- ML GYM
- Tools for Web Development
- Strategy Wars [Online]
- Food Recommendation through Machine Learning
- Conversational Chatbot
- Virtual Keyboard
- Super Shenron
- Gestures for 3D space
- Road Network 3D Rendering using OpenGL
- Face Recognition using Statistics
- Introduction to Kaggle and Machine Learning
- Krittika Website
- Rubik's cube solver
- Planet/Atmosphere Renderer using OpenGL
- Digital Depth Perception
- KontaKt App
- Tinkerers’ Laboratory Website
- Graphic Intensive MUSIC APP
- Pool It!
- Insti Buddy
- Intelligent agents
This notebook will be written using python, also employing numpy and OpenCV, we will initially implement Poisson solver for the discrete case which is immensely useful for many application then we will proceed on the application part which will be from this paper
- Read the concerned paper and discuss about implementation.
- Familiarize with simple optimization problems and how they are treated in the discrete domain.
- Familiarize with Image handling in Python (OpenCV or PIL)
- Design discretized algorithm for Laplace solver, with no Gradient field.
- Work out a method for obtaining a mask - manually/on click.
- Get good images to work upon and implement the mask.
- Implement the Laplacian Solver on an image with random regions highlihgted. Worked Fine.
- Temporary usage of
gimpfor creating mask, at the same time as naive cloning.
- First real implementation of the Poisson Solver, complete with guidance field and real mask. (Geometric implementation)
- Vectorize the search step of algorithm: Speed goes 3x.
- Attempt to approach the problem by the Algebraic Method, which can accomplish the task in under 5 seconds, employing sparse matrices.
- Futile efforts. Implementation on python might not work due to underlying design of sparse matrices (easily done on MATLAB).
- Start off with the notebook by explaining the math and the implementation of the algorithm in the block-wise manner.
The notebook has been completed and this project has been completed in just over two weeks. Follow this readme to run the notebook on your system, or check out the rendered notebook on the official iPython Wiki.