The Problem of Image Recovery by the Metric Projections in Banach Spaces
Abstract
We consider the problem of image recovery by the metric projections in a real Banach space. For a countable family of nonempty closed convex subsets, we generate an iterative sequence converging weakly to a point in the intersection of these subsets. Our convergence theorems extend the results proved by Bregman and Crombez.
1. Introduction
Let C1, C2, …, Cr be nonempty closed convex subsets of a real Hilbert space H such that . Then, the problem of image recovery may be stated as follows: the original unknown image z is known a priori to belong to the intersection of ; given only the metric projections of H onto Ci for i = 1,2, …, r, recover z by an iterative scheme. Such a problem is connected with the convex feasibility problem and has been investigated by a large number of researchers.
Bregman [1] considered a sequence {xn} generated by cyclic projections, that is, . It was proved that {xn} converges weakly to an element of for an arbitrary initial point x ∈ H.
Crombez [2] proposed a sequence {yn} generated by y0 = y ∈ H, for n = 0,1, 2, …, where 0 < αi < 1 for all i = 0,1, 2, …, r with and 0 < λi < 2 for every i = 1,2, …, r. It was proved that {yn} converges weakly to an element of for an arbitrary initial point y ∈ H.
Later, Kitahara and Takahashi [3] and Takahashi and Tamura [4] dealt with the problem of image recovery by convex combinations of nonexpansive retractions in a uniformly convex Banach space E. Alber [5] took up the problem of image recovery by the products of generalized projections in a uniformly convex and uniformly smooth Banach space E whose duality mapping is weakly sequentially continuous (see also [6, 7]).
On the other hand, using the hybrid projection method proposed by Haugazeau [8] (see also [9–11] and references therein) and the shrinking projection method proposed by Takahashi et al. [12] (see also [13]), Nakajo et al. [14] and Kimura et al. [15] considered this problem by the metric projections and proved convergence of the iterative sequence to a common point of countable nonempty closed convex subsets in a uniformly convex and smooth Banach space E and in a strictly convex, smooth, and reflexive Banach space E having the Kadec-Klee property, respectively. Kohsaka and Takahashi [16] took up this problem by the generalized projections and obtained the strong convergence to a common point of a countable family of nonempty closed convex subsets in a uniformly convex Banach space whose norm is uniformly Gâteaux differentiable (see also [17, 18]). Although these results guarantee the strong convergence, they need to use metric or generalized projections onto different subsets for each step, which are not given in advance.
In this paper, we consider this problem by the metric projections, which are one of the most familiar projections to deal with. The advantage of our results is that we use projections onto the given family of subsets only, to generate the iterative scheme. Our convergence theorems extend the results of [1, 2] to a Banach space E, and they deduce the weak convergence to a common point of a countable family of nonempty closed convex subsets of E.
There are a number of results dealing with the image recovery problem from the aspects of engineering using nonlinear functional analysis (see, e.g., [19]). Comparing with these researches, we may say that our approach is more abstract and theoretical; we adopt a general Banach space with several conditions for an underlying space, and therefore, the technique of the proofs can be applied to various mathematical results related to nonlinear problems defined on Banach spaces.
2. Preliminaries
Theorem 1 (Xu [22]). Let E be a smooth Banach space and p > 1. Then, E is p-uniformly convex if and only if there exists a constant c > 0 such that ∥x+y∥p ≥ ∥x∥p + p〈y, Jpx〉 + c∥y∥p holds for every x, y ∈ E.
Remark 2. For a p-uniformly convex and smooth Banach space E, we have that the constant c in the theorem above satisfies c ≤ 1. Let
Lemma 3. Let p > 1 and E be a p-uniformly convex and smooth Banach space. Then, for each x, y ∈ E,
Proof. Let x, y ∈ E. By Theorem 1, we have
Let C be a nonempty closed convex subset of a strictly convex and reflexive Banach space E, and let x ∈ E. Then, there exists a unique element x0 ∈ C such that ∥x0 − x∥ = inf y∈C∥y − x∥. Putting x0 = PCx, we call PC the metric projection onto C (see [24]). We have the following result [25, p. 196] for the metric projection.
Lemma 4. Let C be a nonempty closed convex subset of a strictly convex, reflexive, and smooth Banach space E, and let x ∈ E. Then, y = PCx if and only if 〈y − z, J2(x − y)〉 ≥ 0 for all z ∈ C, where PC is the metric projection onto C.
Remark 5. For p > 1, it holds that ∥x∥Jpx = ∥x∥p−1J2x for every x ∈ E. Therefore, under the same assumption as Lemma 4, we have that y = PCx if and only if 〈y − z, Jp(x − y)〉 ≥ 0 for all z ∈ C.
3. Main Results
Firstly, we consider the iteration of Crombez’s type and get the following result.
Theorem 6. Let p, q > 1 be such that 1/p + 1/q = 1. Let {Cn} n∈ℕ be a family of nonempty closed convex subsets of a p-uniformly convex and smooth Banach space E whose duality mapping Jp is weakly sequentially continuous. Suppose that ⋂n∈ℕCn ≠ ∅. Let λn,k ∈ ]0, (1 + 1/(p − 1)) p−1c0[ and αn,k ∈ [0,1] for all n ∈ ℕ and k = 1,2, …, n with for every n ∈ ℕ, where c0 is maximum in Remark 2. Let {xn} be a sequence generated by x1 = x ∈ E and
Proof. Let for n ∈ ℕ and k = 1,2, …, n. Then, for z ∈ ⋂n∈ℕCn, we obtain
Using the idea of [9, p. 256], we also have the following result by the iteration of Bregman’s type.
Theorem 7. Let p, q > 1 be such that 1/p + 1/q = 1. Let I be a countable set and {Cj} j∈I a family of nonempty closed convex subsets of a p-uniformly convex and smooth Banach space E whose duality mapping Jp is weakly sequentially continuous. Suppose that ⋂j∈ICj ≠ ∅. Let λn ∈ ]0, (1 + 1/(p − 1)) p−1c0[ for all n ∈ ℕ, where c0 is maximum in Remark 2, and let {xn} be a sequence generated by x1 = x ∈ E and
Proof. Let z ∈ ⋂j∈ICj. As in the proof of Theorem 6, we have
4. Deduced Results
Since a real Hilbert space H is 2-uniformly convex and the maximum c0 in Remark 2 is equal to 1, we get the following results. At first, we have the following theorem which generalizes the results of [2] by Theorem 6.
Theorem 8. Let {Cn} n∈ℕ be a family of nonempty closed convex subsets of H such that ⋂n∈ℕCn ≠ ∅. Let λn,k ∈ ]0,2[ and αn,k ∈ [0,1] for all n ∈ ℕ and k = 1,2, …, n with for every n ∈ ℕ. Let {xn} be a sequence generated by x1 = x ∈ H and
Next, we have the following theorem which extends the result of [1] by Theorem 7.
Theorem 9. Let I be a countable set and {Cj} j∈I a family of nonempty closed convex subsets of H such that ⋂j∈ICj ≠ ∅. Let λn ∈ ]0,2[ for all n ∈ ℕ, and let {xn} be a sequence generated by x1 = x ∈ H and
Acknowledgment
The first author was supported by the Grant-in-Aid for Scientific Research no. 22540175 from the Japan Society for the Promotion of Science.