Accurate auto-focus method
An auto focus method includes: assigning searching boundaries L=InitL, R=InitR, and acquiring the resolutions f(L), f(R); defining the focused positions X 1 , X 2 by the golden section method, and acquiring the resolution f(X 1 ), f(X 2 ); determining whether or not f(X 1 ) is greater than f(X 2 ); moving L adjacent to R when f(x1) is less than f(x2); moving R adjacent to L when f(x1) is greater than f(x2); acquiring the focused positions L, x1, x2, and R, and the resolution of the focused positions when L≠InitL and R≠InitR; acquiring an optimal focus point according to the focused positions L, X 1 , X 2 , and R, and the resolution of the focused positions.
1. An auto-focus method configured for controlling a focusing lens of a lens module to move to an optimal focused position X p , comprising:
assigning searching boundaries InitL, InitR of the focusing lens to L, R respectively;
acquiring the resolutions f(L), f(R) of images captured by the lens module when the focusing lens is positioned on the two searching boundaries InitL, InitR, wherein f(X) represents the resolution of the image captured by the lens module when the focusing lens is positioned on a focused position X, X is a variable value greater than InitL and lower than InitR;
defining two focused positions X 1 , X 2 , wherein X 1 =L+(1−τ)×(R−L), X 2 =L+τ×(R−L), and τ=0.618;
acquiring the resolutions f(X 1 ), f(X 2 );
comparing f(X 1 ) with f(X 2 ) to determine whether or not f(X 1 ) is greater than f(X 2 );
determining that L=X 1 , X 1 =X 2 , and X 2 =L+τ×(R−L) when f(X 1 ) is lower than f(X 2 );
determining that R=X 2 , X 2 =X 1 , and X 1 =L+(1−τ)×(R−L) when f(X 1 ) is greater than f(X 2 );
determining whether or not L≠InitL and R≠InitR are established;
acquiring the focused positions L, X 1 , X 2 , and R and the resolutions f(L), f(X 1 ), f(X 2 ), and f(R) when L≠InitL and R≠InitR are established; and
calculating the optimal focused position X p according to the focused positions L, X 1 , X 2 , and R and the resolutions f(L), f(X 1 ), f(X 2 ), and f(R).
2. The auto-focus method of claim 1 , wherein L and R are variables, InitL and InitR are constants, and X 1 and X 2 are variables.
3. The auto-focus method of claim 1 , further comprising: returning to compare f(X 1 ) with f(X 2 ) when L≠InitL and R≠InitR are unestablished.
4. The auto-focus method of claim 1 , wherein calculating the optimal focused position X p comprises:
orderly sampling three groups of the focused positions and the resolutions from the focused positions L, X 1 , X 2 , and R and the resolutions f(L), f(X 1 ), f(X 2 ), and f(R), and substituting each three groups of the focused positions and the resolutions into a parabolic equation to calculate four groups of peak coordinates (X n1 , f(n1)), (X, n2 , f(n2)), (X n3 , f(n3)), (X n4 , f(n4)); and
acquiring the optimal focused position X p according to :
X p =(L*f(L)+X 1 *f(X 1 )+X 2 *f(X 2 )+R*f(R)+X n1 *f(n1)+X n2 *f(n2)+X n3 *f(n3)+X n4 *f(n4))/(L+X 1 +X 2 +R+X n1 +X n2 +X n3 +X n4 ).
5. The auto-focus method of claim 1 , wherein calculating the optimal focused position X p is according to: X p =(L*f(L)+X 1 *f(X 1 )+X 2 *f(X 2 )+R*f(R))/(L+X 1 +X 2 +R).
6. The auto-focus method of claim 1 , wherein calculating the optimal focused position X p comprises:
orderly sampling three groups of the focused positions and the resolutions from the focused positions L, X 1 , X 2 , and R and the resolutions f(L), f(X 1 ), f(X 2 ), and f(R), and substituting each three groups of the focused positions and the resolutions into a parabolic equation to calculate four groups of peak coordinates (X n1 , f(n1)), (X n2 , f(n2)), (X n3 , f(n3)), (X n4 , f(n4)); and
acquiring the optimal focused position X p according to:
X p =(X n1 *f(n1)+X n2 *f(n2)+X n3 *f(n3)+X n4 *f(n4))/(X n1 +X n2 +X n3 +X n4 ).
7. The auto-focus method of claim 1 , wherein L=X 1 represents that X 1 is assigned to L, X 1 =X 2 represents that X 2 is assigned to X 1 , and X 2 =L+τ×(R−L) represents that X 2 is defined via reassigned L.
8. The auto-focus method of claim 1 , wherein R=X 2 represents that X 2 is assigned to R, X 1 =X 2 represents that X 2 is assigned to X 1 , and X 1 =L+(1−τ)×(R−L) represents that X 1 is defined via reassigned R.