-
581
Enhancing Camera Source Identification: A Rapid Algorithm with Enhanced Discriminative Power
Published 2024-12-01“…Compared to the traditional brute-force search algorithm (BFSA), our method significantly reduces computational complexity in large-scale databases, optimizing from <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mi>N</mi><mo>)</mo></mrow></semantics></math></inline-formula> to <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mo form="prefix">log</mo><mi>N</mi><mo>)</mo></mrow></semantics></math></inline-formula>, where <i>n</i> is the length of the fingerprint, and <i>N</i> is the number of fingerprints in the database. …”
Get full text
Article -
582
A comparative study of the performance of ten metaheuristic algorithms for parameter estimation of solar photovoltaic models
Published 2025-01-01“…This estimation is challenging due to computational complexity and the risk of optimization errors, which can hinder reliable performance predictions. …”
Get full text
Article -
583
Design of Super Resolution and Fuzzy Deep Learning Architecture for the Classification of Land Cover and Landsliding Using Aerial Remote Sensing Data
Published 2025-01-01“…Moreover, the stability and computational complexity of the presented architecture are computed on 50 independent runs. …”
Get full text
Article -
584
A Comparison of Classification Algorithms for Predicting Dis-tinctive Characteristics in Fine Aroma Cocoa Flowers Using WE-KA Modeler
Published 2024-09-01“…The algorithms Simple Logistic and LMT were the most accurate and specific, while Naive Bayes was the most efficient in terms of computational complexity for model building. This research provides a comprehensive overview of the use of machine learning to analyze functional traits of flowers that most influence cocoa genetic diversity. …”
Get full text
Article -
585
A Resource-Efficient Multi-Entropy Fusion Method and Its Application for EEG-Based Emotion Recognition
Published 2025-01-01“…The proposed method achieves 84.62% and 82.48% accuracy in arousal and valence classification tasks, respectively, indicating its effectiveness in reducing data dimensionality and computational complexity while maintaining an accuracy of over 80%. …”
Get full text
Article -
586
A Comprehensive Review of Direction-of-Arrival Estimation and Localization Approaches in Mixed-Field Sources Scenario
Published 2024-01-01“…Special attention is given to technical issues such as aperture loss, computational complexity, and hardware considerations. The paper discusses the various sources of noise in the mentioned scenario and highlights the importance of modeling noise accurately for effective estimation. …”
Get full text
Article -
587
ϵ-Confidence Approximately Correct (ϵ-CoAC) Learnability and Hyperparameter Selection in Linear Regression Modeling
Published 2025-01-01“…Drawbacks of these methods include introducing new hyperparameters with their own new challenges and uncertainties, potential increase of the computational complexity or requiring large set of training data sets. …”
Get full text
Article -
588
MSCPNet: A Multi-Scale Convolutional Pooling Network for Maize Disease Classification
Published 2025-01-01“…These models also suffer from high computational complexity when deeper layers are introduced to handle fine-grained details. …”
Get full text
Article -
589
Novel Pythagorean fuzzy score function to optimize fuzzy transportation models
Published 2025-03-01“…Also, the proposed score function integrates these interval values to quantify and rank the alternatives more effectively.However, a notable trade-off is the increased computational complexity due to the use of interval values in the membership and non-membership functions, particularly in larger-scale transportation problems. …”
Get full text
Article -
590
Effects of feature selection and normalization on network intrusion detection
Published 2025-03-01“…However, the advent of larger IDS datasets has negatively impacted the performance and computational complexity of AI-based IDSs. Many researchers used data preprocessing techniques such as feature selection and normalization to overcome such issues. …”
Get full text
Article -
591
A lightweight wheat ear counting model in UAV images based on improved YOLOv8
Published 2025-02-01“…Additionally, a lightweight dynamic upsampler, Dynamic Sample (DySample), is introduced to decrease computational complexity of the upsampling process by dynamically adjusting interpolation positions. …”
Get full text
Article -
592
Grape Recognition and Localization Method Based on 3C-YOLOv8n and Depth Camera
Published 2024-11-01“…This enhancement increased the receptive field and guided the reconstruction process based on input features while maintaining low parameter and computational complexity, thereby forming the 3C-YOLOv8n model. …”
Get full text
Article -
593
Real-time Detection Algorithm of Expanded Feed Image on the Water Surface Based on Improved YOLOv11
Published 2024-11-01“…However, adding a P2 layer may increase computational complexity and resource consumption, so the overall performance and resource consumption of the model must be carefully balanced. …”
Get full text
Article -
594
BDC-DAL: A new algorithm using blueprint difference convolution and dual auxiliary supervision for lightweight face anti-spoofing(BDC-DAL:基于蓝图差分卷积和双重辅助监督的轻量化人脸活体检测算法)...
Published 2025-01-01“…Most current face anti-spoofing methods employ deep convolutional neural networks, and although these systems can provide excellent detection performance, they often involve large number of parameters and computational complexity, which limits their application on resource-limited devices. …”
Get full text
Article -
595
MSH-YOLOv8: Mushroom Small Object Detection Method with Scale Reconstruction and Fusion
Published 2024-09-01“…Additionally, the normalization-based attention module (NAM) was employed to improve performance without compromising detection speed or computational complexity. To further enhance training efficacy and convergence speed, the original loss function CIoU was replaced with wise-intersection over union (WIoU) Loss. …”
Get full text
Article -
596
Efficient Prediction of Network Traffic for Real-Time Applications
Published 2019-01-01“…Comparison of accuracy and cost, both in terms of computation complexity and power consumption, is presented. …”
Get full text
Article -
597
Delay constraint minimum interruption routing algorithm for mobile satellite network
Published 2006-01-01“…By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path(SDCOP)algorithm,which could obtain a path to sat-isfy the delay constraint condition as well as the minimization of interruption during the service,was proposed.This algo-rithm exploits the predictive nature of connectivity changes of time-varying topological to decrease the influence in the QoS routing performance caused by the handover.Besides,it has a low computing complexity to adapt to the restricted computing capability of satellite equipments.Correlative simulation indicates that this novel algorithm is superior to other current algo-rithm in respect of computing complexity,service blocking probability and interrupting probability etc.…”
Get full text
Article -
598
Single-channel blind separation of co-frequency modulated signals based on Gibbs sampler
Published 2015-04-01“…A Gibbs-sampler-based separation algorithm was proposed for single-channel co-frequency digital-modulated signals,which were received in non-cooperative ways.The probability density samples of unknown symbol sequences can be obtained by statistic method,and the computation complexity was not growing exponentially with the increase of channel order.With special emphasis on the separation algorithms of single pair of symbols,multiple pair of symbols and the tracking of channel responses.Moreover,the separation performance between Gibbs sampler and per-survivor processing(PSP) algorithm were analyzed and compared in detail.Simulation results show that,compared with PSP algorithm with L=4 for two co-frequency QPSK-modulated signals,Gibbs sampler can be nearly 17 times lower in computation complexity when the approximately performance is obtained.…”
Get full text
Article -
599
Phase retrieval for block sparsity based on adaptive coupled variational Bayesian learning
Published 2022-12-01“…Simulations indicate that the proposed algorithm outperforms the existing methods in success rate, noise‐robustness, and signal detection rate in large‐scale cases with acceptable computation complexity.…”
Get full text
Article -
600
Recognition method of digital modulation signals over non-Gaussian noise in cognitive radio
Published 2014-01-01“…In cognitive radio system,the traditional methods of digital modulation signals recognition with Alpha stable distribution noise have the problems of poor performance and high computation complexity.A novel recognition method based on correlation coefficient of fractional lower order cyclic spectrum was proposed to solve this problem.The method extracts the recognition characteristic parameters which are five correlation coefficients of the fractional lower order cyclic spectrum’s section and frequency spectrum’s section and projection planes of both,and then decision tree was used as a classifier to achieve digital modulation signals recognition.Simulation results show that the proposed method not only has higher recognition rates and better robustness but also has lower computation complexity in an Alpha stable distribution noise environment,which is more suitable for cognitive radio system.…”
Get full text
Article