In this paper, a reduced Gaussian process regression (RGPR)-based generalized likelihood ratio test (GLRT) is proposed for fault detection in industrial systems. In contrast to the classical GPR technique, the RGPR mo...
详细信息
Effective detection of faults in Biological processes is essential to observe the continuity of good functioning of the system under typical circumstances for ensuring safety. Therefore, the first objective of this pa...
详细信息
The paradigm shift from standard communication models to artificially intelligent solutions continues to be an exciting avenue of research. Through applying neural networks to a communication-learning model, the auton...
详细信息
Since the medical training samples are very limited, it is difficult to construct a statistical shape model with good generalization using few samples. In this paper, we propose a novel statistical shape modeling meth...
详细信息
ISBN:
(纸本)9788988678213
Since the medical training samples are very limited, it is difficult to construct a statistical shape model with good generalization using few samples. In this paper, we propose a novel statistical shape modeling method using 2D PCA. The 3D shape is represented as a matrix by spherical parameterization. The experiments showed that our proposed method can reconstruct statistical shape model with good generalization even using fewer samples.
Data hiding in multimedia is the process of secretly embedding information into data sources such as image, video, or audio signals without changing the perceptual quality of the data source. We present a novel blind ...
详细信息
ISBN:
(纸本)0769510620
Data hiding in multimedia is the process of secretly embedding information into data sources such as image, video, or audio signals without changing the perceptual quality of the data source. We present a novel blind data hiding technique for hiding information in still images. This technique is based on embedding the information in the transform domain, after decorrelating the samples in the spatial domain. This results in a significant increase in the number of transform coefficients that can be used to transmit the hidden information. The technique is suitable for a variety of data hiding applications such as steganography, data authentication and captioning. The technique achieves a higher and more secure data embedding rate than existing data embedding transform domain techniques developed for these particular applications.
Carefully injected noise can speed the average convergence of Markov chain Monte Carlo (MCMC) estimates and simulated annealing optimization. This includes quantum annealing and the MCMC special case of the Metropolis...
详细信息
Carefully injected noise can speed the average convergence of Markov chain Monte Carlo (MCMC) estimates and simulated annealing optimization. This includes quantum annealing and the MCMC special case of the Metropolis-Hastings algorithm. MCMC seeks the solution to a computational problem as the equilibrium probability density of a reversible Markov chain. The algorithm must cycle through a long burn-in phase until it reaches equilibrium because the Markov samples are statistically correlated. The special injected noise reduces this burn-in period in MCMC. A related theorem shows that it reduces the cooling time in simulated annealing. Simulations showed that optimal noise gave a 76% speed-up in finding the global minimum in the Schwefel optimization benchmark. The noise-boosted simulations found the global minimum in 99.8% of trials compared with only 95.4% of trials in noiseless simulated annealing. Simulations also showed that the noise boost is robust to accelerated cooling schedules and that noise decreased convergence times by more than 32% under aggressive geometric cooling. Molecular dynamics simulations showed that optimal noise gave a 42% speed-up in finding the minimum potential energy configuration of an eight-argon-atom gas system with a Lennard-Jones 12-6 potential. The annealing speed-up also extends to quantum Monte Carlo implementations of quantum annealing. Noise improved ground-state energy estimates in a 1024-spin simulated quantum annealing simulation by 25.6%. The quantum noise flips spins along a Trotter ring. The noisy MCMC algorithm brings each Markov step closer on average to equilibrium if an inequality holds between two expectations. Gaussian or Cauchy jump probabilities reduce the noise-benefit inequality to a simple quadratic inequality. Simulations show that noise-boosted simulated annealing is more likely than noiseless annealing to sample high probability regions of the search space and to accept solutions that increase the search bre
A technique to guide landmark matching known as hopping dynamic programming is described. The location of the model in the scene is estimated with a least-squares fit. A heuristic measure is then computed to decide if...
详细信息
A technique to guide landmark matching known as hopping dynamic programming is described. The location of the model in the scene is estimated with a least-squares fit. A heuristic measure is then computed to decide if the model is in the scene. The shape features of an object are the landmarks associated with the object. The landmarks of an object are defined as the points of interest of the object that have important shape attributes. Examples of landmarks are corners, holes, protrusions, and high-curvature points.< >
This paper aims to develop a fast dynamic-texture prediction method, using tools from non-linear dynamical modeling, and fast approaches for approximate regression. We consider dynamic textures to be described by patc...
This paper aims to develop a fast dynamic-texture prediction method, using tools from non-linear dynamical modeling, and fast approaches for approximate regression. We consider dynamic textures to be described by patch-level non-linear processes, thus requiring tools such as delay-embedding to uncover a phase-space where dynamical evolution can be more easily modeled. After mapping the observed time-series from a dynamic texture video to its recovered phase-space, a time-efficient approximate prediction method is presented which utilizes locality-sensitive hashing approaches to predict possible phase-space vectors, given the current phase- space vector. Our experiments show the favorable performance of the proposed approach, both in terms of prediction fidelity, and computational time. The proposed algorithm is applied to shading prediction in utility scale solar arrays.
Orthogonal frequency division multiplexing (OFDM) transmitter diversity techniques have been shown to be efficient means of achieving near optimal diversity gain in frequency-selective fading channels. For these syste...
详细信息
Orthogonal frequency division multiplexing (OFDM) transmitter diversity techniques have been shown to be efficient means of achieving near optimal diversity gain in frequency-selective fading channels. For these systems, knowledge of the channel parameters is required at the receivers for diversity combining and decoding. In this paper, we propose a low complexity, bandwidth efficient, pilot-symbol-assisted channel estimator for multiple transmitter OFDM systems. The pilot symbols are constructed to be non-overlapping in frequency to allow for the simultaneous sounding of the multiple channels. The time-varying channel responses are tracked by interpolating a set of estimates obtained through periodically transmitted pilot symbols. The effectiveness and limitations of the proposed estimator are verified by simulations.
The mode decision process has a significant effect on the quality and complexity of a video encoder. The conventional method that fully codes each macro block for different modes results in the best quality performanc...
详细信息
暂无评论