STRANDMARK.NET

strandmark.wordpress.com

GridCut | Petter Strandmark

https://strandmark.wordpress.com/2012/06/15/gridcut

Computer vison, image processing and optimization. I have briefly tried the GridCut code ( http:/ gridcut.com. And performed the same experiments as in the previous post. Below are the updated graphs. The GridCut code performs very well for graphs with a reasonable amount of regularization, but becomes very slow for a high amount of regularization, just as BK. Feed You can leave a response. From your own site. Laquo; Previous Post. Next Post ». Leave a Reply Cancel reply. Enter your comment here.

strandmark.wordpress.com

Swedish Umbilical Cord Clamping Study is All Over the News | Petter Strandmark

https://strandmark.wordpress.com/2015/05/26/swedish-umbilical-cord-clamping-study-is-all-over-the-news

Computer vison, image processing and optimization. Swedish Umbilical Cord Clamping Study is All Over the News. Today, the news in Sweden reported on a study. That shows the advantages of delayed cord clamping after 4 years. I thought the results sounded remarkably good, so I looked up the article. Here is a table (from which I have removed most columns):. I am not saying this study is wrong, but look at those p-values! If you measure enough variables, some of them are bound to turn out significant!

strandmark.wordpress.com

Petter Strandmark | Computer vison, image processing and optimization | Page 2

https://strandmark.wordpress.com/page/2

Computer vison, image processing and optimization. Graph cuts in nVidia’s NPP toolbox (imageSegmentationNPP). February 18, 2013. Note: This post has been updated after I received some help from nVidia’s Timo Stich. It turned out that some weights have to be set to zero; otherwise, CUDA gives an incorrect answer. Today, I downloaded the latest version of nVidia’s CUDA to try out the graph cut segmentation present in NPP. Read the rest of this entry ». June 15, 2012. Below are the updated graphs. For visio...

strandmark.wordpress.com

Shortest Paths with Curvature and Torsion | Petter Strandmark

https://strandmark.wordpress.com/2013/12/21/shortest-paths-with-curvature-and-torsion

Computer vison, image processing and optimization. Shortest Paths with Curvature and Torsion. Johannes Ulén, Fredrik Kahl and I have recently been to the International Conference on Computer Vision to present our paper. Shortest Paths with Curvature and Torsion. In which we explore applications of higher-order regularization for shortest paths. See the paper here. The code is available here. This entry was posted on Saturday, December 21st, 2013 at 6:31 pm and is filed under Code. From your own site.

strandmark.wordpress.com

Graph cuts in nVidia’s NPP toolbox (imageSegmentationNPP) | Petter Strandmark

https://strandmark.wordpress.com/2013/02/18/graph-cuts-in-nvidias-npp-toolbox-imagesegmentationnpp-do-not-work

Computer vison, image processing and optimization. Graph cuts in nVidia’s NPP toolbox (imageSegmentationNPP). Note: This post has been updated after I received some help from nVidia’s Timo Stich. It turned out that some weights have to be set to zero; otherwise, CUDA gives an incorrect answer. Today, I downloaded the latest version of nVidia’s CUDA to try out the graph cut segmentation present in NPP. Low amount of regularization, so I increased the regularization:. Feed You can leave a response. Good to...

strandmark.wordpress.com

Continuous Optimization for Fields of Experts Denoising Works | Petter Strandmark

https://strandmark.wordpress.com/2014/03/25/continuous-optimization-for-fields-of-experts-denoising-works

Computer vison, image processing and optimization. Continuous Optimization for Fields of Experts Denoising Works. Sameer Agarwal and I just uploaded a paper to arχiv.org. Continuous Optimization for Fields of Experts Denoising Works. We show that simple non-linear least-squares is better than sophisticated discrete optimization methods for certain image denoising problems. This entry was posted on Tuesday, March 25th, 2014 at 7:53 pm and is filed under Pseudo-Boolean. Feed You can leave a response. Short...

strandmark.wordpress.com

Maximum flow for vision | Petter Strandmark

https://strandmark.wordpress.com/2012/01/30/maximum-flow-for-vision

Computer vison, image processing and optimization. Maximum flow for vision. Last week, I decided to try out the IBFS maximum flow algorithm. For vision applications for the first time. The algorithm is due to A.V. Goldberg, S.Hed, H. Kaplan, R.E. Tarjan, and R.F. Werneck, who have released an implementation. Which uses the same interface as the commonly used algorithm by Boykov and Kolmogorov. Feed You can leave a response. From your own site. Laquo; Previous Post. Next Post ». Maximum flow for vision.

strandmark.wordpress.com

C++14 | Petter Strandmark

https://strandmark.wordpress.com/2013/08/05/c14

Computer vison, image processing and optimization. Consider the following code:. Void f(const int &) { cout 1; }. Void f(int& ) { cout 2; }. Void g(const T&) { cout 1; }. Void g(T& ) { cout 2; }. What will the code print? The answer is “2212,” which can be quite surprising. But what if we really want a templated function that accepts r-value references? It turns out to be somewhat complicated (I think this works):. Is lvalue reference T : value, void : type. G(T& ) { cout 2; }. Auto x = my function();.

strandmark.wordpress.com

Rounding of strings | Petter Strandmark

https://strandmark.wordpress.com/2013/04/23/rounding-of-strings

Computer vison, image processing and optimization. Consider the following program:. Auto f = 1.0f;. Printf(“%f n”, f / 0);. Printf(“%.1f n”, f / 0);. Printf(“%.2f n”, f / 0);. Printf(“%.3f n”, f / 0);. Printf(“ n”);. Printf(“%f n”, f / 0);. Printf(“%.1f n”, f / 0);. Printf(“%.2f n”, f / 0);. Printf(“%.3f n”, f / 0);. With Visual Studio 2012, it outputs the following:. The strings are also rounded! That is, ‘#’ 1 = ‘$’. This can be a bit surprising. Feed You can leave a response. From your own site. Short...