S. T. Fathima

Bio: S. T. Fathima is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Stairstep interpolation & Linear interpolation. The author has an hindex of 1, co-authored 2 publications receiving 5 citations.

Significance of initial interpolation in band-limited signal interpolation

Abstract: An improved version of the Papoulis algorithm for bandlimited signal interpolation is presented. This algorithm uses the concept of initial interpolation. The justification for initial interpolation is developed only through experimental studies. It is shown that the performance of the interpolation scheme depends on the number and distribution of the known data samples. >

Handbook of Fourier Analysis & Its Applications

Abstract: 1. Introduction 2. Fundamentals of Fourier Analysis 3. Fourier Analysis in Systems Theory 4. Fourier Transforms in Probability, Random Variables and Stochastic Processes 5. The Sampling Theory 6. Generalizations of the Sampling Theorem 7. Noise and Error Effects 8. Multidimensional Signal Analysis 9. Time-Frequency Representations 10. Signal Recovery 11. Signal and Image Synthesis: Alternating Projections Onto Convex Sets 12. Mathematical Morphology and Fourier Analysis on Time Sales 13. Applications 14. Appendices 15. Reference

Image analysis and computer vision: 1990

Abstract: This paper presents a bibliography of over 1600 references related to computer vision and image analysis, arranged by subject matter. The topics covered include architectures; computational techniques; feature detection, segmentation, and image analysis; matching, stereo, and time-varying imagery; shape and pattern; color and texture; and three-dimensional scene analysis. A few references are also given on related topics, such as computational geometry, computer graphics, image input/output and coding, image processing, optical processing, visual perception, neural nets, pattern recognition, and artificial intelligence.

Comparison of methods for spectral estimation with interrupted data

Abstract: The problem considered is to match the periodogram (spectrum) of a real sampled data sequence when only the samples outside a gap are available: that is, when the samples in the gap are missing or corrupted. Different arguments lead to three reasonable estimation algorithms. Tests with contrived data records indicate that two of these algorithms are preferable, one when the gap length is less than 15% of the record, and the other for 20%-50% gaps. An algorithm based on an autoregressive model is found to have an estimate performance that is relatively independent of gap length. >

Entropy Based Approach to Data Loss Reparation Through the Indeterminate Fine-Grained Parallel Computation

Abstract: The new method of a gap recovery in symbol sequences is presented. A covering is combined from the suitable reasonably short strings of the parts of a sequence available for observation. Two criteria are introduced to choose the best covering. It must yield the maximum of entropy of a frequency dictionary developed over the sequence obtained due to the recovery, if an overlapping combined from the copies of strings from the available parts of the sequence exists. The second criterion identifies the best covering in case when one has to use any string to cover the gap; here the best covering must yield the minimum of specific entropy of the frequency dictionary developed over the available parts of the sequence against the one developed over the entire sequence obtained due to the recovery. Kirdin kinetic machine which is the ideal fine-grained structureless computer has been used to resolve the problem of the reconstruction of a gap in symbol sequence.

A Codeword Classification Mapping Based CAVLC Decoding Implement Algorithm

Abstract: The property of H.264/AVC CAVLC(context-adaptive variable-length coding) and the characteristic of Huffman Coding are analyzed, and a high efficiency implement algorithm of CAVLC decoding based on codeword classification mapping is proposed in this paper. According to the characteristic of Huffman Coding, mapping the codewords and it's syntax element to classification mapped tables, accelerate the process of CAVLC decoding enormously at the expense of little memory consumption. The simulation results show that the proposed algorithm achieves an approximate 24-50% speed advance without degrading video quality as compared to the conventional CAVLC decoding.