Image quality assessment: from error visibility to structural similarity

Motion correction of PET brain images through deconvolution: II. Practical implementation and algorithm optimization

Image quality is significantly degraded even by small amounts of patient motion in very high-resolution PET scanners. When patient motion is known, deconvolution methods can be used to correct the reconstructed image and reduce motion blur. This paper describes the implementation and optimization of an iterative deconvolution method that uses an ordered subset approach to make it practical and clinically viable. We performed ten separate FDG PET scans using the Hoffman brain phantom and simultaneously measured its motion using the Polaris Vicra tracking system (Northern Digital Inc., Ontario, Canada). The feasibility and effectiveness of the technique was studied by performing scans with different motion and deconvolution parameters. Deconvolution resulted in visually better images and significant improvement as quantified by the Universal Quality Index (UQI) and contrast measures. Finally, the technique was applied to human studies to demonstrate marked improvement. Thus, the deconvolution technique presented here appears promising as a valid alternative to existing motion correction methods for PET. It has the potential for deblurring an image from any modality if the causative motion is known and its effect can be represented in a system matrix.

Down-sampling design in DCT domain with arbitrary ratio for image/video transcoding

This paper proposes a designing framework for down-sampling compressed images/video with arbitrary ratio in the discrete cosine transform (DCT) domain. In this framework, we first derive a set of DCT-domain down-sampling methods which can be represented by a linear transform with double-sided matrix multiplication (LTDS) in the DCT domain and show that the set contains a wide range of methods with various complexity and visual quality. Then, for a preselected spatial-domain down-sampling method, we formulate an optimization problem for finding an LTDS to approximate the given spatial-domain down-sampling method for a trade-off between the visual quality and the complexity. By modeling LTDS as a multiple layer network, a so-called structural learning with forgetting algorithm is then applied to solve the optimization problem. The proposed framework has been applied to discover optimal LTDSs corresponding to a spatial down-sampling method with Butterworth low-pass filtering and bicubic interpolation. Experimental results show that the resulting LTDS achieves a significant reduction on the complexity when compared with other methods in the literature with similar visual quality.

Color compensation of multicolor fish images

Multicolor fluorescence in situ hybridization (M-FISH) techniques provide color karyotyping that allows simultaneous analysis of numerical and structural abnormalities of whole human chromosomes. Chromosomes are stained combinatorially in M-FISH. By analyzing the intensity combinations of each pixel, all chromosome pixels in an image are classified. Due to the overlap of excitation and emission spectra and the broad sensitivity of image sensors, the obtained images contain crosstalk between the color channels. The crosstalk complicates both visual and automatic image analysis and may eventually affect the classification accuracy in M-FISH. The removal of crosstalk is possible by finding the color compensation matrix, which quantifies the color spillover between channels. However, there exists no simple method of finding the color compensation matrix from multichannel fluorescence images whose specimens are combinatorially hybridized. In this paper, we present a method of calculating the color compensation matrix for multichannel fluorescence images whose specimens are combinatorially stained.

Design and construction of a realistic DWI phantom for filtering performance assessment

A methodology to build a realistic phantom for the assessment of filtering performance in Diffusion Weighted Images (DWI) is presented. From a real DWI data-set, a regularization process is carried out taking into account the diffusion model. This process drives to a model which accurately preserves the structural characteristics of actual DWI volumes, being in addition regular enough to be considered as a noise-free data-set and therefore to be used as a ground-truth. We compare our phantom with a kind of simplified phantoms commonly used in the literature (those based on homogeneous cross sections), concluding that the latter may introduce important biases in common quality measures used in the filtering performance assessment, and even drive to erroneous conclusions in the comparison of different filtering techniques.

Joint LMMSE estimation of DWI data for DTI processing

We propose a new methodology for Linear Minimum Mean Square Error (LMMSE) filtering of Diffusion Weighted Imaging (DWI). We consider each voxel as an N-dimensional vector that comprises all the DWI volumes, and then compute the LMMSE estimator for the whole DWI data set jointly, taking into account the underlying tensor model. Our experiments, both with phantom and real data, show that this is a more convenient approach compared to the separate processing of each DWI, that translates to better removal of noise and preservation of structural information. Besides, our model has a simple algebraic formulation which makes the overall computational complexity very close to that of the scalar case, and it does not need multiple samples per DWI.

Resource allocation for error resilient video coding over AWGN using optimization approach

The number of slices for error resilient video coding is jointly optimized with 802.11a-like media access control and the physical layers with automatic repeat request and rate compatible punctured convolutional code over additive white gaussian noise channel as well as channel times allocation for time division multiple access. For error resilient video coding, the relation between the number of slices and coding efficiency is analyzed and formulated as a mathematical model. It is applied for the joint optimization problem, and the problem is solved by a convex optimization method such as the primal-dual decomposition method. We compare the performance of a video communication system which uses the optimal number of slices with one that codes a picture as one slice. From numerical examples, end-to-end distortion of utility functions can be significantly reduced with the optimal slices of a picture especially at low signal-to-noise ratio.

An example-based face hallucination method for single-frame, low-resolution facial images

This paper proposes a face hallucination method for the reconstruction of high-resolution facial images from single-frame, low-resolution facial images. The proposed method has been derived from example-based hallucination methods and morphable face models. First, we propose a recursive error back-projection method to compensate for residual errors, and a region-based reconstruction method to preserve characteristics of local facial regions. Then, we define an extended morphable face model, in which an extended face is composed of the interpolated high-resolution face from a given low-resolution face, and its original high-resolution equivalent. Then, the extended face is separated into an extended shape and an extended texture. We performed various hallucination experiments using the MPI, XM2VTS, and KF databases, compared the reconstruction errors, structural similarity index, and recognition rates, and showed the effects of face detection errors and shape estimation errors. The encouraging results demonstrate that the proposed methods can improve the performance of face recognition systems. Especially the proposed method can enhance the resolution of single-frame, low-resolution facial images.

Multidimensional incremental parsing for universal source coding

A multidimensional incremental parsing algorithm (MDIP) for multidimensional discrete sources, as a generalization of the Lempel-Ziv coding algorithm, is investigated. It consists of three essential component schemes, maximum decimation matching, hierarchical structure of multidimensional source coding, and dictionary augmentation. As a counterpart of the longest match search in the Lempel-Ziv algorithm, two classes of maximum decimation matching are studied. Also, an underlying behavior of the dictionary augmentation scheme for estimating the source statistics is examined. For an m-dimensional source, m augmentative patches are appended into the dictionary at each coding epoch, thus requiring the transmission of a substantial amount of information to the decoder. The property of the hierarchical structure of the source coding algorithm resolves this issue by successively incorporating lower dimensional coding procedures in the scheme. In regard to universal lossy source coders, we propose two distortion functions, the local average distortion and the local minimax distortion with a set of threshold levels for each source symbol. For performance evaluation, we implemented three image compression algorithms based upon the MDIP; one is lossless and the others are lossy. The lossless image compression algorithm does not perform better than the Lempel-Ziv-Welch coding, but experimentally shows efficiency in capturing the source structure. The two lossy image compression algorithms are implemented using the two distortion functions, respectively. The algorithm based on the local average distortion is efficient at minimizing the signal distortion, but the images by the one with the local minimax distortion have a good perceptual fidelity among other compression algorithms. Our insights inspire future research on feature extraction of multidimensional discrete sources.

Restoration of DWI data using a Rician LMMSE estimator

This paper introduces and analyzes a linear minimum mean square error (LMMSE) estimator using a Rician noise model and its recursive version (RLMMSE) for the restoration of diffusion weighted images. A method to estimate the noise level based on local estimations of mean or variance is used to automatically parametrize the estimator. The restoration performance is evaluated using quality indexes and compared to alternative estimation schemes. The overall scheme is simple, robust, fast, and improves estimations. Filtering diffusion weighted magnetic resonance imaging (DW-MRI) with the proposed methodology leads to more accurate tensor estimations. Real and synthetic datasets are analyzed.

Bayesian wavelet-based image denoising using the Gauss-Hermite expansion

The probability density functions (PDFs) of the wavelet coefficients play a key role in many wavelet-based image processing algorithms, such as denoising. The conventional PDFs usually have a limited number of parameters that are calculated from the first few moments only. Consequently, such PDFs cannot be made to fit very well with the empirical PDF of the wavelet coefficients of an image. As a result, the shrinkage function utilizing any of these density functions provides a substandard denoising performance. In order for the probabilistic model of the image wavelet coefficients to be able to incorporate an appropriate number of parameters that are dependent on the higher order moments, a PDF using a series expansion in terms of the Hermite polynomials that are orthogonal with respect to the standard Gaussian weight function, is introduced. A modification in the series function is introduced so that only a finite number of terms can be used to model the image wavelet coefficients, ensuring at the same time the resulting PDF to be non-negative. It is shown that the proposed PDF matches the empirical one better than some of the standard ones, such as the generalized Gaussian or Bessel K-form PDF. A Bayesian image denoising technique is then proposed, wherein the new PDF is exploited to statistically model the subband as well as the local neighboring image wavelet coefficients. Experimental results on several test images demonstrate that the proposed denoising method, both in the subband-adaptive and locally adaptive conditions, provides a performance better than that of most of the methods that use PDFs with limited number of parameters.

Maximum differentiation (MAD) competition: a methodology for comparing computational models of perceptual quantities

We propose an efficient methodology for comparing computational models of a perceptually discriminable quantity. Rather than comparing model responses to subjective responses on a set of pre-selected stimuli, the stimuli are computer-synthesized so as to optimally distinguish the models. Specifically, given two computational models that take a stimulus as an input and predict a perceptually discriminable quantity, we first synthesize a pair of stimuli that maximize/minimize the response of one model while holding the other fixed. We then repeat this procedure, but with the roles of the two models reversed. Subjective testing on pairs of such synthesized stimuli provides a strong indication of the relative strengths and weaknesses of the two models. Specifically, the model whose extremal stimulus pairs are easier for subjects to discriminate is the better model. Moreover, careful study of the synthesized stimuli may suggest potential ways to improve a model or to combine aspects of multiple models. We demonstrate the methodology for two example perceptual quantities: contrast and image quality.

Quantitative image quality evaluation of MR images using perceptual difference models

The authors are using a perceptual difference model (Case-PDM) to quantitatively evaluate image quality of the thousands of test images which can be created when optimizing fast magnetic resonance (MR) imaging strategies and reconstruction techniques. In this validation study, they compared human evaluation of MR images from multiple organs and from multiple image reconstruction algorithms to Case-PDM and similar models. The authors found that Case-PDM compared very favorably to human observers in double-stimulus continuous-quality scale and functional measurement theory studies over a large range of image quality. The Case-PDM threshold for nonperceptible differences in a 2-alternative forced choice study varied with the type of image under study, but was approximately 1.1 for diffuse image effects, providing a rule of thumb. Ordering the image quality evaluation models, we found in overall Case-PDM approximately IDM (Sarnoff Corporation) approximately SSIM [Wang et al. IEEE Trans. Image Process. 13, 600-612 (2004)] > mean squared error NR [Wang et al. (2004) (unpublished)] > DCTune (NASA) > IQM (MITRE Corporation). The authors conclude that Case-PDM is very useful in MR image evaluation but that one should probably restrict studies to similar images and similar processing, normally not a limitation in image reconstruction studies.

Rate bounds on SSIM index of quantized images

In this paper, we derive bounds on the structural similarity (SSIM) index as a function of quantization rate for fixed-rate uniform quantization of image discrete cosine transform (DCT) coefficients under the high-rate assumption. The space domain SSIM index is first expressed in terms of the DCT coefficients of the space domain vectors. The transform domain SSIM index is then used to derive bounds on the average SSIM index as a function of quantization rate for uniform, Gaussian, and Laplacian sources. As an illustrative example, uniform quantization of the DCT coefficients of natural images is considered. We show that the SSIM index between the reference and quantized images fall within the bounds for a large set of natural images. Further, we show using a simple example that the proposed bounds could be very useful for rate allocation problems in practical image and video coding applications.

Nonlinearities in stereoscopic phase-differencing

Exploiting the quasi-linear relationship between local phase and disparity, phase-differencing registration algorithms provide a fast, powerful means for disparity estimation. Unfortunately, these phase-differencing techniques suffer a significant impediment: phase nonlinearities. In regions of phase nonlinearity, the signals under consideration possess properties that invalidate the use of phase for disparity estimation. This paper uses the amenable properties of Gaussian white noise images to analytically quantify these properties. The improved understanding gained from this analysis enables us to better understand current methodologies for detecting regions of phase instability. Most importantly, we introduce a new, more effective means for identifying these regions based on the second derivative of phase.

Denoising and 4D visualization of OCT images

We are using Optical Coherence Tomography (OCT) to image structure and function of the developing embryonic heart in avian models. Fast OCT imaging produces very large 3D (2D + time) and 4D (3D volumes + time) data sets, which greatly challenge ones ability to visualize results. Noise in OCT images poses additional challenges. We created an algorithm with a quick, data set specific optimization for reduction of both shot and speckle noise and applied it to 3D visualization and image segmentation in OCT. When compared to baseline algorithms (median, Wiener, orthogonal wavelet, basic non-orthogonal wavelet), a panel of experts judged the new algorithm to give much improved volume renderings concerning both noise and 3D visualization. Specifically, the algorithm provided a better visualization of the myocardial and endocardial surfaces, and the interaction of the embryonic heart tube with surrounding tissue. Quantitative evaluation using an image quality figure of merit also indicated superiority of th new algorithm. Noise reduction aided semi-automatic 2D image segmentation, as quantitatively evaluated using a contour distance measure with respect to an expert segmented contour. In conclusion, the noise reduction algorithm should be quite useful for visualization and quantitative measurements (e.g., heart volume, stroke volume, contraction velocity, etc.) in OCT embryo images. With its semi-automatic, data set specific optimization, we believe that the algorithm can be applied to OCT images from other applications.

Noise and signal estimation in magnitude MRI and Rician distributed images: a LMMSE approach

A new method for noise filtering in images that follow a Rician model-with particular attention to magnetic resonance imaging-is proposed. To that end, we have derived a (novel) closed-form solution of the linear minimum mean square error (LMMSE) estimator for this distribution. Additionally, a set of methods that automatically estimate the noise power are developed. These methods use information of the sample distribution of local statistics of the image, such as the local variance, the local mean, and the local mean square value. Accordingly, the dynamic estimation of noise leads to a recursive version of the LMMSE, which shows a good performance in both noise cleaning and feature preservation. This paper also includes the derivation of the probability density function of several local sample statistics for the Rayleigh and Rician model, upon which the estimators are built.

Structural similarity quality metrics in a coding context: exploring the space of realistic distortions

Perceptual image quality metrics have explicitly accounted for human visual system (HVS) sensitivity to subband noise by estimating just noticeable distortion (JND) thresholds. A recently proposed class of quality metrics, known as structural similarity metrics (SSIM), models perception implicitly by taking into account the fact that the HVS is adapted for extracting structural information from images. We evaluate SSIM metrics and compare their performance to traditional approaches in the context of realistic distortions that arise from compression and error concealment in video compression/transmission applications. In order to better explore this space of distortions, we propose models for simulating typical distortions encountered in such applications. We compare specific SSIM implementations both in the image space and the wavelet domain; these include the complex wavelet SSIM (CWSSIM), a translation-insensitive SSIM implementation. We also propose a perceptually weighted multiscale variant of CWSSIM, which introduces a viewing distance dependence and provides a natural way to unify the structural similarity approach with the traditional JND-based perceptual approaches.

Concurrent recall of serially learned visual discrimination problems in dwarf goats (Capra hircus)

Studies of cognitive ability in farm animals are valuable, not only because they provide indicators of the commonality of comparative influence, but understanding farm animal cognition may also aid in management and treatment procedures. Here, eight dwarf goats (Capra hircus) learned a series of 10 visual four-choice discriminations using an automated device that allowed individual ad lib. access to the test setup while staying in a familiar environment and normal social setting. The animals were trained on each problem for 5 days, followed by concurrent testing of the current against the previous problem. Once all 10 problems had been learned, they were tested concurrently over the course of 9 days. In initial training, all goats achieved criterion learning levels on nearly all problems within 2 days and under 200 trials. Concurrently presenting the problems trained in adjacent sessions did not impair performance on either problem relative to single-problem learning. Upon concurrent presentation of all 10 previously learned problems, at least half were well-remembered immediately. Although this test revealed a recency effect (later problems were better remembered), many early-learned problems were also well-retained, and 10-item relearning was quite quick. These results show that dwarf goats can retain multiple-problem information proficiently and can do so over periods of several weeks. From an ecological point of view, the ability to form numerous associations between visual cues offered by specific plants and food quality is an important pre-grazing mechanism that helps goats exploit variation in vegetation and graze selectively.

Distinct face-processing strategies in parents of autistic children

In his original description of autism, Kanner [1] noted that the parents of autistic children often exhibited unusual social behavior themselves, consistent with what we now know about the high heritability of autism [2]. We investigated this so-called Broad Autism Phenotype in the parents of children with autism, who themselves did not receive a diagnosis of any psychiatric illness. Building on recent quantifications of social cognition in autism [3], we investigated face processing by using the "bubbles" method [4] to measure how viewers make use of information from specific facial features in order to judge emotions. Parents of autistic children who were assessed as socially aloof (N = 15), a key component of the phenotype [5], showed a remarkable reduction in processing the eye region in faces, together with enhanced processing of the mouth, compared to a control group of parents of neurotypical children (N = 20), as well as to nonaloof parents of autistic children (N = 27, whose pattern of face processing was intermediate). The pattern of face processing seen in the Broad Autism Phenotype showed striking similarities to that previously reported to occur in autism [3] and for the first time provides a window into the endophenotype that may result from a subset of the genes that contribute to social cognition.

Effect of different traversal schemes in integral image coding

Integral imaging (InIm) is a highly promising technique for the delivery of three-dimensional (3D) image content. During capturing, different views of an object are recorded as an array of elemental images (EIs), which form the integral image. High-resolution InIm requires sensors with increased resolution and produces huge amounts of highly correlated data. In an efficient encoding scheme for InIm compression both inter-EI and intra-EI correlations have to be properly exploited. We present an EI traversal scheme that maximizes the performance of InIm encoders by properly rearranging EIs to increase the intra-EI correlation of jointly coded EIs. This technique can be used to augment performance of both InIm specific and properly adapted general use encoder setups, used in InIm compression. An objective quality metric is also introduced for evaluating the effects of different traversal schemes on the encoder performance.

Nonlinear Image Representation Using Divisive Normalization

In this paper, we describe a nonlinear image representation based on divisive normalization that is designed to match the statistical properties of photographic images, as well as the perceptual sensitivity of biological visual systems. We decompose an image using a multi-scale oriented representation, and use Student's t as a model of the dependencies within local clusters of coefficients. We then show that normalization of each coefficient by the square root of a linear combination of the amplitudes of the coefficients in the cluster reduces statistical dependencies. We further show that the resulting divisive normalization transform is invertible and provide an efficient iterative inversion algorithm. Finally, we probe the statistical and perceptual advantages of this image representation by examining its robustness to added noise, and using it to enhance image contrast.

Design of linear equalizers optimized for the structural similarity index

We propose an algorithm for designing linear equalizers that maximize the structural similarity (SSIM) index between the reference and restored signals. The SSIM index has enjoyed considerable application in the evaluation of image processing algorithms. Algorithms, however, have not been designed yet to explicitly optimize for this measure. The design of such an algorithm is nontrivial due to the nonconvex nature of the distortion measure. In this paper, we reformulate the nonconvex problem as a quasi-convex optimization problem, which admits a tractable solution. We compute the optimal solution in near closed form, with complexity of the resulting algorithm comparable to complexity of the linear minimum mean squared error (MMSE) solution, independent of the number of filter taps. To demonstrate the usefulness of the proposed algorithm, it is applied to restore images that have been blurred and corrupted with additive white gaussian noise. As a special case, we consider blur-free image denoising. In each case, its performance is compared to a locally adaptive linear MSE-optimal filter. We show that the images denoised and restored using the SSIM-optimal filter have higher SSIM index, and superior perceptual quality than those restored using the MSE-optimal adaptive linear filter. Through these results, we demonstrate that a) designing image processing algorithms, and, in particular, denoising and restoration-type algorithms, can yield significant gains over existing (in particular, linear MMSE-based) algorithms by optimizing them for perceptual distortion measures, and b) these gains may be obtained without significant increase in the computational complexity of the algorithm.

Enhancing obstetric and gynecology ultrasound images by adaptation of the speckle reducing anisotropic diffusion filter

OBJECTIVE

So far there is no ideal speckle reduction filtering technique that is capable of enhancing and reducing the level of noise in medical ultrasound (US) images, while efficiently responding to medical experts' validation criteria which quite often include a subjective component. This paper presents an interactive tool called evolutionary speckle reducing anisotropic diffusion filter (EVOSRAD) that performs adaptive speckle filtering on ultrasound B-mode still images. The medical expert runs the algorithm interactively, having a permanent control over the output, and guiding the filtering process towards obtaining enhanced images that agree to his/her subjective quality criteria.

METHODS AND MATERIAL

We employ an interactive evolutionary algorithm (IGA) to adapt on-line the parameters of a speckle reducing anisotropic diffusion (SRAD) filter. For a given input US image, the algorithm evolves the parameters of the SRAD filter according to subjective criteria of the medical expert who runs the interactive algorithm. The method and its validation are applied to a test bed comprising both real and simulated obstetrics and gynecology (OB/GYN) ultrasound images.

RESULTS

The potential of the method is analyzed in comparison to other speckle reduction filters: the original SRAD filter, the anisotropic diffusion, offset and median filters. Results obtained show the good potential of the method on several classes of OB/GYN ultrasound images, as well as on a synthetic image simulating a real fetal US image. Quality criteria for the evaluation and validation of the method include subjective scoring given by the medical expert who runs the interactive method, as well as objective global and local quality criteria.

CONCLUSIONS

The method presented allows the medical expert to design its own filters according to the degree of medical expertise as well as to particular and often subjective assessment criteria. A filter is designed for a given class of ultrasound images and for a given medical expert who will later use the respective filter in clinical practice. The process of designing a filter is simple and employs an interactive visualization and scoring stage that does not require image processing knowledge. Results show that filters tailored using the presented method achieve better quality scores than other more generic speckle filtering techniques.

A statistical approach to volume data quality assessment

Quality assessment plays a crucial role in data analysis. In this paper, we present a reduced-reference approach to volume data quality assessment. Our algorithm extracts important statistical information from the original data in the wavelet domain. Using the extracted information as feature and predefined distance functions, we are able to identify and quantify the quality loss in the reduced or distorted version of data, eliminating the need to access the original data. Our feature representation is naturally organized in the form of multiple scales, which facilitates quality evaluation of data with different resolutions. The feature can be effectively compressed in size. We have experimented with our algorithm on scientific and medical data sets of various sizes and characteristics. Our results show that the size of the feature does not increase in proportion to the size of original data. This ensures the scalability of our algorithm and makes it very applicable for quality assessment of large-scale data sets. Additionally, the feature could be used to repair the reduced or distorted data for quality improvement. Finally, our approach can be treated as a new way to evaluate the uncertainty introduced by different versions of data.

A multistage motion vector processing method for motion-compensated frame interpolation

In this paper, a novel, low-complexity motion vector processing algorithm at the decoder is proposed for motion-compensated frame interpolation or frame rate up-conversion. We address the problems of having broken edges and deformed structures in an interpolated frame by hierarchically refining motion vectors on different block sizes. Our method explicitly considers the reliability of each received motion vector and has the capability of preserving the structure information. This is achieved by analyzing the distribution of residual energies and effectively merging blocks that have unreliable motion vectors. The motion vector reliability information is also used as a prior knowledge in motion vector refinement using a constrained vector median filter to avoid choosing identical unreliable one. We also propose using chrominance information in our method. Experimental results show that the proposed scheme has better visual quality and is also robust, even in video sequences with complex scenes and fast motion.

Prediction of perceptible artifacts in JPEG2000 compressed abdomen CT images using a perceptual image quality metric

RATIONALE AND OBJECTIVES

To test a perceptual quality metric (high-dynamic range visual difference predictor, HDR-VDP) in predicting perceptible artifacts in Joint Photographic Experts Group 2000 compressed thin- and thick-section abdomen computed tomography images.

MATERIALS AND METHODS

A total of 120 thin (0.67 mm) and corresponding thick (5 mm) sections were compressed to ratios from 4:1 to 15:1. Peak signal-to-noise ratio (PSNR), HDR-VDP results (paired t-tests), and five radiologists' pooled responses for the presence of artifacts (exact tests for paired proportions) were compared between the thin and thick sections. For three subsets of 120 thin- (subset A), 120 thick- (subset B), and 60 thin- and 60 thick-section compressed images (subset C), receiver operating curve analysis was performed to compare PSNR and HDR-VDP in predicting the radiologists' responses. Using the cutoff values where the sum of sensitivity and specificity was the maximum in subset C, visually lossless thresholds (VLTs) were estimated for the 240 original images and the estimation accuracy was compared (McNemar test).

RESULTS

Thin sections showed more artifacts in terms of PSNR, HDR-VDP, and radiologists' responses (p < .0001). HDR-VDP outperformed PSNR for subset C (area under the curve: 0.97 versus 0.93, p = 0.03), whereas they did not differ significantly for subset A or B. Using the cutoff values, PSNR and HDR-VDP predicted the VLT accurately for 124 (51.7%) and 183 (76.3%) images, respectively (p < .0001).

CONCLUSIONS

HDR-VDP can predict the perceptible compression artifacts, and therefore can be potentially used to estimate the VLT for such compressions.

Deformable 2D-3D registration of the pelvis with a limited field of view, using shape statistics

Our paper summarizes experiments for measuring the accuracy of deformable 2D-3D registration between sets of simulated x-ray images (DRR's) and a statistical shape model of the pelvis bones, which includes x-ray attenuation information ("density"). In many surgical scenarios, the images contain a truncated view of the pelvis anatomy. Our work specifically addresses this problem by examining different selections of truncated views as target images. Our atlas is derived by applying principal component analysis to a population of up to 110 instance shapes. The experiments measure the registration error with a large and truncated FOV. A typical accuracy of about 2 mm is achieved in the 2D-3D registration, compared with about 1.4 mm of an "optimal" 3D-3D registration.