The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A Generalized Unsharp Masking Algorithm
Abstract
Enhancement of contrast and sharpness of an image is required in many applications. Unsharp masking is a classical tool for sharpness enhancement. We propose a generalized unsharp masking algorithm using the exploratory data model as a unified framework. The proposed algorithm is designed to address three issues: (1) simultaneously enhancing contrast and sharpness by means of individual treatment of the model component and the residual, (2) reducing the halo effect by means of an edge-preserving filter, and (3) solving the out-of-range problem by means of log-ratio and tangent operations. We also present a study of the properties of the log-ratio operations and reveal a new connection between the Bregman divergence and the generalized linear systems. This connection not only provides a novel insight into the geometrical property of such systems, but also opens a new pathway for system development. We present a new system called the tangent system which is based upon a specific Bregman divergence. Experimental results, which are comparable to recently published results, show that the proposed algorithm is able to significantly improve the contrast and sharpness of an image. In the proposed algorithm, the user can adjust the two parameters controlling the contrast and sharpness to produce the desired results. This makes the proposed algorithm practically useful.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
Single image haze removal using dark channel prior
He, K., Sun, J., & Tang, X. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.168 · Cited by 7,601
Marr, D. (1982) · Cumulative Index of Computer Aided Architectural Design · Cited by 5,733
Barlow, H. B. (1983) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(83)90030-5 · Cited by 5,424
Land, E. H., & McCann, J. J. (1971) · Journal of the Optical Society of America · doi:10.1364/josa.61.000001 · Cited by 4,095
Adaptive histogram equalization and its variations
Pizer, S. M., Amburn, E. P., Austin, J. D., Cromartie, R., Geselowitz, A., Greer, T., ter Haar Romeny, B., Zimmerman, J. B., & Zuiderveld, K. (1987) · Computer Vision, Graphics, and Image Processing · doi:10.1016/s0734-189x(87)80186-x · Cited by 4,012
Single image haze removal using dark channel prior
He, K., Sun, J., & Tang, X. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206515 · Cited by 2,414
Fattal, R. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360671 · Cited by 2,114
Fast bilateral filtering for the display of high-dynamic-range images
Durand, F., & Dorsey, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566574 · Cited by 1,547
Synthesis and evaluation of linear motion transitions
Wang, J., & Bodenheimer, B. (2008) · ACM Transactions on Graphics · doi:10.1145/1330511.1330512 · Cited by 1,534
Cited by
Naturalness Preserved Enhancement Algorithm for Non-Uniform Illumination Images
Wang, S., Zheng, J., Hu, H.-M., & Li, B. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2261309 · Cited by 1,755
Contrast Enhancement Based on Layered Difference Representation of 2D Histograms
Lee, C., Lee, C., & Kim, C.-S. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2284059 · Cited by 1,066
Li, C.-Y., Guo, J.-C., Cong, R.-M., Pang, Y.-W., & Wang, B. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2612882 · Cited by 924
URetinex-Net: Retinex-based Deep Unfolding Network for Low-light Image Enhancement
Wu, W., Weng, J., Zhang, P., Wang, X., Yang, W., & Jiang, J. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.00581 · Cited by 809
A fusion-based enhancing method for weakly illuminated images
Fu, X., Zeng, D., Huang, Y., Liao, Y., Ding, X., & Paisley, J. (2016) · Signal Processing · doi:10.1016/j.sigpro.2016.05.031 · Cited by 739
Wang, Y., Song, W., Fortino, G., Qi, L.-Z., Zhang, W., & Liotta, A. (2019) · IEEE Access · doi:10.1109/access.2019.2932130 · Cited by 311
Metadata
- Authors
- Deng, G.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2011-05
- Volume
- 20
- Issue
- 5
- Pages
- 1249-1261
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2113350594
- Cited by
- 345
- References
- 31
- FWCI
- 8.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.