Search Results - (( using optimization sensor algorithm ) OR ( frames selection search algorithm ))*

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
  7. 7

    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
  8. 8

    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
  9. 9
  10. 10

    Node placement optimization using extended virtual force and cuckoo search algorithm in wireless sensor network by Puteri Azwa, Ahmad

    Published 2014
    “…This study proposed Extended Virtual Force and Cuckoo Search (EVFCS) algorithm with a combination of EVFA and CS algorithm to find an optimal node placement. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Cluster head selection optimization in wireless sensor network via genetic-based evolutionary algorithm by Vincent Chung, Hamzarul Alif Hamzah, Norah Tuah, Kit, Guan Lim, Min, Keng Tan, Kenneth Tze Kin Teo

    Published 2020
    “…Genetic-based evolutionary algorithms such as Genetic Algorithm (GA) and Differential Evolution (DE) have been popularly used to optimize cluster head selection in WSN to improve energy efficiency for the extension of network lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Global optimization method for continuous - Time sensor scheduling by Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan C.

    Published 2010
    “…We consider a situation in which several sensors are used to collect data for signal processing since operating multiple sensors simultaneously canses system interference, only one sensor can be active at any one time.The problem of scheduling a discrete-valued optimal control problem.This problem cannot be solved using conventional optimization problem.The Transformed problem is then decomposed into a bi-level optimization problem, which is solved using a discreate filled function method in conjunction with a conventional optimal control algorithm.Numerical results show that our algorithm is robust, efficient, and reliable in attaining a near globally optimal solution.…”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Whale optimization algorithm based on tent chaotic map for feature selection in soft sensors by AlRijeb, Mothena Fakhri Shaker, Othman, Mohammad Lutfi, Ishak, Aris, Hassan, Mohd Khair, Albaker, Baraa Munqith

    Published 2025
    “…One of the powerful optimization algorithms that is used for feature selection is the Whale Optimization Algorithm (WOA), which is a nature-inspired metaheuristic optimization algorithm that mimics the social behavior of humpback whales. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2017
    “…The main contribution of the paper is to introduce a dynamic programming algorithm, which defines an optimal policy for solving the visual sensor coverage problem. …”
    Get full text
    Get full text
    Article
  16. 16

    A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

    Published 2024
    “…Results: Simulation results perfectly showed that the suggested localization algorithm based on NMM can carry out a better performance than that of other localization algorithms utilizing other op- timization approaches, including a particle swarm optimization, ant colony (ACO) and bat algorithm (BA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    A Green Clustering Protocol for Mobile Sensor Network Using Particle Swarm Optimization by ., Nurul Mu’azzah Abdul Latiff NikNoordini, NikAbdMalik Abdul Halim

    Published 2016
    “…One of the methods that can improve the utilization of sensor nodes batteries is the clustering method. In this paper, we propose a green clustering protocol for mobile sensor networks using particle swarm optimization (PSO) algorithm.…”
    Get full text
    Article
  19. 19

    Multi-mobile agent itinerary planning algorithms for data gathering in wireless sensor networks: a review paper by Qadori, Huthiafa Q., Ahmad Zukarnain, Zuriati, Mohd Hanapi, Zurina, Subramaniam, Shamala

    Published 2017
    “…The review shows that most of the algorithms used one parameter to find the optimal number of mobile agents in multi-agent itinerary planning without utilizing other parameters. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

    Published 2015
    “…This research explores path integration in mobile robot navigation and path optimization technique using vector calculus. A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
    Get full text
    Get full text
    Get full text
    Article