The proceedings contain 83 papers. The topics discussed include: measuring the Hurst parameter of compressed video sequences;coalition-based multimedia peer matching strategies for P2P networks;risk-aware scheduling m...
详细信息
ISBN:
(纸本)9780819469946
The proceedings contain 83 papers. The topics discussed include: measuring the Hurst parameter of compressed video sequences;coalition-based multimedia peer matching strategies for P2P networks;risk-aware scheduling multi-user video streaming multi-hop networks;video multicast over wireless mesh networks with scalable video coding (SVC);rate-distortion optimized multimedia communication in networks;distributed fine grain adaptive-FEC scheme for scalable video streaming;motion-compensated noise estimation fro effective video processing;motion tracking with non-stationary camera based on area and level set weighted average of centroid shifting vectors;a novel approach to skip mode decision for H.264;distributed pose estimation from multiple views;and smooth extraction of SVC fine-granular SNR scalable videos with a virtual-GOP-based rate distortion modeling.
This paper proposes a method for evaluating visual difference caused by decimation. In many applications it is important to evaluate visual difference of two different images. There exist many image assessment methods...
详细信息
ISBN:
(纸本)9781424425648
This paper proposes a method for evaluating visual difference caused by decimation. In many applications it is important to evaluate visual difference of two different images. There exist many image assessment methods that utilize the human visual system (HVS), such as the visual difference predictor (VDP) and the Sarnoff visual discrimination model. In this paper, we extend and elaborate on the conventional image assessment method for the purpose of evaluating the visual difference caused by the image decimation. Our method matches actual human evaluation more and requires less computation complexity than the conventional method.
The end of the performance entitlement historically achieved by classic scaling of CMOS devices is within sight, driven ultimately by fundamental limits. Performance entitlements predicted by classic CMOS scaling have...
详细信息
ISBN:
(纸本)9780819469946
The end of the performance entitlement historically achieved by classic scaling of CMOS devices is within sight, driven ultimately by fundamental limits. Performance entitlements predicted by classic CMOS scaling have progressively failed to be realized in recent process generations due to excessive leakage, increasing interconnect delays and scaling of gate dielectrics. Prior to reaching fundamental limits, trends in technology, architecture and economics will pressure the industry to adopt new paradigms. A likely response is to repartition system functions away from digital implementations and into new architectures. Future architectures for visualcommunications will require extending the implementation into the optical and analog processing domains. The fundamental properties of these domains will in turn give rise to new architectural concepts. The limits of CMOS scaling and impact on architectures will be briefly reviewed. Alternative approaches in the optical, electronic and analog domains will then be examined for advantages, architectural impact and drawbacks.
This paper presents an energy efficient VLSI architecture for motion estimation using imageprocessing assisted voltage overscaling (VOS). Motion estimation is the most computationally expensive block inside any video...
详细信息
ISBN:
(纸本)9780819469946
This paper presents an energy efficient VLSI architecture for motion estimation using imageprocessing assisted voltage overscaling (VOS). Motion estimation is the most computationally expensive block inside any video encoder, typically consuming 40-60% of the total power. This work focuses on using VOS to reduce power consumption at the expense of marginal loss of visual quality. Some imageprocessing techniques are used to assist VOS so that a better trade-off between power and visual quality can be achieved. The design is demonstrated using full search and three step search algorithms. Simulation results in 65mn CMOS technology show that the proposed technique can save up to 30% power at the cost of 0.5dB loss of PSNR.
An attraction-repulsion expectation-maximization (AREM) algorithm for density estimation is proposed in this paper. We introduce a Gibbs distribution function for attraction and inverse Gibbs distribution for repulsio...
详细信息
ISBN:
(纸本)9780819469946
An attraction-repulsion expectation-maximization (AREM) algorithm for density estimation is proposed in this paper. We introduce a Gibbs distribution function for attraction and inverse Gibbs distribution for repulsion as an augmented penalty function in order to determine equilibrium between over-smoothing and over-fitting. The logarithm of the likelihood function augmented the Gibbs density mixture is solved under expectation-maximization (EM) method. We demonstrate the application of the proposed attraction-repulsion expectation-maximization algorithm to image reconstruction and sensor field estimation problem using computer simulation. We show, that the proposed algorithm improves the performance considerably.
We consider the problem of communicating compact descriptors for the purpose of establishing visual correspondences between two cameras operating under rate constraints. Establishing visual correspondences is a critic...
详细信息
ISBN:
(纸本)9780819469946
We consider the problem of communicating compact descriptors for the purpose of establishing visual correspondences between two cameras operating under rate constraints. Establishing visual correspondences is a critical step before other tasks such as camera calibration or object recognition can be performed in a network of cameras. We verify that descriptors of regions which are in correspondence are highly correlated, and propose the use of distributed source coding to reduce the bandwidth needed for transmitting descriptors required to establish correspondence. Our experiments demonstrate that the proposed scheme is able to provide compression gains of 57% with minimal, loss in the number of correctly established correspondences compared to a scheme that communicates the entire image of the scene losslessly in compressed form. Over a wide range of rates, the proposed scheme also provides superior performance when compared to simply transmitting all the feature descriptors.
A novel statistical image model is proposed to facilitate the design and analysis of imageprocessing algorithms. A mean-removed image neighborhood is modeled as a scaled segment of a hypothetical texture source, char...
详细信息
ISBN:
(纸本)9780819469946
A novel statistical image model is proposed to facilitate the design and analysis of imageprocessing algorithms. A mean-removed image neighborhood is modeled as a scaled segment of a hypothetical texture source, characterized as a 2-D stationary zero-mean unit-variance random field, specified by its autocorrelation function. Assuming that statistically similar image neighborhoods are derived from the same texture source, a clustering algorithm is developed to optimize both the texture sources and the cluster of neighborhoods associated with each texture source. Additionally, a novel parameterization of the texture source autocorrelation function and the corresponding power spectral density is incorporated into the clustering algorithm. The parametric autocorrelation function is anisotropic, suitable for describing directional features such as edges and lines in images. Experimental results demonstrate the application of the proposed model for designing linear predictors and analyzing the performance of wavelet-based image coding methods.
Progressive transmission of images is an important functionality for cominunicating high resolution images over limited bandwidth networks. By encoding the image data in an accessible and hierarchical format, the JPEG...
详细信息
ISBN:
(纸本)9780819469946
Progressive transmission of images is an important functionality for cominunicating high resolution images over limited bandwidth networks. By encoding the image data in an accessible and hierarchical format, the JPEG 2000 standard supports many types of image progressions, e.g., based on quality, resolution, component and position. This paper considers a progressive transmission scheme in which codestream ordering and transmission decisions are driven entirely by the server, which is useful for classes of applications that employ image analysis at the server and perform streaming based on the results of this analysis. The proposed system aims to minimize signaling overhead and allow for incremental decoding and display with minimal processing delay. It also aims to fully exploit the various styles of progression that are enabled by the JPEG 2000 coding format. The performance of our proposed scheme is reported in terms of signaling overhead, complexity and visual effectiveness.
Adaptive decimation ( AD) is a technique that aims at compressing images with a very small amount of computations and memory requirement. For images that contain moderate amounts of textural content, the method exhibi...
详细信息
Adaptive decimation ( AD) is a technique that aims at compressing images with a very small amount of computations and memory requirement. For images that contain moderate amounts of textural content, the method exhibits satisfactory performance and in general provides good visual quality and acceptable coding fidelity at low bit-rate of around 0.2 bpp. Although the complexity of the method is relatively light when compared with the existing compression methods, it still involves a considerable amount of computations that would require the use of medium-speed processors to achieve real-time operation. In the paper, a novel image encoder based on the principles of AD is reported. The scheme is near-computation-free as it involves on average a single fixed point multiplication plus a few other summing and logical operations for every four pixels. Experimental results reveal that, despite the substantial reduction in complexity, the performance of proposed method is similar to, if not better than, the existing AD encoding algorithms.
A projection onto convex sets (POCS)-based annotation method for semantic image retrieval is presented in this paper. Utilizing database images previously annotated by keywords, the proposed method estimates unknown s...
详细信息
A projection onto convex sets (POCS)-based annotation method for semantic image retrieval is presented in this paper. Utilizing database images previously annotated by keywords, the proposed method estimates unknown semantic features of a query image from its known visual features based on a POCS algorithm, which includes two novel approaches. First, the proposed method semantically assigns database images to some clusters and introduces a nonlinear eigenspace of visual and semantic features in each cluster into the constraint of the POCS algorithm. This approach accurately provides semantic features for each cluster by using its visual features in the least squares sense. Furthermore, the proposed method monitors the error converged by the POCS algorithm in order to select the optimal cluster including the query image. By introducing the above two approaches into the POCS algorithm, the unknown semantic features of the query image are successfully estimated from its known visual features. Consequently, similar images can be easily retrieved from the database based on the obtained semantic features. Experimental results verify the effectiveness of the proposed method for semantic image retrieval.
暂无评论