|Code Listing by GAGAN|
It uses recursion to to implement quicksort. For the purpose of partitioning pivot is chosen according to median-of-three scheme.
The code has been tested successfully on a number of images. The algorithm is based on paper tiled "Accurate eye center location using isophote curature" presented by Roberto valenti and Theo Gevers at CVPR 2008 in ALASKA.
The following code can be used to separate red and green pixels from an image. It is based on color distance transform. Some Threshold has to be provided so that its color distance is within some range to determine whether the given pixel is red...
Computes the clusters of Pixels based upon their color.
Computes the clusters of Pixels based upon their color. The algorithm is based uopon binary tree quantization technique described by Orchard and Bouman. The code can be used for...
Quicksort is a standard algorithm for sorting in Computer science. I dont consider it to be highly optimized but can be used for educational purpose.
Feature detection is an importatnt aspect of any image or video processing application. The given code can be used for detecting cornera and edges in a RGB or grayscale image.It is based upon the famous paper on the topic titled "A Combined...
All files and free downloads are copyright of their respective owners. We do not provide any hacked, cracked, illegal, pirated version of scripts, codes, components downloads. All files are downloaded from the publishers website, our file servers or download mirrors. Always Virus check files downloaded from the web specially zip, rar, exe, trial, full versions etc. Download links from rapidshare, depositfiles, megaupload etc not published.