Khatalyn E Mata
University of the City of Manila

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

An Enhancement of Cuckoo Search Algorithm for Optimal Earthquake Evacuation Space Allocation in Intramuros, Manila City Marcus Andre C Villanueva; Charles Matthew L Ching; Khatalyn E Mata
Proceeding of the International Conference on Electrical Engineering and Informatics Vol. 1 No. 1 (2024): January : Proceeding of the International Conference on Electrical Engineering
Publisher : Asosiasi Riset Teknik Elektro dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/iceei.v1i1.23

Abstract

The Cuckoo Search Algorithm (CSA), while effective in solving complex optimization problems, faces limitations in random population initialization and reliance on fixed parameters. Random initialization of the population often results in clustered solutions, resulting in uneven exploration of the search space and hindering effective global optimization. Furthermore, the use of fixed values for discovery rate and step size creates a trade-off between solution accuracy and convergence speed. To address these limitations, an Enhanced Cuckoo Search Algorithm (ECSA) is proposed. This algorithm utilizes the Sobol Sequence to generate a more uniformly distributed initial population and incorporates Cosine Annealing with Warm Restarts to dynamically adjust the parameters. The performance of the algorithms was evaluated on 13 benchmark functions (7 unimodal, 6 multimodal). Statistical analyses were conducted to determine the significance and consistency of the results. The ECSA outperforms the CSA in 11 out of 13 benchmark functions with a mean fitness improvement of 30% across all functions, achieving 35% for unimodal functions and 24% for multimodal functions. The enhanced algorithm demonstrated increased convergence efficiency, indicating its superiority to the CSA in solving a variety of optimization problems. The ECSA is subsequently applied to optimize earthquake evacuation space allocation in Intramuros, Manila.
An Enhancement of Harris Corner Detector Algorithm Applied in Signature Forgery Detection System Dzelle Faith R Tan; Pauline Regina J Obispo; Jonathan C Morano; Khatalyn E Mata
Proceeding of the International Conference on Electrical Engineering and Informatics Vol. 1 No. 1 (2024): January : Proceeding of the International Conference on Electrical Engineering
Publisher : Asosiasi Riset Teknik Elektro dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/iceei.v1i1.27

Abstract

Signature verification is crucial for confirming the authenticity of identities in both administrative and financial transactions, where signature forgery can lead to significant security risks. The Harris Corner Detector Algorithm is a widely used method for feature extraction in image processing; its application spans various domains, such as detection of signature forgery. While effective in identifying key features, noise significantly affects performance, especially with impulse noise like salt-and-pepper noise commonly found in signature images. To solve this problem, this study enhances the Harris Corner Detector Algorithm by applying a median filter before gradient calculation. This method removes noise without sacrificing the integrity of key features important in signature forgery detection. The study evaluates the original and the enhanced algorithm using standard image quality metrics. Peak Signal-to-Noise Ratio (PSNR) surged from an average of 13.6 dB to 43.28 dB, the Structural Similarity Index (SSIM) improved significantly from 78% to 94%, and the Mean Squared Error (MSE) dropped substantially from 16.74 to 3.84. These advancements resulted in a more reliable algorithm, exhibiting excellent resistance to noise while maintaining image structure, making the enhanced algorithm highly effective for accurate signature forgery detection.
An Enhancement of Jiang, Z., et al.’s Compression-Based Classification Algorithm Applied to News Article Categorization Cid Antonio F Masapol; Sean Lester C Benavides; Jonathan C Morano; Khatalyn E Mata
Proceeding of the International Conference on Electrical Engineering and Informatics Vol. 1 No. 1 (2024): January : Proceeding of the International Conference on Electrical Engineering
Publisher : Asosiasi Riset Teknik Elektro dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62951/iceei.v1i1.35

Abstract

This study enhances Jiang et al.'s compression-based classification algorithm by addressing its limitations in detecting semantic similarities between text documents. The proposed improvements focus on unigram extraction and optimized concatenation, eliminating reliance on entire document compression. By compressing extracted unigrams, the algorithm mitigates sliding window limitations inherent to gzip, improving compression efficiency and similarity detection. The optimized concatenation strategy replaces direct concatenation with the union of unigrams, reducing redundancy and enhancing the accuracy of Normalized Compression Distance (NCD) calculations. Experimental results across datasets of varying sizes and complexities demonstrate an average accuracy improvement of 5.73%, with gains of up to 11% on datasets containing longer documents. Notably, these improvements are more pronounced in datasets with high-label diversity and complex text structures. The methodology achieves these results while maintaining computational efficiency, making it suitable for resource-constrained environments. This study provides a robust, scalable solution for text classification, emphasizing lightweight preprocessing techniques to achieve efficient compression, which in turn enables more accurate classification.