检索结果-内蒙古大学图书馆

CBAR-UNet: A novel methodology for segmentation of cardiac magnetic resonance images using block attention-based deep residual neural network

引用

Multimedia Tools and Applications 2024年第37期83卷 85047-85063页

作者： Kumar, Rakesh Gupta, Meenu Agarwal, Aman Nayyar, Anand Department of Computer Science and Engineering Chandigarh University Punjab140413 India Graduate School Faculty of Information Technology Duy Tan University Da Nang550000 Viet Nam

computer-aided Medical Image Segmentation (MIS) plays a leading role in diagnosing diseases automatically. MIS is used extensively in diagnosing medical ailments to obtain clinically relevant information of the shapes and volumes of the target organs and tissues. In order to facilitate accurate segmentation, a Block Attention Based Deep Residual Neural Network, i.e., CBAR-UNet model, is proposed to perform cardiac image segmentation on short axis Magnetic Resonance Images (MRI) stacks from top to bottom slice. The Automated Cardiac Diagnosis Challenge (ACDC) dataset is used in the proposed work, which comprise of a 3D MRI of 100 patients (i.e., 200 MRI stacks). Further, 3D MRIs are converted into 2D by slicing each image to train the model, and Contrast Limited Adaptive Histogram Equalization (CLAHE) is performed on the 2D dataset. Residual connections are introduced that aid in training deeper models. Convolutional Block Attention Module (CBAM) is also added in the proposed network, which consists of Spatial and Channel attention that enhances the spatial and channel-wise features in the image by providing information like ‘what’ and ‘where’ to pay attention respectively. To test and validate the proposed methodology, extensive experimentations were conducted and it was observed that proposed image segmentation model delivers better results by 2.47% when compared to both 2D and 3D State-Of-The-Art (SOTA) methods with a Dice Score of 0.9428. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Optimization of machine learning models for predicting the compressive strength of fiber-reinforced self-compacting concrete

引用

Frontiers of Structural and Civil Engineering 2023年第2期17卷 284-305页

作者： Hai-Van Thi MAI May Huu NGUYEN Son Hoang TRINH Hai-Bang LY Civil Engineering Department University of Transport TechnologyHanoi 100000Vietnam Civil and Environmental Engineering Program Graduate School of Advanced Science and EngineeringHiroshima UniversityHiroshima 739-8527Japan

Fiber-reinforced self-compacting concrete(FRSCC)is a typical construction material,and its compressive strength(CS)is a critical mechanical property that must be adequately *** the machine learning(ML)approach to estimating the CS of FRSCC,the current research gaps include the limitations of samples in databases,the applicability constraints of models owing to limited mixture components,and the possibility of applying recently proposed *** study developed different ML models for predicting the CS of FRSCC to address these *** neural network,random forest,and categorical gradient boosting(CatBoost)models were optimized to derive the best predictive model with the aid of a 10-fold cross-validation technique.A database of 381 samples was created,representing the most significant FRSCC dataset compared with previous studies,and it was used for model *** findings indicated that CatBoost outperformed the other two models with excellent predictive abilities(root mean square error of 2.639 MPa,mean absolute error of 1.669 MPa,and coefficient of determination of 0.986 for the test dataset).Finally,a sensitivity analysis using a partial dependence plot was conducted to obtain a thorough understanding of the effect of each input variable on the predicted CS of *** results showed that the cement content,testing age,and superplasticizer content are the most critical factors affecting the CS.

关键词： compressive strength self-compacting concrete artificial neural network decision tree CatBoost

来源：评论

学校读者我要写书评

暂无评论

Multimodal Large Models Are Effective Action Anticipators

引用

IEEE Transactions on Multimedia 2025年 27卷 2949-2960页

作者： Wang, Binglu Tian, Yao Wang, Shunzhou Yang, Le College of Information and Control Engineering Xi'an University of Architecture and Technology Xi'an710055 China Northwestern Polytechnical University School of Astronautics Xi'an710072 China Peking University School of Electronic and Computer Engineering Shenzhen Graduate School Shenzhen518055 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence China University of Science and Technology of China School of Information Science and Technology Hefei230022 China

The task of long-term action anticipation demands solutions that can effectively model temporal dynamics over extended periods while deeply understanding the inherent semantics of actions. Traditional approaches, which primarily rely on recurrent units or Transformer layers to capture long-term dependencies, often fall short in addressing these challenges. Large Language Models (LLMs), with their robust sequential modeling capabilities and extensive commonsense knowledge, present new opportunities for long-term action anticipation. In this work, we introduce the ActionLLM framework, a novel approach that treats video sequences as successive tokens, leveraging LLMs to anticipate future actions. Our baseline model simplifies the LLM architecture by setting future tokens, incorporating an action tuning module, and reducing the textual decoder layer to a linear layer, enabling straightforward action prediction without the need for complex instructions or redundant descriptions. To further harness the commonsense reasoning of LLMs, we predict action categories for observed frames and use sequential textual clues to guide semantic understanding. In addition, we introduce a Cross-Modality Interaction Block, designed to explore the specificity within each modality and capture interactions between vision and textual modalities, thereby enhancing multimodal tuning. Extensive experiments on benchmark datasets demonstrate the superiority of the proposed ActionLLM framework, encouraging a promising direction to explore LLMs in the context of action anticipation. © 1999-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Does a Dense Point Cloud for Training Data Generation Improve Segmentation Accuracy?

Does a Dense Point Cloud for Training Data Generation Improv...

引用

2023 IEEE International Conference on Big Data, BigData 2023

作者： Wada, Marin Sudo, Hiroaki Adachi, Miho Miyamoto, Ryusuke Meiji University Graduate School of Science and Technology Dept. of Computer Science Kawasaki Japan Meiji University School of Science and Technology Dept. of Computer Science Kawasaki Japan

ISBN: (纸本)9798350324457

Semantic segmentation can provide significant information for a robot to actualize autonomous moving. To increase the classification accuracy of segmentation, appropriate datasets should be prepared, which requires huge human labors. The authors attempt to realize a semi-automatic method that generates two dimensional images having pixel-wise class labels from 3D point clouds obtained by a 3D scanner. In this study, dense point clouds are generated to improve the quality of training samples. Experimental results using data obtained around the course of the Tsukuba Challenge, which is the famous competition for autonomous moving robots in Japan, showed that the dense point clouds effective but appropriate variety of textures should be included in the training samples. © 2023 IEEE.

关键词： 3D scanned data dataset generation density of point clouds semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

Dataset Creation for Segmentation to Enhance Visual Navigation in a Targeted Indoor Environment 17

Dataset Creation for Segmentation to Enhance Visual Navigati...

引用

17th International Conference on Signal-Image technology and Internet-Based Systems, SITIS 2023

作者： Ueda, Yuriko Wada, Marin Adachi, Miho Miyamoto, Ryusuke Meiji University Graduate School of Science and Technology Dept. of Computer Science Kawasaki Japan Meiji University School of Science and Technology Dept. of Computer Science Kawasaki Japan

ISBN: (纸本)9798350370911

To show the effectiveness of visual navigation based on the results of semantic segmentation, the authors participating in the Tsukuba Challenge, a well-known autonomous robot motion competition in Japan. The Tsukuba Challenge, which normally includes events only in outdoor environments, included in 2023 a new indoor environmental challenge, in which a robot must navigate a crowded shopping mall. In order to achieve visual navigation in an indoor environment, based on the results of segmentation, we needed to train a classifier suitable to navigate many simultaneously moving obstacles such as crowded people. For this purpose, this paper proposes a method for creating an appropriate dataset using a public dataset and modifying an existing dataset for an outdoor scenario: class labels are re-assigned considering the target environment. Experimental results using images captured at the course of the Extra Challenge in the Tsukuba Challenge 2023 showed that the proposed dataset enables the construction of a better classifier for semantic segmentation than only a public dataset. © 2023 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Deployment of Ensemble-Based IDS on Raspberry Pi 13

A Deployment of Ensemble-Based IDS on Raspberry Pi

引用

13th IEEE Global Conference on Consumer Electronic, GCCE 2024

作者： Musthafa, Muhammad Bisri Huda, Samsul Shamim, S.M. Kodera, Yuta Mwaura, Jedidah Araki, Shunsuke Nogami, Yasuyuki Okayama University Graduate School of Environmental Life Natural Science and Technology Japan Okayama University Green Innovation Center Japan Kyushu Institute of Technology Graduate School of Computer Science and Systems Engineering Fukuoka Japan Kyushu Institute of Technology Faculty of Computer Science and Systems Engineering Fukuoka Japan

ISBN: (纸本)9798350355079

Intrusion Detection Systems (IDS) are essential for safeguarding IoT networks against various attacks. Our previously developed ensemble-based IDS model, which combines stacked Long Short-Term Memory (LSTM) networks with ANOVA feature selection, achieved a remarkable accuracy of 97.46% and an overfitting value of 0.22% in classifying network attacks. However, deploying this powerful model on resource-constrained devices like Raspberry Pi poses challenges due to limited computational resources. In this paper, we tackle these challenges by converting the original model to TensorFlow Lite (TFLite) and applying quantization techniques to optimize the model size for deployment on a Raspberry Pi 3b+. Our approach significantly reduces the model size by 90.9% while maintaining an impressive accuracy of 96.96%, only a 0.5% reduction from the original model. The optimized model demonstrates efficient performance on the Raspberry Pi, with a loading time of 100.2ms and an inference time of 1.2ms. © 2024 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

Watermarking technique for document images using discrete curvelet transform and discrete cosine transform

引用

Multimedia Tools and Applications 2024年第40期83卷 87647-87671页

作者： Singh, Balkar Sharma, M.K. Post Graduate Department of Computer Science Gujranwala Guru Nanak Khalsa College Punjab Ludhiana India School of Mathematics Thapar Institute of Engineering and Technology Punjab Patiala India

In this paper, a watermarking technique based on discrete curvelet transform and discrete cosine trans- form is proposed to protect the color document images. The six layers of the document image are created using the Discrete Curvelet Transform (DCuT). The sixth layer is chosen for the embedding process, while the remaining layers are discarded. Discrete Cosine Transform (DCT) is applied on the 8 × 8 blocks of the real part of sixth layer. DCT coefficients from low to medium are selected for the embedding process, excluding the first one. To choose the Direct Current (DC) coefficients of DCT to embed the watermark bits, a zigzag function is used. The same process is applied on the receiver side watermark image is extracted. Since this is a non-blind method, we require both a cover image and a watermarked image. DCT of watermarked image and the cover image are compared to extract the watermark image. The resistivity of the watermarked image against image processing attacks is measured using the Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), Mean Square Error (MSE), Normalization Correlation (NC), Bit Error Rate (BER) and Universal Quality Index (UQI). © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Negation Handling on XLNet Using Dependency Parser for Sentiment Analysis 4

Negation Handling on XLNet Using Dependency Parser for Senti...

引用

4th International Conference on Intelligent Cybernetics technology and Applications, ICICyTA 2024

作者： Winaya, Ferdinand Girsang, Abba Suganda Binus Graduate Program Bina Nusantara University Jakarta Indonesia School of Computer Science Bina Nusantara University Jakarta Indonesia

ISBN: (纸本)9798331506490

Negation handling is often overlooked in Indonesian sentiment analysis, making it difficult to automatically and accurately determine the polarity of sentences containing negation words. Negation is a challenging issue in natural language processing, as it can drastically alter the meaning of a sentence. For example, common Indonesian negation words such as 'tidak' (no/not), 'belum' (not yet), or 'jangan' (do not) can reverse the sentiment polarity in a text. Previous studies have proposed rule-based approaches, relying on linguistic rules or dependency parse trees to handle negation. However, negation is a complex problem that cannot be effectively addressed by simple rules alone, as they often lack flexibility in handling diverse sentence structures and negation complexities. Therefore, a more dynamic approach is needed, such as combining a dependency parser with an embedding layer, which can map syntactic relationships between words and learn vector representations of negation. This allows the model to flexibly determine the scope of negation words, enabling more accurate sentiment analysis even in complex sentences. This study evaluates the impact of negation handling on a transformer-based model, specifically XLNet, in Indonesian sentiment analysis. Using the proposed method, the model's F1 score increased by 2.13%, from 71.42% to 73.55%, compared to the baseline model. This demonstrates that the proposed negation handling strategy enhances sentiment prediction accuracy, making the model more effective at handling texts with negation. © 2024 IEEE.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimization of Node Reduction Using BRKGA for GNN-Based Traffic Speed Forecasting 13

Optimization of Node Reduction Using BRKGA for GNN-Based Tra...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Inokuchi, Yuto González, Pedro Henrique Mendonça, Israel Aritsugi, Masayoshi Graduate School of Science and Technology Kumamoto University Kumamoto Japan Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350308365

While Spatio-Temporal Graph Convolutional Networks (STGCNs) are an effective method for traffic speed fore-casting, their training and inference tend to be time-consuming. In this paper, we aim to refine these networks by strategically reducing their number of nodes, thereby boosting computational efficiency. The nodes in these graphs represent data observed for road segments, and by analyzing the interconnections and layout of the graph, we can identify nodes with minimal contribution to overall performance. Removing these nodes can potentially decrease computation time while maintaining the prediction accuracy. We employ the Biased Random-Key Genetic Algorithm (BRKGA) to identify a good set of nodes for removal, based on a predefined percentage reduction of the original graph size (e.g., retaining 95 % of the original graph). We evaluate different graph size configurations, ranging from 95 % to 70 % node retention, to determine the least impactful node set performance. Our experiments on three real-world datasets reveal that reducing nodes can decrease computation time by up to 29%, and as a byproduct of removing noise, even improve the prediction accuracy. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Hyperparameter Optimization Using Deep Q-Network and BRKGA 13

Efficient Hyperparameter Optimization Using Deep Q-Network a...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Kobayashi, Kosei Aritsugi, Masayoshi González, Pedro Henrique Mendonça, Israel Graduate School of Science and Technology Kumamoto University Kumamoto Japan Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9798350308365

Hyperparameter optimization (HPO) is paragon to maximize performance when designing machine learning models. Among different HPO methods, Genetic Algorithm (GA) based optimization is considered effective because it allows a wide and diverse range of solutions to be explored. However, GA's exploratory nature makes this type of algorithm to evaluate many solutions that do not improve the overall performance. This is specially costly when the objective function to be evaluated is time-consuming, like in the HPO field. In this paper, we propose an efficient hybrid algorithm that is able to reduce computational cost by combining deep reinforcement learning with the Biased Random Key Genetic Algorithm (BRKGA), a variant of genetic algorithms. Our reinforcement learning agent has a decision-making role during the population's fitness calculation, in which it filters out chromosomes that would not improve the overall fitness of the population. The agent uses small amounts of pre-trained data to identify trends in potentially good solutions, and carry out its decision process. We conduct experiments on eight different datasets to assess the effectiveness of the proposed method, and the results show that the proposed method can significantly reduce the computation time of hyperparameter search using BRKGA (up to 44% reduction in computational time) without compromising the quality of the solution (no statistically difference in results). © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：