Introduction to common interpolation algorithms (3)

2019 Unicorn Enterprise Heavy Gold Recruitment Python Engineer Standard >>> hot3.png

Bicubic interpolation (also called coordination plate element), the binary bicubic interpolation formula has a total of (3+1)2=16 coefficients, and its general form can be written as:

 a00 + a10x + a01y + a20x2 + a11xy + a02y2 + a21x2y + a12xy2 + a22x2y2 + a30x3 + a03y3 + a31x3y + a13xy3 + a32x3y2 + a23x2y3 + a33x3y3    

Or a simpler form:



The bicubic interpolation method overcomes the shortcomings of bilinear interpolation and nearest neighbor interpolation algorithms. The calculation accuracy is relatively high, and the interpolation effect is better than the nearest neighbor interpolation method and the bilinear interpolation method, but the calculation amount is large. In the image domain, the method considers 16 neighbors around a floating point coordinate (i+u, j+v), and the target pixel value f(i+u, j+v) can be obtained by the following interpolation formula:
    f(i+u,j+v)=[A]×[B]×[C]

    [A]=[S(u+1)  S(u+0)  S(u-1)  S(u-2)]       


Reprinted at: https://my.oschina.net/u/923087/blog/279235

Intelligent Recommendation

Introduction of common hashing algorithms

background knowledge: Hash algorithms are mainly used in cache distributed systems. Distributed means that a whole is divided into multiple parts, which are executed by multiple servers. Pay attention...

Introduction to common encryption algorithms

Introduction As a developer, it is necessary to understand some encryption algorithms. Through encryption algorithms, we can accomplish three goals of data communication, namely data confidentiality, ...

Introduction to common sorting algorithms

Insertion sort(Insertion sorting): Insert a piece of data into ordered data to form new ordered data with a length plus one. It is suitable for sorting a small amount of data. The time complexity is O...

Introduction to common GC algorithms

Four GC algorithms Overview Reference counting Copying algorithm (Copying) Mark-Sweep Mark compression algorithm (Mark-Compact) to sum up Overview When JVM is performing GC,The above three memory area...

Introduction to Algorithms 5.1-3

Java code: The expected runtime of the algorithm requires a p-value to determine Reprinted at: https://blog.51cto.com/herculeser/1256680...

More Recommendation

Introduction to Algorithms (3)

Chapter 6 Heap Sort Definition of heap: The heap is a one-bit array maintained using a binary tree structure. As shown in the figure, given an array A, it can be represented by an approximately comple...

Introduction to Algorithms (3) Enumeration

description Farmer John built a long corral, which includes N (2 <= N <= 100,000) compartments, which are numbered x1,…,xN (0 <= xi <= 1,000,000,000). However, John's C (2 <= C &...

Introduction to Algorithms--Part 3

Introduction to Algorithms--Part 3 Part 3: Data Structures Chapter 10: Elementary Data Structures 10.1 Stack and Queue 10.2 Linked list 10.3 Realization of Pointer and Object 10.4 Representation of Ro...

Common search algorithms (sequence, dichotomy, interpolation, block, Fibonacci)

Common search algorithms (sequence, dichotomy, interpolation, block, Fibonacci) Sequential search Basic idea Code Block search Basic idea Binary search Basic idea Code Interpolation lookup Basic idea ...

Introduction to Algorithms (3) Probability Analysis and Random Algorithms

Introduction to Algorithms (3) Probability Analysis and Random Algorithms 1. Employment issues First, let's consider a simple problem, the employment problem. To join you need to hire a new office man...

Copyright  DMCA © 2018-2026 - All Rights Reserved - www.programmersought.com  User Notice

Top