Using Kadane's Algorithm to find the brightest area in Astronomical images. Using concept of maximum contiguous subarray to find the area with highest sum and thus using opencv and finding the brightest area, applying on image and video.
It finds the maximum sum of a continuous subarray in a given array of integers.
Find the maximum contiguous subarray sum
Given an array Arr[] of N integers. Find the contiguous sub-array(containing at least one number) which has the maximum sum and return its sum.
This repository is managed by LeetPush extension: https://github.com/husamahmud/LeetPush
Add a description, image, and links to the kadane-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the kadane-algorithm topic, visit your repo's landing page and select "manage topics."