We present the mapping of a parallel thinning algorithm on shared memory SIMD computers. Four models of SM SIMD computers are considered. The parallel thinning algorithm is presented for all these four models of computers. The algorithm has been analyzed for time and cost performance on four ...
对《A Fast Parallel Algorithm for Thinning Digital Patterns》一文的理解(上),程序员大本营,技术文章内容聚合第一站。
parallel processingA disconnectedness problem which appeared in the 1subcycle parallel thinning algorithm [1] is shown and a correct condition is presented to overcome this problem. As a result, to preserve the connectivity of a P8ETtype thin line, the removal of a (quasi) Tjunction should ...
Fu, A 3D parallel skeletonwize thinning algorithm, in: IEEE Conference on Pattern Recognition and Image Processing, 1982, pp. 678–683. Google Scholar [79] Borgefors G. Distance transformations in digital images Comput. Vis. Graph. Image Process., 34 (1986), pp. 344-371, 10.1016/S0734-...
Cheng X, Huang Y, Cai X, Wei O (2014) An adaptive memetic algorithm based on multiobjective optimization for software next release problem. In: GECCO (Companion), ACM, pp 185–186 Google Scholar Cheng YH, Lai CM (2017) Control strategy optimization for parallel hybrid electric vehicles usi...
as well as the impact of more bulk defects lowering the bulk lifetime (Supplementary Fig.18). We found that both effects (increased energy offset and reduced bulk lifetime) lead to a parallel downshift of the scan rate-dependent PCE rather than an increase in the ionic losses, which is no...
To develop a novel algorithm based on ray tracing, simulated visual performance and through-focus optimization for an accurate intraocular lens (IOL) power calculation. Custom-developed algorithms for ray tracing optimization (RTO) were used to combine the natural corneal higher-order aberrations (HOAs...
Given that the (x, y)-model has been selected by the filter, the model may be initialized by a set of connectivity cuts generated by a dual ascent algorithm [27], and with a starting solution generated by a parallel implementation of a partitioning heuristic (see [21]). Based on the ...
(2001) used a modified version with limited memory of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. However, since the definition of the cost-function derivative is not always straightforward, gradient-free optimization algorithms are more commonly used. Such algorithms treat the cost ...
The solution method is the PISO algorithm, which moves the repeated computation of the momentum equation inside the solution phase of the pressure correction equation. The dimensionless time step is 0.02. The number of iterations is limited to 20 per time step, while the true number of ...