A Technique to Approximate Digital Planar Curve with Polygon

2017 ◽  
pp. 150-169
Author(s):  
Mangayarkarasi Ramaiah ◽  
Bimal Kumar Ray
Keyword(s):  
State Of The Art ◽  
Experimental Results ◽  
Planar Curve ◽  
Digital Curve ◽  
Comparative Results ◽  
Digital Planar Curve

This chapter presents a technique which uses the sum of height square as a measure to define the deflection associated with a pseudo high curvature points on the digital planar curve. The proposed technique iteratively removes the pseudo high curvature points whose deflection is minimal, and recalculates the deflection associated with its neighbouring pseudo high curvature points. The experimental results of the proposed technique are compared with recent state of the art iterative point elimination methods. The comparative results show that the proposed technique produces the output polygon in a better way than others for most of the input digital curve.

A GENETIC ALGORITHM-BASED APPROACH FOR DETECTION OF SIGNIFICANT VERTICES FOR POLYGONAL APPROXIMATION OF DIGITAL CURVES

2004 ◽  
Vol 04 (02) ◽  
pp. 223-239 ◽  
Author(s):  
BISWAJIT SARKAR ◽  
LOKENDRA KUMAR SINGH ◽  
DEBRANJAN SARKAR
Keyword(s):  
Genetic Algorithm ◽  
A Priori ◽  
Approximation Error ◽  
Compact Representation ◽  
Polygonal Approximation ◽  
Original Curve ◽  
Planar Curve ◽  
Digital Curve ◽  
Digital Planar Curve ◽  
Curve Form

A polygonal approximation captures the essential features of a digital planar curve and yields a compact representation. Those points of the digital curve that carry vital information about the shape of the curve form the vertices of the approximating polygon and are called significant vertices. In this paper, we present a genetic algorithm-based approach to locate a specified number of significant points, such that the approximation error between the original curve and its polygonal version obtained by joining the adjacent significant points is minimized. By using a priori knowledge about the shape of the curve we confine our search to only those points of the curve that have the potential of qualifying as significant points. We also incorporate chromosome differentiation to improve upon the effectiveness of the search in arriving at a near-optimal polygonal approximation. Finally, we show that the proposed method performs remarkably well when evaluated in terms of the metrics available for assessing the goodness of a polygonal approximation algorithm.

Browser Security Attacks and Detection Techniques: A Case of Tabnabbing

2020 ◽  
Vol 8 (1) ◽  
pp. 33-41
Author(s):  
Dr. S. Sarika ◽  
Keyword(s):  
Credit Card ◽  
State Of The Art ◽  
Experimental Results ◽  
Detection Technique ◽  
Security Attacks ◽  
Agent Based ◽  
Detection Techniques ◽  
Browser Security ◽  
Cyber Threats ◽  
Multi Agent

Phishing is a malicious and deliberate act of sending counterfeit messages or mimicking a webpage. The goal is either to steal sensitive credentials like login information and credit card details or to install malware on a victim’s machine. Browser-based cyber threats have become one of the biggest concerns in networked architectures. The most prolific form of browser attack is tabnabbing which happens in inactive browser tabs. In a tabnabbing attack, a fake page disguises itself as a genuine page to steal data. This paper presents a multi agent based tabnabbing detection technique. The method detects heuristic changes in a webpage when a tabnabbing attack happens and give a warning to the user. Experimental results show that the method performs better when compared with state of the art tabnabbing detection techniques.

scholarly journals Automatic Detection of Discrimination Actions from Social Images

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 325
Author(s):  
Zhihao Wu ◽  
Baopeng Zhang ◽  
Tianchen Zhou ◽  
Yan Li ◽  
Jianping Fan
Keyword(s):  
Action Recognition ◽  
State Of The Art ◽  
Automatic Detection ◽  
Experimental Results ◽  
Practical Approach ◽  
Detection And Identification ◽  
Art Methods ◽  
Image Set ◽  
Social Images ◽  
Relationship Identification

In this paper, we developed a practical approach for automatic detection of discrimination actions from social images. Firstly, an image set is established, in which various discrimination actions and relations are manually labeled. To the best of our knowledge, this is the first work to create a dataset for discrimination action recognition and relationship identification. Secondly, a practical approach is developed to achieve automatic detection and identification of discrimination actions and relationships from social images. Thirdly, the task of relationship identification is seamlessly integrated with the task of discrimination action recognition into one single network called the Co-operative Visual Translation Embedding++ network (CVTransE++). We also compared our proposed method with numerous state-of-the-art methods, and our experimental results demonstrated that our proposed methods can significantly outperform state-of-the-art approaches.

scholarly journals PyConvU-Net: a lightweight and multiscale network for biomedical image segmentation

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Changyong Li ◽  
Yongxian Fan ◽  
Xiaodong Cai
Keyword(s):  
Image Segmentation ◽  
Deep Learning ◽  
State Of The Art ◽  
Experimental Results ◽  
Actual Situation ◽  
Controlled Experiments ◽  
Biomedical Image ◽  
Segmentation Methods ◽  
Art Performance

Abstract Background With the development of deep learning (DL), more and more methods based on deep learning are proposed and achieve state-of-the-art performance in biomedical image segmentation. However, these methods are usually complex and require the support of powerful computing resources. According to the actual situation, it is impractical that we use huge computing resources in clinical situations. Thus, it is significant to develop accurate DL based biomedical image segmentation methods which depend on resources-constraint computing. Results A lightweight and multiscale network called PyConvU-Net is proposed to potentially work with low-resources computing. Through strictly controlled experiments, PyConvU-Net predictions have a good performance on three biomedical image segmentation tasks with the fewest parameters. Conclusions Our experimental results preliminarily demonstrate the potential of proposed PyConvU-Net in biomedical image segmentation with resources-constraint computing.

scholarly journals Evaluation of recent advances in recommender systems on Arabic content

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Mehdi Srifi ◽  
Ahmed Oussous ◽  
Ayoub Ait Lahcen ◽  
Salma Mouline
Keyword(s):  
Recommender Systems ◽  
High Performance ◽  
Large Scale ◽  
State Of The Art ◽  
Experimental Results ◽  
Recent Advances ◽  
Research Gap ◽  
Text Preprocessing

AbstractVarious recommender systems (RSs) have been developed over recent years, and many of them have concentrated on English content. Thus, the majority of RSs from the literature were compared on English content. However, the research investigations about RSs when using contents in other languages such as Arabic are minimal. The researchers still neglect the field of Arabic RSs. Therefore, we aim through this study to fill this research gap by leveraging the benefit of recent advances in the English RSs field. Our main goal is to investigate recent RSs in an Arabic context. For that, we firstly selected five state-of-the-art RSs devoted originally to English content, and then we empirically evaluated their performance on Arabic content. As a result of this work, we first build four publicly available large-scale Arabic datasets for recommendation purposes. Second, various text preprocessing techniques have been provided for preparing the constructed datasets. Third, our investigation derived well-argued conclusions about the usage of modern RSs in the Arabic context. The experimental results proved that these systems ensure high performance when applied to Arabic content.

scholarly journals Contour Detection for Fibre of Preserved Szechuan Pickle Based on Dilated Convolution

2019 ◽  
Vol 9 (13) ◽  
pp. 2684 ◽  
Author(s):  
Hongyang Li ◽  
Lizhuang Liu ◽  
Zhenqi Han ◽  
Dan Zhao
Keyword(s):  
Edge Detection ◽  
State Of The Art ◽  
Contour Detection ◽  
Experimental Results ◽  
Contour Method ◽  
Class Differences ◽  
Dilated Convolution ◽  
The Mean ◽  
Art Performance

Peeling fibre is an indispensable process in the production of preserved Szechuan pickle, the accuracy of which can significantly influence the quality of the products, and thus the contour method of fibre detection, as a core algorithm of the automatic peeling device, is studied. The fibre contour is a kind of non-salient contour, characterized by big intra-class differences and small inter-class differences, meaning that the feature of the contour is not discriminative. The method called dilated-holistically-nested edge detection (Dilated-HED) is proposed to detect the fibre contour, which is built based on the HED network and dilated convolution. The experimental results for our dataset show that the Pixel Accuracy (PA) is 99.52% and the Mean Intersection over Union (MIoU) is 49.99%, achieving state-of-the-art performance.

scholarly journals Random Forest with Adaptive Local Template for Pedestrian Detection

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Tao Xiang ◽  
Tao Li ◽  
Mao Ye ◽  
Zijian Liu
Keyword(s):  
Computer Vision ◽  
Random Forest ◽  
Classification Accuracy ◽  
Template Matching ◽  
Detection Method ◽  
State Of The Art ◽  
Pedestrian Detection ◽  
Sliding Window ◽  
Experimental Results ◽  
Training Samples

Pedestrian detection with large intraclass variations is still a challenging task in computer vision. In this paper, we propose a novel pedestrian detection method based on Random Forest. Firstly, we generate a few local templates with different sizes and different locations in positive exemplars. Then, the Random Forest is built whose splitting functions are optimized by maximizing class purity of matching the local templates to the training samples, respectively. To improve the classification accuracy, we adopt a boosting-like algorithm to update the weights of the training samples in a layer-wise fashion. During detection, the trained Random Forest will vote the category when a sliding window is input. Our contributions are the splitting functions based on local template matching with adaptive size and location and iteratively weight updating method. We evaluate the proposed method on 2 well-known challenging datasets: TUD pedestrians and INRIA pedestrians. The experimental results demonstrate that our method achieves state-of-the-art or competitive performance.

IMPROVEMENT OF THE PERFORMANCE OF FINGERPRINT VERIFICATION USING A COMBINATORIAL APPROACH

2018 ◽  
Vol 30 (03) ◽  
pp. 1850019
Author(s):  
Fatemeh Alimardani ◽  
Reza Boostani
Keyword(s):  
Nearest Neighbor ◽  
State Of The Art ◽  
Recognition Rate ◽  
Acceptance Rate ◽  
Feature Reduction ◽  
Support Vector ◽  
Fingerprint Verification ◽  
Linear Discriminant ◽  
Comparative Results ◽  
Verification Systems

Fingerprint verification systems have attracted much attention in secure organizations; however, conventional methods still suffer from unconvincing recognition rate for noisy fingerprint images. To design a robust verification system, in this paper, wavelet and contourlet transforms (CTS) were suggested as efficient feature extraction techniques to elicit a coverall set of descriptive features to characterize fingerprint images. Contourlet coefficients capture the smooth contours of fingerprints while wavelet coefficients reveal its rough details. Due to the high dimensionality of the elicited features, across group variance (AGV), greedy overall relevancy (GOR) and Davis–Bouldin fast feature reduction (DB-FFR) methods were adopted to remove the redundant features. These features were applied to three different classifiers including Boosting Direct Linear Discriminant Analysis (BDLDA), Support Vector Machine (SVM) and Modified Nearest Neighbor (MNN). The proposed method along with state-of-the-art methods were evaluated, over the FVC2004 dataset, in terms of genuine acceptance rate (GAR), false acceptance rate (FAR) and equal error rate (EER). The features selected by AGV were the most significant ones and provided 95.12% GAR. Applying the selected features, by the GOR method, to the modified nearest neighbor, resulted in average EER of [Formula: see text]%, which outperformed the compared methods. The comparative results imply the statistical superiority ([Formula: see text]) of the proposed approach compared to the counterparts.

scholarly journals Spreading predictability in complex networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Na Zhao ◽  
Jian Wang ◽  
Yong Yu ◽  
Jun-Yan Zhao ◽  
Duan-Bing Chen
Keyword(s):  
Infectious Diseases ◽  
Prediction Model ◽  
Complex Networks ◽  
State Of The Art ◽  
Experimental Results ◽  
Vaccination Strategies ◽  
Macro Scale ◽  
Good Consistency ◽  
The Future ◽  
Rumor Control

AbstractMany state-of-the-art researches focus on predicting infection scale or threshold in infectious diseases or rumor and give the vaccination strategies correspondingly. In these works, most of them assume that the infection probability and initially infected individuals are known at the very beginning. Generally, infectious diseases or rumor has been spreading for some time when it is noticed. How to predict which individuals will be infected in the future only by knowing the current snapshot becomes a key issue in infectious diseases or rumor control. In this report, a prediction model based on snapshot is presented to predict the potentially infected individuals in the future, not just the macro scale of infection. Experimental results on synthetic and real networks demonstrate that the infected individuals predicted by the model have good consistency with the actual infected ones based on simulations.

Estimated path information gain-based robot exploration under perceptual uncertainty

Robotica ◽  
2022 ◽  
pp. 1-17
Author(s):  
Jie Liu ◽  
Chaoqun Wang ◽  
Wenzheng Chi ◽  
Guodong Chen ◽  
Lining Sun
Keyword(s):  
Decision Making ◽  
Topological Structure ◽  
Information Gain ◽  
State Of The Art ◽  
Selection Process ◽  
Random Trees ◽  
Experimental Results ◽  
Restricted Area ◽  
Structure Information ◽  
Path Information

Abstract At present, the frontier-based exploration has been one of the mainstream methods in autonomous robot exploration. Among the frontier-based algorithms, the method of searching frontiers based on rapidly exploring random trees consumes less computing resources with higher efficiency and performs well in full-perceptual scenarios. However, in the partially perceptual cases, namely when the environmental structure is beyond the perception range of robot sensors, the robot often lingers in a restricted area, and the exploration efficiency is reduced. In this article, we propose a decision-making method for robot exploration by integrating the estimated path information gain and the frontier information. The proposed method includes the topological structure information of the environment on the path to the candidate frontier in the frontier selection process, guiding the robot to select a frontier with rich environmental information to reduce perceptual uncertainty. Experiments are carried out in different environments with the state-of-the-art RRT-exploration method as a reference. Experimental results show that with the proposed strategy, the efficiency of robot exploration has been improved obviously.

Sign in / Sign up

Export Citation Format

Share Document