A trellis coded 4-ary Pulse Amplitude Modulation (4-PAM) is presented, where the encoding algorithm is derived from Distance Preserving Mapping (DPM) algorithm. In this work, we modify the DPM algorithm for 4-PAM and obtain a new construction for mapping binary sequences to permutation sequences, where the permutation sequences are obtained by permuting symbols of a 4-PAM constellation. The resulting codebook of permutation sequences formed this way are termed mappings. We also present several metrics for assessing the performance of the mappings from our construction, and we show that a metric called the Sum of Product of Distances (SOPD) is the best metric to use when judging the performance of the mappings. Finally, performance results are presented, where the mappings from our construction are compared against each other and also against the conventional mappings in the literature.
The aim of this paper is to compare the efficiency of various outlier correction methods for ECG signal processing in biometric applications. The main idea is to correct anomalies in various segments of ECG waveform rather than skipping a corrupted ECG heartbeat in order to achieve better statistics. Experiments were performed using a self-collected Lviv Biometric Dataset. This database contains over 1400 records for 95 unique persons. The baseline identification accuracy without any correction is around 86%. After applying the outlier correction the results were improved up to 98% for autoencoder based algorithms and up to 97.1% for sliding Euclidean window. Adding outlier correction stage in the biometric identification process results in increased processing time (up to 20%), however, it is not critical in the most use-cases.
The copy-move forgery detection (CMFD) begins with the preprocessing until the image is ready to process. Then, the image features are extracted using a feature-transform-based extraction called the scale-invariant feature transform (SIFT). The last step is features matching using Generalized 2 Nearest- Neighbor (G2NN) method with threshold values variation. The problem is what is the optimal threshold value and number of keypoints so that copy-move detection has the highest accuracy. The optimal threshold value and number of keypoints had determined so that the detection has the highest accuracy. The research was carried out on images without noise and with Gaussian noise.