Image Processing Algorithm for Fringe Analysis in Photoelasticity
Journal Title: Scholars Journal of Engineering and Technology - Year 2016, Vol 4, Issue 7
Abstract
Photoelastic fringe patterns recognition are carried out using a circular polariscope on a four point beam loaded by pure bending and they are processed with image processing algorithm in a personal computer. The aim of the present paper stress analysis of the photoelastic fringe in a rectangular cross section beam using digital image processing technology. An algorithm is developed to visualize the stress pattern acting in photoelastic models using fringe sharpening in conjunction with MATLAB software. Photoelasicity is a non-destructive experimental tool can be used for visual representation of stress patterns allowing for stress analysis. The present paper presents an image processing algorithm executed in a personal computer and obtained stress pattern recognition using digital image processing with histogram.
Authors and Affiliations
S. Alsiya, C. J eyaLekshmi, B. P. J ishnaPriya, R. C. Mehta
Keywords
Related Articles
- EP ID EP385603
- DOI -
- Views 69
- Downloads 0
Recommendation of News Groups to the Users Based on Cobweb Clustering
Internet provides drastic access to the news articles from different information sources around the world. The main approach is used to find out the users preference from both news content and user information. Increment...
On Special Diophantine Triples
This paper concerns with the study of constructing a special Diophantine triples (a,b,p) such that the product of any two elements of the set added with their sum and increased by a polynomial with integer coefficients i...
Estimation of Groundwater Resources using Groundwater-Hydrograph Analysis, a Case of Linbian and Donggang basins
This study applied groundwater fluctuation method (GFM) and considered the natural groundwater recession rate to analyze the groundwater storage levels of the Donggang River and Linbian River basins. Subsequently, the sa...
On The Higher Degree Equation with Six Unknowns x6-y6-2z3=52nT2m(w2-p2)
We presents non zero solutions of the degree non-homogeneous Diophantine equation in six unknowns represented by in which . In particular, different patterns of non-zero integral solutions of the above equation alon...
An efficient clustering method of assigning nearest cluster center
K-means is a numerical, unsupervised, non-deterministic, simple iterative cluster method. k-means algorithm computes the distances between data point and all centers in iterative process, this is computationally very exp...