C显示图像

资源描述CS7495 Final Project  Sooraj Bhat Object Removal by Exemplar-based Inpainting USING THE CODE Everything was done in Matlab and MEX (i.e. a C function callable from Matlab).  First, the C code needs to be compiled.  At the Matlab prompt, type:    mex bestexemplarhelper.c You should then be able to run the following (which takes ~2mins on my 2GHz Pentium 4 laptop with 256MB of RAM):    [i1,i2,i3,c,d,mov] = inpaint("bungee0.png","bungee1.png",[0 255 0]); A smaller run (~25 seconds) would be:    [i1,i2,i3,c,d,mov] = inpaint("bw0.png","bw2.png",[0 255 0]); To visualize:    plotall;    close; movie(mov); SAMPLE IMAGES & RESULTS *0.png      The original images ("bw" and "bungee") *{1,2}.png    The different fill region masks. *P2.png     &nbs

很有用的算法哦。这是我好不容易-useful algorithm oh. This is not easy, I

奇数N 阶魔方阵问题： 奇数N 阶魔方阵的构造规则如下： 1、在第一行的正中间填入1； 2、如果左上角能够移动，则往左上角填入后继的数；如果左上角不 能移动，则顺移到该列最下方左边的一列中最靠近该列的位置； 3、如果左上角不能移动，同时在该列位置的最下方左边最靠近的位 置处也不能填入数，则往该位置的上一行的最右边的位置处填入 后继数； 4、每次尽可能地往左上角填数，如果发现左上角已经填满了数，则 从当前填的数的位置下方填上后继数。 要求： 无。 输入： 用户从键盘任意输入一个正奇数。 输出： 打印出该魔方阵。-odd N bands Demon Lineup : N-odd magic Lineup Construction Rules are as follows : 1, the first line is the middle of a preference; Two, if the upper left corner to Mobile, the successor to fill in the upper left; If the upper left corner, unable to move, with the move out of the bottom of the left one of the closest out of position; three, if the upper left corner, unable to move, while in the position shown in the bottom left nearest location Department has not entered a few, to the position of the party on the right side of the positions filled successor; 4, each possible to fill the upper left corner, if fill the upper left corner, has found a few, from the current fill several positions to fill in the bottom subsequent few. Requ

后缀树实现在java中。该算法后缀树实现。字符串是从控制台输入和输出是在输出文件中生成。

EMD分解C语言算法，内含EMD分解所需的三次样条插值C语言算法。-EMD decomposition algorithm C language, containing the decomposition EMD cubic spline interpolation algorithm C language.

算24点，若有解则输出每一步计算步骤，若无解则返回“No answer！”-Count 24 points, if so, what solutions are output every step of the calculation steps, if there are no solution is returned

ACM大学生程序设计竞赛广东省赛2005年赛题-ACM Collegiate Programming Contest in Guangdong Province tournament title game in 2005

数值处理算法源代码-numerical algorithm source code

资源描述这是使用stein算法，实现的计算两个32位数的最大公约数的算法，在这里面使用了流水线来提高吞吐量，并且提高了工作速度，初次之外，还有两个串转并和并转串的模块，供大家参考

挺好的用于计算年利率和月利率的vb程序-Holbrook used in the calculation of annual and monthly interest rates vb procedures