International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org

Volume 6, Issue 2, March - April 2017 ISSN 2278-6856

AFM(Adaptive focus measure) with B-Spline

polynomial for image Depth Estimation
K.Kanthamma1, S.A.K.Jilanir2
1
Reasearch scholar, Department of Electronics and communication Engineering, Rayalaseema university, Kurnool,
Andrapradesh, INDIA.
2
Professor,DEparment of Electronics and communication engineering, Madanapalle institute of
technology,Madanapalle.Andrapradesh,INDIA.

bleeding, edge bleeding can be decreased by expanding

Abstract
Shape from focus (SFF) techniques every now and again
utilizes a solitary focus measure to get a depth map. Basic
focus measures are settled and spatially invariant. In this
paper we display a work to make an adaptive focus
measure with B-spline interpolation. In this method we can
deal the extent of the support window can be expanded
advantageously for vigorous depth estimation without
presenting any window measure related SFF issues, and
depth discontinuities. We likewise presented B-spline
addition for the depth approximation, regarding shape
smoothness and depth discontinuities. We assess the
execution of our new approach by broad analyses with
profoundly synthetic images and real time images captured
by Logitech C920.
focus measure window size. However using huge window
sizes in focus measure produces mixed up results around
depth discontinuities. Focus measure is a local property,
normally assessed in a little 2D window around the
purpose of intrigue.
Another real issue with the conventional SFF techniques is
called edge bleeding. This influences the image regions
even at impeccable focus and it can't be effortlessly tended
to by conventional SFF strategy. Errors because of edge
bleeding can be lessened by expanding focus measure
produces mistaken outcomes around depth discontinuities.
Error because of edge draining can be decreased by
expanding focus measure window sizes. In any case,
utilizing larger window sizes in focus measure produces
mistaken outcomes around depth discontinuities.

In this paper we first recommend another versatile focus

1. INTRODUCTION
Recouping the 3D structure of a scene from multiple
images is one of the principles investigate area of machine
vision. Shape from focus is the customary methodologies
which utilize the concentration as a cue for depth
extraction of a scene. The SFF gauges the depth via
hunting down the best focused scene from images set
brought with various focus settings. For every image in the
succession, the nature of focus is figured and the best
focused image in the arrangement is resolved for every
pixel.SFF can be acted like an issue of measuring the focus
quality of image pixels. Although there are distinctive SFF
approaches, such as every one of them utilize local
windows to gauge the focus quality since it is extremely
hard to quantify the focus quality utilizing a solitary pixel.
The local window approach expects that the surface of the
articles in the scene can be approximated surface patches
parallel to the image plane. This supposition not generally
legitimate in this present reality since question protest
surfaces can have extremely complex structure including
depth discontinuities and non-equifocal surfaces. As an
outcome the ordinary SFF strategy neglects to yield
accurate outcomes about around depth discontinuities and
inclined surfaces. Another issue with SFF strategy is edge
Volume 6, Issue 2, March April 2017
measure that can specifically bring about enhanced Depth
maps. Focus measure is installed in straight space crossed
by image derivatives with various orders and directions.
Focus measure regularly utilize image derivatives as high
as second request, our casing work permits utilizing
extensively high order derivatives observed to be viable.
Shape from focus pipeline incorporates additionally steps.
Calculation of focus measure per pixel in the picture stack
yields the focus volume. At that point normally noise and
errors are filter out from the volume by total, before depth
extraction. In this way use non-linear filtering in the focus
volume by adaptively changing the kernel size and
weights. At long last the depth extraction can be performed
by setting the depth values at each indicate concurring the
greatest focus level. Surface guess strategies scarcely adapt
up to sharp depth discontinuities because of the
smoothness imperatives. In this we employ B-spline
interpolation for depth estimation.
II.ADAPTIVE FOCUS MEASURING
The focus measure for an image pixel is figured over a
limited support window in customary SFF [4][7] with the
supposition that depth of the scene ought not change inside
the window. To be free from edge bleeding and to deal
with noise and homogeneous picture parts. The extent of
Page 36
 International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 6, Issue 2, March - April 2017
the window must be sufficiently huge. Nonetheless, bigger
bolster windows situated on depth discontinuities contain
pixels from different depths which disregard the equifocal
surfaces presumption. Subsequently, depth estimation
around these districts would be in precise.
So as to recoup depth of surfaces around homogeneous and
uproarious districts as well as around depth discontinuities,
a legitimate bolster window ought to be chosen for every
pixel adaptively. Expecting that image attributes contains
signals about scene structure, it is conceivable to create an
adaptive support window for every pixel in view of the
local image qualities.
We have to assess intensity assortments of the whole
image. Sadly, ordinary cameras with huge gap focal points
tend to obscure image regions around depth discontinuities
not withstanding for impeccably focused surfaces,
subsequently it is unrealistic to fabricate adaptive support
window from partially focused images in the succession.
Rather than utilizing partially focused images, we utilized
the all-focused image to produce image setting subordinate
adaptive support windows. Take note of that utilizing the
all-focused image does not add any computational
intricacy to the framework.
Adaptivity of window is accomplished by doling out
weights to every pixel in the support window. Distinctive
support windows are computed for every pixel in the all-
focused picture. The weights are allocated to the support
window pixels as per closeness and vicinity scores
between the pixels encased by the window and the pixels
for which window is registered. Comparable and close
pixels get larger weights in the presumption that most
likely lies on a similar surface. Weights of the support
window x0,y0 based on the pixel x0,y0 are processed
utilizing all-focused image If as per the accompanying
equation[1,2]
d I f
( )
1 2
x 0, y 0 ( x, y) e
Where d = ( x x0 ) ( y y0 ) 2 , ( x, y ) x 0, y 0
d is Euclidian distance in spatial domain, I is Euclidian
distance in color space and 1, 2 are constant parameters
to supervise relative weights.
Utilizing one of the standard focus measure operators (FM)
initial focus measures are processed for all partially
focused images. At that point the new focus measure
(AFM) for pixel x0,y0 is figured utilizing support window
delivered utilizing equation1.
AFM ( x0 , y0 )
( x , y ) x 0 , y 0
x 0, y 0 ( x, y ) FM
The best focused frame can be obtained by applying by
applying new AFM for each image in the sequence.[1,2]
III.B-SPLINE INTERPOLATION
In this paper we implemented cubic B-Spline polynomial
to evaluate perfect depth by interpolating best focused
frames obtained by new AFM. Interpolation is the process
of determining the values of a function at positions lying
Volume 6, Issue 2, March April 2017
ISSN 2278-6856
between its samples. It achieves this process by fitting a
continuous function through the discrete input samples.
This permits input values to be evaluated at arbitrary
position. Whatever point you go for some interpolation, we
need to make utilization of certain interpolation functions
and this interpolation operation of the interpolation
functions ought to fulfill certain conditions.
The conditions are; the interpolation function should have
a finite region of support. That means when we do the
interpolation, we should not consider the sample values
from say minus infinity to plus infinity. Then the second
property which this interpolation operation must satisfy is
it should be a smooth interpolation. That means by
interpolation, we should not introduce any discontinuity in
the signal. Then the third operation, the third condition that
must be satisfied for this interpolation operation is that the
interpolation must be shift invariant. B-Spline interpolation
functions satisfy all these 3 properties which are desirable
properties for interpolation.
So for interpolation, what we use is say f(t) should be
equal to some pi into Bik(t) where I vary from 0 to say n
where pi indicates the ith sample and Bik is the interpolation
function.
n
f (t ) Pi Bi , k (t ) -------------------- (3)
i 0
Where (t ti ) Bi , k 1 (t ) (ti k t ) Bi 1, k 1 (t )
Bi , k
t1 k 1 t1 ti n ti 1
Bi ,1 (t ) 1 ti t ti 1
=0 otherwise
Here we find the region of support for Bi,1 is just 1 sample
interval. For Bi,2, the region of support is just 2 sample
intervals. For Bi,3, it is 3 samples intervals and for Bi,4 ,it is
4 sample intervals. The quadratic one is for the esteem k
equivalent to 3, it is ordinarily not utilized on the grounds
that this does not give a symmetric interpolation. Whereas,
(1) using the other 3 that is Bi,1, Bi,2, Bi,4, we can get symmetric
interpolation.nth degree of B-Spline polynomial can be
calculated by using n convolution of box filter. The cubic
B-Spline can be defined as
B0 , 4 (t ) ----------- (4)
t2
0 t 1
6
3t 12t 12t 4 1 t 2
2 2
6
4 t2
3t 0
6
0otherwise
The positivity of the kernel is alluring for depth
(2)
approximation. When utilizing part with negative lobes, it
is conceivable to produce negative qualities while inserting
positive information. Since negative intensity qualities are
good for nothing for show, it is alluring to utilize entirely
positive interpolation kernel to ensure the energy of the
introduced image [5].
Page 37
 International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 6, Issue 2, March - April 2017 ISSN 2278-6856

IV.RESULT Figure 2: Depth map of real time images capture by

With a specific end goal to test and check exactness and Logitech C920 camera
adequacy of our strategy, we performed experiments on
synthetic images of various focus levels. Furthermore, real Table 1: Performance evaluation through statistical
time images of different focus levels captured by Logitech parameters.
C920 camera. We tried our technique additionally difficult S. Param Data base Images captured by Logitech
real scenes including sharp depth discontinuities. Five no eter images C920 camera
arrangements of test images were captured in the lab . Fig Fig Fig Fig Fig Fig Fig
utilizing a real camera Logitech C920. For each set, 30 ure ure ure ure ure ure ure
images were gotten with various focus levels. We 1 2 1 2 3 4 5
ascertained the RMSE errors and statistical parameters 1. RMSE 0.0 0.0 0.1 0.0 0.0 0.1 0.1
between our outcome and ground truth esteem. 98 65 41 95 77 19 30
2. MSE 0.0 0.0 0.0 0.0 0.0 0.0 0.0
09 04 20 09 06 14 17
3. PSNR 68. 71. 65. 68. 70. 66. 65.
24 76 11 50 34 57 81
4. Norma 0.6 0.8 0.5 0.7 1.1 0.6 0.5
lised 88 09 30 49 48 16 72
cross-
correla
tion
5. Averag 0.0 0.0 0.0 0.0 0.0 0.0 0.0
e 28 31 89 21 25 27 37
differe
nce
6. Structu 1.5 1.3 2.4 1.2 0.5 1.6 1.8
ral 58 20 38 25 74 85 96
content
7. Maxim 0.4 0.1 0.4 0.4 0.2 0.5 0.4
um 38 48 28 25 85 22 67
differe
nce
8. Absolu 0.2 0.3 0.5 0.4 0.5 0.5 0.5
te error 42 30 05 35 15 26 31

V.CONCLUSION
We present another context work for shape from focus
based around the all-focused image to deliver image
setting subordinate adaptive support windows for focus
measure with novel weighting function yields an adaptive
focus quality measure that adapts to challenges in SFF, for
example, image bleeding, as high intensity forces, texture
variety and depth discontinuities. Also, to acquire
smoothing and we received B-spline interpolation
procedure with this we can ready to get depth extraction.

VI ACKNOWLEDGEMENT

The author would like to thank the reviewers for their time
in reviewing to this paper. They would like to thank
(http://en.pudn.com/ downloads784/doc/
detail3102556_en.html) for providing images of figure2
and figure3.

Figure1: Depth map of data base images

Volume 6, Issue 2, March April 2017 Page 38

 International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org
Volume 6, Issue 2, March - April 2017 ISSN 2278-6856

References
[1] Yuval frommer , Rami Ben-Ari and Nahum Kiryati.
Shape from focus with adaptive focus measure and
high order Derivatives,BMVC,2015.
[2] Tarkan Aydin,Yusuf sinan Akgul. A new adaptive
focus measure for shape from focus,BMVC 2008.
[3] M.subbarao and Tao Choi. Accurate recovery of three-
dimensional shape from image focus. Pattern Analysis
and machine intelligence,IEEE Transaction on
17(3):266-274,March 1995.
[4] M.T.Mahmood,T.S.Choi,K.Young,andS.O.Shim.
Estimating shape from focus by Gaussian process
regression.IEEE International conference on
systems,man and cybernetics,1:1345_1350,2012.
[5] Michael Unser: Splines- A perfect fit for signal and
image processing, IEEE signal processing
Magazine,November 1999,PP. 22-38.
[6] R. Sakurai. Iris filters. http://WWW.reiji.net/,2004.
[7] S.Pertuz,D.Puig,and M.A.Garcia. Ananlysis of focus
measure operators for shape-from-focus. Pattern
recognition,46(5):1415-1432,2013.
[8] Y.Y.Schechner and N.Kiryati.Depth from defocus
vs.stereo:How differently really are they international
journal of computer vision,39(2):141-162,2000.
[9] D.Scharstein and R.Szeliski. Ataxonomy and
evaluation of dense two-frame stereo correspondence
algoithums.International journal of computer
vision,47(1-3):7-42,April 2002.
[10]L.Zhang and S.K.Nayar, projection Defocus Analysis
for Display.ACM Trans.on Graphics(also proc.of
ACM SIGGRAPH),jul 2006.

Volume 6, Issue 2, March April 2017 Page 39