An improved forming algorithm of error-patterns for two-dimensional codes

Dvelopments of techniques for processing two-dimensional information have aroused interest in two-dimensional codes. [1] have investigated the two-dimensional codes called - βγ array codes. Nonzero codewords of these codes are two-dimensional versions of M-sequences and have interesting properties that are essentially two-dimensional.[2] has made studies on product codes from a two-dimensional viewpoint and has shown that the product of an (n1, k1) cyclic code and an (n2, k2) cyclic code permits the correction of every two dimensional burst (or spot) of area (n1 − k1) or (n2, k2) or less. In this paper, we analyze the methods for forming error vectors and the properties of error vectors, which are allowed to determining the type of error vector in two-dimensional coding of information

Classification of point forms and establish a library for coding the skeleton of the binary images

In this paper, the methods for classifying points which are allowed to determining the types of two-dimensional vectors and can be used to code the skeleton of the binary image were analyzed. On the basis of , our research focused on the matrix which is t by t, in which there are only t elements are one. These elements can be called as point (pixel). An improved algorithm for classifying points is proposed. The result of the preprocessing point is a compressed library of point patterns

Multiple sensors

The paper discusses an advanced human fall detection algorithm that utilizes data from multiple sensors, specifically acceleration sensors and video sensors, to enhance fall risk management for high-risk groups like the elderly and those with limited mobility. The key innovation in this research is the integration of multiple sensors, which enhances the accuracy and reliability in differentiating between genuine falls and non-fall activities. This advancement significantly enhances the safety of individuals who are at a high risk of falling

A novel fully parallel skeletonization algorithm

A Skeleton that is extracted by a skeletonization algorithm from a binary image is useful for object description, matching, recognition and compression. The parallel thinning algorithm, one of the skeletonization algorithms is well known to have computational effciency. The main contribution of this paper is that we proposed a novel fully parallel thinning algorithm based on a comprehensive investigation of the well-known Zhang-Suen (ZS)-series algorithms and the one-pass thinning algorithm (OPTA)-series algorithms, which not only has good performance in terms of (8,4) connectivity preservation and single-pixel thickness, but also has the following qualities: it is more robust to the boundary noise than the OPTA-series algorithms and it is faster than the ZS-series algorithms in terms of thinning speed, as confirmed by the experiments presented in this paper

Parallel skeleton algorithm with one-subiteration

The skeletonize of the binary image has crucial application in the field of target recognition. The thinning result of the Zhang’s fast parallel thinning algorithm maintains the connection of the original image, has a good structural form and has no burs. However, Zhang’s fast parallel thinning algorithm consists two subiterations in where the most of operations are similar, which cause the waste of the resources of the calculate. Besides, it can’t ensure the single pixel width, which brings difficulties for post-processing

Issuing Digital Signatures for Integrity and Authentication of Digital Documents

In this paper, we developed a secure system for issuing digital signature for digital documents and certificates using message digest algorithm (MD5). The developed system is providing the integrity and authentication for certificates by combining the information of participant and supply them to MD5 algorithm to produce a unique hash key of 32 digits which is hard to guess or attack. The process provides a certificate which allows for the authentication of a document at any time. The proposed system used and tested to produce digital certificate for participant of electronic seminars in Mustansiriyah university which were about 1000 certificate. The results were good and very fair to authenticate certificates and preventing forgery

Improved decoding method of hamming product codes

Product codes are preferred in high data rate wireless communication systems to achieve good error performance. However, to conceive a proper decoding method, which can correct all the potential errors pattern that within the half of the code distance for the product code, is not easy. In this paper, an improved decoding method of hamming product code has proposed. The proposed method can correct all the combinations of errors that less than four. As a result, it has a good performance in BER and WER

A fast feature error pattern generating two-dimensional error patterns

In this paper, after comprehensive analysing the existing method for forming feature error pattern, in which the types of two-dimensional vectors are allowed to determine. A fast feature error pattern generating algorithm is proposed by the idea that constructing other error patterns by using the simple or basic error pattern. This algorithm is faster than the previous algorithm theoretically

Interleaving based on linear block code

In this paper the methods of transforming one-dimensional linear code into two- dimensional symmetric and asymmetric recursive scattering information code are analyzed. The method has transformed the encoded information sequence into a discrete sequence to combat the burst noisy environment. Channel coding is effective when detecting and correcting single errors are not too long strings and is ineffective for long burst errors caused by interference and fading of the mobile communication channel. However, the interleaving technique can solve the above problem without adding extra redundancy

An Iterative Error Patterns Library Formation Method for the Decoding of Product Codes

Product codes are preferred in high data rate wireless communication systems to achieve good error performance. In this paper, the problem of twodimensional syndrome-norm decoding of product codes based on a library of error patterns is considered. In product coding, sequence code is first transformed into a code matrix, and then the row and column check code are calculated. In the decoder, the error position of the two-dimensional can be obtained by the operations that first calculate the syndromes and norms, then match with the error patterns in the existing library. The error pattern library is stored in the memory and generated by the subset of the error pattern. This paper proposed a mathematical model for fast generating a library based on the iterative expansion of the error patterns, which makes it possible to shorten the computational complexity in comparison with the known approaches