One fast inter mode decision algorithm is proposed in this paper. The whole algorithm is divided into two stages. In the pre-stage, by exploiting spatial and temporal information of encoded macrobocks (MBs), a skip mode early detection scheme is proposed. The homogeneity of current MB is also analyzed to filter out small inter modes in this stage. Secondly, during the block matching stage, a motion feature based inter mode decision scheme is introduced by analyzing the motion vector predictor's accuracy, the block overlapping situation and the smoothness of SAD (sum of absolute difference) value. Moreover, the rate distortion cost is checked in an early stage and we set some constraints to speed up the whole decision flow. Experiments show that our algorithm can achieve a speed up factor of up to 53.4% for sequences with different motion type. The overall bit increment and quality degradation is negligible compared with existing works.

抄録全体を表示

Block truncation coding (BTC) is an efficient image compression algorithm that generates a constant output bit-rate. For color image compression, vector quantization (VQ) is exploited to improve the coding efficiency. In this letter, we propose an improved VQ based BTC (VQ-BTC) algorithm using template matching and Lloyd quantization (LQ). The experimental results show that the proposed method improves the PSNR by 0.9dB in average compared to the conventional VQ-BTC algorithms.

抄録全体を表示

We investigated the relationship between ambient illumination and psychological effect by applying a modified color harmony model. We verified the proposed model by analyzing correlation between psychological value and modified color harmony score. Experimental results showed the possibility to obtain the best color for illumination using this model.

抄録全体を表示

The purpose of the paper is to show that boundary implication results hold for complex-valued uncertain linear time-delay systems. The results are derived by the Lambert W function and yield tractable robust stability criteria for simultaneously triangularizable linear time-delay systems. The setting is similar to a recently reported extreme-point result, but the assumed uncertainty sets can be much more free in shape.

抄録全体を表示

Our paper proposes a low power delay element with many other valuable characteristics for asynchronous circuits in the bundled-data implementation. Delay elements are frequently utilized to interact with asynchronous environment for revealing the current status of the bundled-data asynchronous circuits. Thus, a notable portion of the total energy is consumed by the delay elements for this kind of designs. Moreover, constructing a specific delay on a chip is a difficult task for recent CMOS technology. An extreme low power asymmetrical delay element with post-chip adjustment feature was developed mainly for solving these issues. Our initial intention was to develop a programmable delay element for asynchronous data path components. The proposed delay element is also suitable for many other applications requiring low power constraint. In addition to the programmability, the delay element also demonstrated efficiently characteristics such as good tolerance to process and temperature variations on the delay. Our delay element is equivalent to approximately the average power of a 4-stage inverter chain. A large delay can be obtained by cascaded scheme with nearly zero handshaking overhead. All arguments were cautiously verified by the post-layout simulation setup using TSMC 0.35µm and 0.18µm technologies under all extreme corners.

抄録全体を表示

A new deadbeat control scheme for linear systems with input constraints is presented. Input constraints exist in most control systems, but in conventional dead-beat control, logical strategy to handle it has not been studied enough. The proposed controller in this paper adjusts the number of steps for dead-beat tracking on-line, in order to achieve delayed deadbeat-tracking performance and satisfy any admissible input constraint. Increasing the number of steps for dead-beat tracking and formulating the corresponding degree of freedom into null-space vectors make it possible to obtain delayed dead-beat tracking, and minimize the inevitable delay, respectively. LMI feasibility problems are solved to numerically obtain the solution and minimize the unavoidable step-delay. As a result, calculation effort is reduced compared to LMI-optimization problem. The proposed schemes can be readily numerically implemented. Its practical usefulness is validated by simulation for 6-axis robot model and experimental results for DC-motor servoing.

抄録全体を表示

A performance of the complex chaotic spreading sequences with constant power is investigated in a chip-synchronous complex CDMA with a complex scrambling. We estimate a signal-to-interference ratio (SIR) and a bit error rate (BER). An exact invariant measure of the complex chaotic spreading sequence can be obtained. Therefore, the SIR can be calculated analytically. The result can be used as one of the criteria for evaluating the performance of the complex CDMA using the chaotic spreading sequences.

抄録全体を表示

In this paper we give a simple algorithm to compute a canonical code for fullerene graphs. Our algorithm runs in O(n) time, while the best known algorithm runs in O(n²) time. Our algorithm is simple. One can generalize the algorithm to compute a canonical code for the skeleton of a convex polyhedron with n vertices. The algorithm runs in O(n²) time.

抄録全体を表示

Information theoretic security is an important security notion in cryptography as it provides a true lower bound for attack complexities. However, in practice attacks often have a higher cost than the information theoretic bound. In this paper we study the relationship between information theoretic attack costs and real costs. We show that in the information theoretic model, many well-known and commonly used hash functions such as MD5 and SHA-256 fail to be preimage resistant.

抄録全体を表示

Factorization of Hadamard matrices can provide fast algorithm and facilitate efficient hardware realization. In this letter, constructions of factorizable multilevel Hadamard matrices, which can be considered as special case of unitary matrices, are inverstigated. In particular, a class of ternary Hadamard matrices, together with its application, is presented.

抄録全体を表示

Since multiview video coding (MVC) based on H.264/AVC uses a prediction scheme exploiting inter-view correlation among multiview video, MVC encoder compresses multiple views more efficiently than simulcast H.264/AVC encoder. However, in case that the number of views to be encoded increases in MVC, the total encoding time will be greatly increased. To reduce computational complexity in MVC, a fast mode decision using both Macroblock-based region segmentation information and global disparity vector among views is proposed to reduce the encoding time. The proposed method achieves on the average 1.5∼2.9 reduction of the total encoding time with the PSNR (Peak Signal-to-Noise Ratio) degradation of about 0.05dB.

抄録全体を表示