[Update2] I used the library eigen to reimplement the algorithm, reducing the code from 84 lines to 41 lines (wow), and time increases 11%. Looks acceptable, with similar workload as unoptimized C#, but the same speed as heavily optimized C# (with 164 lines of code and unsafe compilation). What's even …
Host paper reading seminars with github
Github is a well-known tool within the dev community. People use git(http://git-scm.com/) and github to collaboratively build awesome stuffs and also enjoy the social life (xD, geeks). I find it also useful in our daily research, say, to host a paper reading seminar. (I assume you are …
Thoughts about convex optimization
Just finished the final of convex optimization. This is really an interesting course, which even changed the way I'm looking at this world. In college, I was thinking in an algorithmic way, i.e., to solve a problem, will try to design some certain steps, following which we can get …
Markov Random Field (MRF) and Graph-Cut (3)
本文是《MRF GraphCut系列》系列的一部分：
- Markov Random Field (MRF) and Graph-Cut (1)
- Markov Random Field (MRF) and Graph-Cut (2)
- Markov Random Field (MRF) and Graph-Cut (3)（本文）
Implemented Loopy Belief Propagation [wiki], which is …
Markov Random Field (MRF) and Graph-Cut (2)
本文是《MRF GraphCut系列》系列的一部分：
- Markov Random Field (MRF) and Graph-Cut (1)
- Markov Random Field (MRF) and Graph-Cut (2)（本文）
- Markov Random Field (MRF) and Graph-Cut (3)
In the previous post, we've seen applications of MRF …