Preferred Language
Articles
/
bsj-9775
Human Pose Estimation Algorithm Using Optimized Symmetric Spatial Transformation Network
...Show More Authors

Human posture estimation is a crucial topic in the computer vision field and has become a hotspot for research in many human behaviors related work. Human pose estimation can be understood as the human key point recognition and connection problem. The paper presents an optimized symmetric spatial transformation network designed to connect with single-person pose estimation network to propose high-quality human target frames from inaccurate human bounding boxes, and introduces parametric pose non-maximal suppression to eliminate redundant pose estimation, and applies an elimination rule to eliminate similar pose to obtain unique human pose estimation results. The exploratory outcomes demonstrate the way that the proposed technique can precisely recognize the human central issues, really work on the exactness of human posture assessment, and can adjust to the intricate scenes with thick individuals and impediment. Finally, the difficulties and possible future trends are described, and the development of the field is presented.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Mar 30 2021
Journal Name
Baghdad Science Journal
Future of Mathematical Modelling: A Review of COVID-19 Infected Cases Using S-I-R Model
...Show More Authors

The spread of novel coronavirus disease (COVID-19) has resulted in chaos around the globe. The infected cases are still increasing, with many countries still showing a trend of growing daily cases. To forecast the trend of active cases, a mathematical model, namely the SIR model was used, to visualize the spread of COVID-19. For this article, the forecast of the spread of the virus in Malaysia has been made, assuming that all Malaysian will eventually be susceptible. With no vaccine and antiviral drug currently developed, the visualization of how the peak of infection (namely flattening the curve) can be reduced to minimize the effect of COVID-19 disease. For Malaysians, let’s ensure to follow the rules and obey the SOP to lower the

... Show More
View Publication Preview PDF
Scopus (9)
Crossref (3)
Scopus Clarivate Crossref
Publication Date
Tue Jun 12 2007
Journal Name
Iraqi Journal Of Laser
Nonlinear Optical Properties of CdS Thin Film Nanoparticles Using z-Scan Technique
...Show More Authors

In the present work, a z-scan technique was used to study the nonlinear optical properties, represented by the nonlinear refractive index and nonlinear absorption coefficients of nanoparticles cadmium sulfide thin film. The sample was prepared by the chemical bath deposition method. Several testing were done including, x-ray, transmission and thickness of thin film. z-Scan experiment was performed at two wavelengths (1064 nm and 532 nm) and different energies. The results showed the effect of self-focusing in the material at higher intensities, which evaluated n2 to be (0.11-0.16) cm2/GW. The effect of two-photon absorption was studied, which evaluated β to be (24-106) cm/GW. In addition, the optical limiting behavior has been studied.

... Show More
View Publication Preview PDF
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (44)
Crossref (43)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (65)
Crossref (48)
Scopus Clarivate Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Engineering
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

... Show More
View Publication Preview PDF
Publication Date
Mon Sep 30 2013
Journal Name
International Journal Of Network Security & Its Applications
Evaluating the Performance of the Secure Block Permutation Image Steganography Algorithm
...Show More Authors

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Oct 12 2022
Journal Name
Axioms
Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports
...Show More Authors

Pathology reports are necessary for specialists to make an appropriate diagnosis of diseases in general and blood diseases in particular. Therefore, specialists check blood cells and other blood details. Thus, to diagnose a disease, specialists must analyze the factors of the patient’s blood and medical history. Generally, doctors have tended to use intelligent agents to help them with CBC analysis. However, these agents need analytical tools to extract the parameters (CBC parameters) employed in the prediction of the development of life-threatening bacteremia and offer prognostic data. Therefore, this paper proposes an enhancement to the Rabin–Karp algorithm and then mixes it with the fuzzy ratio to make this algorithm suitable

... Show More
View Publication
Scopus (2)
Scopus Clarivate Crossref
Publication Date
Mon May 01 2017
Journal Name
2017 5th International Conference On Information And Communication Technology (icoic7)
Analysis of the number of ants in ant colony system algorithm
...Show More Authors

View Publication
Scopus (29)
Crossref (14)
Scopus Crossref
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref