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

The Network-Based Candidate Forwarding Set Optimization for Opportunistic Routing

IEEE SENSORS JOURNAL 2021年第20期21卷 23626-23644页

作者： Li, Ning Yuan, Xin Martinez-Ortega, Jose-Fernan Diaz, Vicente Hernandez Harbin Inst Technol Sch Comp Sci & Technol Weihai 150001 Shandong Peoples R China Harbin Inst Technol Sch Ocean Engn Weihai 150001 Shandong Peoples R China Univ Politecn Madrid Sch Comp Sci & Technol Madrid 28040 Spain

In wireless multi-hop networks, the opportunistic routing has advantages on packet delivery probability over deterministic routing. For reducing the transmission delay and duplicate transmission in opportunistic routing, the candidate forwarding set (CFS) optimization approach is proposed. Since the previous node-based approaches have disadvantages on improving the performance of opportunistic routing, we propose the network-based approach to address these disadvantages, named the Delay and Duplicate transmission Avoid CFS optimization algorithm, shorted as DDA. In DDA, the nodes in CFS are divided into different fully connected relay networks. For the forwarding nodes in CFS, more than one relay networks can be constructed and only one can be chosen as the final relay network. So, first, we propose the fully connected relay network recognition algorithm to judge whether the chosen network is fully connected or not. Next, the properties of these networks are investigated. Then, based on the multi-attribution decision making (MADM) theory, and taking the packet delivery probability (between sender and relay networks), the transmission delay, and the forwarding priorities of nodes into account, the DDA chooses the most appropriate relay network. The nodes in this relay network are selected as the final forwarding nodes. Based on these innovations, the transmission delay and duplicate transmission are reduced while the efficiency of the original opportunistic routing algorithms is kept. The simulation results illustrate the effectiveness of the network-based DDA algorithm.

关键词： Routing Relay networks (telecommunication) Delays Optimization Wireless sensor networks filtering algorithms Prediction algorithms Opportunistic routing wireless multi-hop networks candidate forwarding set transmission delay duplicate transmission

来源：评论

学校读者我要写书评

暂无评论

Robust set-membership filtering algorithms against impulsive noise

Robust set-membership filtering algorithms against impulsive...

引用

IEEE Signal Processing and Communications Applications (SIU)

作者： Muhammed Ö. Sayın N. Denizcan Vanli Süleyman S. Kozat Elektrik ve Elektronik Mühendisliği Bölümü Bilkent Üniversitesi

In this paper, we propose robust set-membership filtering algorithms against impulsive noise. Firstly, we introduce set-membership normalized least absolute difference algorithm (SM-NLAD). This algorithm provides robustness against impulsive noise through pricing the absolute error instead of the square. Then, in order to achieve comparable convergence performance in the impulse-free noise environments, we propose the set-membership normalized least logarithmic absolute difference algorithm (SM-NLLAD) through the logarithmic cost framework. Logarithmic cost function involves the absolute value of the error for large error values and the square of the error for small error values intrinsically. Finally, in the numerical examples, we show the robustness of our algorithms against impulsive noise and their comparable performance in the impulse-free noise environments.

关键词： Noise Signal processing algorithms Robustness Conferences Adaptive filters filtering algorithms

来源：评论

学校读者我要写书评

暂无评论

Course Recommendation System using Content-based filtering

Course Recommendation System using Content-based Filtering

引用

International Conference on Trends in Electronics and Informatics (ICEI)

作者： Pranshu Mishra Vishal Jain Department of Computer Science and Enginnering Sharda School of Enginnring and Technology Sharda University Greater Noida UP India

The E-learning infrastructure is growing rapidly, choosing the right skills set to built a career in an area of interest sometimes can be mystifying and hence a recommendation system is helpful to narrow down the information or choices based on user's data or preferences. A recommender system automates the process of filtering and make it feasible for a user to search through vast information available online and thus provide a personalized experience for the user. This study has attempted to implement a recommender system based on content based filtering and Machine Learning algorithm to filter skills and courses available digitally based on user's input information.

关键词： Machine learning algorithms Electronic learning Engineering profession filtering algorithms Information filters Market research Informatics

来源：评论

学校读者我要写书评

暂无评论

Direct-Lattice Adaptive Notch Filter for Frequency Estimation and Tracking

Direct-Lattice Adaptive Notch Filter for Frequency Estimatio...

引用

14th Annual Summit and Conference of the Asia-Pacific-Signal-and-Information-Processing-Association (APSIPA ASC)

作者： Inban, P. Punchalard, R. Benjangkaprasert, C. King Mongkuts Inst Technol Ladkrabang Sch Engn Bangkok Thailand Rajabhat Rajanagarindra Univ Sch Elect Engn Fac Ind Technol Mueang Chachoengsao Thailand King Mongkuts Inst Technol Ladkrabang Sch Engn Dept Comp Engn Bangkok Thailand

ISBN: (数字)9786165904773

ISBN: (纸本)9786165904773

This paper presents a direct-lattice adaptive notch filter (DLANF) for frequency estimation and tracking. The proposed filter is the cascade of an all-pole direct form structure filter with an all-zero lattice predictor. The normalized gradient algorithm is used to adjust the filter parameter. This technique outperforms some conventional adaptive filters in terms of convergence time and provides a small mean square error (MSE). Computer simulations are conducted to show the superiority of the proposed filter.

关键词： Maximum likelihood detection Adaptive filters Lattices IIR filters Nonlinear filters filtering algorithms Information filters

来源：评论

学校读者我要写书评

暂无评论

Enhancing Movie Recommendations: A Hybrid filtering Approach Combining Collaborative and Content-Based filtering

Enhancing Movie Recommendations: A Hybrid Filtering Approach...

引用

Artificial Intelligence Robotics, Signal and Image Processing (AIRoSIP), International Conference on

作者： Esther Vemberly Eugenia Ancilla Anderies Anderies Andry Chowanda Computer Science Department School of Computer Science Bina Nusantara University Jakarta Indonesia

ISBN: (数字)9798350327472

ISBN: (纸本)9798350327489

The exponential growth of information and the widespread use of the internet has increased the importance of recommender algorithms, particularly in movie recommendation systems across various industries. By helping users select movies that match their interests, these systems significantly improve the movie-watching experience. However, a common challenge faced by these systems is the cold-start problem, which makes it difficult to provide accurate recommendations for new users with limited historical data. To address this issue and improve recommendation accuracy, this research paper presents a hybrid approach combining collaborative filtering (CF) and content-based filtering (CBF) to provide movie recommendations, where the model makes use of user ratings and movie datasets. The CF component identifies similar users and suggests popular movies, while the CBF component examines movie attributes such as titles, genres, ratings, and descriptions to recommend movies. The methodology involves data acquisition, cleaning, partitioning, and the design of collaborative, content-based, and hybrid models., where the dataset was partitioned into 60% for training and 40% for testing. The evaluation is based on the MovieLens 100K Dataset, using Root Mean Squared Error (RMSE) and Fraction of Concordant Pairs (FCP) metrics. Eventually, the result of the hybrid model obtains a training and testing RMSE of 0.881858 and 0.999145, respectively. For the FCP value, the model achieves a training value of 0.751256 and a testing value of 0.641928. Overall, the proposed hybrid approach highlights the importance of using CF and CBF approaches in recommender algorithms as it gives a balance between accuracy and diversity of the datasets and shows potential in addressing the cold-start problem and providing personalized recommendations. Future studies can focus on improving the hybrid model and exploring other evaluation metrics for a more thorough review.

关键词： Training Measurement Accuracy filtering Collaboration filtering algorithms Motion pictures Data models Recommender systems Testing

来源：评论

学校读者我要写书评

暂无评论

Autoexplorer: Autonomous Exploration of Unknown Environments using Fast Frontier-Region Detection and Parallel Path Planning

Autoexplorer: Autonomous Exploration of Unknown Environments...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Han, Kyung Min Kim, Young J. Ewha Womans Univ Dept Comp Sci & Engn Seoul South Korea

ISBN: (数字)9781665479271

ISBN: (纸本)9781665479271

We propose a fully autonomous system for mobile robot exploration in unknown environments. Our system employs a novel frontier detection algorithm based on the fast front propagation (FFP) technique and uses parallel path planning to reach the detected front regions. Given an occupancy grid map in 2D, possibly updated online, our algorithm can find all the frontier points that can allow mobile robots to visit unexplored regions to maximize the exploratory coverage. Our FFP method is six similar to seven times faster than the state-of-theart wavefront frontier detection algorithm in terms of finding frontier points without compromising the detection accuracy. The speedup can be further accelerated by simplifying the map without degrading the detection accuracy. To expedite locating the optimal frontier point, We also eliminate spurious points by the obstacle filter and the novel boundary filter. In addition, we parallelize the global planning phase using the branch-andbound A*, where the search space of each thread is confined by its best knowledge discovered during the parallel search. As a result, our parallel path-planning algorithm operating on 20 threads is about 30 times faster than the vanilla exploration system that operates on a single thread. Our method is validated through extensive experiments, including autonomous robot exploration in both synthetic and real-world scenarios. In the real-world experiment, we show that an autonomous navigation system using a human-sized mobile manipulator robot equipped with a low-end embedded processor that fully integrates our FFP and parallel path-planning algorithms.

关键词： Buildings filtering algorithms Manipulators Path planning Planning Mobile robots Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

A Study of Endpoint-Constrained Nonlinear Tracking Filters

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2021年第6期57卷 3952-3961页

作者： Ford, Kevin R. Haug, Anton J. Johns Hopkins Univ Appl Phys Lab Laurel MD 20723 USA Johns Hopkins Univ Appl Phys Lab Ellicott City MD 20723 USA

The development and performance of an endpoint-constrained (EPC) extended Kalman filter (EKF) were published by Haug and Ford, where the EPC EKF was shown to outperform similar non-EPC EKFs against highly maneuverable antiship cruise missile (ASCM) trajectories. The purpose of this article is to resolve two issues identified during the original study. The first issue is that EKFs may not offer superior performance when the target's motion is highly nonlinear. The second issue is that the EPC EKF performs poorly against the high diver trajectory, where the target does not satisfy the EPC until the dive begins. This article presents a new filter that uses a modified version of the EPC and a multiple-model algorithm to achieve superior performance against a larger set of ASCM trajectories than the EPC EKF.

关键词： Target tracking Mathematical model Trajectory filtering algorithms Kalman filters Aerodynamics Predictive models Constrained Kalman filter endpoint constraint extended Kalman filter (EKF) interacting multiple-model (IMM) particle filtering target tracking unscented Kalman filter (UKF)

来源：评论

学校读者我要写书评

暂无评论

Metric and Accuracy Ranked Feature Inclusion: Hybrids of Filter and Wrapper Feature Selection Approaches

引用

IEEE ACCESS 2021年 9卷 128687-128701页

作者： Thejas, G. S. Garg, Rameshwar Iyengar, S. S. Sunitha, N. R. Badrinath, Prajwal Chennupati, Shasank Tarleton State Univ Texas A&M Univ Syst Dept Comp Sci & Elect Engn Stephenville TX 76401 USA RV Coll Engn Dept Comp Sci & Engn Bengaluru 560059 Karnataka India Florida Int Univ Knight Fdn Sch Comp & Informat Sci Miami FL 33199 USA Siddaganga Inst Technol Dept Comp Sci & Engn Tumakuru 572103 India Univ N Carolina Global Womens Hlth Chapel Hill NC 27599 USA

Feature selection has emerged as a craft, using which we boost the performance of our learning model. Feature or Attribute Selection is a data preprocessing technique, where only the most informative features are considered and given to the predictor. This reduces the computational overhead and improves the correctness of the classifier. Attribute Selection is commonly carried out by applying some filter or by using the performance of the learning model to gauge the quality of the attribute subset. Metric Ranked Feature Inclusion and Accuracy Ranked Feature Inclusion are the two novel hybrid feature selection methods we introduce in this paper. These algorithms follow a two-stage procedure, the first of which is feature ranking, followed by feature subset selection. They differ in the way they rank the features but follow the same subset selection technique. Multiple experiments have been conducted to assess our models. We compare our results with numerous works of the past and validate our models using 12 datasets. From the results, we infer that our algorithms perform better than many existent models.

关键词： Feature extraction Prediction algorithms Support vector machines Optimization Correlation filtering algorithms Computer science Feature selection filter wrapper hybrid K-means V-measure random forest

来源：评论

学校读者我要写书评

暂无评论

Poisson-Gaussian Noise Reduction for X-Ray Images Based on Local Linear Minimum Mean Square Error Shrinkage in Nonsubsampled Contourlet Transform Domain

引用

IEEE ACCESS 2021年 9卷 100637-100651页

作者： Lee, Sangyoon Kang, Moon Gi Yonsei Univ Sch Elect & Elect Engn Seoul 03722 South Korea

Noise reduction is important for X-ray images because it can reduce radiation exposure to patients. X-ray image noise has a Poisson-Gaussian distribution, and recently, noise analysis and removal in multiscale transformations have been widely implemented. The nonsubsampled contourlet transform (NSCT) is a multiscale transformation suitable for medical images that separates the scale and direction. This study proposes a Poisson-Gaussian noise-removal method using NSCT shrinkage that is based on the characteristics of Poisson-Gaussian noise in NSCT domain. It has the structure of a block-matching 3D filtering algorithm in the form of basic estimation and noise removal process;however, the main processes are modified to consider Poisson-Gaussian noise characteristics. In the basic estimation process, an NSCT shrinkage method that is suitable for Poisson-Gaussian noise characteristics is developed by optimizing the local linear minimum mean square error estimator in the NSCT domain. In the denoising step, the noise term of the Wiener filter is determined using the result of the NSCT shrinkage, and finally, the denoised image is obtained. The proposed method is applied to simulated and real X-ray images and is compared with other state-of-the-art Poisson-Gaussian noise removal methods;it exhibits excellent results in both quantitative and qualitative aspects.

关键词： Wiener filters Three-dimensional displays Smoothing methods Estimation Transforms Mean square error methods filtering algorithms Poisson-Gaussian noise noise removal nonsubsampled contourlet transform (NSCT) X-ray image local linear minimum mean square error (LLMMSE) filtering block-matching and 3D filtering (BM3D)

来源：评论

学校读者我要写书评

暂无评论

Efficient Bayesian Detection of Faint Curved Edges in Noisy Images

引用

IEEE ACCESS 2024年 12卷 186343-186361页

作者： Ofir, Nati Weizmann Inst Sci IL-7610001 Rehovot Israel

Detecting edges in images is a fundamental problem in computer vision with many applications. Many edge detection algorithms have been proposed over the past several decades. These algorithms can deal effectively with the problem, but often face difficulties when applied to images taken under poor visual conditions of faint edges and noisy backgrounds. Such conditions occur frequently in various imaging domains including biomedical, satellite, and high shutter speed, and may even occur in natural images. In this work, the proposed method introduces an efficient method to detect faint edges in noisy images. The first question addressed is how to detect curved edges efficiently. Previous work showed that faint edges can be detected by applying a search over the space of possible curves. While this search space is exponentially large in the number of image pixels, the proposed algorithm novel multiscale algorithm carries a search through a large subset of the space in practical polynomial time. The introduced algorithm is based on a novel hierarchical partitioning of the image into triangular or rectangular tiles. In addition, the second question addressed is how to decide if a curve in the image indeed corresponds to a (possibly faint) edge. To that end, the paper introduces a Bayesian approach that incorporates the intensity and shape features of an edge. The proposed method utilizes relevant statistical priors on edge contrast and shape. Finally, the algorithm utilizes natural images to derive a prior on-edge contrast. As the manuscript experiments demonstrate, in comparison to previous works the proposed algorithm is efficient and obtains higher quality of edge detection.

关键词： Image edge detection Noise measurement Bayes methods filtering algorithms Matched filters Vegetation Bayesian detection edge detection noisy images

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：