Communication between one individual and another can be delivered in different ways, not only through speech, writing and body motions. Communication can also be delivered through basic emotions one feels through visi...
详细信息
ISBN:
(纸本)9781538609699
Communication between one individual and another can be delivered in different ways, not only through speech, writing and body motions. Communication can also be delivered through basic emotions one feels through visible facial expressions. Facial expressions displayed in the forms of emotional expressions can be demonstrated briefly or quickly, which is known as micro-expression. The subtle motion of micro facial expression in every exchange makes many people find it difficult to identify and recognize the ongoing emotion. Therefore, this study proposes the recognition of micro-expression emotions with estimated subtle motion in the image sequence based on onset-frame, apex-frame, and offset-frame for feature extraction. The method used for feature extraction are the combination of block matching algorithm with Taylor Series Approximation referred to as Subpixel Subtle Motion Estimation (SME). Multiclass Classification process using Multilayer Perceptron (MLP) Backpropagation and Support Vector Machine (SVM) as a comparison. The evaluation results show the best accuracy 85.07%, with the Mean Absolute Error 0.0597 and Root Mean Square Error 0.2443.
Most of the fast search motion estimation algorithms reduce the computational complexity of motion estimation (ME) greatly by checking only a few search points inside the search area. In this paper, we propose a new a...
详细信息
Most of the fast search motion estimation algorithms reduce the computational complexity of motion estimation (ME) greatly by checking only a few search points inside the search area. In this paper, we propose a new algorithm-multi-layer motion estimation (MME) which reduces the computational complexity of each distortion measure instead of reducing the number of search points. The conventional fast search motion estimation algorithms perform ME on the reference frame with full distortion measure;on the contrary, the MME performs ME on the layers with partial distortion measures to enhance the computational speed of ME. A layer is an image which is derived from the reference frame;each macro-pixel value in the layer represents the sum of the values of the corresponding pixels in the reference frame. A hierarchical quad-tree structure is employed in this paper to construct multiple layers from the reference frame. Experimental results on different video sequences show evidence that many motion vectors have been found similar both in the reference frame and the layers. The effectiveness of the proposed MME algorithm is compared with that of some state-of-the-art fast block matching algorithms with respect to speed and motion prediction quality. Experimental results on a wide variety of video sequences show that the proposed algorithm outperforms the other popular conventional fast search motion estimation algorithms computationally while maintaining the motion prediction quality very close to the full-search algorithm. Moreover, the proposed algorithm can achieve a maximum of 97.99 % speed-improvement rate against the fast full-search motion estimation algorithms which are based on hierarchical blockmatching process. The proposed MME performs the motion estimation on the layers by using three types of search patterns. The derivation of these search patterns exploits the characteristic of the center-biased motion vector distribution and that of less intensive block di
Most of the fast search motion estimation algorithms reduce the computational cost of motion estimation (ME) greatly by checking only a few search points inside the search area by using full distortion measure. This p...
详细信息
Most of the fast search motion estimation algorithms reduce the computational cost of motion estimation (ME) greatly by checking only a few search points inside the search area by using full distortion measure. This paper proposes multi-layer motion estimation (MME) which employs partial distortion as its distortion measure to reduce the number of computations involved in each search point instead of reducing the number of search points. The MME, first, constructs the layers from the reference frame so as to facilitate the calculation of partial distortion measures on the layers. Later, it searches motion vectors by computing the partial distortion measures on the layers. A layer is an image which is derived from the reference frame such that the summation of a block of pixels in the reference frame determines the point of a layer. It has been noticed on different video sequences that many motion vectors on the layers are the same as those searched on the reference frame. Experimental results on a wide variety of video sequences show that the proposed algorithm outperforms the other popular conventional fast search motion estimation algorithms computationally while maintaining the motion prediction quality very close to the full-search algorithm.
In this paper, we propose a novel, efficient and fast motion estimation (ME) algorithm for High Efficiency Video Coding (HEVC). The proposed work is based on video content that gives us the provision to select a best ...
详细信息
ISBN:
(纸本)9781509020287
In this paper, we propose a novel, efficient and fast motion estimation (ME) algorithm for High Efficiency Video Coding (HEVC). The proposed work is based on video content that gives us the provision to select a best macro block mode and suitable search pattern for a given slice of the video frame. Each frame is divided into multiple slices based on a tiered scene labelling mechanism and a suitable search pattern is estimated for each slice by investigating texture of the slice. The inter space distance between a macro block in current frame to the candidate macro block in the previous frame is calculated for all the macro blocks in a slice, to find the block movement factor (BMF) which identifies a appropriate search pattern for that slice. Also, the disparity between the neighbouring blocks is measured for each slice to predict the mode to be considered for blockmatching in next frame. The experimental analysis is performed with x265 video codec, which shows considerable amount (20%) of improvement in compression performance.
In the context of motion estimation (ME) for video coding, the rate-constrained successive elimination algorithm (RC-SEA) safely eliminates candidate motion vectors while preserving the optimal candidate chosen by the...
详细信息
ISBN:
(纸本)9781467399616
In the context of motion estimation (ME) for video coding, the rate-constrained successive elimination algorithm (RC-SEA) safely eliminates candidate motion vectors while preserving the optimal candidate chosen by the block matching algorithm (BMA). This paper describes a technique for reusing ME information from rectangular to square prediction units in order to reduce the search area without altering the optimal candidate chosen by the BMA. Our experiments show that, on average, when this optimization is combined with the RCSEA in the HEVC HM encoder reference software, the number of sum of the absolute differences (SAD) operations drops by 94.9%, resulting in a speedup of 6.13x in full search mode. Although identical coding decisions cannot be guaranteed when multiple optimal solutions exist, the average impact on BD-PSNR is 0.0002 dB.
Increasing frame rates by temporal frame interpolation is one of the main challenge in modern video processing. Recent studies on frame interpolation mainly focused on getting true motion vectors, but along with that ...
详细信息
ISBN:
(纸本)9781509017461
Increasing frame rates by temporal frame interpolation is one of the main challenge in modern video processing. Recent studies on frame interpolation mainly focused on getting true motion vectors, but along with that assigning motion vectors accurately is also an important issue. In this paper we have proposed a new Cubic Motion Compensated Frame Interpolation algorithm which generates a frame by properly assigning motion vectors. In conventional motion compensated frame interpolation algorithm two consecutive frames are considered for motion estimation to get motion vectors. In this paper, use of cubic interpolation technique have been done, which considers four successive frames through which three different motion vectors are calculated. For evaluation average Peak Signal to Noise Ratio (PSNR) and average Structural Similarity (SSIM) are taken into consideration to compare the proposed algorithm with the conventional algorithm. It is found that proposed algorithm outperforms over conventional motion compensated frame interpolation algorithm. From numerical value it can be observed that the proposed algorithm has achieved around 3dB improvement in terms of average PSNR and an increase of around 5% of average SSIM. Simulation results demonstrate performance compared to existing algorithm on different video sequences with various frame size.
Most of the fast search motion estimation algorithms reduce the computational cost of motion estimation greatly by checking only a few search points inside the search area by using full distortion measure. This paper ...
详细信息
ISBN:
(纸本)9781479947614
Most of the fast search motion estimation algorithms reduce the computational cost of motion estimation greatly by checking only a few search points inside the search area by using full distortion measure. This paper proposes a multi-layer motion estimation which employs partial distortion as its distortion measure to reduce the number of computations involved in each search point instead of reducing the number of search points. A layer is an image which is derived from the reference frame such that the sum of a block of pixels in the reference frame determines the point of a layer. It has been noticed on different video sequences that many motion vectors on the layers are the same as those searched on the reference frame. Experimental results on a wide variety of video sequences show that the proposed algorithm outperforms the other popular conventional fast search motion estimation algorithms computationally while maintaining the motion prediction quality very close to the full-search algorithm.
This study focuses on accelerating the optimization of motion estimation algorithms, which are widely used in video coding standards, by using both the paradigm based on Altera Custom Instructions as well as the effic...
详细信息
ISBN:
(纸本)9781628414905
This study focuses on accelerating the optimization of motion estimation algorithms, which are widely used in video coding standards, by using both the paradigm based on Altera Custom Instructions as well as the efficient combination of SDRAM and On-Chip memory of Nios II processor. Firstly, a complete code profiling is carried out before the optimization in order to detect time leaking affecting the motion compensation algorithms. Then, a multi-cycle Custom Instruction which will be added to the specific embedded design is implemented. The approach deployed is based on optimizing SOC performance by using an efficient combination of On-Chip memory and SDRAM with regards to the reset vector, exception vector, stack, heap, read/write data (. rwdata), read only data (. rodata), and program text (. text) in the design. Furthermore, this approach aims to enhance the said algorithms by incorporating Custom Instructions in the Nios II ISA. Finally, the efficient combination of both methods is then developed to build the final embedded system. The present contribution thus facilitates motion coding for low-cost Soft-Core microprocessors, particularly the RISC architecture of Nios II implemented in FPGA. It enables us to construct an SOC which processes 50x50 @ 180 fps.
A power efficient block matching algorithm is proposed using pattern based pixel truncation scheme. Our observation shows that during blockmatching, if we represent the blockmatching process as a one-dimensional sig...
详细信息
ISBN:
(纸本)9781467365574
A power efficient block matching algorithm is proposed using pattern based pixel truncation scheme. Our observation shows that during blockmatching, if we represent the blockmatching process as a one-dimensional signal, we can see clearly that the signal has repeated mountain-and valley-like regions. Utilizing this feature, the proposed low power blockmatching scheme truncates pixels except the pixels of the valley-like SAD values, which have high chance to be the minimum SAD value. We synthesized the proposed algorithm to measure the switching power dissipation. The results show that the proposed BMA architecture obtains at least 76% power saving with negligible coding performances.
To significantly reduce the number of block-matching (BM) processes in motion vector estimation for HDTV, we have developed an extremely fast blockmatching (BM) algorithm that we call a "Stick-Shaped Window Sear...
详细信息
ISBN:
(纸本)9781424458981
To significantly reduce the number of block-matching (BM) processes in motion vector estimation for HDTV, we have developed an extremely fast blockmatching (BM) algorithm that we call a "Stick-Shaped Window Search (SSWS)" BM algorithm for H.264/AVC. The algorithm consists of three steps: (1) sub-sampling BM in a reduced number of stick-shaped windows, (2) alternate eight-direction sub-sampling BM, and (3) cyclic small-diamond BM. For HDTV the algorithm not only improves full search (FS) processing speed by a factor of up to 2,716, but also that of a simplified unsymmetrical-cross multi-hexagon-grid search (S-UMHS) by a factor of up to 7.87, while achieving the same visual quality as that of FS.
暂无评论