Research Article Integral Equation-Wavelet Collocation ...Phase .First,thepartialdi...
Transcript of Research Article Integral Equation-Wavelet Collocation ...Phase .First,thepartialdi...
-
Research ArticleIntegral Equation-Wavelet Collocation Method for GeometricTransformation and Application to Image Processing
Lina Yang,1,2 Yuan Yan Tang,1,3 Xiang Chu Feng,4 and Lu Sun5
1 Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Macau2Department of Mathematics and Computer Science, Guangxi Normal University of Nationalities, Chongzuo 532200, China3 College of Computer Science, Chongqing University, Chongging 40030, China4Department of Mathematics, Xidian University, Xiβan 710126, China5 Sichuan Sunray Machinery Co., Ltd., Deyang 618000, China
Correspondence should be addressed to Yuan Yan Tang; [email protected]
Received 28 August 2013; Accepted 13 February 2014; Published 1 April 2014
Academic Editor: M. Mursaleen
Copyright Β© 2014 Lina Yang et al.This is an open access article distributed under theCreativeCommonsAttributionLicense,whichpermits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Geometric (or shape) distortion may occur in the data acquisition phase in information systems, and it can be characterized bygeometric transformation model. Once the distorted image is approximated by a certain geometric transformation model, we canapply its inverse transformation to remove the distortion for the geometric restoration. Consequently, finding a mathematical formto approximate the distorted image plays a key role in the restoration. A harmonic transformation cannot be described by any fixedfunctions in mathematics. In fact, it is represented by partial differential equation (PDE) with boundary conditions. Therefore, todevelop an efficient method to solve such a PDE is extremely significant in the geometric restoration. In this paper, a novel wavelet-based method is presented, which consists of three phases. In phase 1, the partial differential equation is converted into boundaryintegral equation and representation by an indirect method. In phase 2, the boundary integral equation and representation arechanged to plane integral equation and representation by boundary measure formula. In phase 3, the plane integral equation andrepresentation are then solved by a method we call wavelet collocation. The performance of our method is evaluated by numericalexperiments.
1. Introduction
Geometric (or shape) distortion may be produced in the dataacquisition phase in pattern recognition, computer vision,and robot vision systems, and it can be characterized bygeometric transformation model [1, 2]. An obvious exampleof such a distortion can be found in a photograph taken by acamera in a computer vision system. In the acquisition phaseshown in Figure 1, the trade mark βCokeβ is printed on aCoca-Cola bottle, due to the cylindrical shape of the bottle,and the square shape of the trade mark has been changed.This kind of distortion can be characterized by a geometrictransformationmodel, specifically, the biquadratic geometrictransformation model in this example [2].
An image is displayed by a set of coordinate points; hence,a geometric transformation can be viewed as the procedure
for calculating new coordinate positions of these points undera certain model. The geometric transformation is defined by
π : (π₯1, π₯2) β (π’, V) , (1)
such that
π’ = π’ (π₯1, π₯2) , V = V (π₯
1, π₯2) . (2)
Through this transformation, an image in Cartesian coordi-nates π₯
1ππ₯2is transformed into a new image in Cartesian
coordinates π’πV as shown in Figure 2. The properties of thetransformation π are determined by functions π’ = π’(π₯
1, π₯2)
and V = V(π₯1, π₯2); that is different functions can produce
different kinds of geometric transformations.There aremanymodels of the geometric transformations,
which have been widely used in many disciplines [1β4]. In
Hindawi Publishing CorporationAbstract and Applied AnalysisVolume 2014, Article ID 798080, 17 pageshttp://dx.doi.org/10.1155/2014/798080
-
2 Abstract and Applied Analysis
750mL
Figure 1: Example of the biquadratic geometric transformation.
our previous work, they are categorized into twomain classes[1, 2]. If the function is fixed, we call it a fixed transformationmodel; otherwise we call it an elastic transformation model.The former consists of linear and nonlinear models includingbilinear, quadratic, biquadratic, cubic, and bicubic models,while the latter comprises Coonsmodel and harmonicmodel.These transformation models can be summarized as follows[2]:
(A) fixed models:
(1) linear models(a) translation,(b) rotation,(c) scaling,
(2) nonlinear models:(a) bilinear model,(b) quadratic model,(c) biquadratic model,(d) cubic model,(e) bicubic model,
(B) elastic models
(1) coons model,(2) harmonic model.
Generally speaking, by the fixedmodels, a standard imagecan be transformed into some special shapes. An exampleof the fixed transformation can be found in Figure 1. Moreprecisely, a fixed transformation has a certain mathematicalform to approximate it, which can be described by a fixedclass of mathematical functions. In our previous work [1, 2],some significant forms (models) and algorithms have beendeveloped to handle these geometric transformations. For
example, the geometric transformation in Figure 1 can beapproximated by the biquadraticmodel, and itsmathematicalfunction can be written as
[π’
V] = [[1 β π₯1 π₯1] 0
0 [1 β π₯1 π₯1]]
Γ[[[
[
[ππ1
ππ4
ππ2
ππ3
]
[ππ1
ππ4
ππ2
ππ3
]
]]]
]
[1 β π₯2
π₯2
] ,
(3)
where πππ
and πππ
(π = 1, 2, 3, 4) denote the new coordinatesof the vertices in the quadrangle, which is a distorted imageof the trade mark βCokeβ in Figure 1.
Once the distorted image is approximated by a certaingeometric transformation model, its inverse transformationcan be applied to remove the distortion for the geometricrestoration. Look at Figure 3, the original trade mark βCokeβis shown in Figure 3(a), and its distorted images are displayedin Figure 3(b). When the inverse biquadratic transformationis applied to these images, the normalized images can beproduced and illustrated in Figure 3(c), which aremuchmoreeasy to be recognized by a recognition system.
Consequently, finding a mathematical form to approxi-mate the distortion of a distorted image plays a key role forthe restoration.
Unfortunately, the harmonic geometric transformationmodel, which converts an image into arbitrary shape, doesnot have any fixed mathematical forms. An example canbe found in Figure 4, where the image of Canadian flag isdistorted as shown in Figure 4(b). Note that the shape ofthe flag is changed, which is so complex that it cannot bedescribed by any fixedmodel; that is, it cannot be representedby any fixed functions in mathematics. In fact, this modelis characterized by other kinds of mathematical formula,that is, partial differential equation. Unlike solving a fixedmathematical formula, solving a partial differential equationis difficult.
The harmonic transformation model is the most impor-tant and most complicated one in the geometric transforma-tion models. Actually, all of the other models can be in it.The harmonic model is represented by the partial differentialequation (PDE) with boundary conditions.
LetΞ© be the region of the elastic plane, where the image islocated, and let Ξ be its boundary. Suppose that the functionsof the transformation of boundary Ξ are π’ = π(π₯
1, π₯2) and
V = π(π₯1, π₯2). The harmonic transformation
π : (π₯1, π₯2) β (π’, V) (4)
satisfies the partial differential equation:
Ξπ’ (π₯1, π₯2) = 0, (π₯
1, π₯2) β Ξ©,
π’|Ξ= π (π₯
1, π₯2) , (π₯
1, π₯2) β Ξ,
ΞV (π₯1, π₯2) = 0, (π₯
1, π₯2) β Ξ©
V|Ξ= π (π₯
1, π₯2) , (π₯
1, π₯2) β Ξ,
(5)
-
Abstract and Applied Analysis 3
u
οΏ½
O O
x2
x1
T
Figure 2: An image in Cartesian coordinates π₯1ππ₯2is transformed into a new image in Cartesian coordinates π’πV by geometric
transformation π.
(a)
(b) (c)
Figure 3: Restoration of image from the biquadratic distortion byinverse transformation.
where
Ξ :π2
ππ₯2
1
+π2
ππ₯2
2
(6)
is Laplaceβs operator; thus the above partial differentialequation is called Laplaceβs equation or harmonic equation.
Accordingly, the task of the restoration is solving theabove harmonic equation.We return to the previous exampleas shown in Figure 4, and the distorted image in Figure 4(b)can be approximated by harmonic transformation. As thecorresponding harmonic equation is solved and its inversetransformation is utilized, the restored image can be obtainedin Figure 4(c). Therefore, solving the harmonic equation (5)plays a key role in the geometric restoration.
This paper proposes a novel approach based on waveletanalysis to handle the harmonic transformation.
The paper is organized as follows. The existing methodsare reviewed in Section 2. The core of the proposed wavelet-based approach is presented in Section 3. As the first stepof this method, in Section 3.1, the conversion of the partialdifferential equation into boundary integral equation andrepresentation is discussed. Two integral methods can beapplied; here the indirectmethod is chosen and the boundaryintegral equation of the first kind is produced. In Section 3.2,
the boundary measure formula, which can change theforms of integral equation and integral representation fromboundary to the plane, is presented. Based on the new forms,the wavelet collocation method is used to solve the equation,which is the main task in Section 3.3. A couple of algorithmsof IEWC are provided in Section 4. The experiments areillustrated in Section 5. Finally, the conclusions are given inSection 6.
2. Review of the Existing Methods
Two successful approaches have been used to solve this kindof partial differential equation, namely, finite elementmethod[5] and finite difference method [6]. In our previous work[2], the finite element method has been employed solving theequation to handle the harmonic transformation, which givesthe following algorithm.
Algorithm 1 (finite element method). One has the following.
Step 1 (discrete region Ξ©). Divide region Ξ© by many smalltriangular elements π
πsuch thatΞ© β βͺ
πππ. For example, region
Ξ© in Figure 5 is divided into twenty two triangular elementsbased on twelve dots, which produce a lattice Ξ .Step 2 (discrete solution π’). Use piecewise linear function π’
β
to approximate the original solution π’. Because π’βis linear in
each triangular element, therefore π’βis fully determined by
the values at latticeΞ . To determine these values, replacing π’with π’
βin the variational form of the equation produces a set
of linear equations
πΎπ’β= πβ, (7)
where the elements in vector π’βare the values of π’
βat lattice
Ξ , πΎ is a known matrix, and πβis a right-hand side vector.
Step 3 (consider the boundary conditions). Find the boundarydots on latticeΞ , and thereafter, the values of π’
βon these dots
are assigned to satisfy boundary condition π(π₯1, π₯2), which
-
4 Abstract and Applied Analysis
Tβ1T
β1
(a) (b) (c)
Figure 4: Harmonic distortion and restoration.
11 12
9
8
7
6
5
1
32
4
5
6
7
8
9
11 12
1010
32
1
4
T
Ξ©
Ξ©
Figure 5: Finite element method.
can be done by modifying the matrix πΎ and the right-handside π
βin the equationsπΎπ’
β= πβ.
Step 4 (solve equations). Solve the linear algebraic equationsand finally obtain π’|
Ξ β π’β|Ξ = π’β, where π’|
Ξ indicates the
value of π’ at lattice Ξ .In our example, shown in Figure 5, twelve values at lattice
Ξ are to be determined, seven dots are on the boundary, andthe correct values of π’
βat these seven boundary dots (dots
1 to 7) are given due to the boundary condition π(π₯1, π₯2).
The values at remainder five inner dots (dots 8 to 12) will beobtained by solving the linear equations.
The finite difference method is another common way tosolve partial differential equation numerically. It can changethe partial differential equation into a set of correspondingalgebraic linear equations. The details can be found in [6].
Both the finite element method and finite differencemethod have some defects when they will be used in ourcases. For example, two issues of the weakness will occurwhen the finite element method is applied to the harmonictransformation.
(i) It depends on the lattice Ξ . In finite element method,the values of all points at lattice Ξ are solved, eventhough some points do not lie on the image. Forexample, in Figure 5, the values of all points at lattice,say points 8β12, are solved.However, only three points(8β10) are the pixels of the pattern, English letterβA.β The values of these points are required to be
transformed, while the values of the remainder twopoints (11 and 12) are not required to be transformed.
On the other hand, the values of some pixels on thepattern but not at the lattice are still unknown aftersolving πΎπ’
β= πβ. For example, in Figure 5, most
of the pixels of letter βA,β which are required to betransformed, are not at the lattice. Thus, the values ofthese pixels are unknown in solution of π’|
Ξ β π’β|Ξ =
π’β. Consequently, the interpolation will be used to
approximate these values. In this way, the extra costand error will be brought in.
(ii) More attention must be paid to deal with theboundary conditions. Specifically, for a given lattice,we should know which dots are on the boundaryand assign them the values satisfying the boundaryconditions, as mentioned in Step 3 of Algorithm 1.Therefore, the program code of the lattice and thelinear equations is required to be modified, when thedomain or lattice is changed.
Thus, more efficient methodmust be developed to handlethe geometric transformation. In this paper, a novel approachcalled Integral Equation-Wavelet Collocation (IEWC) is pre-sented.
-
Abstract and Applied Analysis 5
Partialdifferentialequation
representation
Boundary integral Plane integralequation and
plane integralrepresentation
boundary integralequation and Solution
Phase 1 Phase 2 Phase 3
Figure 6: Diagram of the new approach.
3. Integral Equation-Wavelet Collocation(IEWC) Approach
This is the core section of the paper; a novel approachbased on the integral equation and wavelets, called IntegralEquation-Wavelet Collocation (IEWC), is presented in thissection.
The diagram of the newmethod is shown in Figure 6.Thebasic idea of the method is briefly described in Figure 6.
Phase 1. First, the partial differential equation (PDE) (Laplaceβsequation) is changed into the form of integral equationand integral representation on boundary Ξ, which are calledboundary integral equation (BIE) and boundary integral rep-resentation (BIR), respectively. There are two ways to do so,namely, direct method and indirect method [7, 8]. In thispaper, the indirect method is utilized. Mathematically, theprocess for solving π’ can be written as follows:
PDE : {Ξπ’ (π₯1, π₯2) = 0, β (π₯1, π₯2) β Ξ©π’|Ξ= π (π₯
1, π₯2) , β (π₯
1, π₯2) β Ξ,
β Boundary Integral (Indirect) Method β
BIE : β«Ξ
π (π¦) log π₯ β π¦ ππ π¦ = π (π₯) , β (π₯1, π₯2) β Ξ
BIR : π’ (π₯) = β«Ξ
π (π¦) β β β ππ π¦, β (π₯
1, π₯2) β π,
(8)
where π(π¦) is a unknown function, which can be solved inBIE and will be used in BIE. ππ
π¦indicates the curvilinear
integrate with respect to variable π¦ = (π¦1, π¦2). The first
shortcoming, which arises in the finite element method, canbe overcome by this way.
Similarly, V can also be obtained in the same way, whichwill be omitted to save the space. In the remainder of thispaper, we only discuss π’.
Phase 2. In order to solve the boundary integral equation(BIE) efficiently and to get rid of the second defect in thefinite element method, the boundary measure formula (BMF)is used. It changes the boundary integral equation and bound-ary integral representation into an integral equation and anintegral representation on the whole plane π 2 rather than thespecial boundary Ξ. They are called plane integral equation(PIE) and plane integral representation (PIR), respectively. Inthis way, when Ξ is changed, the program code will not to be
modified at all. In mathematics, this process can be presentedin the following:
BIE : β«Ξ
π (π¦) log π₯ β π¦ ππ π¦ = π (π₯) , β (π₯1, π₯2) β Ξ
BIR : π’ (π₯) = β«Ξ
π (π¦) β β β ππ π¦, β (π₯
1, π₯2) β π
β BoundaryMeasure Formula (BMF) β
PIE : β«π 2
π (π¦) βπΞ©β log π₯ β π¦ ππ π¦ = π (π₯) ,
β (π₯1, π₯2) β Ξ
PIR : π’ (π₯) = β«π 2
π (π¦) βπΞ©β β β β ππ π¦, β (π₯1, π₯2) β π,
(9)
where βπΞ©β stands for the boundary measure, which will bediscussed in Section 3.2.
Phase 3. Then, wavelet collocation technique is used to solvethe plane integral equation. In the integral equation, theintegrandhas a discontinuity across boundary Ξ. Hence, thereis a kind of singularity in it. Fortunately, wavelets have agood property to approximate this kind of singularity. Morespecifically, suppose that we have a function π, which has adiscontinuity across curve Ξ; otherwise it is smooth. When astandard Fourier representation is applied to approximate πwith the bestπ nonzero Fourier terms, ππΉ
π, we have
π β π
πΉ
π
2
2β πβ1/2
, π β β. (10)
When a wavelet representation is used to approximateπwiththe bestπ nonzero wavelet terms, πW
π, we can obtain
π β π
π
π
2
2β πβ1, π β β. (11)
Note that if we compare the right-hand sides of the abovetwo equations, that is, πβ1/2 and πβ1, it is clear that the rateof the approximation is very slow when Fourier approachis utilized, and the rate of wavelet approximation is betterthan that of Fourier approximation. Moreover, until now, thewavelet approach is the best result for a fixed nonadaptivemethod [9].
The last step is the choice of the points to be transformedin the domain and calculate the new coordinates of them by
-
6 Abstract and Applied Analysis
integral representation. The mathematical representation ofthese operations can be illustrated as follows:
PIE : β«π 2
π (π¦) βπΞ©β log π₯ β π¦ ππ π¦ = π (π₯) ,
β (π₯1, π₯2) β Ξ
PIR : π’ (π₯) = β«π 2
π (π¦) βπΞ©β β β β ππ π¦, β (π₯1, π₯2) β π
β Wavelet Collocation (WC) Technique β
β
π,π
βπ
(π,π)β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯π β π¦
ππ¦
β π (π₯π) = 0, β (π₯
1, π₯2) β Ξ
π’π(π₯) = β
π,π
βπ
(π,π)β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) β β β ππ¦,
β (π₯1, π₯2) β π
ββ
Solutions.
(12)
The principal advantages of our method are as follows.
(i) The algorithm is divided into two parts, integralequation and integral representation. After solvingthe plane integral equation, we can choose the pixelsto be transformed in the domain arbitrarily and useplane integral representation to evaluate their newcoordinates. Therefore, only the pixels on the patternare transformed to the new coordinate space. InFigure 2, for example, we will choose all pixels oncharacters βCoke,β and find the new coordinates ofthem by the integral representation.
(ii) The program code is independent of the domainconsidered; that is, the program code will require nochange for the different kind of boundaries. It benefitsfrom the boundary measure formula. In fact, we donot need the function of boundary Ξ at all. What wereally need are the original coordinates of the pixels atthe boundary and the coordinates of the new ones.
Finally, the summary of this novel approach can be illustratedin the following mathematical expression:
PDE : {Ξπ’ (π₯1, π₯2) = 0, β (π₯1, π₯2) β Ξ©π’|Ξ= π (π₯
1, π₯2) , β (π₯
1, π₯2) β Ξ,
ββ
Boundary Integral (Indirect) Method
ββ
BIE : β«Ξ
π (π¦) log π₯ β π¦ ππ π¦ = π (π₯) , β (π₯1, π₯2) β Ξ
BIR : π’ (π₯) = β«Ξ
π (π¦) β β β ππ π¦, β (π₯
1, π₯2) β π
ββ
BoundaryMeasure Formula (BMF)
ββ
PIE : β«π 2
π (π¦) βπΞ©β log π₯ β π¦ ππ π¦ = π (π₯) ,
β (π₯1, π₯2) β Ξ
PIR : π’ (π₯) = β«π 2
π (π¦) βπΞ©β β β β ππ π¦, β (π₯1, π₯2) β π
ββ
Wavelet Collocation (WC) Method
ββ
β
π,π
βπ
(π,π)β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯π β π¦
ππ¦ β π (π₯π) = 0,
β (π₯1, π₯2) β Ξ
π’π(π₯) = β
π,π
βπ
(π,π)β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) β β β ππ¦,
β (π₯1, π₯2) β π
ββ
Solutions .(13)
3.1. Boundary Integral Method. According to the boundaryintegral method, the first phase of the IEWC converts thepartial differential equation (PDE) (5) which is recalledbelow,
Ξπ’ = 0, βπ₯ = (π₯1, π₯2) β Ξ©,
π’|Ξ= π (π₯
1, π₯2) , βπ₯ = (π₯
1, π₯2) β Ξ,
(14)
into a boundary integral equation (BIE) and a boundaryintegral representation (BIR).
There are two kinds of boundary integral equations,namely, (1) integral equation of the first kind and (2) integralequation of the second kind.
If the equation takes the form of
β«Ξ
πΎ(π₯, π¦) π’ (π¦) ππ π¦= π (π₯) , βπ₯ = (π₯
1, π₯2) β Ξ, (15)
it is called integral equation of the first kind, whereπΎ(π₯, π¦) andπ(π₯) are known functions andππ
π¦indicates the integratewith
variable π¦ = (π¦1, π¦2). Otherwise, the equation with the form
ππ’ (π₯) β β«Ξ
πΎ(π₯, π¦) π’ (π¦) ππ π¦= π (π₯) , βπ₯ = (π₯
1, π₯2) β Ξ
(16)
is called an integral equation of the second kind, where π is aknown constant.
Most of the researchers work on the integral equationsof the second kind in both of the theories and applications,because some integral equations of the first kind are quite ill-conditioned; that is, the speed of the convergent will be slow if
-
Abstract and Applied Analysis 7
an iterative algorithm is used.However, the integral equationsof the first kind have been an increasingly popular approachto solve various boundary value problems [7]. In this paper,the boundary integral equations of the first kind are appliedto facilitate the use of the boundary measure formula, as wellas the further application of the wavelet collocation method.
Furthermore, there are two ways to convert the partialdifferential equation (PDE), into the boundary integral equa-tion of the first kind, namely, (1) direct method and (2) indirectmethod [7, 8]. They will briefly be presented in the following.
(1) Direct Method. In this method, based on Greenβs formula,
β«Ξ©
β β FπΞ© = β«Ξ
F β nππ, (17)
where β = π/ππ₯1+ π/ππ₯
2, F = (π
1(π₯), π2(π₯)), π₯ = (π₯
1, π₯2),
and n is the unit outer normal vector; the partial differentialequation (5) can be changed to a system with a boundaryintegral equation and a boundary integral representation.Thereafter, the following main steps are done.
Step 1. Solve the integral equation to find π on Ξ suchthat
β«Ξ
π (π¦) log π₯ β π¦ ππ π¦
= βππ (π₯) + β«Ξ
π (π¦)π
ππlog π₯ β π¦
ππ π¦,
βπ₯ = (π₯1, π₯2) β Ξ.
(18)
Step 2. βπ₯ β Ξ©, calculate π’(π₯) by formula
π’ (π₯)
=1
2πβ«Ξ
(π (π¦)π
ππlog π₯ β π¦
β π (π¦) logπ₯ β π¦
) ππ π¦.
(19)
(2) Indirect Method. This method is based on the potentialtheory, and the procedure of solving (5) is presented in thefollowing.
Step 1. Solve the integral equation to find π on Ξ suchthat
β«Ξ
π (π¦) log π₯ β π¦ ππ π¦ = π (π₯) , βπ₯ = (π₯1, π₯2) β Ξ. (20)
Step 2. Calculate π’(π₯) by formula
π’ (π₯) = β«Ξ
π (π¦) log (π₯ β π¦) ππ π¦, βπ₯ = (π₯1, π₯2) β Ξ©.
(21)
It is obvious that either the pair of (18), (19) or (20), (21)is equivalent to (5).The latter is utilized in this paper, becausethe right-hand sides of these equations are very simple and
can be solved easily. Furthermore, to ensure the uniquenessof the solution, we tacitly assume that the interior of domainΞ© has the property of
diameter (Ξ©) < 1. (22)
As to the existence of the solution, [10] has proved that (20)is equivalent to
β«Ξ
π (π¦) log π₯ β π¦ ππ π¦ = π (π₯) + π, βπ₯ β Ξ,
β«Ξ
π (π¦) ππ π¦= π΄,
(23)
and for arbitrary function π and constant π΄, (23) has uniquesolutions π and π, which ensures that (20) is of viability (i.e.,unique solvable).
The above discussion gives us a hint that we can firstobtain the dataπ from (20) and then use (21) to calculate π’(π₯)at any pixel π₯ = (π₯
1, π₯2) in the domain Ξ©. Note that the pixel
π₯ β Ξ© is chosen arbitrarily in the integral representation,which makes us free from the lattice built in either the finiteelement method or finite difference one.
If the function of the boundary can be determined, that is,Ξ is parameterized, (20) can be changed into one-dimensionalintegral equation on a closed interval. Thereafter, it can besolved by the classical methods or periodic wavelet method[11β16]. In this way, the program code is dependent on therepresentation of curve Ξ. Unfortunately, inmost of the cases,the function of the boundary is unknown as wementioned inSection 1. In order to develop a newmethod, which can avoidknowing the function of boundary Ξ, the boundary measureformula is utilized in our study to change the forms of (20)and (21) into other suitable forms.
3.2. Boundary Measure Formula. Based on the boundarymeasure formula, the second phase of the IEWC convertsthe boundary integral equation (BIE) and boundary integralrepresentation (BIR) into the plane integral equation (PIE)and plane integral representation (PIR).
Assume thatΞ© is a bounded domain inπ 2, whose bound-ary Ξ can be presented by Lipschitz function πΉ(π₯
1, π₯2) = π,
and πΞ©denotes its characteristic function, which has value 1
if the point (π₯1, π₯2) is in domain Ξ©; otherwise is 0. The unit
normal vector along Ξ can be written as
n = βπΉ|βπΉ|
, (24)
where βπΉ is the gradient of πΉ and |βπΉ| stands for itsnorm.They can generalize the vector-valuedmeasure and theRadonmeasure, respectively, ifπΉ is only of bounded variationover domain Ξ© [17]. Hence, the boundary measure formulacan be described below.
Theorem 2. For any integrable function π defined on Ξ, afterextending π from Ξ to π 2, we have
β«Ξ
πππ = β«π 2
π βπΞ©β ππ₯, (25)
where βπΞ©β = ββπΞ©β n is called boundary measure.
-
8 Abstract and Applied Analysis
Proof. In fact, we can derive
β«Ξ
πππ = β«Ξ
πn β nππ
= β«Ξ©
βπ β nππ₯ + β«Ξ©
π div nππ₯
= β«π 2
βπ β πΞ©nππ₯ + β«
π 2
ππΞ©div nππ₯
= β«π 2
βπ β πΞ©nππ₯ β β«
π 2
β (ππΞ©) β nππ₯
= ββ«π 2
πβπΞ©β nππ₯
= β«π 2
π βπΞ©β ππ₯.
(26)
This establishes (25).
Reference [18] has proved that the gradient of the char-acteristic functions βπ
Ξ©and n can be approximated by
Daubechies scale or wavelet function in the Sobolev spaceπ»β1(Ξ©) or spaceπ»1(Ξ©), respectively. That ensures that
π βπΞ©β = βπβπΞ© β n (27)
can be approximated byDaubechies scale or wavelet functionif π is integrable. We will use this formula in our newapproach. It should be noted that βπΞ©β = ββπ
Ξ©β n
has singularities along boundary Ξ, therefore the waveletrepresentation is more effective to handle this problem thanthe Fourier representation due to its sparse representationof singularities. For example, to represent an edge, a type ofsingularity, with error β1/π, roughly speaking, requiresπ2sinusoids in Fourier form but needs only about π waveletitems in wavelet representation. As we discussed in Section 1,the wavelets outperform the classical method. That is themain reason we use wavelet here.
Using the boundarymeasure formula, the boundary inte-gral equation (20) and the boundary integral representation(21) become the following plane integral equation and planeintegral representation:
β«π 2
π¦
π βπΞ©β log π₯ β π¦ ππ¦ = π (π₯) , βπ₯ β Ξ, (28)
π’ (π₯) = β«π 2
π¦
π βπΞ©β log π₯ β π¦ ππ¦, βπ₯ β Ξ©. (29)
Theorem 3. Plane integral representation (29) is the solutionof partial differential equation (5), where π is the solution ofplane integral equation (28).
Proof. The proof of this theorem is omitted in this paper toavoid the complicated mathematics and to save space.
3.3. Wavelet Collocation Technique. Wavelet analysis hasbeen widely applied in image processing [19β22]. In thispaper, the wavelet theory is used in IEWCmethod, in which,
after phase 2, the plane integral equation (PIE) and planeintegral representation (PIR) have been obtained; thereafter,in phase 3, the wavelet collocation technique is employed toarrive the solution.
Let π be the Daubechies scale function and
ππ
π(π‘) = 2
π/2π (2ππ‘ β π) . (30)
Based on the boundary measure formula (25), the task nowis to solve plane integral equation:
β«π 2
π¦
π βπΞ©β log π₯ β π¦ ππ¦ = π (π₯) , βπ₯ β Ξ. (31)
Recall that the support of the gradient of the characteristicfunctionβπ
Ξ©is a compact domain inπ 2; in fact, it is a tubular
neighborhood of Ξ. Therefore, we need only finite number ofscale functions to represent πβπΞ©β = βπβπ
Ξ©β n. Let Ξ be an
index set, and let |Ξ| be the cardinal of Ξ. The key point hereis solving the product πβπΞ©β instead of solving the unknownfunctionπ. In fact, when we know πβπΞ©β, then from integralrepresentation (29), we can obtain π’(π₯) for any π₯ β Ξ©. Thatis why we use integral equation of the first kind in this paper.As πβπΞ©β can be approximated by
(π βπΞ©β)π= β
(π,π)βΞ
βπ
(π,π)ππ
π(π¦1) ππ
π(π¦2) , (32)
substituting πβπΞ©β in (28) with (πβπΞ©β)π produces the errorrepresentation π(π₯):
π (π₯) = β«π 2
π¦
(π βπΞ©β)π log π₯ β π¦
ππ¦ β π (π₯) , βπ₯ β Ξ.
(33)
Choose |Ξ| collocation points {π₯π} β Ξ, and let π(π₯
π) = 0, 1 β€
π β€ |Ξ|, and then we have
π (π₯π) = β«π 2
π¦
(π βπΞ©β)π log π₯π β π¦
ππ¦ β π (π₯π) = 0,
1 β€ π β€ |Ξ| .
(34)
That is,
β«π 2
π¦
(π βπΞ©β)π log π₯π β π¦
ππ¦ = π (π₯π) , 1 β€ π β€ |Ξ| .
(35)
That is,
β
(π,π)βΞ
βπ
(π,π)β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯π β π¦
ππ¦ = π (π₯π) .
(36)
Equation (36) is a set of linear algebraic equations, which canbe rewritten in form of
πΎβ = π, (37)
-
Abstract and Applied Analysis 9
from which, {βπ(π,π)
} is obtained, where matrixπΎ with entriesof |Ξ| Γ |Ξ| is
πΎπ,(π,π)
= β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯π β π¦
ππ¦,
1 β€ (π, π) , π β€ |Ξ| , π₯π β Ξ,
(38)
and the right hand side vector π is
ππ= π (π₯
π) , 1 β€ π β€ |Ξ| . (39)
Remark 4. Note that matrix πΎ does not depend on Ξ, exceptpoints {π₯
π}|Ξ|
π=1that should be chosen on Ξ. Meantime, the
right-hand side in (37) does not need the representation offunction π(π₯), except values {π(π₯
π)}|Ξ|
π=1of the discrete pixels
{π₯π}|Ξ|
π=1on the boundary Ξ. These points are called tiepoints.
It indicates that, in the implementation, the program code isindependent of the boundary.
Remark 5. The condition number of matrix πΎ may be large,because it is from the integral equation of the first kind;thus, usually the Tikhonovβs regularize method is used tosolve it [23]. In our new approach, linear algebraic equations(37) are generated by the wavelet collocation technique.Therefore, the diagonal preconditioning method [14] can beemployed to reduce the condition number of matrix πΎ. Itleads us to use a very easy way to solve (37) instead of usingTikhonovβs regularize method. This approach was first usedin the Galerkin method, and thereafter, in 1995, Schneiderproved that it also can be applied to the collocation method[24].
Now we can use integral representation (29) to evaluatethe approximate value of π’(π₯) at any point π₯ in Ξ©; that is,
π’ (π₯) = β«Ξ
π log π₯ β π¦ ππ π¦
= β«π 2
π¦
π βππβ log π₯ β π¦ ππ¦
β β
(π,π)βΞ
βπ
(π,π)β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯ β π¦
ππ¦
= π’π(π₯) , βπ₯ β Ξ©.
(40)
We use notationπ(π,π)
(π₯) to represent the integral expressionin (40); that is
π(π,π)
(π₯) = β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯ β π¦
ππ¦, βπ₯ β Ξ©,
(41)
and at last, we have
π’π(π₯) = β
(π,π)βΞ
βπ
(π,π)π(π,π)
, βπ₯ β Ξ©. (42)
4. Algorithms of the IEWC Approach
In this section, the wavelet-based algorithms of the IEWCapproach are presented in both of the general version anddetailed version. To facilitate the implementation of thealgorithm, the computation of matrix, which will be usefulin performance of the algorithm, is also discussed in thissection.
Algorithm 6 (boundary measure and wavelet (general)). Onehas the following.
Step 1. Choose the collocation points {π₯π}|Ξ|
π=1on Ξ, and
evaluate matrixesπΎ and π in (37) with the formula (38).
Step 2. Solve (37) with least square method to obtain coeffi-cients {βπ
(π,π)}(π,π)βΞ
.
Step 3. Choose a point π₯ in the domain needed to betransformed to new coordinate, and calculate the coefficients{π(π,π)
(π₯)}(π,π)βΞ
with the formula (41).
Step 4. Obtain the approximation π’π(π₯) using (41).
4.1. Computation of the Matrix. In the Step 1 and Step 3above, the main cost is the computation of
β«π 2
π¦
π (π₯, π¦) ππ
π(π¦1) ππ
π(π¦2) ππ¦. (43)
In this subsection we will give a simple method to calculate itapproximately. Let us first introduce some notations.
Definition 7. If a quadrature formula
β«π (π‘) π (π‘) ππ‘ =
π
β
π=0
π΄ππ (π‘π) (44)
holds for any polynomial of degree less than or equal to 2π +1, then it is called Gauss-type quadrature with scale functionπ(π‘) as its weight function, the dots {π‘
π}, and the coefficients
{π΄π} are called generalized Gauss-type quadrature dots and
generalized Gauss-type quadrature weights.
Similar to the classical Gauss-type quadrature formula,we recall that [0, 2π β 1] is the support of the scale functionπ; therefore, we have the following.
Proposition 8. In formula (44), the necessary and sufficientcondition for {π‘
π} being generalizedGauss-type quadrature dots
is π€π(π‘) = Ξ
π
π=0(π‘ β π‘π) being orthogonal to any polynomial
ππ(π‘)(degree β€ π) with π(π‘) as the weight function; that is,
β«
2πβ1
0
π (π‘) ππ(π‘) π€π(π‘) ππ‘ = 0. (45)
-
10 Abstract and Applied Analysis
(a) (b)
(c) (d)
Figure 7: Experiment 1: nonlinear harmonic and its inverse: (a) original image, (b) distorted image, (c) restored image by IEWC, and(d) restored image by bilinear method.
Figure 8: A harmonic distorted image is approximated by piecewisebilinear model.
Proposition 9. In formula (44), if π(π‘) β πΆ2π+2[0, 2π β 1],the error of (44) is
π = β«
2πβ1
0
π (π‘) π (π‘) ππ‘ β
π
β
π=0
π΄ππ (π‘π)
=π(2π+2)
(π) π (π)
(2π + 2)!β«
2πβ1
0
π€2
π(π‘) ππ‘,
(46)
where π β [0, 2π β 1].
A significant task is to determine {π‘π} and {π΄
π} in formula
(44). Letπ(π‘) = π‘π, 0 β€ π β€ 2π+1, we obtain a nonlinear system[25]:
π
β
π=0
π΄ππ‘π
π= β«π (π‘) π‘
πππ‘, π = 0, . . . , 2π + 1. (47)
First, we compute the right-hand side of (47) recursively.Suppose that 2π + 1 β€ π β 1, from the theory of wavelet,we can write
π‘π
π!=
+β
β
π=ββ
ππ(π) π (π‘ β π) , π = 0, . . . , 2π + 1, (48)
from which we know
ππ= β«
+β
ββ
π‘π
π!π (π‘) ππ‘ = π
π(0) , (49)
and it can be computed recursively using [26]
π0= 1
ππ=
1
2π β 1
π
β
π=1
ππππβπ
(50)
with ππ= (1/β2)Ξ£
πβπ(ππ/π!), where reals β
πare coeffi-
cients in π(π‘) = β2Ξ£βππ(2π‘βπ). So far, the right-hand side in
-
Abstract and Applied Analysis 11
6
4
2
00 200 300100
Γ104
(a) Orig π₯-axis
0 200 300100
6
4
5
2
3
Γ104
(b) Chang π₯-axis
0 200 300100
6
4
2
0
Γ104
(c) Pde π₯-axis
0 200 300100
6
4
2
0
Γ104
(d) Bi-128 π₯-axis
Figure 9: Comparison in Experiment 1: projection of images to the π₯-axis: (a) original image, (b) distorted image, (c) restored image byIEWC, and (d) restored image by the piecewise bilinear method.
Table 1
π π₯1= π
3 8.17401πΈ β 0014 1.005395 1.193906 1.38216
(47) is computed. Then, we solve the nonlinear system (47),so that 2π + 2 coefficients {π‘
π} and {π΄
π} are obtained. For
example, when π = 1,π = 3, 4, 5, 6, we have
π΄0β 0, π΄
1β 1 (51)
and obtain Table 1.Therefore, we have a very simple formula
β«
2πβ1
0
π (π‘) π (π‘) ππ‘ β π (π) . (52)
For π β πΆ4, by use of spline function, we can prove that itserror, π, is
π = π (β4) , β =
2π β 1
2π. (53)
Based on these results, we know that
1
2ππ(
π + π
2π,π + π
2π) (54)
can be used to approximate
β«π 2
π¦
π (π₯, π¦) ππ
π(π¦1) ππ
π(π¦2) ππ¦, (55)
and we will use it in our experiments.
-
12 Abstract and Applied Analysis
6
4
2
00 200 300100
Γ104
(a) Origπ¦-axis
0 200 300100
6
4
5
2
3
Γ104
(b) Chang π¦-axis
0 200 300100
6
4
2
0
Γ104
(c) Pde π¦-axis
0 200 300100
6
4
2
0
Γ104
(d) Bi-128 π¦-axis
Figure 10: Comparison in Experiment 1: projection of images to the π¦-axis: (a) original image, (b) distorted image by harmonictransformation, (c) restored image by IEWC, and (d) restored image by the piecewise bilinear method.
Algorithm 10 (boundary measure and wavelet (detail)).
Input {π₯π} β Ξ and {π(π₯
π)}.
Step 1
Choose a resolution level π and fix a rectan-gular domainπ· covering {π₯
π}.
Calculate the index set Ξ = {(π, π)} byππ
(π,π)β© π· ΜΈ= {0}.
Choose any |Ξ| collocation points {π₯π} β
{π₯π}.
Step 2
For π = 1 to |Ξ| Do
Compute matrix elements
πΎπ,(π,π)
(π₯π) = β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π₯π β π¦
ππ¦
β1
2log [(π₯
π1
βπ + π
2π)
2
+ (π₯π2
βπ + π
2π)
2
] .
(56)Obtain right-hand side {π(π₯
π)} from
{π(π₯π)}.
End.Step 3
Solve the linear systemsπΎβ = π and obtainβ = {β
π
(π,π)}.
Step 4Choose the points {π§
π}π
π=1in the domain to
be transformed to new coordinate space.
-
Abstract and Applied Analysis 13
(a) (b)
(c) (d)
Figure 11: Experiment 2: nonlinear harmonic and its inverse for a circle area.
Step 5
For π = 1 toπ Do:Evaluate
π(π,π)
(π§π) = β«π 2
π¦
ππ
π(π¦1) ππ
π(π¦2) log π§π β π¦
ππ¦
β1
2log [(π§
π1
βπ + π
2π)
2
+ (π§π2
βπ + π
2π)
2
] .
(57)
Calculate the new coordinate
π’π(π§π) = β
(π,π)βΞ
βπ
(π,π)π(π,π)
(π§π) . (58)
End.
Output {π’π(π§π)}π
π=1.
5. Experiments
Experiments have been conducted to evaluate the perfor-mances of the new approach.
A couple of numerical experiments using the wavelet-based IEWC approach is presented in this section.
Experiment 1 (nonlinear-harmonic and its inverse). The har-monic transformation π : (π₯, π¦) β (π’, V) satisfies (5), whichis recalled as follows:
Ξπ’ (π₯1, π₯2) = 0, (π₯
1, π₯2) β Ξ©,
π’|Ξ= π (π₯
1, π₯2) , (π₯
1, π₯2) β Ξ,
ΞV (π₯1, π₯2) = 0, (π₯
1, π₯2) β Ξ©,
V|Ξ= π (π₯
1, π₯2) , (π₯
1, π₯2) β Ξ.
(59)
In this experiment, the equations of the boundary conditionsπ’|Ξ= π(π₯
1, π₯2), V|Ξ= π(π₯
1, π₯2) and the regionΞ© are specified
by the following forms:
π (π₯1, π₯2) = 1.2π₯
1, π (π₯
1, π₯2) = π₯2+ (π₯1β 0.5)
2
, (60)
Ξ© : 0 β€ π₯1, π₯
2β€ 0.5. (61)
Geometric transform is viewed to map the location of inputimage to a location in the output image; it defines how thepixel values in the output image are to be arranged. Thedistorted image coordinates can be defined by the equations
π’ = π’ (π₯1, π₯2) , V = V (π₯
1, π₯2) . (62)
The primary idea is to find a mathematical model for thegeometric distortion process, specifically, the equations π’ =π’(π₯1, π₯2), V = V(π₯
1, π₯2) and then apply the inverse process
-
14 Abstract and Applied Analysis
0 200 300100
6
4
5
2
3
1
Γ104
(a) Orig π₯-axis
0 200 300100
5.5
4.5
5
3.5
4
3
Γ104
(b) Chang π₯-axis
0 200 300100
6
4
5
2
3
1
Γ104
(c) Pde π₯-axis
0 200 300100
6
4
5
2
3
1
Γ104
(d) Bi-128 π₯-axis
Figure 12: Comparison in Experiment 2: projection of images to the π₯-axis: (a) original image, (b) distorted image, (c) restored image byIEWC, and (d) restored image by the piecewise bilinear method.
to find the restored image. To determine the necessary equa-tions, we need to identify a set of points in the original imagethat matches another set of points in the distorted image.These sets of points are called tiepoints. In this experiment,the relationship between these tiepoints in two images isdetermined by the boundary condition, which is describedin (60), and the proposed IEWCmethod can be used.
We use Figure 7 as an example, where Figure 7(a) is theoriginal image. As the IEWC approach is applied to solve theharmonic transformation with the boundary condition (60),the original image is distorted and displayed in Figure 7(b).To achieve the restoration, then the CSIM method is used toperform the inverse transformation, and the restored imageis illustrated in Figure 7(c). The details of the CSIM methodcan be found in our previous work [1].
To quantify and clarify the advantages of IEWC over thetraditional approach, a comparison is given in Figure 8.
In the traditional approach, a harmonic distorted image isapproximated by piecewise bilinear model [27], as shown inFigure 8. In the bilinear model, four points of each subregionare used to generate the equation:
π’ = π1π₯1+ π2π₯2+ π3π₯1π₯2+ π4,
V = π5π₯1+ π6π₯2+ π7π₯1π₯2+ π8,
(63)
where ππ, π = 1, 2, . . . , 8, are constants to be determined
by solving the eight simultaneous equations. Because wehave defined four tiepoints, thus we have eight equations,where π₯
1, π₯2, π’, and V are known. Now we can solve
the eight equations for the eight unknowns ππ, so that
the necessary equations for the coordinate mapping canbe obtained. The mapping equations π’ = π’(π₯
1, π₯2), V =
V(π₯1, π₯2) then are applied to all (π₯
1, π₯2) pairs needed. In
practice, the values of π₯1, π₯2, π’, and V are not likely to
-
Abstract and Applied Analysis 15
0 200 300
6
4
2
0100
Γ104
(a) Origπ¦-axis
6
4
2
00 200 300100
Γ104
(b) Chang π¦-axis
6
4
2
00 200 300100
Γ104
(c) Pde π¦-axis
6
4
2
00 200 300100
Γ104
(d) Bi-128 π¦-axis
Figure 13: Comparison in Experiment 2: projection of images to the π¦-axis: (a) original image, (b) distorted image, (c) restored image byIEWC, and (d) restored image by the piecewise bilinear method.
be integers. The simplest solution is the nearest neighbormethod, where the pixel is assigned to the value of theclosest pixel in the image. The restored image which isconstructed by the classical piecewise bilinear method is pre-sented in Figure 7(d), in which, 128 tiepoints are used on theboundary. This method does not necessarily provide optimalresults.
To compare the above two restored images, we projectboth of them, as well as the original image and the distortedone, to the π₯-axis and π¦-axis.The results are shown in Figures9 and 10, respectively. From these projections, it is clear thatthe results of IEWC approach are better than that of thetraditional one.
Experiment 2 (nonlinear-harmonic and its inverse for a circlearea). Consider
π2: (π₯1, π₯2) β (π’, V) , Ξ© : π₯2
1+ π₯2
2β€ 0.42,
π (π₯1, π₯2) = π₯1+ π₯2,
π (π₯1, π₯2) = π₯2
1β π₯2
2.
(64)
In this experiment, the domain Ξ© of the partial differentialequation (PDE) is a circle area. Because the area is not aquadrilateral (four-sided polygon), it is difficult to use thepiecewise bilinear method. It is shown that the program codeof the IEWC approach is independent of the boundary form.The results are shown in Figure 11. To compare the results, theprojections of them to the axis are shown in Figures 12 and 13.
6. Conclusions
Usually the piecewise bilinear model can be used to allgeometric degradation image regardless the different char-acteristics of images. We have found a new model (partial
-
16 Abstract and Applied Analysis
differential equation PDE) for the transformation in our pre-vious work [1, 2] and aim to construct an efficient algorithm(IEWC) to solve the PDE in this paper.
In this paper, we have presented awavelet-based approachfor the harmonic transformation. Unlike the traditionalmethods, in the IEWC approach, the pixels needed to betransformed to new coordinates can be chosen arbitrarily.Meanwhile, the program code of our method is independentof the boundary, and we need only a set of the originalcoordinates of the pixels on the boundary of the image aswell as their new coordinates in the transformed image.To make the algorithm more efficiency, Daubechies wavelet(scale) functions and a Gauss-type quadrature formula havebeen used. Different examples have been tested with theanticipated results.
Some further work is still under study, which is presentedbelow. The tiepoints are unknown and should be guessedor calculated by some other methods. In this paper, a GAapproach has been applied to extract the outer contours andfind the tiepoints. In our further work, other GA, wavelet-based method, local search, immune approach, and so forthwill be used to find their usage in this direction to constructa good interpolation method.
In addition, as discussed above, there are singularitiesalong the boundary, which can be treated efficiently bywavelet. More recently, Donoho [9] has constructed a toolcalled curvelet to handle this kind of singularity, which is builtfrom Meyer wavelet basis. In our further work, the curveletwill be utilized. In this way, the boundary measure will beapproximated by the curvelet with the same accuracy as weuse wavelet. Meantime, compared with wavelet or sinusoidbasis, fewer terms will be computed when the curvelet will beused. It will make our algorithm more efficient.
Besides the further improvement of the algorithm, theproposed method will be combined with other techniquesto solve more sophisticated problems. For example, when werestore the distorted image, some blurred pictures may occur.To obtain a clean image, which will be easier to be recognizedby a pattern recognition system, the fusion technique will beapplied.
Conflict of Interests
The authors declare that there is no conflict of interestsregarding the publication of this paper.
Acknowledgments
This work was financially supported by the Multi-YearResearch of University of Macau under Grants no.MYRG205(Y1-L4)-FST11-TYY and no. MYRG187(Y1-L3)-FST11-TYY and by the National Natural Science Foundationof China under Grant no. 61273244.This research project wasalso supported by the Science and Technology DevelopmentFund (FDCT) of Macau, under Contract nos. 100-2012-A3,026-2013-A, and also by Guangxi Science and TechnologyFund of China, under Contract no. 201203YB179.
References
[1] Z. C. Li, T. D. Bui, Y. Y. Tang, and C. Y. Suen, ComputerTransformation of Digital images and Patterns, vol. 17, WorldScientific, Singapore, 1989.
[2] Y. Y. Tang and C. Y. Suen, βImage transformation approachto nonlinear shape restoration,β IEEE Transactions on Systems,Man and Cybernetics, vol. 23, no. 1, pp. 155β171, 1993.
[3] H. D. Cheng, Y. Y. Tang, and C. Y. Suen, βParallel image trans-formation and its VLSI implementation,β Pattern Recognition,vol. 23, no. 10, pp. 1113β1129, 1990.
[4] G. Wolberg, Digital Image Warping, IEEE Computer SocietyPress, Los Alamitos, CA, USA, 1990.
[5] O. C. Zienkiewics, The Finite Element Method, McGraw-Hill,London, UK, 3rd edition, 1977.
[6] A. R. Mitchell,The Finite Difference Method in Partial Differen-tial Equations, Addision-Wesley, New York, NY, USA, 1980.
[7] K. E. Atkinson, The Numerical Solution of Integral Equationsof the Second Kind, vol. 4, Cambridge University Press, Cam-bridge, UK, 1997.
[8] G. C. Hsiao and W. L. Wendland, βA finite element method forsome integral equations of the first kind,β Journal of Mathemat-ical Analysis and Applications, vol. 58, no. 3, pp. 449β481, 1977.
[9] D. L. Donoho, βOrthonormal ridgelets and linear singularities,βSIAM Journal onMathematical Analysis, vol. 31, no. 5, pp. 1062β1099, 2000.
[10] G. Hsiao and R. C. MacCamy, βSolution of boundary valueproblems by integral equations of the first kind,β SIAM Review,vol. 15, no. 4, pp. 77β93, 1973.
[11] A. Antoniadis, X. Brossat, J. Cugliari, and J.-M. Poggi, βClus-tering functional data using wavelets,β International Journal ofWavelets, Multiresolution and Information Processing, vol. 11, no.1, Article ID 1350003, 30 pages, 2013.
[12] G. Bhatnagar and Q. M. J. Wu, βAn image fusion frameworkbased on human visual system in framelet domain,β Inter-national Journal of Wavelets, Multiresolution and InformationProcessing, vol. 10, no. 1, Article ID 1250002, 30 pages, 2012.
[13] G. Chen, S.-E. Qian, J.-P. Ardouin, and W. Xie, βSuper-resolution of hyperspectral imagery using complex Ridgelettransform,β International Journal of Wavelets, Multiresolutionand Information Processing, vol. 10, no. 3, Article ID 1250025,22 pages, 2012.
[14] W. Dahmen, S. Prossdorf, and R. Schneider,Multiscale Methodsfor Pseudodifferential Equations. Equations, Recent Advances inWavelet Analysis, 1993, edited by, L. L. Schumaker and G.Webb.
[15] R. L.Wagner andW.C.Chew, βStudy ofwavelets for the solutionof electromagnetic integral equations,β IEEE Transactions onAntennas and Propagation, vol. 43, no. 8, pp. 802β810, 1995.
[16] Z. Xiang and Y. Lu, βAn effective wavelet matrix transformapproach for efficient solutions of electromagnetic integralequations,β IEEE Transactions on Antennas and Propagation,vol. 45, no. 8, pp. 1205β1213, 1997.
[17] R. O.Wells, Jr. and X. Zhou, βWavelet solutions for the Dirichletproblem,β Numerische Mathematik, vol. 70, no. 3, pp. 379β396,1995.
[18] H. L. Resnikoff and R.O.Wells Jr.,Wavelet Analysis-The ScalableStructure of Information, Springer, New York, NY, USA, 1998.
[19] S. Kumar, S. Kumar, B. Raman, and N. Sukavanam, βImage dis-parity estimation based on fractional dual-tree complex wavelettransform: a multi-scale approach,β International Journal ofWavelets, Multiresolution and Information Processing, vol. 11, no.1, Article ID 1350004, 21 pages, 2013.
-
Abstract and Applied Analysis 17
[20] S. P. Maity and M. K. Kundu, βPerformance improvement inspread spectrum image watermarking using wavelets,β Inter-national Journal of Wavelets, Multiresolution and InformationProcessing, vol. 9, no. 1, pp. 1β33, 2011.
[21] S. P. Maity, A. Phadikar, and M. K. Kundu, βImage errorconcealment based on QIM data hiding in dual-tree complexwavelets,β International Journal of Wavelets, Multiresolution andInformation Processing, vol. 10, no. 2, Article ID 1250016, 30pages, 2012.
[22] M. Zaied, S. Said, O. Jemai, and C. Ben Amar, βA novelapproach for face recognition based on fast learning algorithmand wavelet network theory,β International Journal of Wavelets,Multiresolution and Information Processing, vol. 9, no. 6, pp.923β945, 2011.
[23] L. M. Delves and J. L. Mohamed, Computational Methods forIntegral Equations, Cambridge University Press, Cambridge,UK, 1985.
[24] W. Dahmen, βWavelet and multiscale methods for operatorequations,β ACTA Numerica, vol. 6, pp. 55β228, 1997.
[25] Y. H. Zhou and J. Z. Wang, βA generalized Gaussian integralmethod for the calculation of scaling function transforms ofwavelets and its applications,β Acta Mathematica Scientia A:Shuxue Wuli Xuebao, vol. 19, no. 3, pp. 293β300, 1999.
[26] A. Cohen, I. Daubechies, and P. Vial, βWavelets on the inter-val and fast wavelet transforms,β Applied and ComputationalHarmonic Analysis: Time-Frequency and Time-Scale Analysis,Wavelets, Numerical Algorithms, and Applications, vol. 1, no. 1,pp. 54β81, 1993.
[27] S. E. Umbaugh, Computer Vision and Image Processing,Prentice-Hall, New York, NY, USA, 1998.
-
Submit your manuscripts athttp://www.hindawi.com
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
MathematicsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Mathematical Problems in Engineering
Hindawi Publishing Corporationhttp://www.hindawi.com
Differential EquationsInternational Journal of
Volume 2014
Applied MathematicsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Probability and StatisticsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Mathematical PhysicsAdvances in
Complex AnalysisJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
OptimizationJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
CombinatoricsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
International Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Operations ResearchAdvances in
Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Function Spaces
Abstract and Applied AnalysisHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
International Journal of Mathematics and Mathematical Sciences
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
The Scientific World JournalHindawi Publishing Corporation http://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Algebra
Discrete Dynamics in Nature and Society
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Decision SciencesAdvances in
Discrete MathematicsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com
Volume 2014 Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Stochastic AnalysisInternational Journal of