THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

In this article, we have reviewed the reasons why we (collectively) want to love or leave the venerable (but perhaps hoary) MSE. We have also reviewed emerging alternative signal fidelity measures and discussed their potential application to a wide variety of problems. The message we are trying to send here is not that one should abandon use of the MSE nor to blindly switch to any other particular signal fidelity measure. Rather, we hope to make the point that there are powerful, easy-to-use, and easy-to-understand alternatives that might be deployed depending on the application environment and needs. While we expect (and indeed, hope) that the MSE will continue to be widely used as a signal fidelity measure, it is our greater desire to see more advanced signal fidelity measures being used, especially in applications where perceptual criteria might be relevant. Ideally, the performance of a new signal processing algorithm might be compared to other algorithms using several fidelity criteria. Lastly, we hope that we have given further motivation to the community to consider recent advanced signal fidelity measures as design criteria for optimizing signal processing algorithms and systems. It is in this direction that we believe that the greatest benefit eventually lies.

Mean squared error: Love it or leave it? A new look at Signal Fidelity Measures

A morphable model for the synthesis of 3D faces

The development of the Internet in recent years has made it possible and useful to access many different information systems anywhere in the world to obtain information. While there is much research on the integration of heterogeneous information systems, most commercial systems stop short of the actual integration of available data. Data fusion is the process of fusing multiple records representing the same real-world object into a single, consistent, and clean representation.This article places data fusion into the greater context of data integration, precisely defines the goals of data fusion, namely, complete, concise, and consistent data, and highlights the challenges of data fusion, namely, uncertain and conflicting data values. We give an overview and classification of different ways of fusing data and present several techniques based on standard and advanced operators of the relational algebra and SQL. Finally, the article features a comprehensive survey of data integration systems from academia and industry, showing if and how data fusion is performed in each.

Data fusion

A fast and effective image fusion method is proposed for creating a highly informative fused image through merging multiple images. The proposed method is based on a two-scale decomposition of an image into a base layer containing large scale variations in intensity, and a detail layer capturing small scale details. A novel guided filtering-based weighted average technique is proposed to make full use of spatial consistency for fusion of the base and detail layers. Experimental results demonstrate that the proposed method can obtain state-of-the-art performance for fusion of multispectral, multifocus, multimodal, and multiexposure images.

/pdf/image-fusion-with-guided-filtering-4bhdh8vaii.pdf

Image Fusion With Guided Filtering

Survey on 3D face reconstruction from uncalibrated images

This paper presents strain quantification results obtained from the Tagged Magnetic Resonance Imaging (TMRI) sequences acquired for the 1st cardiac Motion Analysis Challenge (cMAC). We applied the Temporal Diffeomorphic Free Form Deformation (TDFFD) algorithm to the phantom and the 15 healthy volunteers of the cMAC database. The TDFFD was modified in two ways. First, we modified the similarity metric to incorporate frame to frame intensity differences. Second, on volunteer sequences, we performed the tracking backward in time since the first frames did not show the contrast between blood and myocardium, making these frames poor choices of reference.

On the phantom, we propagated a grid adjusted to tag lines to all frames for visually assessing the influence of the different algorithmic parameters. The weight between the two metric terms appeared to be a critical parameter for making a compromise between good tag tracking while preventing drifts and avoiding tag jumps. For each volunteer, a volumetric mesh was defined in the Steady-State Free Precession (SSFP) image, at the closest cardiac time from the last frame of the tagging sequence. Uniform strain patterns were observed over all myocardial segments, as physiologically expected.

/pdf/temporal-diffeomorphic-free-form-deformation-tdffd-applied-1cdfblqm2i.pdf

Temporal diffeomorphic free form deformation (TDFFD) applied to motion and deformation quantification of tagged MRI sequences

The lifting scheme provides a general and flexible tool for the construction of wavelet decompositions and perfect reconstruction filter banks. We propose an adaptive version of this scheme which has the intriguing property that it allows perfect reconstruction without any overhead cost. We restrict ourselves to the update lifting step which affects the approximation signal only. The update lifting filter is assumed to depend pointwise on the norm of the associated gradient vector, in such a way that a large gradient induces a weak update filter. Thus, sharp transitions in a signal (eg, edges in an image) will not be smoothed to the same extent as regions which are more homogeneous.

/pdf/an-adaptive-update-lifting-scheme-with-perfect-43bzeaa5gn.pdf

An adaptive update lifting scheme with perfect reconstruction

Learning non-linear patch embeddings with neural networks for label fusion.

In this paper, we present some adaptive wavelet decompositions that can capture the directional nature of images. Our method exploits the properties of seminorms to build lifting structures able to choose between different update filters, the choice being triggered by the local gradient-type features of the input. In order to deal with the variety and wealth of images, one has to be able to use multiple criteria, giving rise to multiple choice of update filters. We establish the conditions under these decisions can be recovered at synthesis, without the need for transmitting overhead information. Thus, we are able to design invertible and non-redundant schemes that discriminate between different geometrical information to efficiently represent images for lossless compression methods.

Gemma Piella

Papers

Survey on 3D face reconstruction from uncalibrated images

Temporal diffeomorphic free form deformation (TDFFD) applied to motion and deformation quantification of tagged MRI sequences

An adaptive update lifting scheme with perfect reconstruction

Learning non-linear patch embeddings with neural networks for label fusion.

Combining Seminorms in Adaptive Lifting Schemes and Applications to Image Analysis and Compression