Multidimensional vector radix FHT algorithms

In this paper, efficient multidimensional (M-D) vector radix (VR) decimation-in-frequency and decimation-in-time fast Hartley transform (FHT) algorithms are derived for computing the discrete Hartley transform (DHT) of any dimension using an appropriate index mapping and the Kronecker product. The proposed algorithms are more effective and highly suitable for hardware and software implementations compared to all existing M-D FHT algorithms that are derived for the computation of the DHT of any dimension. The butterflies of the proposed algorithms are based on simple closed-form expressions that allow easy implementations of these algorithms for any dimension. In addition, the proposed algorithms possess properties such as high regularity, simplicity and in-place computation that are highly desirable for software and hardware implementations, especially for the M-D applications. A close relationship between the M-D VR complex-valued fast Fourier transform algorithms and the proposed M-D VR FHT algorithms is established. This type of relationship is of great significance for software and hardware implementations of the algorithms, since it is shown that because of this relationship and the fact that the DHT is an alternative to the discrete Fourier transform (DFT) for real data, a single module with a little or no modification can be used to carry out the forward and inverse M-D DFTs for real- or complex-valued data and M-D DHTs. Thus, the same module (with a little or no modification) can be used to cover all domains of applications that involve the DFTs or DHTs.     

On the VLSI implementation of real-time order statistic filters

Real-time implementation of an order-statistic filter (OSF) or ranked order filter requires the computation of the order statistic (ranked order) of the samples in a window which gets periodically updated with the arrival of a new sample(s). The authors give an algorithm for the computation of the running order statistic. A highly parallel architecture suitable for VLSI implementation is presented. The architecture is very versatile, with programmable window size and rank order. An expansion algorithm and its VLSI architecture, which permit the usage of two r-bit OSFs to implement an (r+1)-bit OSF, where r is the resolution of the input signal samples, are given. In a special case where one is satisfied with at most one LSB error, the hardware complexity of the proposed architecture can be reduced by almost one half. It is further shown how a VLSI chip incorporating the proposed architecture can be used as the basic building block in the real-time implementation of other forms of nonlinear filters     

Wavelet domain-based video noise reduction using temporal discrete cosine transform and hierarchically adapted thresholding

A novel spatio-temporal filter for video denoising, which operates entirely in the wavelet domain, is proposed. For effective noise reduction, the spatial and temporal redundancies that exist in the wavelet domain representation of a video signal are exploited. First, a 2D discrete wavelet transform is applied to the input noisy frames. This is followed by a discrete cosine transform (DCT), which is applied to the temporal subband coefficients to minimise the redundancy among the consecutive frames. The DCT transformed, noise-free coefficients in the different wavelet domain subbands for the original image sequence are modelled using a prior having a generalised Gaussian distribution. On the basis of this prior, filtering of the noisy wavelet coefficients in each subband is carried out using a new, low-complexity wavelet shrinkage method, which utilises the correlation that exists between subsequent resolution levels. Experimental results show that the proposed scheme outperforms several state-of-the-art spatio-temporal filters in terms of both the peak signal-to-noise ratio and the visual quality     

Microstructural development in microsecond pulsed laser melted polycrystalline nickel

The microsecond Nd glass pulsed laser interaction with polycrystalline nickel was studied with particular emphasis on melting and the nature of the microstructural development following irradiation. The change in the melt pool shape and the melting efficiency as a function of the total laser power has been determined. Evidence is presented to show that for low energy pulse, the microstructural development accompanies fresh nucleation of grains and leads to a finer grain size than that of the substrate. At a higher energy level, growth competition leads to a coarser grain size. We also report a banded feature roughly parallel to the melt substrate interface that develops in the resolidified region during high energy interaction. These results are discussed in the light of our present understanding of rapid solidification processes.     

Descriptive epidemiology of childhood cancers in Bangalore, India

While fairly complete and reliable incident data on childhood cancers are available from the registries in India, mortality and survival information is not. Information concerning the latter was obtained by the Bangalore cancer registry through active follow-up involving visits to homes of patients. Between 1982 and 1989, 617 cases of cancers in childhood were registered, giving an age-standardized incidence rate of 84.8 and 48.4 per million in male and female children, respectively. Active follow-up provided mortality/survival information in 532 or 86.2 percent of these cases. Overall, observed five-year survival was 36.8 percent (both genders combined) with a relative survival of 37.5 percent when childhood mortality in the general population was taken into account. The five-year relative survival was best for thyroid carcinoma (100 percent) followed by Hodgkin's disease (73 percent) and retinoblastoma (72.9 percent). Survival was comparatively low, being 9.9 percent in acute nonlymphatic leukemia and less than 20 percent in rhabdomyosarcoma and the category grouped as 'other malignant neoplasms.' Survival in Hodgkin's disease was influenced by clinical stage at presentation, but was not statistically significant possibly due to small numbers.     

Delaminations at the free edge of a composite laminate

The concept of a fracture process zone where damage takes place is used to analyse the delaminations at the free edges of angle ply laminates under uniaxial tension. The use of a fracture process zone removes the singularity in the interlaminar stresses and enables the initiation and growth of delaminations to be modelled for a perfect laminate without any assumed prior defects. Two different models for the stress displacement relationship in the fracture process zone are examined: a constant stress up to critical displacement and a linear relationship. Finite element analysis shows that there is little difference in the predictions obtained from the two models. An approximate analysis is presented for the constant stress stress-displacement model which is shown to agree with a finite element solution and experimental data. Hence it is argued that the approximate method using a constant stress model for the fracture process zone is sufficient for accurate prediction of delaminations.     

A theory for the flexural strength of steel fiber reinforced concrete

A theory is presented to predict the flexural tensile strength of concrete reinforced with short, discontinuous steel fibers randomly oriented and uniformly dispersed in a cement-based matrix. The theory is based on a dual criterion of crack control and composite mechanics. The first crack in the fibrous composite occurs due to bond slip. The fracture process consists of progressive debonding of fibers during which slow crack propagation occurs. Final failure occurs due to unstable crack propagation when fibers pull out and the interfacial shear stress reaches the ultimate bond strength. The theory is supported by test data on fiber reinforced concrete, mortar and paste.