[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

I have developed "tennis elbow" from lugging this book around the past four weeks, but it is worth the pain, the effort, and the aspirin. It is also worth the (relatively speaking) bargain price. Including appendixes, this book contains 894 pages of text. The entire panorama of the neural sciences is surveyed and examined, and it is comprehensive in its scope, from genomes to social behaviors. The editors explicitly state that the book is designed as "an introductory text for students of biology, behavior, and medicine," but it is hard to imagine any audience, interested in any fragment of neuroscience at any level of sophistication, that would not enjoy this book. The editors have done a masterful job of weaving together the biologic, the behavioral, and the clinical sciences into a single tapestry in which everyone from the molecular biologist to the practicing psychiatrist can find and appreciate his or

Principles of Neural Science

Principal component analysis is one of the most important and powerful methods in chemometrics as well as in a wealth of other areas. This paper provides a description of how to understand, use, and interpret principal component analysis. The paper focuses on the use of principal component analysis in typical chemometric areas but the results are generally applicable.

/pdf/principal-component-analysis-1sba76ou47.pdf

Principal component analysis

Photoplethysmography and its application in clinical physiological measurement

Denoising problems can be regarded as that of a prior probability modeling in an estimation task. The performance of the estimator is intimately related on the correctness of the model. This paper proposes a new wavelet-domain image denoising method using the minimum mean square error (MMSE) estimator. The vector-based hidden Markov model (HMM) is used as the prior for modeling the wavelet coefficients of an image. This model is an effective statistical model for the wavelet coefficients, since it is capable of capturing both the subband marginal distribution and the inter-scale, intra-scale and cross-orientation dependencies of the wavelet coefficients. Using this prior, a Weiner filter, which is derived using a MMSE estimator, is developed for estimating the denoised coefficients. Experiments are conducted on standard images to evaluate the performance of the proposed method. Simulation results are provided to show that the proposed denoising method can effectively reduce the noise in yielding higher values for the peak signal-to-noise ratio along with better visual quality than that provided by some of the other existing methods.

Image denoising in wavelet domain using the vector-based hidden Markov model

Recently, sparse representation has attracted a great deal of interest in many of the image processing applications. However, the idea of self-similarity, which is inherently present in an image, has not been considered in standard sparse representation. Moreover, if the dictionary atoms are not constrained to be correlated, the redundancy present in the dictionary may not improve the performance of sparse coding. This paper addresses these issues by using orthogonal moments to extract the correlations among the atoms and group them together by extracting the characteristics of the noisy image patches. Most of the existing sparsity-based image denoising methods utilize an over-complete dictionary, for example, the K-SVD method that requires solving a minimization problem which is computationally challenging. In order to improve the computational efficiency and the correlation between the sparse coefficients, this paper employs the concept of overlapping group sparsity formulated for both convex and non-convex denoising frameworks. The optimization method used for solving the denoising framework is the well known majorization-minimization method, which has been applied successfully in sparse approximation and statistical estimations. Experimental results demonstrate that the proposed method offers, in general, a performance that is better than that of the existing state-of-the-art methods irrespective of the noise level and the image type.

Image denoising via overlapping group sparsity using orthogonal moments as similarity measure.

Tracking maneuvering targets accurately is one of the most challenging tasks in the design of aircraft tracking systems. For efficient tracking performance, the target motion predicted by the target motion model needs to match the target's actual motion during the maneuver. For tracking a maneuvering target, a combination of the constant velocity (CV) model and the coordinated turn (CT) model with a known turn rate are incorporated in the interacting multiple model (IMM) algorithm. However, in such a scheme when a target performs an unexpected maneuver, the tracking performance deteriorates, or the scheme may even fail to track the target. To overcome this problem, there exists a scheme in the literature, in which instead of using an a priori knowledge of the target turn rate, it is estimated adaptively using the target acceleration and speed. However, this algorithm uses a three-dimensional model to estimate the turn rate in two-dimensional space, which may result in an inaccurate estimation of the target acceleration, and thus may lead to in inaccurate turn rate value. In this paper, an adaptive algorithm to track a maneuvering target in an IMM framework is proposed. Estimating the turn rate is based on the speed of the target and the radius of the turn, where the latter is computed by a simple method using the previous three successive measurements. Further, a detailed study to select an appropriate transition probability matrix for the proposed algorithm is carried out. Simulation results demonstrate that the proposed tracking algorithm outperforms the other algorithms in terms of its tracking accuracy and consistency, particularly in the realistic situation when neither an a priori knowledge about the target turn rate nor about the range rate information is available to the tracking algorithm.

/pdf/an-adaptive-turn-rate-estimation-for-tracking-a-maneuvering-47yuooplqp.pdf

An Adaptive Turn Rate Estimation for Tracking a Maneuvering Target

The features produced by the layers of a neural network become increasingly more sparse as the network gets deeper and consequently, the learning capability of the network is not further enhanced as the number of layers is increased. In this paper, a novel residual deep network, called CompNet, is proposed for the single image super resolution problem without an excessive increase in the network complexity. The idea behind the proposed network is to compose the residual signal that is more representative of the features produced by the different layers of the network and it is not as sparse. The proposed network is experimented on different benchmark datasets and is shown to outperform the state-of-the-art schemes designed to solve the super resolution problem.

Compnet: A New Scheme for Single Image Super Resolution Based on Deep Convolutional Neural Network

The necessity for an efficient bit-reversal routine in the implementation of fast discrete Fourier transform algorithms is well known. In this paper, we propose a bit-reversal algorithm that reduces the computational effort to an extent that it becomes negligible compared with the data swapping operation for which the bit-reversal is required. >

M. Omair Ahmad

Papers

Image denoising in wavelet domain using the vector-based hidden Markov model

Image denoising via overlapping group sparsity using orthogonal moments as similarity measure.

An Adaptive Turn Rate Estimation for Tracking a Maneuvering Target

Compnet: A New Scheme for Single Image Super Resolution Based on Deep Convolutional Neural Network

A fast FFT bit-reversal algorithm