Search - COST 2

Search - COST 2 - List

[Special Effects] rtfluid06.src DL : 0: Real-Time Particle-Based Fluid Simulation Rendering realistic moving water is one of the key techniques that immerse the viewers into interactive graphics world including computer games. Physical simulations based on computational fluid dynamics (CFD) is useful for rendering the realistic behaviour of water. However, real-time fluid rendering has been one of the challenging tasks because of high computational cost of CFD. This research shows the fast implementation of the simulation based on Smoothed Particle Hydrodynamics.
Date : 2025-12-25 Size : 1.64mb User : mike
[Special Effects] MegaParticlesDemo DL : 0: Rendering realistic moving water is one of the key techniques that immerse the viewers into interactive graphics world including computer games. Physical simulations based on computational fluid dynamics (CFD) is useful for rendering the realistic behaviour of water. However, real-time fluid rendering has been one of the challenging tasks because of high computational cost of CFD. This research shows the fast implementation of the simulation based on Smoothed Particle Hydrodynamics.
Date : 2025-12-25 Size : 1.59mb User : mike
[Special Effects] paq8n DL : 0: PAQ - console archiver with open source developers who jointly have risen in the first place ratings of many test data compression (although at the cost of CPU time and memory).
Date : 2025-12-25 Size : 83kb User : andrey
[Special Effects] StereoVisionVS2008 DL : 0: 双目立体视觉，采用两张图像恢复三维形状，外国人的一个开源项目。-System Prototype to make 3D reconstruction solution using stereo images. It works with common cameras and not require large amount of memory during the images processing. It provides a low cost solution to educational environments with low budgets.
Date : 2025-12-25 Size : 9.07mb User : 王邦平
[Special Effects] IEEE_ExtremePrograming_2010_D DL : 0: This question was asked in IEEE Extreme Programming 2010. Its a graph problem, that the nodes with minimum cost should be followed.
Date : 2025-12-25 Size : 1kb User : Molinken
[Special Effects] blossom5-v2.02.src DL : 0: 图像密集匹配经典算法（图割）代码论文“Blossom V: A new implementation of a minimum cost perfect matching algorithm.”的实现源码-BLOSSOM V- implementation of Edmonds algorithm for computing a minimum cost perfect matching in a graph Version 2.02
Date : 2025-12-25 Size : 59kb User : zhang
[Special Effects] Cost-Aggregation DL : 0: 基于树形结构算法的全局立体匹配源代码。效果不错-Tree structure algorithm-based global stereo matching source code.
Date : 2025-12-25 Size : 2.93mb User : tc
[Special Effects] stereo_sad DL : 1: 自己编写的立体匹配源代码，采用SAD作为费用累积函数，并且加入了L-R Check和邻域投票法解决误匹配问题-Stereo matching source code to write your own, using the SAD as cost cumulative function, and LR Check and neighborhood voting method to solve the problem of mismatching
Date : 2025-12-25 Size : 6kb User : 纪坤
[Special Effects] DarkchannelPriorDehazeCProgram DL : 0: 改进的基于暗原色先验图像去雾算法，采用C语言实现，有耗时统计和效果显示，对做去雾研究的人员有一定的参考价值。-this is a program exe coded by the c language, there are time cost and the result display,then is refered as a standard to the dehaze.
Date : 2025-12-25 Size : 9.84mb User : idlerrf
[Special Effects] DPStereoMatch DL : 0: 利用动态规划算法的优点，使用一种基于行列动态规划的自适应立体匹配算法，采用自适应代价函数和能量最小化模型，对最优化问题进行求解。-Take advantage of the dynamic programming algorithm uses an adaptive stereo matching algorithm based on dynamic programming ranks, adaptive cost function and energy minimization model for optimization problem to solve.
Date : 2025-12-25 Size : 5.26mb User : 李枫
[Special Effects] convexMRF-v1.0.src DL : 0: 马尔可夫模型，用于分割和建立数学模型New Algorithms for the Dual of the Convex Cost Network Flow Problem with Application to Computer Vision-convex MRF energy functions
Date : 2025-12-25 Size : 9kb User : 高林
[Special Effects] LiveWireAlg DL : 0: 是一种路径搜索方法。 Livewire需要对应节点的状态：expanded(作为种子点算过)，initial (没算过)，active(作为种子的邻域被算过，可以继续更新) 或者frozen，frame（目标区），narrowband。也可以先设frozen区域，限制计算范围。节点的速度值（fastmarching中用于计算时间）节点的时间（代价值）为了连续地计算更新节点信息，需要将节点保存为可以找到其父节点（指针或数组中的值）的链表形式，通过此链表，找到待计算队列中代价值最小的点，进行邻域代价值更新计算。链表内部是优先队列。种子点存储在此队列中，当队列为空，停止计算。当计算过程中遇到目标点，停止计算。也可以当计算过程中，frame目标区的代价值大于阈值，停止计算。如果，整个计算区域的每个节点，是既有代价值、状态值，又有父节点的指针，区域计算接受后，就可以通过每个点的父节点，一直找到目标点为止。如果，代价值是通过位置和值存储的，状态值也是位置和byte存储的，种子点队列用的是含有代价值、当前位置、父节点位置的优先队列。所有值更新后，通过开始点邻域的最小代价值的区域生长，找到目标节点位置。区域更新时先碰到目标点可以提前结束-it is a way to find the cost for every point to go to the seed point. thus one can choose a point and find a way it to the seed point with the least cost.
Date : 2025-12-25 Size : 5.15mb User : lynn
[Special Effects] CSCA DL : 0: 这是用C++实现图像立体匹配的一个完整的论文代码，主要特性是提出了一种全新的跨规模代价聚合方法，适合对于图像的立体匹配有一定基础的人学习-Cross-Scale Cost Aggregation for Stereo Matching
Date : 2025-12-25 Size : 31.35mb User : linjie