Guided-filtering optimization speed-up method based on CUDA
An optimization method and guided filtering technology, applied in image data processing, instruments, calculations, etc., can solve the problem that it is difficult to meet the requirements of algorithm accuracy and real-time processing, guided filtering algorithm consumes computing time and space, and is difficult to achieve algorithm accuracy Algorithm execution efficiency and other issues, to achieve the effect of low hardware requirements, great innovation significance, and novel ideas
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0034] A CUDA-based guided filtering acceleration optimization method, see figure 1 , the guided filtering acceleration optimization method includes the following steps:
[0035] 101: Read the input image p and the guide image I from the host-side memory into the global memory, and obtain the input image p, the guide image I, the image I*P, and the image I*I in the neighborhood window respectively by constructing the first kernel function. image neighborhood mean;
[0036] 102: Construct the second kernel function to obtain the covariance of the image (I, p) in turn, guide the variance of the image I, and then obtain the key filtering parameters a and b;
[0037] 103: Call the first kernel function to obtain the neighborhood mean value mean_a of parameter a and the neighborhood mean value of parameter b
[0038] mean_b, and then obtain the final filtering result, save the result to the corresponding global memory, and transfer it to the host-side memory.
[0039] Wherein, b...
Embodiment 2
[0049] The guided filtering algorithm is implemented based on a local linear model. In the local linear model, let the input image be p, the guiding image be I, and the filtered output image be q. The local linear model assumes that the neighborhood window ω with the center pixel k k There is a linear relationship as follows:
[0050] q i = a k I i + b k , ∀ i ∈ ω k
[0051] (1)
[0052] Among them, ω k is a square window with side length r, a k and b k is the neighborhood window ω k The linear coefficient in, I i For the guide image in the neighborhood window ω k Pixel value in q i is the neighborhood window ω k Filtered output in . Coefficient a k and b k It can be determined by finding the minimum difference between the input...
Embodiment 3
[0092] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be further described in detail below in conjunction with specific examples.
[0093] The example of the present invention adopts windows 7 operating system, and CPU is Intel Core i5-3470, and main frequency is 3.2GHz, and system memory is 4GB; Contains 192 CUDA cores, onboard global memory is 2048Mbytes, memory bandwidth is 192 bits, and supports CUDA Compute Capability 3.0. At the same time, the present invention utilizes the Visual Profile that comes with the CUDA Toolkit to analyze various data to realize the quantitative analysis of the program performance.
[0094] In order to verify the effectiveness of this method, the example of the present invention carries out CUDA parallel optimization to the guided filtering algorithm in four application fields such as image smoothing, image feathering, image enhancement and f...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 