Experimental results with one of the algorithms, namely the EM algorithm, are presented to demonstrate the gains of this exercise.
Such a situation can be mitigated by increasing the complexity of the adaptation algorithm, namely in what concerns analysis and decision.
These results are compared with those obtained by the existing algorithms, namely, IP-VQ method [12], JPEG2000 method [32], singular value decomposition and wave difference reduction (SVD & WDR) method [33].
In this subsection, we propose a new improved algorithm based on the PBSD algorithm, namely, IPBSD algorithm, by taking the counterpart ML estimate into account when computing the LLRs of the modulated symbol bits.
In order to distinguish the status of collisions for further analysis, the collisions between polygonal models are categorized into three types by evaluation algorithm, namely real collision, potential collision, and fake collision.
Based on the discussion above, we propose the following algorithm, namely Lower Bound Tightening (LBT) algorithm.
To derive the proposed multi-dimensional extension of the M-EFT algorithm, namely the R-D EFT, we start by looking at an R-dimensional noise-only case.
The proposed algorithm, namely, FKBN, offers a trade-off between probability estimation and network structure complexity.
We have published an open-source C implementation of the above algorithm, namely mmc.
This paper compares the maps produced by three algorithms, namely the automated land component mapper (ALCoM), the iterative self-organizing data analysis technique algorithm (ISODATA) and multi-resolution image segmentation (MRS), to determine which technique produces the most homogenous and morphologically representative land components for an area in the Western Cape province of South Africa.
