The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In video coding, motion estimation is the most time consuming part due to its high computational complexity. Based on the high temporal and spatial correlation of motion vector (MV), a new fast motion estimation algorithm of UMHexagonS (UMH) has been proposed to reduce computational complexity by using relatively few search points without degrading image quality, in which the modified patterns with...
Research on inter-prediction algorithms is an important respect in the real-time video codec technology. In the regarded studies, the prediction error can be reduced by incorporating high accuracy estimation and compensation algorithms. So the performance of compressed video can be improved. However, this brings a considerable cost for the complexity of encoder. The computation complexity is mainly...
H.264/AVC is the newest international video coding standard which shows extremely higher coding efficiency compared to any other previous standards, but it brings high computational complexity. The variable block size motion estimation process is the most time consuming part of the H.264/AVC encoder. In order to reduce the computation of the full search motion estimation method, this paper presents...
This paper presents a novel block motion estimation scheme with edge alignment strategy on H.264/AVC video coding, whose computational complexity is linearly dependent on the number of allowed reference frames and block sizes using the full exhaustive search. Many fast block-matching algorithms reduce the computational complexity of motion estimation by carefully designing the search patterns with...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.