arXiv subjects
Publications and source records attributed to H. M. de Oliveira.
The k-trigonometric functions over the Galois Field GF(q) are introduced and their main properties derived. This leads to the definition of the cask(.) function over GF(q), which in turn leads to a finite field Hartley Transform. The main properties of this new discrete transform are presented and areas for possible applications are mentioned.
A new approach to multiple access based on finite field transforms is investigated. These schemes, termed Galois-Division Multiple Access (GDMA), offer compact bandwidth requirements. A new digital transform, the Finite Field Hartley Transform (FFHT) requires to deal with fields of characteristic p, p \neq 2. A binary-to-p-ary (p \neq 2) mapping based on the opportunistic secondary channel is introduced. This allows the use of GDMA in conjunction with available digital systems. The performance of GDMA is also evaluated.
The human visual color response is driven by specialized cells called cones, which exist in three types, viz. R, G, and B. Software is developed to simulate how color images are displayed for different types of color blindness. Specified the default color deficiency associated with a user, it generates a preview of the rainbow (in the visible range, from red to violet) and shows up, side by side with a colorful image provided as input, the display correspondent colorblind. The idea is to provide an image processing after image acquisition to enable a better perception ofcolors by the color blind. Examples of pseudo-correction are shown for the case of Protanopia (red blindness). The system is adapted into a screen of an i-pad or a cellphone in which the colorblind observe the camera, the image processed with color detail previously imperceptible by his naked eye. As prospecting, wearable computer glasses could be manufactured to provide a corrected image playback. The approach can also provide augmented reality for human vision by adding the UV or IR responses as a new feature of Google Glass.
An approach for approximately calculating the number of genes in a genome is presented, which takes into account the average protein length expected for the species. A number of virus, bacterial and eukaryotic genomes are scrutinized. Genome figures are presented, which support the average protein size of a species as a criterion for assessing life complexity. The human gene distribution in the 23 chromosomes is investigated emphasizing the genomic rate, the mean 'exon' length, and the mean 'exons per gene'. It is shown that storing all genes of a single human definitely requires less than 12 MB.
Spread-spectrum systems are presented, which are based on Finite Field Fourier Transforms. Orthogonal spreading sequences defined over a finite field are derived. New digital multiplex schemes based on such spread-spectrum systems are also introduced, which are multilevel Coding Division Multiplex. These schemes termed Galois-field Division Multiplex (GDM) offer compact bandwidth requirements because only leaders of cyclotomic cosets are needed to be transmitted.
An original multiplex scheme is introduced, which is based on Mallat's multiresolution formulation of wavelet systems. This system is adaptable and its implementation is well matched to digital signal processors and computers. The approach termed multiresolution division multiplex (MRDM) is intensive in signal processing (SP) tools, extremely flexible and can combine a variety of tributaries at different bit rates. A broad variety of orthogonal wavelet systems can endow with MRDM and the channel waveforms, and consequently the spectral shape and system performance depend upon the selected wavelets. Demultiplex can be done efficiently, since the number of floating multiplications and additions increase only linearly with the length of signals. A Haar-based MRDM scheme is presented to illustrate the versatility of this new multiplex approach.
This paper exploits the multiresolution analysis in the fault analysis on transmission lines. Faults were simulated using the ATP (Alternative Transient Program), considering signals at 128/cycle. A nonorthogonal multiresolution analysis was provided by Gegenbauer scaling and wavelet filters. In the cases where the signal reconstruction is not required, orthogonality may be immaterial. Gegenbauer filter banks are thereby offered in this paper as a tool for analyzing fault signals on transmission lines. Results are compared to those ones derived from a 4-coefficient Daubechies filter. The main advantages in favor of Gegenbauer filters are their smaller computational effort and their constant group delay, as they are symmetric filters.
This paper presents the foundations of a computer oriented approach for preparing a list of random treatment assignments to be adopted in randomised controlled trials. Software is presented which can be applied in the earliest stage of clinical trials and bioequivalence assays. This allocation of patients to treatment in clinical trials ensures exactly equal treatment numbers. The investigation of the randomness properties of an assignment leads to the concept of a 'strong randomised list'. The new approach introduced in this note is based on thresholds and produces a strong randomised list of treatment assignments.
Finite field transforms have many applications and, in many cases, can be implemented with a low computational complexity. In this paper, the Z Transform over a finite field is introduced and some of its properties are presented.
Shape-invariant signals under the Discrete Fourier Transform are investigated, leading to a class of eigenfunctions for the unitary discrete Fourier operator. Such invariant sequences (eigensequences) are suggested as user signatures over the real adder channel (t-RAC) and a multiuser communication system over the t-RAC is presented.
This paper presents a new approach for a vocoder design based on full frequency masking by octaves in addition to a technique for spectral filling via beta probability distribution. Some psycho-acoustic characteristics of human hearing - inaudibility masking in frequency and phase - are used as a basis for the proposed algorithm. The results confirm that this technique may be useful to save bandwidth in applications requiring intelligibility. It is recommended for the legal eavesdropping of long voice conversations.
Real-valued block codes are introduced, which are derived from Discrete Fourier Transforms (DFT) and Discrete Hartley Transforms (DHT). These algebraic structures are built from the eigensequences of the transforms. Generator and parity check matrices were computed for codes up to block length N=24. They can be viewed as lattices codes so the main parameters (dimension, minimal norm, area of the Voronoi region, density, and centre density) are computed. Particularly, Hamming-Hartley and Golay-Hartley block codes are presented. These codes may possibly help an efficient computation of a DHT/DFT.
In this paper a variant of the classical hierarchical cluster analysis is reported. This agglomerative (bottom-up) cluster technique is referred to as the Adaptive Mean-Linkage Algorithm. It can be interpreted as a linkage algorithm where the value of the threshold is conveniently up-dated at each interaction. The superiority of the adaptive clustering with respect to the average-linkage algorithm follows because it achieves a good compromise on threshold values: Thresholds based on the cut-off distance are sufficiently small to assure the homogeneity and also large enough to guarantee at least a pair of merging sets. This approach is applied to a set of possible substituents in a chemical series.
A relationship between the Riemann zeta function and a density on integer sets is explored. Several properties of the examined density are derived.
New continuous wavelets of compact support are introduced, which are related to the beta distribution. They can be built from probability distributions using 'blur'derivatives. These new wavelets have just one cycle, so they are termed unicycle wavelets. They can be viewed as a soft variety of Haar wavelets whose shape is fine-tuned by two parameters a and b. Close expressions for beta wavelets and scale functions as well as their spectra are derived. Their importance is due to the Central Limit Theorem applied for compactly supported signals.
This paper introduces some foundations of wavelets over Galois fields. Standard orthogonal finite-field wavelets (FF-Wavelets) including FF-Haar and FF-Daubechies are derived. Non-orthogonal FF-wavelets such as B-spline over GF(p) are also considered. A few examples of multiresolution analysis over Finite fields are presented showing how to perform Laplacian pyramid filtering of finite block lengths sequences. An application of FF-wavelets to design spread-spectrum sequences is presented.
In continuous-time wavelet analysis, most wavelet present some kind of symmetry. Based on the Fourier and Hartley transform kernels, a new wavelet multiresolution analysis is proposed. This approach is based on a pair of orthogonal wavelet functions and is named as the Fourier-Like and Hartley-Like wavelet analysis. A Hilbert transform analysis on the wavelet theory is also included.
This paper presents a novel approach for deciding on the appropriateness or not of an acquired fingerprint image into a given database. The process begins with the assembly of a training base in an image space constructed by combining Principal Component Analysis (PCA) and edge detection. Then, the parameter H, a new feature that helps in the decision making about the relevance of a fingerprint image in databases, is derived from a relationship between Euclidean and Mahalanobian distances. This procedure ends with the lifting of the curve of the Receiver Operating Characteristic (ROC), where the thresholds defined on the parameter H are chosen according to the acceptable rates of false positives and false negatives.