15869205
Detection using correlation bound in a linear mixture model
A detection approach, detection with a correlation bound (DCB), is introduced based on a linear mixture model. We use the upper bound of the correlation between the target and mixing components as the detection index, and derive the expression for this correlation bound using the observed data. The proposed method is an unsupervised approach and provides satisfactory detection performance without imposing strong assumptions. Simulation and experimental results are presented to demonstrate the effectiveness of the proposed method in Raman spectroscopy for the detection of surface-deposited chemical agents.
6315207
Target detection and identification using canonical correlation analysis and subspace partitioning
We present a data-driven approach for target detection and identification based on a linear mixture model. Our aim is to determine the existence of certain targets in a mixture without specific information on the targets or the background, and to identify the targets from a given library. We use the maximum canonical correlation between the target set and the observations as the detection score, and use coefficients of the canonical vector to identify the indices of the present components from the given target library. The performance of the detector is enhanced using subspace partitioning on the target library. Both simulation and experimental results are presented to demonstrate the effectiveness of the proposed method in Raman spectroscopy for detection of surface-deposited chemical agents.
29222863
An adaptive approach for image encryption and secure transmission over multirate wireless sensor networks
In this paper, we propose an innovative adaptive secure image delivery approach, to achieve effective and efficient image encryption based on an optimal transmission rate in terms of energy efficiency in wireless sensor networks (WSN). Our contribution is three folds—First, the proposed component based selective encryption scheme achieves high image security, while incurring little encryption overhead; furthermore, the proposed adaptive encryption scheme achieve the best security effort within delay bound; finally, the proposed transmission rate optimization improves energy efficiency, and feeds back effective path capacity parameters for adaptive encryption. Simulation results show a significant gain in both energy efficiency and security based on the proposed approach for image secure transmissions in WSN. Copyright # 2007 John Wiley & Sons, Ltd.
14797393
A system for analyzing and indexing human-motion databases
We demonstrate a data-driven approach for representing, compressing, and indexing human-motion databases. Our modeling approach is based on piecewise-linear components that are determined via a divisive clustering method. Selection of the appropriate linear model is determined automatically via a classifier using a subspace of the most significant, or principle features (markers). We show that, after offline training, our model can accurately estimate and classify human motions. We can also construct indexing structures for motion sequences according to their transition trajectories through these linear components. Our method not only provides indices for whole and/or partial motion sequences, but also serves as a compressed representation for the entire motion database. Our method also tends to be immune to temporal variations, and thus avoids the expense of time-warping.
11683146
Collaborative Image Transmissions Based on Region and Path Diversity in Wireless Sensor Network
Many sensor applications such as monitoring and surveillance may require image sensor array to conduct collaborative image transmissions in wireless sensor networks (WSN). The large size image transmissions cause bottlenecks in WSN due to the limited energy resources and network capacity. In this paper, we propose a collaborative transmission scheme for image sensors to utilize inter-sensor correlations to decide transmission patterns based on transmission path diversities, which achieves minimal energy consumption, balanced sensor lifetime and required image quality. This optimization scheme not only allows each image sensor to transmit optimal fractions of the overlapped images through appropriate transmission paths in energy-efficient way, but also provides unequal protection on the overlap image regions through path selections and resource allocations to achieve good transmission image quality. The simulation results show that the proposed image transmission scheme can achieve considerable gains in terms of the network lifetime extension, image distortion reduction, and energy efficiency.
1655622
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data integration and cleaning, bioinformatics, and pattern recognition. We focus on efficient algorithms for similarity join with edit distance constraints. Existing approaches are mainly based on converting the edit distance constraint to a weaker constraint on the number of matching q-grams between pair of strings. 
 
In this paper, we propose the novel perspective of investigating mismatching q-grams. Technically, we derive two new edit distance lower bounds by analyzing the locations and contents of mismatching q-grams. A new algorithm, Ed-Join, is proposed that exploits the new mismatch-based filtering methods; it achieves substantial reduction of the candidate sizes and hence saves computation time. We demonstrate experimentally that the new algorithm outperforms alternative methods on large-scale real datasets under a wide range of parameter settings.
12021051
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Two-locus epistasis (gene-gene interaction) detection has attracted great research interest as a promising method for genetic analysis of complex diseases. In this paper, we propose a general approach, COE, for efficient large scale gene-gene interaction analysis, which supports a wide range of tests. In particular, we show that many commonly used statistics are convex functions. From the observed values of the events in two-locus association test, we can develop an upper bound of the test value. Such an upper bound only depends on single-locus test and the genotype of the SNP-pair. We thus group and index SNP-pairs by their genotypes. This indexing structure can benefit the computation of all convex statistics. Utilizing the upper bound and the indexing structure, we can prune most of the SNP-pairs without compromising the optimality of the result. Our approach is especially efficient for large permutation test. Extensive experiments demonstrate that our approach provides orders of magnitude performance improvement over the brute force approach.