A Comparative Study on Shape Reorganization
Journal Title: International Journal of Science Engineering and Advance Technology - Year 2016, Vol 4, Issue 1
Abstract
This paper proposes a new mechanism for identifying two-dimensional shapes called the SKS algorithm and compares it with three other state-ofart methods in detail. These include the Hu Moments, CSS matching and Shape context. The algorithm uses the philosophy of evidence accumulation equal to generalized Hough transform and is highly parallel in nature. The performance of each algorithm is evaluated under affine transforms - translation, rotation in the plane, scale (zoom) and also under partial occlusion.
Authors and Affiliations
S. Suresh| Research Scholar , Dept. of Computer Science and Engineering Acharya Nagarjuna University, A.P. -India, Dr. R Siva Ram Prasad| Research Director, Dept. of Computer Science and Engineering Acharya Nagarjuna University, A.P. -India
Contact Stress Analysis of Helical Gear by Using AGMA and ANSYS
Gears are one of the most critical components in mechanical power transmission systems. The gears are generally used to transmit power and torque. The efficiency of power transmission is very high when compared to ot...
Modeling And Biomechanical Analysis Of Human Knee Joint
The main objective of the present work is to implement the computer aided technology to study the biomechanical behavior of human knee joint which consists of Femur, Tibia, Patella, Menisci, Posterior Cruciate Ligame...
Self-Assured Formal Deduplication In FusionCloud Methodology
Data deduplication is a critical system in support dispose of excess information as an option of enthralling records; it provisions simply distinct copy of file. Together with the whole associations stockpiling patte...
To Provide An Innovative Policy Anomaly Management Framework For Firewalls
Firewalls have been widely organized on the Internet for securing private networks. A firewall checks each incoming or outgoing packet to choose whether to accept or discard the packet based on its policy. Optimizing...
CONVERGENCE OF ITERATIVE NEWTON’S METHOD FOR THE SOLUTION NUMERICAL EQUATIONS
this paper an Iterative Newton’s method for the solution of simple and multiple roots of an equation f(x)=0 is given and it is proved that this method has second order convergence.