Contrast Enhancement Algorithm Using Singular Value Decomposition and Image Pyramid 


Vol. 38,  No. 11, pp. 928-937, Nov.  2013


PDF Full-Text
  Abstract

This paper presents a novel contrast enhancement method based on singular value decomposition and image pyramid. The proposed method consists mainly of four steps. The proposed algorithm firstly decomposes image into band-pass images, including basis image and detail images, to improve both the global contrast and the local detail. In the global contrast process, singular value decomposition is used for contrast enhancement; the local detail scheme uses weighting factors. In the final image composition process, the proposed algorithm combines color and luminance components in order to preserve the color consistency. Experimental results show that the proposed algorithm improves contrast performance and enhances detail compared to conventional methods.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

C. Ha, C. Choi, J. Jeong, "Contrast Enhancement Algorithm Using Singular Value Decomposition and Image Pyramid," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 11, pp. 928-937, 2013. DOI: .

[ACM Style]

Changwoo Ha, Changryoul Choi, and Jechang Jeong. 2013. Contrast Enhancement Algorithm Using Singular Value Decomposition and Image Pyramid. The Journal of Korean Institute of Communications and Information Sciences, 38, 11, (2013), 928-937. DOI: .

[KICS Style]

Changwoo Ha, Changryoul Choi, Jechang Jeong, "Contrast Enhancement Algorithm Using Singular Value Decomposition and Image Pyramid," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 11, pp. 928-937, 11. 2013.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880