This repository consits of a simple implementaion of Probability of boundary detection algorithm and its comparsion with the classical approaches for edge detection like Canny and Sobel edge detectors that measures discontinuities in the image intensities to detect edges. The PB algorithm considers texture and color information along with intensity, making it a better performing algorithm. This algorithm predicts per pixel probability of the boundary detected. The original image and the output of implementation is shown below:
The algorithm of PBLite detection is shown below:
The main steps for implementing the same are:
The filter banks implemented for low-level feature extraction are Oriented Derivative if Gaussian Filters, Leung-Malik Filters (multi-scale) and Gabor Filter.
Filter banks can be used for extraction of texture properties but here all the three filter banks are combined which results into vector of filter responses. As filter response vectors are generated, they are clustered together using k-means clustering. For Texton Maps k = 64 is used; Color and Brightness Maps k= 16 is used.
The gradient measurement is performed to know how much all features distribution is changing at a given pixel. For this purpose, half-disc masks are used.
The gradient maps which are generated are combined with classical edge detectors like Canny and Sobel baselines for weighted avaerage.
python Wrapper.py
Phase1
├── Code
| ├── Wrapper.py
├── Data
| ├── BSDS500
├── results
| ├── BrightnessGradient
| ├── Brightness_map
| ├── ColorGradient
| ├── Color_map
| ├── PbLite
| ├── TextonGradient
| ├── TextonMap
| ├── Other filter outputs
This was implemented as part of CMSC733 and for detailed report refer here.
In this section, a basic neural network and its modified version for classification on CIFAR10 dataset have been de-scribed. Later, a case study for ResNet, ResNext and DenseNet architecture was conducted. Refer report for more details.