Search

Bamboos, also known as non-timber forest products (NTFPs) and belonging to the family Poaceae and subfamily Bambusoideae, have a wide range of flowering cycles from 3 to 120 years; hence, it is difficult to identify species. Here, the focus is on supervised machine learning (ML) and deep learning (DL) as a potential automated approach for the identification and classification of commercial bamboo species, with the help of the majority multiclass voting (MajMulVot) algorithm. We created an image dataset of 2000 bamboo instances, followed by a texture dataset prepared using local binary patterns (LBP) and gray-level cooccurrence matrix (GLCM)-based methods. First, we deployed five ML models for the texture datasets, where support vector machine (SVM) shows an accuracy rate of 82.27%. We next deployed five DL-based convolutional neural network (CNN) models for bamboo classification, namely AlexNet, VGG16, ResNet18, VGG19, and GoogleNet, using the transfer learning (TL) approach, where VGG16 prevails, with an accuracy rate of 88.75%. Further, a MajMulVot-based ensemble approach was introduced to improve the classification accuracy of all ML- and DL-based models. The ML-MajMulVot enhanced the accuracy for the texture dataset to 86.96%. In the same way, DL-MajMulVot increased the accuracy to 92.8%. We performed a comparative analysis of all classification models with and without K-fold cross-validation and MajMulVot methods. The proposed findings indicate that even difficult-to-identify species may be identified accurately with adequate image datasets. The suggested technology can also be incorporated into a mobile app to offer farmers effective agricultural methods. [ABSTRACT FROM AUTHOR]

In this digital era, events based video summarization has become an emerging topic in the field of computer vision which finds its applications in video data management, highlights of a game, video surveillance, etc. In this work, we propose a novel network-based approach for event summarization. First, the scale-free network is mapped to a neural network, and then dynamics of a complex video are determined by Chiavlo maps of the network. Second, we declare the neurons as hubs that are exceedingly well linked up as opposed to a majority who receive very short connections. Eventually, these hubs assume as the key-figures of the outcomes; then hubs and all its associated neurons counted for the issue summaries. Experiments show that the proposed approach outperforms the previous existing approaches on Precision and F-measure. The computing cost shows that the proposed model meets the criteria for real-time applications. [ABSTRACT FROM AUTHOR]

The rapid growth of video data demands both effective and efficient video summarization methods so that users are empowered to quickly browse and comprehend a large amount of video content. It is a herculean task to manage access to video content in real time where humongous amount of audiovisual recorded data is generated every second. In this paper we propose an Eratosthenes Sieve based key-frame extraction approach for video summarization (VS) which can work better for real-time applications. Here, Eratosthenes Sieve is used to generate sets of all Prime number frames and nonprime number frames up to total N frames of a video. k-means clustering procedure is employed on these sets to extract the key-frames quickly. Here, the challenge is to find the optimal set of clusters, achieved by employing Davies-Bouldin Index (DBI). DBI a cluster validation technique which allows users with free parameter based VS approach to choose the desired number of key-frames without incurring additional computational costs. Moreover, our proposed approach includes likes of both local and global perspective videos. The method strongly enhances clustering procedure performance trough engagement of Eratosthenes Sieve. Qualitative and quantitative evaluation and complexity computation are done in order to compare the performances of the proposed model and state-of-the-art models. Experimental results on two benchmark datasets with various types of videos exhibit that the proposed methods outperform the state-of-the-art models on F-measure. [ABSTRACT FROM AUTHOR]

Background: Analyzing genomic sequences plays a crucial role in understanding biological diversity and classifying Bamboo species. Existing methods for genomic sequence analysis suffer from limitations such as complexity, low accuracy, and the need for constant reconfiguration in response to evolving genomic datasets., Aim: This study addresses these limitations by introducing a novel Dual Heuristic Feature Selection-based Ensemble Classification Model (DHFS-ECM) for the precise identification of Bamboo species from genomic sequences., Methods: The proposed DHFS-ECM method employs a Genetic Algorithm to perform dual heuristic feature selection. This process maximizes inter-class variance, leading to the selection of informative N-gram feature sets. Subsequently, intra-class variance levels are used to create optimal training and validation sets, ensuring comprehensive coverage of class-specific features. The selected features are then processed through an ensemble classification layer, combining multiple stratification models for species-specific categorization., Results: Comparative analysis with state-of-the-art methods demonstrate that DHFS-ECM achieves remarkable improvements in accuracy (9.5%), precision (5.9%), recall (8.5%), and AUC performance (4.5%). Importantly, the model maintains its performance even with an increased number of species classes due to the continuous learning facilitated by the Dual Heuristic Genetic Algorithm Model., Conclusion: DHFS-ECM offers several key advantages, including efficient feature extraction, reduced model complexity, enhanced interpretability, and increased robustness and accuracy through the ensemble classification layer. These attributes make DHFS-ECM a promising tool for real-time clinical applications and a valuable contribution to the field of genomic sequence analysis., Competing Interests: The authors declare no conflict of interest, financial or otherwise., (Bentham Science Publishers.)

Human gene sequences are considered a primary source of comprehensive information about different body conditions. A wide variety of diseases including cancer, heart issues, brain issues, genetic issues, etc . can be pre-empted via efficient analysis of genomic sequences. Researchers have proposed different configurations of machine learning models for processing genomic sequences, and each of these models varies in terms of their performance & applicability characteristics. Models that use bioinspired optimizations are generally slower, but have superior incremental-performance, while models that use one-shot learning achieve higher instantaneous accuracy but cannot be scaled for larger disease-sets. Due to such variations, it is difficult for genomic system designers to identify optimum models for their application-specific & performance-specific use cases. To overcome this issue, a detailed survey of different genomic processing models in terms of their functional nuances, application-specific advantages, deployment-specific limitations, and contextual future scopes is discussed in this text. Based on this discussion, researchers will be able to identify optimal models for their functional use cases. This text also compares the reviewed models in terms of their quantitative parameter sets, which include, the accuracy of classification, delay needed to classify large-length sequences, precision levels, scalability levels, and deployment cost, which will assist readers in selecting deployment-specific models for their contextual clinical scenarios. This text also evaluates a novel Genome Processing Efficiency Rank (GPER) for each of these models, which will allow readers to identify models with higher performance and low overheads under real-time scenarios., Competing Interests: The authors declare no conflict of interest, financial or otherwise., (© 2023 Bentham Science Publishers.)

Genome sequences indicate a wide variety of characteristics, which include species and sub-species type, genotype, diseases, growth indicators, yield quality, etc . To analyze and study the characteristics of the genome sequences across different species, various deep learning models have been proposed by researchers, such as Convolutional Neural Networks (CNNs), Deep Belief Networks (DBNs), Multilayer Perceptrons (MLPs), etc ., which vary in terms of evaluation performance, area of application and species that are processed. Due to a wide differentiation between the algorithmic implementations, it becomes difficult for research programmers to select the best possible genome processing model for their application. In order to facilitate this selection, the paper reviews a wide variety of such models and compares their performance in terms of accuracy, area of application, computational complexity, processing delay, precision and recall. Thus, in the present review, various deep learning and machine learning models have been presented that possess different accuracies for different applications. For multiple genomic data, Repeated Incremental Pruning to Produce Error Reduction with Support Vector Machine (Ripper SVM) outputs 99.7% of accuracy, and for cancer genomic data, it exhibits 99.27% of accuracy using the CNN Bayesian method. Whereas for Covid genome analysis, Bidirectional Long Short-Term Memory with CNN (BiLSTM CNN) exhibits the highest accuracy of 99.95%. A similar analysis of precision and recall of different models has been reviewed. Finally, this paper concludes with some interesting observations related to the genomic processing models and recommends applications for their efficient use., (© 2022 Bentham Science Publishers.)