5251967
Foveation scalable video coding with automatic fixation selection
Image and video coding is an optimization problem. A successful image and video coding algorithm delivers a good tradeoff between visual quality and other coding performance measures, such as compression, complexity, scalability, robustness, and security. In this paper, we follow two recent trends in image and video coding research. One is to incorporate human visual system (HVS) models to improve the current state-of-the-art of image and video coding algorithms by better exploiting the properties of the intended receiver. The other is to design rate scalable image and video codecs, which allow the extraction of coded visual information at continuously varying bit rates from a single compressed bitstream. Specifically, we propose a foveation scalable video coding (FSVC) algorithm which supplies good quality-compression performance as well as effective rate scalability. The key idea is to organize the encoded bitstream to provide the best decoded video at an arbitrary bit rate in terms of foveated visual quality measurement. A foveation-based HVS model plays an important role in the algorithm. The algorithm is adaptable to different applications, such as knowledge-based video coding and video communications over time-varying, multiuser and interactive networks.
17056192
Automatic Alignment of High-Resolution NMR Spectra Using a Bayesian Estimation Approach
Nuclear magnetic resonance (NMR) spectral analysis has recently become one of the major means for the detection and recognition of metabolic changes of disease state, physiological alteration, and natural biological variation. For the pattern recognition tasks in which two or more NMR spectra need to be compared, it is critical to properly align the spectra for the subsequent pattern recognition analysis. Previous spectral alignment methods do not consider any baseline intensity variation between the spectra and disregard the effect of noise. Here we formulate the spectra alignment problem in a Bayesian statistical framework, which allows us to simultaneously and efficiently estimate the spectral shift and the baseline intensity variation in the existence of independent additive noise. Experimental results with real high-resolution NMR spectral data from human plasma demonstrate the effectiveness and robustness of the proposed approach
8060733
Embedded foveation image coding
The human visual system (HVS) is highly space-variant in sampling, coding, processing, and understanding. The spatial resolution of the HVS is highest around the point of fixation (foveation point) and decreases rapidly with increasing eccentricity. By taking advantage of this fact, it is possible to remove considerable high-frequency information redundancy from the peripheral regions and still reconstruct a perceptually good quality image. Great success has been obtained previously by a class of embedded wavelet image coding algorithms, such as the embedded zerotree wavelet (EZW) and the set partitioning in hierarchical trees (SPIHT) algorithms. Embedded wavelet coding not only provides very good compression performance, but also has the property that the bitstream can be truncated at any point and still be decoded to recreate a reasonably good quality image. In this paper, we propose an embedded foveation image coding (EFIC) algorithm, which orders the encoded bitstream to optimize foveated visual quality at arbitrary bit-rates. A foveation-based image quality metric, namely, foveated wavelet image quality index (FWQI), plays an important role in the EFIC system. We also developed a modified SPIHT algorithm to improve the coding efficiency. Experiments show that EFIC integrates foveation filtering with foveated image coding and demonstrates very good coding performance and scalability in terms of foveated image quality measurement.
16274687
Measuring Intra- and Inter-Observer Agreement in Identifying and Localizing Structures in Medical Images
Inter- and intra-observer variability exists in any measurements made on medical images. There are two sources of variability. The first occurs when the observers identify and localize the object of interest, and the second happens when the observers make appropriate measurement on the object of interest. A number of statistical methods are available to quantify the degree of agreement between measurements made by different observers. However, little has been done to develop metrics for quantifying the variability in identifying and localizing the objects of interest prior to measurement. In this paper, we propose to use the complex wavelet structural similarity index (CW-SSIM) method to measure the variability in identifying and localizing structures on images. Performance comparisons using simulated images as well as real mammography images demonstrate the effectiveness and robustness of the CW-SSIM method.
6449041
Adaptive frame prediction for foveation scalable video coding
Embedded rate scalable video coding allows for the extraction of coded visual information at continuously varying bit rates from a single compressed bitstream. This is a very attractive feature for many multimedia communication applications. Motion estimation (ME) /motion compensation (MC) techniques are widely employed in various video coding systems to reduce temporal information redundancy. One of the major challenging problems in ME/MC based rate scalable video coding is how to generate the prediction frame from the previous frame to match the current frame. This problem is more difficult in rate scalable coding than in fixed rate coding because the decoding data rate is unavailable to the encoder. We propose an adaptive frame prediction scheme for foveation scalable video coding (FSVC), which is a new video coding algorithm that combines a foveation-based human visual system (HVS) model with a wavelet-based rate scalable coding algorithm. The new frame prediction algorithm provides an adaptive mechanism to control the prediction errors while reduce error propagation.
10308738
No-reference perceptual quality assessment of JPEG compressed images
Human observers can easily assess the quality of a distorted image without examining the original image as a reference. By contrast, designing objective No-Reference (NR) quality measurement algorithms is a very difficult task. Currently, NR quality assessment is feasible only when prior knowledge about the types of image distortion is available. This research aims to develop NR quality measurement algorithms for JPEG compressed images. First, we established a JPEG image database and subjective experiments were conducted on the database. We show that Peak Signal-to-Noise Ratio (PSNR), which requires the reference images, is a poor indicator of subjective quality. Therefore, tuning an NR measurement model towards PSNR is not an appropriate approach in designing NR quality metrics. Furthermore, we propose a computational and memory efficient NR quality assessment model for JPEG images. Subjective test results are used to train the model, which achieves good quality prediction performance.
8746593
Modal logic interpretation of Dempster-Shafer theory: An infinite case
Abstract A modal logic interpretation of belief and plausibility measures defined on infinite sets is established. As a special case, a modal logic interpretation of necessity and possibility measures defined on infinite sets is also established. It is proven in both cases that the interpretation is complete. These results establish, in effect, modal logic interpretations of the Dempster-Shafer theory and possibility theory.
31361781
Adaptive Processing of Tree-Structure Image Representation
Much research on image analysis and processing has been carried out for the last few decades. However, it is still challenging to represent the image contents effectively and satisfactorily. In this paper, a segmentation-free tree-structure image representation is presented. In order to learn the structure representation, a back-propagation through structure (BPTS) algorithm is adopted. Experiments on plant image classification and retrieval refining using only six visual features were conducted on a plant image database and a natural scene image database, respectively. Encouraging results have been achieved.
12482658
On circulant chromatic number and circulant chromatic function
Abstract A new concept of circulant chromatic function of a graph is introduced to generalize the concept of chromatic polynomial of a graph. This is similar to the generalization from the concept of chromatic number to the concept of circulant chromatic number. We provide circulant chromatic functions for a few classes of graphs. We consider circulant chromatic functions on the graphs obtained by elementary operations on given graphs, and the relationship between the circulant chromatic number of a graph and that of its complement. We also investigate some sufficient conditions for the circulant chromatic number and the chromatic number of a graph to be equal to each other.
2647804
Extended DBP for (m, k)-Firm Based QoS
In this paper, an extended DBP (E_DBP) scheme is studied for (m,k)-firm constraint. The basic idea of the proposed algorithm takes into account the distance to exit a failure state, which is a symmetrical notion of distance to fall into a failure state in DBP. Quality of Service (QoS) in terms of dynamic failure and delay is evaluated. Simulation results reveal the effectiveness of E_DBP to provide better QoS.
9720590
Using the compiler to improve cache replacement decisions
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with LRU replacement policies to combine fast access with relatively low miss rates. To improve replacement decisions in set-associative caches, we develop a new set of compiler algorithms that predict which data will and will not be reused and provide these hints to the architecture. We prove that the hints either match or improve hit rates over LRU. We describe a practical one-bit cache-line tag implementation of our algorithm, called evict-me. On a cache replacement, the architecture will replace a line for which the evict-me bit is set, or if none is set, it will use the LRU bits. We implement our compiler analysis and its output in the Scale compiler. On a variety of scientific programs, using the evict-me algorithm in both the level 1 and 2 caches improves simulated cycle times by up to 34% over the LRU policy by increasing hit rates. In addition, a combination of simple hardware prefetching and evict-me works together to further improve performance.