home | news | contact | about
New Looks~
11 April 2009 posted by John
At last the site's new layout is finally finished. It has taken me quite sometime to actually make an effort changing the layout, experimented with css, a little bit of head scratching, and now here it is - a brand 'new' look... But in the end it feels like nothing has really changed. What actually happened is, the site's hosting was changed recently due to some issues with the previous one, and I thought that it would also be nice to do some sort of site-spring-cleaning as well. The result is as you can see, similar bluish gradient at the top, just slightly shorter, and a widened viewable content area, making some of the quite lengthy articles somehow appear less lengthy... Of course there are some other changes too. The first one is a new commenting system implemented for every article and news entry such as the one you are reading now. Hopefully this will encourage people to give their thoughts, give suggestion, and point out errors. The second one is a contact page for people to give feedbacks regarding other stuff such as site suggestion and bugs reporting. If you do find one, I kindly ask to be informed of it. Among other things, there are some new and old materials laying around but not yet ready for publishing. It is my intent to get back into the drafts and start putting in new materials online as soon as my free time allows me.

Are you new to the site? Although it shouldn't be much a mystery to figure what the site is about, there is actually a page dedicated to do the explaining. It is in the about section if you care to read.
27 June 2009
Bilinear image scaling is about the same as nearest neighbor image scaling except with interpolation. Instead of copying the neighboring pixels (which often results in jaggy image), interpolation technique based on surrounding pixels is used to produce much smoother scaling.
25 June 2009
Linear interpolation is a basic form of interpolation. It is a method to estimate property (in this case color) of any arbitrary point between two or more given points. There are many other types of interpolation, and many different uses (not just color estimation). To name a few others we have polynomial and cubic spline interpolation. The focus in this article however is on the basic of its implementation – simple and easy to understand.
25 October 2007
Prim's algorithm is another kind of a greedy algorithm, just like dijkstra's shortest path algorithm. However the difference is Prim's algorithm is to find a minimum spanning tree, not the least path taken as in dijkstra's. A minimum spanning tree is a tree having branches that are as short as possible. When all the branches are measured and summed it must be the smallest value possible.
18 October 2007
The algorithm will be much easier to understand when we see it in action. Here is an applet demonstrating dijkstra's algorithm process when roaming a network. In this demonstration, our search begin at node g and ends only after all node has been visited. Try clicking and keep clicking the applet to conduct step-by-step search. You will notice nodes and paths changing colors.
18 October 2007
This is a page mainly for demonstrating the box filtering algorithm using Java applet, make sure your browser is Java capable and enabled. If you are interested in reading the article for box filtering visit this link and see for yourself. Otherwise just play around with the applet below.
13 October 2007
Before anything else examine the circles below. What is the characteristic?