Search Results - (( frames selection search algorithm ) OR ( java application customization algorithm ))

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique by Hardev Singh, Jitvinder Dev Singh

    Published 2015
    “…The variable block matching developed based on four stages which is the video and frame selection, threshold calculation, block size selection and search pattern. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    An Improved Action Key Frames Extraction Algorithm for Complex Colour Video Shot Summarization by Mizher, Manar Abduljabbar Ahmad, Ang, Mei Choo, Sheikh Abdullah, Siti Norul Huda, Kok, Weng Ng

    Published 2019
    “…The objective of this work is to improve our previous action key frames extraction algorithm (AKF) by adapting a threshold which selects action key frames as final key frames. …”
    Get full text
    Get full text
    Article
  3. 3

    Performance Analysis of Hexagon-Diamond Search Algorithm for Motion Estimation using MATLAB by Abdul Manap, Redzuan, Ranjit, S.S.S.

    Published 2010
    “…In recent years, many of these BMAs have been developed with similar intention of reducing the computational costs while at the same time maintaining the video signal quality. In this paper, an algorithm called Hexagon-Diamond Search (HDS) is proposed for ME where the algorithm and several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
    Get full text
    Get full text
    Article
  4. 4

    A new stepsize for gradient method via weak secant equation by Leong, Wah June

    Published 2007
    “…In this work we present a new technique for stepsize selection in the frame of gradient method. This new stepsize selection technique provides a different stepsize for every component of the negative gradient search. …”
    Get full text
    Conference or Workshop Item
  5. 5

    Performance analysis of hexagon-diamond search algorithm for motion estimation by Abdul Manap, Redzuan, Ranjit, S.S.S., Basari, Amat Amir, Ahmad, Badrul Hisham

    Published 2010
    “…In recent years, many of these BMAs have been developed with similar intention of reducing the computational costs while at the same time maintaining the video signal quality. In this paper, an algorithm called Hexagon-Diamond Search (HDS) is proposed for ME where the algorithm and several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    An analysis of the performance of fast block matching motion estimation algorithms by Abdul Manap, Redzuan, Esro, Mazran, Basari, Amat Amir, Ahmad, Badrul Hisham

    Published 2009
    “…In this paper, several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Performance analysis of block matching algorithms in motion estimation by Abdul Manap, Redzuan, Esro, Mazran, Basari, Amat Amir, Ahmad, Badrul Hisham

    Published 2010
    “…In this paper, several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    New filtering framework for web personalization search / Anitawati Mohd Lokman and Aishah Ahmad by Mohd Lokman, Anitawati, Ahmad, Aishah

    Published 2012
    “…The Filtering framework provides foundation in developing the algorithm for searching tools. This algorithm can be implemented in both website and search engine.…”
    Get full text
    Get full text
    Research Reports
  9. 9
  10. 10

    Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

    Published 2019
    “…The proposed technique can be enhanced in the future to protect games applications and mobile applications that are developed by java; it can improve the software development industry. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Design & Development of a Robotic System Using LEGO Mindstorm by Abd Manap, Nurulfajar, Md Salim, Sani Irwan, Haron, Nor Zaidi

    Published 2006
    “…Since the model is built using LEGO bricks, the model is fully customized, in term of its applications, to perform any relevant tasks. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Join query enhancement processing (jqpro) with big rdf data on a distributed system using hashing-merge join technique by Nahla Mohammedelzein, Elawad Babiker

    Published 2021
    “…The sort–merge–join algorithm sorts the datasets on the joining attribute and then searches for tuples by merging the two datasets. …”
    Get full text
    Get full text
    Thesis
  13. 13