3155816
A directional field based fast intra mode decision algorithm for H.264 video coding
The H.264 video coding standard can achieve considerably higher coding efficiency than previous standards. In order to achieve this, a robust rate-distortion optimization (RDO) technique is employed to select the best coding mode for each macroblock. As a result. the encoder complexity is increased considerably. This paper presents a directional field based fast intra mode decision algorithm to improve the encoder's efficiency. Prior to intra prediction, the directional field is calculated for all the block size to decide the dominant edge direction in the blocks. Based on the edge direction information, only a small number of prediction modes are chosen for RDO calculation. Experimental results show that the fast intra mode decision algorithm increases the speed of intra coding significantly with negligible loss of PSNR
39269573
An adaptive edge-preserving artifacts removal filter for video post-processing
We propose an adaptive edge-preserving artifacts removal filter (EPARF) for post-processing video compressed using block-based motion compensation so as to improve visual quality. The proposed filter is based on half-quadratic regularization, and it can adaptively remove both blocking and ringing artifacts while preserving object edges. The proposed algorithm has been applied to video sequences compressed by the MSRA scalable video coding (SVC) codec with block-based motion-compensated temporal filtering (MCTF). Experimental results demonstrate that EPARF can significantly improve both subjective and objective quality.
981043
Learning Event Durations from Event Descriptions
We have constructed a corpus of news articles in which events are annotated for estimated bounds on their duration. Here we describe a method for measuring inter-annotator agreement for these event duration distributions. We then show that machine learning techniques applied to this data yield coarse-grained event duration information, considerably outperforming a baseline and approaching human performance.
11110859
A locally-adaptive algorithm for measuring blocking artifacts in images and videos
Block transform coding is the most popular approach for image and video compression. The objective measurement of blocking artifacts plays an important role in the design, optimization, and assessment of image and video coding systems. This paper presents a new algorithm for measuring blocking artifacts in images and videos. It exhibits unique and useful features: 1) it examines the blocks individually so that it can measure the severity of blocking artifacts locally; 2) it is a one-pass algorithm in the sense that the image needs to be accessed only once; 3) it takes into account the blocking artifacts for high bit rate images and the flatness for the very low bit rate images; 4) the blocking artifacts measure is well-defined in the range of 0-10. Experiments on various still images and videos show that this blockiness measure is very efficient in terms of computational complexity and memory usage, and can produce consistent blocking artifacts measurement.
9260921
Complexity adaptive quantization for intra-frames in very low bit rate video coding
Conventional rate control schemes focus on the problem of finding an optimal quantization value for P- and B-frames. No rate control is available for the encoding of I-frames. This could pose big problems due to the large number of bits an I-frame could generate, and due to the fact that the number of bits varies drastically from sequence to sequence, depending on their image complexity. This problem becomes severe especially at very low bit rate. Therefore, a mechanism to allocate data bits to an I-frame according to its complexity is indispensable in order to have constant coding quality. This work presents a mechanism to establish for I-frames a generic relationship between the quantization value, data bits, and their image complexity. Experimental results show that this generic relationship provides a fairly accurate estimation of quantization value for an I-frame at given data bits and image complexity, and is very useful in controlling the data bits generated by an I-frame.
8588212
Temporal Aggregates in OWL-Time
In this paper, we describe our approach for representing temporal aggregates in OWL-Time, and a systematic way of mapping iCalendar recurrence sets to OWL-Time temporal sequences. We present several examples of natural language expressions for temporal aggregates and how they would be represented in OWL-Time; some examples can be described in both iCalendar and OWL-Time, while others can only be represented in OWL-Time. We also illustrate how we can translate from a natural language sentence to our representation.
16312564
A new hybrid model for time-series prediction
This paper proposed a new hybrid model in order to increase time series prediction accuracy. This hybrid model considers the routine time prediction technique like AR, ANN or any others as atomic building block. A linear hybrid technique is used to combine their forecast result into the final result. The hybrid algorithm was tested against three different kinds of time series data. Experiments results showed the effectiveness of the proposed hybrid model.
16938513
Robust procedures for obtaining assembly contact state extremal configurations
Two important components in the selection of an admittance that facilitates force-guided assembly are the identification of: 1) the set of feasible contact states, and 2) the set of configurations that span each contact state, i.e., the extremal configurations. We present a procedure to automatically generate both sets from CAD models of the assembly parts. In the procedure, all possible combinations of principle contacts are considered when generating hypothesized contact states. The feasibility of each is then evaluated in a genetic algorithm based optimization procedure. The maximum and minimum value of each of the 6 configuration variables spanning each contact state are obtained by again using genetic algorithms. Together, the genetic algorithm approach, the hierarchical data structure containing the states, the relationships among the states, and the extremals within each state are used to provide a reliable means of identifying all feasible contact states and their associated extremal configurations.
41075889
Efficient Compression of Multi-view Video Using Hierarchical B Pictures
3D and free viewpoint video are new types of natural video media that expand the user's sensation far beyond what is offered by traditional media. As video compression is a key issue in traditional video communications and the use of multi video streams makes it even more important for such applications. In this paper, we presented an investigation of the multi- view video coding structures with focus on exploiting hierarchical B pictures. We demonstrate hierarchical B pictures prediction structures, and present the advantage of several multi-view video coding prediction schemes. This demonstration will show the benefits of using hierarchical B pictures based on H.264/AVC. The simulation results demonstrate that the objective quality can be improved with the advanced MVC prediction structures in comparison to the simulcast coding structures.
207290821
Discriminating between photorealistic computer graphics and natural images using fractal geometry
Rendering technology in computer graphics (CG) is now capable of producing highly photorealistic images, giving rise to the problem of how to identify CG images from natural images. Some methods were proposed to solve this problem. In this paper, we give a novel method from a new point of view of image perception. Although the photorealistic CG images are very similar to natural images, they are surrealistic and smoother than natural images, thus leading to the difference in perception. A part of features are derived from fractal dimension to capture the difference in color perception between CG images and natural images, and several generalized dimensions are used as the rest features to capture difference in coarseness. The effect of these features is verified by experiments. The average accuracy is over 91.2%.
10609537
A new set of moment invariants for handwritten numeral recognition
In this paper, a new set of aspect invariant moments for handwritten numeral recognition are presented. These new moments exhibit two useful properties. Firstly, they are aspect invariant. This eliminates the need for size normalization of the unconstrained numerals. Secondly, their dynamic range remains constant with moment order. This overcomes the problem of diminishing high order moments, which occurs when other moment invariants are used. Thus, aspect invariant moments are particularly suitable for use with neural networks. Experimental results (using a multilayer perceptron and the backpropagation learning rule) show that a very high recognition rate (98.73%) and low substitution rate (1.06%) can be achieved on a totally unconstrained handwritten numeral database.<<ETX>>