|
Image Processing
|
Color Image Enhancement based on Segmentation Region Histogram Equalization
5. Conclusion
Histogram equalization is powerful method for increasing the contrast of image. The enhanced image will give the full dynamic range of histogram. However, the global histogram equalization process tries to merge the adjacent gray levels together in order to force the uniformity of number of pixels in each appeared gray levels. Consequently, the intensity saturation will be presented in darkness regions and whiteness region. Also the pixels located in the border of two regions which are not too different in gray levels will be grouped together. But, for our propose, we separate out these two regions first and then exploit the histogram equalization to each region independently. Therefore, the mentioned defects can be overcome.
References
- P.W. Fung, K.K. Ly, and Y. Attikiouzed, 1988. Automatic segmentation of biomedical image. Proc ICASSP, pp. 882-885.
- F. Tomita and S. Tsuji, 1977. Extraction of multiple regions by smoothing in selected neighbourhood. IEEE Trans. System Man and Cybernetics SMC-7, pp. 107-109.
- M. Nagao and T. Matsuyama, 1979. Edge preserving smoothing. Computer Graphics and Image Processing, vol.9, pp. 374-407.
- S. Chitwong, F. Cheevasuvit, K. Dejhan, S. Mitatha, C. Nokyoo and T. Paungma, 2000 Segmentation on Edge Preserving Smoothing Image based on Graph Theory. Proceeding of IGARSS 2000, July.
- S.L. Horowitz and T. Pavlidis, 1974. Picture segmentation by a directed split-and-merge procedure. Proc. 2 nd Int. Joint Conf. on Pattern Recognition, pp. 424-433.
- F. Cheevasuvit, H. Maitre and D. Vidal-Madjar, 1986. A robust method for picture segmentation based on a split-and-merge procedure. Computer Vision, Graphics and image processing, vol. 34, pp. 268-281.
- J.B. Jun Kruskal, 1956. On the shortest spanning subtree of a graph and the travelling saleman problem. Proc. Am. Math. Soc., vol. 7, pp. 48-50.
- D. Cheriton and R.E. Tarjan, 1967. Finding minimum spanning trees. SIAM J. Comput., vol. 5, pp. 724-742.
- O.J. Morris, M.de J. Lee, and A.G. Constantinides, 1986. Graph theory for image analysis : an approach based on the shortest spanning tree. Proc. IEE, vol. 133, pt. F, no. 2, pp.146-15.
- O.J. Morris, M.de J.Lee, and A.G. Constantinides, 1986. A unified method for segmentation and edge detection using graph theory. Proc. ICASSP, pp. 2051-2054.
|
|
|
|
|
