RECONSTRUCTION OF HV-CONVEX BINARY IMAGES WITH DIAGONAL AND ANTI-DIAGONAL PROJECTIONS USING SIMULATED ANNEALING TECHNIQUE

Abstract

In discrete tomography, reconstruction of binary images in few directions of projection is an old inverse problem of mathematics. Most of the researcher found approximate solution of binary images in the direction of horizontal and vertical directions. Special case binary images by introducing some constraints on the binary images such as convexity and connectivity improved the reconstruction process. In this paper hv-convex binary images were reconstructed in other form of orthogonal projection i.e. in diagonal and anti-diagonal direction. To get the optimize solution of the diagonal and anti-diagonal projection simulate annealing techniques were implemented. It was found that the reconstruction has been improved from the previous technique. The misclassification of pixel values from the reconstructed and the original were considered as the main parameter for comparison of results.

Authors and Affiliations

SHELJA SEHDEV, SHIV KUMAR VERMA, ANUPRIYA SHARMA

Keywords

Related Articles

The Scheme Programming Language

This paper is a review of the Scheme programming language. Origin of Scheme, various features, syntax, example code and applications of Scheme language are discussed in this paper. The interpreters that are used and othe...

The Impact of Computer Information Systems on the Adequacy of Institutional Work (Case Study)

In the light of the greatest development in the field of information systems and modern technology, information has become of particular importance to various institutions and companies. The current study aimed to Determ...

ENHANCED K STRANGE POINTS CLUSTERING USING BAT INSPIRED ALGORITHM

One of the major techniques for data analysis is Clustering in data mining . In this paper, a partitioning clustering method called the Enhanced K Strange Points Clustering algorithm (EKSPA) is used with Bat algorithm. T...

DETECTION OF BRAIN TUMOR USING ENHANCED K-STRANGE POINTS CLUSTERING AND MORPHOLOGICAL FILTERING

Image processing has become an emerging area of endless possibilities to explore and advances in this domain are gaining momentum. A brain tumor is an abnormal growth, which is caused due to cells reproducing themselves...

NATURE INSPIRED ALGORITHMS FOR TEST SUITE OPTIMIZATION FOR REGRESSION TESTING: AN INVESTIGATION

Software Testing is one of the expensive activities in software development. But at the same time, it will assure the quality of the software product. Software testing will take more cost and maximum time which actually...

Download PDF file
  • EP ID EP220321
  • DOI -
  • Views 148
  • Downloads 0

How To Cite

SHELJA SEHDEV, SHIV KUMAR VERMA, ANUPRIYA SHARMA (2017). RECONSTRUCTION OF HV-CONVEX BINARY IMAGES WITH DIAGONAL AND ANTI-DIAGONAL PROJECTIONS USING SIMULATED ANNEALING TECHNIQUE. International Journal of Computer Science Engineering and Information Technology Research (IJCSEITR), 7(1), 59-68. https://europub.co.uk./articles/-A-220321