Search Results - (( basic optimization _ algorithm ) OR ( using decomposition based algorithm ))

Refine Results
  1. 1

    Image watermarking optimization algorithms in transform domains and feature regions by Tao, Hai

    Published 2012
    “…The achieved tradeoffs from these techniques between imperceptibility and robustness are controversial.To solve this problem,this study proposes the application of artificial intelligent techniques into digital watermarking by using discrete wavelet transform (DWT) and singular value decomposition (SVD).To protect the copyright information of digital images,the original image is decomposed according to two-dimensional discrete wavelet transform.Subsequently the preprocessed watermark with an affined scrambling transform is embedded into the vertical subband (HLm) coefficients in wavelet domain without compromising the quality of the image.The scaling factors are trained with the assistance of Particle Swarm Optimization (PSO).A new algorithmic framework is used to forecast feasibility of hypothesized watermarked images.In addition,the novelty is to associate the Hybrid Particle Swarm Optimization (HPSO),instead of a single optimization,as a model with SVD.To embed and extract the watermark,the singular values of the blocked host image are modified according to the watermark and scaling factors. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian by Tey, Siew Kian

    Published 2009
    “…This optimal state estimate and corrected data base are then used by the security monitoring and operation and control functions of the center.Most state estimation programs in practical use are formulated as overdetermined systems (Pozrikidis, 2008) of nonlinear equations and solved as weighted least square problems (refer to section 2.1.1).This research involves finding the least squares solution of the power system state estimation problem, HTR-1HDx = HTR-1 [z - f (x)] (refer to section 2.3.1) and to develop a program to implement the said algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Identifying Students' Summary Writing Strategies Using Summary Sentence Decomposition Algorithm by Idris, Norisma, Baba, Mohd Sapiyan, Abdullah, Rukaini

    Published 2011
    “…We first analyzed experts' written summaries, extracted the strategies used in the summaries, formulated a set of heuristics rules to define the strategies and finally transformed the rules using position-based method into summary sentence decomposition algorithm (SSDA). …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Path planning algorithm for a car-like robot based on cell decomposition method by Omar, Nurhanum

    Published 2013
    “…This project proposes an obstacle avoiding path planning algorithm based on cell decomposition method for a car-like robot. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    A Summary Sentence Decomposition Algorithm for Summarizing Strategies Identification by Idris, N., Baba, S., Abdullah, R.

    Published 2009
    “…A summary sentence decomposition algorithm is then developed based on the heuristic rules. …”
    Get full text
    Get full text
    Article
  8. 8
  9. 9
  10. 10

    Signal detection algorithm for cognitive radio using singular value decomposition by Omar, Mohd Hasbullah, Hassan, Suhaidi, Amphawan, Angela, Awang Nor, Shahrudin

    Published 2011
    “…This paper highlights an algorithm for detecting the presence of wireless signal using the Singular Value Decomposition (SVD) technique.We simulated the algorithm to detect common digital signals in wireless communication to test the performance of the signal detector.The SVD-based signal detector was found to be more efficient in detecting a signal without knowing the properties of the transmitted signal.The performance of the algorithm is better compared to the favorable energy detection.The algorithm is suitable for blind spectrum sensing where the properties of the signal to be detected are unknown.This is also the advantage of the algorithm since any signal would interfere and subsequently affect the quality of service (QoS) of the IEEE 802.22 connection.Furthermore, the algorithm performed better in the low signalto-noise ratio (SNR) environment.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    An algorithm for positive solution of boundary value problems of nonlinear fractional differential equations by Adomian decomposition method by A. I., Md. Ismail, Hytham. A., Alkresheh

    Published 2016
    “…In this paper, an algorithm based on a new modification, developed by Duan and Rach, for the Adomian decomposition method (ADM) is generalized to find positive solutions for boundary value problems involving nonlinear fractional ordinary differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    A new domain decomposition FDTD technique for simulating electromagnetic penetration into buildings by Abd-EI-Raouf, Hany Ehsan

    Published 2005
    “…The second technique based on hybridizing the Yee algorithm with the higher order FDTD "M3d24" scheme. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  13. 13

    Basic firefly algorithm for document clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents.The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Performance of MIMO space-time coded system and training based channel estimation for MIMO-OFDM system by Abdolee, Reza

    Published 2006
    “…For doing so, the performance analysis between QR decomposition and LS algorithm in terms of MSE (Mean Square Error) and BER (Bit Error Rate) has been done using simulations software. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Eeg-Based Person Identification Using Multi-Levelwavelet Decomposition With Multi-Objective Flower Pollination Algorithm by Yahya Alyasseri, Zaid Abdi Alkareem

    Published 2020
    “…For addressing these points, a novel person identification method that is using EEG with multi-level wavelet decomposition and multi-objective flower pollination algorithm is proposed in this thesis. …”
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18

    Optimization of medical image steganography using n-decomposition genetic algorithm by Al-Sarayefi, Bushra Abdullah Shtayt

    Published 2023
    “…To overcome these limitations, this study proposes a technique known as an n-decomposition genetic algorithm. This algorithm uses a variable-length search to identify the best location to embed the secret message by incorporating constraints to avoid local minimum traps. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  20. 20