| 书目名称 | Modern Algorithms for Image Processing | | 副标题 | Computer Imagery by | | 编辑 | Vladimir Kovalevsky | | 视频video | http://file.papertrans.cn/637/636902/636902.mp4 | | 概述 | Teaches efficient methods of digital image processing that can be used for improving the quality of images and for recognizing and measuring objects.Provides project source code you can immediately us | | 图书封面 |  | | 描述 | .Utilize modern methods for digital image processing and take advantage of the many time-saving templates provided for all of the projects in this book..Modern Algorithms for Image Processing. approaches the topic of image processing through teaching by example. Throughout the book, you will create projects that resolve typical problems that you might encounter in the world of digital image processing. Some projects teach you methods for addressing the quality of images, such as reducing random errors or noise and suppressing pulse noise (salt and pepper), a method valuable for improving the quality of historical images. Other methods detail how to correct inhomogeneous illumination, not by means of subtracting the mean illumination, but through division, a far more efficient method. Additional projects cover contrasting, and a process for edge detection, more efficient than Canny‘s, for detecting edges in color images directly, without converting them into black and white images..What You‘ll Learn.Apply innovative methods for suppressing pulse noise, enhancing contrast, and edge detection.Know the pros and cons of enlisting a particular method.Use new approaches for image compress | | 出版日期 | Book 2019 | | 关键词 | image processing; C#; image improvements; noise reduction; shading correction; edge detection; thresholdin | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4842-4237-7 | | isbn_softcover | 978-1-4842-4236-0 | | isbn_ebook | 978-1-4842-4237-7 | | copyright | Vladimir Kovalevsky 2019 |
The information of publication is updating
|
|
|Archiver|手机版|小黑屋|
派博传思国际
( 京公网安备110108008328)
GMT+8, 2025-8-26 12:32
发表于 2025-3-21 18:30:10
