Guided wave based detection of damage in honeycomb core sandwich structures

We report on the Lamb wave type guided wave propagation in honeycomb core sandwich structures. An experimental study supported by theoretical evaluation of the guided wave characteristics is presented that proves the potential of Lamb wave type guided wave for detection of damage in sandwich structures. A sandwich panel is fabricated with planar dimension of 600 mm x 600 mm, having a core thickness of 7 mm, cell size of 5 mm and 0.1 mm thick aluminum face sheets. Thin piezoelectric patch actuators and sensors are used to excite and sense a frequency band limited guided wave with a central frequency. A linear phased array of piezoelectric patch actuators is used to achieve higher signal strength and directivity. Group velocity dispersion curves and corresponding frequency response of sensed signal are obtained experimentally. Linearity between the excitation signal amplitude and the corresponding sensed signal amplitude is found for certain range of parameters. The nature of damping present in the sandwich panel is monitored by measuring the sensor signal amplitude at various different distances measured from the center of the linear phased array. Indentation and low velocity impact induced damages of increasing diameter covering several honeycomb cells are created. Crushing of honeycomb core with rupture of face sheet is observed while introducing the damage. The damages are then detected experimentally by pitch-catch interrogation with guided waves and wavelet transform of the sensed signal. Signal amplitudes are analyzed for various different sizes of damages to differentiate the damage size/severity. Monotonic changes in the sensor signal amplitude due to increase in the damage size has been established successfully. With this approach it is possible to locate and monitor the damages with the help of phased array and by tracking the wave packets scattered from the damages. (C) 2012 Elsevier Ltd. All rights reserved.

Simultaneous Detection of Two Triplets: A Time-Resolved Resonance Raman Study

Solvents are known to affect the triplet state structure and reactivity. In this paper, we have employed time-resolved resonance Raman (TR3) spectroscopy to understand solvent-induced subtle structural changes in the lowest excited triplet state of thioxanthone. Density functional theory (DFT) combined with the self-consistent reaction field (SCRF) implicit solvation model has been used to calculate the vibrational frequencies in the solvents. Here, we report a unique observation of the coexistence of two triplets, which has been substantiated by the probe wavelength-dependent Raman experiments. The coexistence of two triplets has been further supported by photoreduction experiments carried out at various temperatures.

On the basin-scale detection and attribution of human-induced climate change in monsoon precipitation and streamflow

Detecting and quantifying the presence of human-induced climate change in regional hydrology is important for studying the impacts of such changes on the water resources systems as well as for reliable future projections and policy making for adaptation. In this article a formal fingerprint-based detection and attribution analysis has been attempted to study the changes in the observed monsoon precipitation and streamflow in the rain-fed Mahanadi River Basin in India, considering the variability across different climate models. This is achieved through the use of observations, several climate model runs, a principal component analysis and regression based statistical downscaling technique, and a Genetic Programming based rainfall-runoff model. It is found that the decreases in observed hydrological variables across the second half of the 20th century lie outside the range that is expected from natural internal variability of climate alone at 95% statistical confidence level, for most of the climate models considered. For several climate models, such changes are consistent with those expected from anthropogenic emissions of greenhouse gases. However, unequivocal attribution to human-induced climate change cannot be claimed across all the climate models and uncertainties in our detection procedure, arising out of various sources including the use of models, cannot be ruled out. Changes in solar irradiance and volcanic activities are considered as other plausible natural external causes of climate change. Time evolution of the anthropogenic climate change ``signal'' in the hydrological observations, above the natural internal climate variability ``noise'' shows that the detection of the signal is achieved earlier in streamflow as compared to precipitation for most of the climate models, suggesting larger impacts of human-induced climate change on streamflow than precipitation at the river basin scale.

HUMAN DETECTION USING SPARSE REPRESENTATION

The problem of human detection is challenging, more so, when faced with adverse conditions such as occlusion and background clutter. This paper addresses the problem of human detection by representing an extracted feature of an image using a sparse linear combination of chosen dictionary atoms. The detection along with the scale finding, is done by using the coefficients obtained from sparse representation. This is of particular interest as we address the problem of scale using a scale-embedded dictionary where the conventional methods detect the object by running the detection window at all scales.

Joint data detection and dominant singular mode estimation in time varying reciprocal MIMO systems

This paper proposes an algorithm for joint data detection and tracking of the dominant singular mode of a time varying channel at the transmitter and receiver of a time division duplex multiple input multiple output beamforming system. The method proposed is a modified expectation maximization algorithm which utilizes an initial estimate to track the dominant modes of the channel at the transmitter and the receiver blindly; and simultaneously detects the un known data. Furthermore, the estimates are constrained to be within a confidence interval of the previous estimate in order to improve the tracking performance and mitigate the effect of error propagation. Monte-Carlo simulation results of the symbol error rate and the mean square inner product between the estimated and the true singular vector are plotted to show the performance benefits offered by the proposed method compared to existing techniques.

A hybrid RTS-BP algorithm for improved detection of large-MIMO M-QAM signals

Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive tabu search (RTS) algorithm, as well as a factor-graph based belief propagation (BP) algorithm for low-complexity large-MIMO detection. The motivation for the present work arises from the following two observations on the above two algorithms: i) Although RTS achieved close to optimal performance for 4-QAM in large dimensions, significant performance improvement was still possible for higher-order QAM (e.g., 16-, 64-QAM). ii) BP also achieved near-optimal performance for large dimensions, but only for {±1} alphabet. In this paper, we improve the large-MIMO detection performance of higher-order QAM signals by using a hybrid algorithm that employs RTS and BP. In particular, motivated by the observation that when a detection error occurs at the RTS output, the least significant bits (LSB) of the symbols are mostly in error, we propose to first reconstruct and cancel the interference due to bits other than LSBs at the RTS output and feed the interference cancelled received signal to the BP algorithm to improve the reliability of the LSBs. The output of the BP is then fed back to RTS for the next iteration. Simulation results show that the proposed algorithm performs better than the RTS algorithm, and semi-definite relaxation (SDR) and Gaussian tree approximation (GTA) algorithms.

A Huber-loss-driven clustering technique and its application to robust cell detection in confocal microscopy images

We address the problem of detecting cells in biological images. The problem is important in many automated image analysis applications. We identify the problem as one of clustering and formulate it within the framework of robust estimation using loss functions. We show how suitable loss functions may be chosen based on a priori knowledge of the noise distribution. Specifically, in the context of biological images, since the measurement noise is not Gaussian, quadratic loss functions yield suboptimal results. We show that by incorporating the Huber loss function, cells can be detected robustly and accurately. To initialize the algorithm, we also propose a seed selection approach. Simulation results show that Huber loss exhibits better performance compared with some standard loss functions. We also provide experimental results on confocal images of yeast cells. The proposed technique exhibits good detection performance even when the signal-to-noise ratio is low.

A finite-rate-of-innovation signal sampling perspective of the source-filter model of speech production

We consider the speech production mechanism and the asso- ciated linear source-filter model. For voiced speech sounds in particular, the source/glottal excitation is modeled as a stream of impulses and the filter as a cascade of second-order resonators. We show that the process of sampling speech signals can be modeled as filtering a stream of Dirac impulses (a model for the excitation) with a kernel function (the vocal tract response),and then sampling uniformly. We show that the problem of esti- mating the excitation is equivalent to the problem of recovering a stream of Dirac impulses from samples of a filtered version. We present associated algorithms based on the annihilating filter and also make a comparison with the classical linear prediction technique, which is well known in speech analysis. Results on synthesized as well as natural speech data are presented.

Frequency detection from multiplexed compressed sensing of noisy signals

Signal acquisition under a compressed sensing scheme offers the possibility of acquisition and reconstruction of signals sparse on some basis incoherent with measurement kernel with sub-Nyquist number of measurements. In particular when the sole objective of the acquisition is the detection of the frequency of a signal rather than exact reconstruction, then an undersampling framework like CS is able to perform the task. In this paper we explore the possibility of acquisition and detection of frequency of multiple analog signals, heavily corrupted with additive white Gaussian noise. We improvise upon the MOSAICS architecture proposed by us in our previous work to include a wider class of signals having non-integral frequency components. This makes it possible to perform multiplexed compressed sensing for general frequency sparse signals.

A transient detection algorithm for audio using iterative analysis of STFT

We propose an iterative algorithm to detect transient segments in audio signals. Short time Fourier transform(STFT) is used to detect rapid local changes in the audio signal. The algorithm has two steps that iteratively - (a) calculate a function of the STFT and (b) build a transient signal. A dynamic thresholding scheme is used to locate the potential positions of transients in the signal. The iterative procedure ensures that genuine transients are built up while the localised spectral noise are suppressed by using an energy criterion. The extracted transient signal is later compared to a ground truth dataset. The algorithm performed well on two databases. On the EBU-SQAM database of monophonic sounds, the algorithm achieved an F-measure of 90% while on our database of polyphonic audio an F-measure of 91% was achieved. This technique is being used as a preprocessing step for a tempo analysis algorithm and a TSR (Transients + Sines + Residue) decomposition scheme.

Nonparametric distributed sequential detection via universal source coding

We consider nonparametric or universal sequential hypothesis testing when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are primarily motivated from spectrum sensing in Cognitive Radios and intruder detection in wireless sensor networks. We use easily implementable universal lossless source codes to propose simple algorithms for such a setup. The algorithms are first proposed for discrete alphabet. Their performance and asymptotic properties are studied theoretically. Later these are extended to continuous alphabets. Their performance with two well known universal source codes, Lempel-Ziv code and KT-estimator with Arithmetic Encoder are compared. These algorithms are also compared with the tests using various other nonparametric estimators. Finally a decentralized version utilizing spatial diversity is also proposed and analysed.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Lamb wave based detection of damage in a stiffener bonded to a plate

Stiffener is one of the major components of aircraft structures to increase the load carrying capacity. Damage in the stiffener, mostly in the form of crack is an unavoidable problem in aerospace structures. Stiffener is bonded to the inner side of the aircraft panel which is not accessible for immediate inspection. A sensor-actuator network can be placed on the outer side of the panel that is accessible. Ultrasonic lamb waves are transmitted through stiffener using the sensoractuator network for detecting the presence of damages. The sensor-actuator network is placed on both halves of the stiffened section on the accessible surface of the plate. Detecting damage in stiffener by using this technique has significant potential for SHM technology. One of the major objectives of the present work is to determine the smallest detectable crack on the stiffener using the proposed technique. Wavelet based damage parameter correlation studies are carried out. In the proposed scheme, with increase in the damage size along the stiffener, it is found that the amplitude of the received signal decreases monotonically. The advantage of this technique is that the stiffened panels need not be disassembled in a realistic deployment of SHM system.

Threshold-Independent QRS Detection Using the Dynamic Plosion Index

Detection of QRS serves as a first step in many automated ECG analysis techniques. Motivated by the strong similarities between the signal structures of an ECG signal and the integrated linear prediction residual (ILPR) of voiced speech, an algorithm proposed earlier for epoch detection from ILPR is extended to the problem of QRS detection. The ECG signal is pre-processed by high-pass filtering to remove the baseline wandering and by half-wave rectification to reduce the ambiguities. The initial estimates of the QRS are iteratively obtained using a non-linear temporal feature, named the dynamic plosion index suitable for detection of transients in a signal. These estimates are further refined to obtain a higher temporal accuracy. Unlike most of the high performance algorithms, this technique does not make use of any threshold or differencing operation. The proposed algorithm is validated on the MIT-BIH database using the standard metrics and its performance is found to be comparable to the state-of-the-art algorithms, despite its threshold independence and simple decision logic.

Lattice Reduction Aided Detection in Large-MIMO Systems

Lattice reduction (LR) aided detection algorithms are known to achieve the same diversity order as that of maximum-likelihood (ML) detection at low complexity. However, they suffer SNR loss compared to ML performance. The SNR loss is mainly due to imperfect orthogonalization and imperfect nearest neighbor quantization. In this paper, we propose an improved LR-aided (ILR) detection algorithm, where we specifically target to reduce the effects of both imperfect orthogonalization and imperfect nearest neighbor quantization. The proposed ILR detection algorithm is shown to achieve near-ML performance in large-MIMO systems and outperform other LR-aided detection algorithms in the literature. Specifically, the SNR loss incurred by the proposed ILR algorithm compared to ML performance is just 0.1 dB for 4-QAM and < 0.5 dB for 16-QAM in 16 x 16 V-BLAST MIMO system. This performance is superior compared to those of other LR-aided detection algorithms, whose SNR losses are in the 2 dB to 9 dB range.