2 resultados para Minimization Algorithm

em Digital Peer Publishing


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article deals with complex material flow systems and series connections of conveyor and op-erating elements. These can be characterised by a specific availability. The thus resultant overall availabil-ity of necessary “technical throughput” of the individual elements for the achievement of a specified throughput. When the conveyor and operating elements are subjected to a stochastic distribution, the interposition of buffers is necessary but these can also lead to a reduction of the necessary throughput due faults. The system behaviour of complex installations can only be investigated by simulation. The parame-ter changes required in order to achieve specific target values can also be determined by simulation runs in iteration loops.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present an algorithm for estimating dense image correspondences. Our versatile approach lends itself to various tasks typical for video post-processing, including image morphing, optical flow estimation, stereo rectification, disparity/depth reconstruction, and baseline adjustment. We incorporate recent advances in feature matching, energy minimization, stereo vision, and data clustering into our approach. At the core of our correspondence estimation we use Efficient Belief Propagation for energy minimization. While state-of-the-art algorithms only work on thumbnail-sized images, our novel feature downsampling scheme in combination with a simple, yet efficient data term compression, can cope with high-resolution data. The incorporation of SIFT (Scale-Invariant Feature Transform) features into data term computation further resolves matching ambiguities, making long-range correspondence estimation possible. We detect occluded areas by evaluating the correspondence symmetry, we further apply Geodesic matting to automatically determine plausible values in these regions.