In my previous three articles (1,2,3) I discussed how to use Canny edge detection and Hough transform to identify blur […]
I will continue where I left off in my previous post. After performing Hough transform, and extracted the longest sections […]
In my previous post, I briefly discussed the rationale behind automated blur detection in digital imagery and did an overview […]
It is often necessary to identify and classify images based on their clarities. For instance, it is desirable for an […]
In the example I gave in “Interfacing IPP with Magick++“, I illustrated how to use Intel’s Integrated Performance Primitives (IPP) […]
Intel’s Integrated Performance Primitives (IPP) is a low level C++ library. It provides routines that are highly optimized on Intel […]
A few days ago, I ran across this article by Dmitri Nesteruk. In his article, he compared the performance between […]
In my previous post, I discussed how to merge and split a two level tree. Before moving on to discuss […]
A two level tree is a simple tree data structure. Unlike in a typical tree where the tree depths could […]
Processes tend to benefit greatly from multi-core processors if they are CPU bound (i.e. computational intensive tasks). The actual speedup […]
I came across something rather interesting the other day when trying to determine what sorting algorithms .Net Framework uses in […]
Download UniquePermutation.zip The numbers of permutations on a set of n elements is n! (see definition).
Download Trie.zip Trie is a tree like data structure that can be used for fast text search.
In my post a week ago, I mentioned three ways to reverse a string. OK, I really meant three alternative […]
OK, conceptually, it’s quite easy. A couple of my friends got asked this question when interviewing. Here are what my […]