17056192
Automatic Alignment of High-Resolution NMR Spectra Using a Bayesian Estimation Approach
Nuclear magnetic resonance (NMR) spectral analysis has recently become one of the major means for the detection and recognition of metabolic changes of disease state, physiological alteration, and natural biological variation. For the pattern recognition tasks in which two or more NMR spectra need to be compared, it is critical to properly align the spectra for the subsequent pattern recognition analysis. Previous spectral alignment methods do not consider any baseline intensity variation between the spectra and disregard the effect of noise. Here we formulate the spectra alignment problem in a Bayesian statistical framework, which allows us to simultaneously and efficiently estimate the spectral shift and the baseline intensity variation in the existence of independent additive noise. Experimental results with real high-resolution NMR spectral data from human plasma demonstrate the effectiveness and robustness of the proposed approach
6449041
Adaptive frame prediction for foveation scalable video coding
Embedded rate scalable video coding allows for the extraction of coded visual information at continuously varying bit rates from a single compressed bitstream. This is a very attractive feature for many multimedia communication applications. Motion estimation (ME) /motion compensation (MC) techniques are widely employed in various video coding systems to reduce temporal information redundancy. One of the major challenging problems in ME/MC based rate scalable video coding is how to generate the prediction frame from the previous frame to match the current frame. This problem is more difficult in rate scalable coding than in fixed rate coding because the decoding data rate is unavailable to the encoder. We propose an adaptive frame prediction scheme for foveation scalable video coding (FSVC), which is a new video coding algorithm that combines a foveation-based human visual system (HVS) model with a wavelet-based rate scalable coding algorithm. The new frame prediction algorithm provides an adaptive mechanism to control the prediction errors while reduce error propagation.
18764674
Image information restoration based on long-range correlation
A new class of image information restoration algorithms, virtually different from traditional techniques, is proposed. In comparison with other approaches, our methods use not only the information in local areas, but also that in the remote regions of the image. The methods originate from the idea that there exists abundant long-range correlation within natural images and the human vision system, composed of our eyes and brains, can sufficiently utilize such types of information redundancy to implement the functions of image interpretation, representation, restoration, enhancement and error concealment. Our general approach can be summarized as five basic steps: fetching, searching, matching, competing and recovering. The experimental results on several practical applications show that our methods perform substantially better than many other state-of-the-art methods.
27067527
A faster method for modeling virtual colony
A virtual colony composed by vivid personal characters with different facial texture and body size, will strongly enhance the reality of the whole virtual environment. This paper describes a fast, economic but realistic method for modeling virtual colony. The system has two major components: photographs based human model reconstruction and anthropometry based automatic human model edit, both of them were advanced to achieve more practical and realistic purpose. To demonstrate the power of this approach, the method was applied to generate some virtual colonies.
13893124
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network with n sensors deployed independently and uniformly in a square field of unit area. Each sensor is active with probability p, independently from others, and each active sensor can sense a disc area with radius rs. Moreover, considering the inherent irregularity of a sensor's sensing range caused by time-varying environments, we model the sensing radius rs as a random variable with mean r0 and variance r$_{\rm 0}^{\rm 2}$σ$_{s}^{\rm 2}$. Two active sensors can communicate with each other if and only if the distance between them is smaller than or equal to the communication radius rc. 
 
The key contributions of this paper are: (1) we introduce a new definition of a wireless sensor network's lifetime from a novel probabilistic perspective, called ω-lifetime (0 ≤ ω ≤ 1). It is defined as the expectation of the time interval during which the probability of guaranteeing connectivity and k-coverage simultaneously is at least ω; and (2) based on the analysis results, we propose a near-optimal scheduling algorithm, called PIS (Pre-planned Independent Sleeping), to achieve the network's maximum ω-lifetime, which is validated by simulation results, and present a possible implementation of the PIS scheme in the distributed manner.
18739199
Block spreading for MUI/ISI-resilient generalized multi-carrier CDMA with multirate capabilities
The potential increase in capacity along with the need to provide multimedia services and cope with multiuser interference (MUI) and intersymbol interference (ISI) arising due to wireless multipath propagation, motivate well multirate wideband code-division multiple-access (CDMA) systems. This paper develops an all-digital block-spread filterbank framework capable of encompassing single- or multi-rate transceivers for asynchronous or quasi-synchronous CDMA transmissions through multipath channels. Thanks to symbol blocking and through appropriate design of user codes, the resulting generalized multi-carrier (GMC) CDMA system guarantees symbol recovery irrespective of the (possibly unknown) FIR multipath channels in both downlink and uplink setups with low complexity FIR receivers. Simulations corroborate that the novel GMC-CDMA system outperforms existing multirate alternatives in the presence of asynchronism and multipath.
30635259
On global exponential stability of generalized stochastic neural networks with mixed time-delays
Abstract This paper is concerned with the global exponential stability analysis problem for a general class of stochastic neural networks with mixed time-delays. The mixed time-delays under consideration comprise both the discrete time-varying delays and the distributed time-delays. The main purpose of this paper is to establish easily verifiable conditions under which the delayed stochastic neural network is exponentially stable in the mean square in the presence of both the discrete and distributed delays. By employing a new Lyapunov–Krasovskii functional and conducting stochastic analysis, a linear matrix inequality (LMI) approach is developed to derive the criteria of the exponential stability. Furthermore, the main results are specialized to deal with the analysis problem for the global asymptotic stability within the same LMI framework. The proposed criteria can be readily checked by using some standard numerical packages such as the Matlab LMI toolbox. A simple example is provided to demonstrate the effectiveness and applicability of the proposed testing criteria.
236203
New Techniques for DNA Sequence Classification
DNA sequence classification is the activity of determining whether or not an unlabeled sequence S belongs to an existing class C. This paper proposes two new techniques for DNA sequence classification. The first technique works by comparing the unlabeled sequence S with a group of active motifs discovered from the elements of C and by distinction with elements outside of C. The second technique generates and matches gapped fingerprints of S with elements of C. Experimental results obtained by running these algorithms on long and well conserved Alu sequences demonstrate the good performance of the presented methods compared with FASTA. When applied to less conserved and relatively short functional sites such as splice-junctions, a variation of the second technique combining fingerprinting with consensus sequence analysis gives better results than the current classifiers employing text compression and machine learning algorithms.