[신간의 별자리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

In this paper, a new Hebbian-type learning algorithm for the total least-squares parameter estimation is presented. The algorithm is derived from the classical Hebbian rule. An asymptotic analysis is carried out to show that the algorithm allows the weight vector of a linear neuron unit to converge to the eigenvector associated with the smallest eigenvalue of the correlation matrix of the input signal. When the algorithm is applied to solve parameter estimation problems, the converged weights directly yield the total least-squares solution. Since the process of obtaining the estimate is optimal in the total least-squares sense, its noise rejection capability is superior to those of the least-squares-based algorithms. It is shown that the implementations of the proposed algorithm have the simplicity of those of the LMS algorithm. The applicability and performance of the algorithm are demonstrated through computer simulations of adaptive FIR and IIR parameter estimation problems. >

A constrained anti-Hebbian learning algorithm for total least-squares estimation with applications to adaptive FIR and IIR filtering

In the past decade, several schemes for digital image watermarking have been proposed to protect the copyright of an image document or to provide proof of ownership in some identifiable fashion. This paper proposes a novel multiplicative watermarking scheme in the contourlet domain. The effectiveness of a watermark detector depends highly on the modeling of the transform-domain coefficients. In view of this, we first investigate the modeling of the contourlet coefficients by the alpha-stable distributions. It is shown that the univariate alpha-stable distribution fits the empirical data more accurately than the formerly used distributions, such as the generalized Gaussian and Laplacian, do. We also show that the bivariate alpha-stable distribution can capture the across scale dependencies of the contourlet coefficients. Motivated by the modeling results, a blind watermark detector in the contourlet domain is designed by using the univariate and bivariate alpha-stable distributions. It is shown that the detectors based on both of these distributions provide higher detection rates than that based on the generalized Gaussian distribution does. However, a watermark detector designed based on the alpha-stable distribution with a value of its parameter α other than 1 or 2 is computationally expensive because of the lack of a closed-form expression for the distribution in this case. Therefore, a watermark detector is designed based on the bivariate Cauchy member of the alpha-stable family for which α = 1 . The resulting design yields a significantly reduced-complexity detector and provides a performance that is much superior to that of the GG detector and very close to that of the detector corresponding to the best-fit alpha-stable distribution. The robustness of the proposed bivariate Cauchy detector against various kinds of attacks, such as noise, filtering, and compression, is studied and shown to be superior to that of the generalized Gaussian detector.

A study of multiplicative watermark detection in the contourlet domain using alpha-stable distributions.

In recent years, many works on digital image watermarking have been proposed all aiming at protection of the copyright of an image document or authentication of data. This paper proposes a novel watermark decoder in the contourlet domain . It is known that the contourlet coefficients of an image are highly non-Gaussian and a proper distribution to model the statistics of the contourlet coefficients is a heavy-tailed PDF. It has been shown in the literature that the normal inverse Gaussian (NIG) distribution can suitably fit the empirical distribution. In view of this, statistical methods for watermark extraction are proposed by exploiting the NIG as a prior for the contourlet coefficients of images. The proposed watermark extraction approach is developed using the maximum likelihood method based on the NIG distribution. Closed-form expressions are obtained for extracting the watermark bits in both clean and noisy environments. Experiments are performed to verify the robustness of the proposed decoder. The results show that the proposed decoder is superior to other decoders in terms of providing a lower bit error rate. It is also shown that the proposed decoder is highly robust against various kinds of attacks such as noise, rotation, cropping, filtering, and compression.

Multiplicative Watermark Decoder in Contourlet Domain Using the Normal Inverse Gaussian Distribution

In this paper, a one-parameter eight-point orthogonal transform suitable for image compression is proposed. An algorithm for its fast computation is developed and an efficient structure for a simple implementation valid for all possible values of its independent parameter is proposed. It is shown that an appropriate selection of the values of the parameter results in a number of new multiplication-free transforms having a good compromise between the computational complexity and performance. Applying the proposed transform to image compression, we show that it outperforms the existing transforms having complexities similar to that of the proposed one.

A low-complexity parametric transform for image compression

In this paper, we propose an efficient 8×8 transform matrix for image compression by appropriately introducing some zeros in the 8×8 signed DCT matrix. We show that the proposed transform is orthogonal, which is a highly desirable property. In order to make this novel transform more attractive for recent real-time applications, we develop an efficient algorithm for its fast computation. By using this algorithm, the proposed transform requires only 18 additions to transform an 8-point sequence. Compared to the existing 8×8 approximated DCT matrices, it is shown that savings of 25% in the number of arithmetic operations can easily be achieved using the proposed transform operator without noticeable degradations in the reconstructed images. We also present simulation results using some standard test images to show the efficiency of the proposed transform in image compression.

M. Omair Ahmad

Papers

A constrained anti-Hebbian learning algorithm for total least-squares estimation with applications to adaptive FIR and IIR filtering

A study of multiplicative watermark detection in the contourlet domain using alpha-stable distributions.

Multiplicative Watermark Decoder in Contourlet Domain Using the Normal Inverse Gaussian Distribution

A low-complexity parametric transform for image compression

A fast 8×8 transform for image compression