Standard Intensity Deviation Approach based Clipped Sub Image Histogram Equalization Algorithm for Image Enhancement
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 1
Abstract
The limitations of the hardware and dynamic range of digital camera have created the demand for post processing software tool to improve image quality. Image enhancement is a technique that helps to improve finer details of the image. This paper presents a new algorithm for contrast enhancement, where the enhancement rate is controlled by clipped histogram approach, which uses standard intensity deviation. Here standard intensity deviation is used to divide and equalize the image histogram. The equalization processes is applied to sub images independently and combine them into one complete enhanced image. The conventional histogram equalization stretches the dynamic range which leads to a large gap between adjacent pixels that produces over enhancement problem. This drawback is overcome by defining standard intensity deviation value to split and equalize the histogram. The selection of suitable threshold value for clipping and splitting image, provides better enhancement over other methods. The simulation results show that proposed method out performs other conventional histogram equalization (HE) methods and effectively preserves entropy.
Authors and Affiliations
Sandeepa K S, Basavaraj N Jagadale, J S Bhat
Keywords
Related Articles
- EP ID EP261473
- DOI 10.14569/IJACSA.2018.090116
- Views 65
- Downloads 0
A New 3D Model-Based Tracking Technique for Robust Camera Pose Estimation
In this paper we present a new robust camera pose estimation approach based on 3D lines features. The proposed method is well adapted for mobile augmented reality applications We used an Extended Kalman Filter (EKF...
Improved Echo cancellation in VOIP
VoIP (voice over internet protocol) is very popular communication technology of this century and has played tremendous role in communication system. It is preferred by all because it deploys many benefits it uses Interne...
NMVSA Greedy Solution for Vertex Cover Problem
Minimum vertex cover (MVC) is a well-known NP-Complete optimization problem. The importance of MVC in theory and practical comes from the wide range of its applications. This paper describes a polynomial time greedy algo...
Exploreing K-Means with Internal Validity Indexes for Data Clustering in Traffic Management System
Traffic Management System (TMS) is used to improve traffic flow by integrating information from different data repositories and online sensors, detecting incidents and taking actions on traffic routing. In general, two d...
Automatic Cloud Resource Scaling Algorithm based on Long Short-Term Memory Recurrent Neural Network
Scalability is an important characteristic of cloud computing. With scalability, cost is minimized by provisioning and releasing resources according to demand. Most of current Infrastructure as a Service (IaaS) providers...