Abstract
The cubic unsharp masking method is introduced in this paper. It is demonstrated, through both a statistical study and some computer simulations, that the proposed method has a much reduced noise sensitivity with respect to the linear unsharp masking technique and it permits to obtain perceptually pleasant results. The proposed operator also compares favourably with other algorithms which recently have been studied to improve the behaviour of the unsharp masking approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
