Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/mgautam98/smartpen
Application Deployed at :
https://github.com/mgautam98/smartpen
Last synced: about 1 month ago
JSON representation
Application Deployed at :
- Host: GitHub
- URL: https://github.com/mgautam98/smartpen
- Owner: mgautam98
- Created: 2020-03-26T00:55:27.000Z (over 4 years ago)
- Default Branch: master
- Last Pushed: 2023-05-01T21:22:15.000Z (over 1 year ago)
- Last Synced: 2024-10-09T13:23:43.611Z (about 1 month ago)
- Language: HTML
- Homepage: https://smartpen.herokuapp.com/
- Size: 510 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# SmartPen
>Create a page or tool which performs edge detection on a given image and, given a point, returns the distance from that point to the closest edge.
>Application Deployed at : https://smartpen.herokuapp.com/
## Install
Install the requirements, flask, opencv-python and numpy using the following command```
pip3 install -r requirements.txt
```## Run
Run the app by running the following command in the termial```
python3 app.py
```
![alt text](https://i.imgur.com/XpOM5zD.png)Default port is :8080, you can change it in the application.
After running go to the specified port.Choose an image by clickin on "choose file"
![alt text](https://i.imgur.com/QwxaElw.png)
Click on upload to process the file
![alt text](https://i.imgur.com/z5jTjJ6.png)
Your processed image is ready. Now click on any point in the image to get the distance of closest edge from that point in the edge detected image.![alt text](https://i.imgur.com/iqjLo4B.png)
## Approach
Since, in the project we will be using Tensorflow.js and most of the computations will be on the client-side I have tried to do the same here.
In brief, following are the steps that I followed.
1. Take the image form the user and upload it.
2. The server performs the processing part i.e. detecting the edges, and finding the edges and saves the processed image.
3. The server passes the processed image, original image as well as the edge points to the client.
4. When the user clicks on any part of the image the client invokes a function and find the coordinates of the clicked point and well as the point relative to the processed part on server.
5. The same functon finds the distance between the coordinates and closest edge.
6. The closest edge distance is displayed on the screen to the user.>When we will be using Tensorflow.js, the edge detection part won't be done by server.
## Edge detection
An edge may be defined as a set of connected pixels that forms a boundary between two disjoints regions.
Edge detection is basically, a method of segmenting an image into regions of discontinuity.There are many edge detection algorithms. i have implemented them from scratch here [mgautam98/Digital-Image-Processor/filters](https://github.com/mgautam98/Digital-Image-Processor/blob/master/src/filters.py). For this project I have used opencv python library to do the same.
### Canny Edge detection
Canny Edge Detection is a popular edge detection algorithm.It is a four stage algorithm, where it performs following tasks
* Noise Reduction
> To remoe noise we apply 5x5 Gaussian filter
* Finding Intensity Gradient of the Image
> here, we apply sobel filter in both horizontal and vertical direction the enhance the edges.
* Non-maximum Suppression and
>There are still some unwanted noise so w remove is using non-max suppression algorithm.
* Hysteresis Thresholding
> Here, we dicide which points are edge and which are not.
This achieved the following result
![alt text](https://i.imgur.com/0fSzHIx.png)### Finding Distance from closest edge
The server returns a object of edges which is changed into JSON data (At server) for client to further process it.
> Points to consider :
- We don't have to do a lot of computation as the detected edges are small portion of area as compared to non-edges.
Say, out of 4000 pts only 100 are edge points.
> Initially, I was thinking to apply and graph based alorithm to find the closest edge using neighbourhood graph based algorithm and data structures such as K-D tree or a VP-tree.
> But, I made an observation that we are returning very small proportion of data back in comparision to the image size. So, we can simply go through all the edges and find the closest one (Brute Force).
> Technically, at max only the half of the points could be edge points. If they are more they amalgamate to form new edge which has less edge points then the sum of the two. And it is only possible in highly noisy image.
> So, Burute force is a good candidate for this particular problem.#### Thank You for reading.