• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.753-762
• /
• 2010

Let K be a nonempty closed convex subset of a real Hilbert space H. Let T : K $\rightarrow$ K be a nonexpansive mapping with a nonempty fixed point set Fix(T). Let f : K $\rightarrow$ K be a contraction mapping. Let {$\alpha_n$} and {$\beta_n$} be sequences in (0, 1) such that $\lim_{x{\rightarrow}0}{\alpha}_n=0$, (0.1) $\sum_{n=0}^{\infty}\;{\alpha}_n=+{\infty}$, (0.2) 0 < a ${\leq}\;{\beta}_n\;{\leq}$ b < 1 for all $n\;{\geq}\;0$. (0.3) Then it is proved that the modified Krasnoselski-Mann iterative sequence {$x_n$} given by {$x_0\;{\in}\;K$, $y_n\;=\;{\alpha}_{n}f(x_n)+(1-\alpha_n)x_n$, $n\;{\geq}\;0$, $x_{n+1}=(1-{\beta}_n)y_n+{\beta}_nTy_n$, $n\;{\geq}\;0$, (0.4) converges strongly to a point p $\in$ Fix(T} which satisfies the variational inequality

$\leq$ 0, z $\in$ Fix(T). (0.5) This result improves and extends the corresponding results of Yao et al[Y.Yao, H. Zhou, Y. C. Liou, Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings, J Appl Math Com-put (2009)29:383-389.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.13-30
• /
• 2010

Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.637-641
• /
• 2007

Airborne LIDAR (Light Detection and Ranging) technology has reached a degree of the required accuracy in mapping professions, and advanced LIDAR systems are becoming increasingly common in the various fields of application. LiDAR data constitute an excellent source of information for reconstructing the Earth's surface due to capability of rapid and dense 3D spatial data acquisition with high accuracy. However, organizing the LIDAR data and extracting information from the data are difficult tasks because LIDAR data are composed of randomly distributed point clouds and do not provide sufficient semantic information. The main reason for this difficulty in processing LIDAR data is that the data provide only irregularly spaced point coordinates without topological and relational information among the points. This study introduces an efficient and robust method for automatic extraction of building footprints using airborne LIDAR data. The proposed method separates ground and non-ground data based on the histogram analysis and then rearranges the building boundary points using convex hull algorithm to extract building footprints. The method was implemented to LIDAR data of the heavily built-up area. Experimental results showed the feasibility and efficiency of the proposed method for automatic producing building layers of the large scale digital maps and 3D building reconstruction.

• East Asian mathematical journal
• /
• 제25권2호
• /
• pp.179-196
• /
• 2009

Let E be a uniformly convex Banach space and K a nonempty closed convex subset which is also a nonexpansive retract of E. For i = 1, 2, 3, let $T_i:K{\rightarrow}E$ be an asymptotically nonexpansive mappings with sequence ${\{k_n^{(i)}\}\subset[1,{\infty})$ such that $\sum_{n-1}^{\infty}(k_n^{(i)}-1)$ < ${\infty},\;k_{n}^{(i)}{\rightarrow}1$, as $n{\rightarrow}\infty$ and F(T)=$\bigcap_{i=3}^3F(T_i){\neq}{\phi}$ (the set of all common xed points of $T_i$, i = 1, 2, 3). Let {$a_n$},{$b_n$} and {$c_n$} are three real sequences in [0, 1] such that $\in{\leq}\;a_n,\;b_n,\;c_n\;{\leq}\;1-\in$ for $n{\in}N$ and some ${\in}{\geq}0$. Starting with arbitrary $x_1{\in}K$, define sequence {$x_n$} by setting {$$x_{n+1}=P((1-a_n)x_n+a_nT_1(PT_1)^{n-1}y_n)$$ $$y_n=P((1-b_n)x_n+a_nT_2(PT_2)^{n-1}z_n)$$ $$z_n=P((1-c_n)x_n+c_nT_3(PT_3)^{n-1}x_n)$$. Assume that one of the following conditions holds: (1) E satises the Opial property, (2) E has Frechet dierentiable norm, (3) $E^*$ has Kedec -Klee property, where $E^*$ is dual of E. Then sequence {$x_n$} converges weakly to some p${\in}$F(T).

• 대한수학회보
• /
• 제47권4호
• /
• pp.675-685
• /
• 2010

In this paper, we consider a new class of regularized (nonconvex) generalized mixed variational inequality problems in real Hilbert space. We give the concepts of partially relaxed strongly mixed monotone and partially relaxed strongly $\theta$-pseudomonotone mappings, which are extension of the concepts given by Xia and Ding [19], Noor [13] and Kazmi et al. [9]. Further we use the auxiliary principle technique to suggest a two-step iterative algorithm for solving regularized (nonconvex) generalized mixed variational inequality problem. We prove that the convergence of the iterative algorithm requires only the continuity, partially relaxed strongly mixed monotonicity and partially relaxed strongly $\theta$-pseudomonotonicity. The theorems presented in this paper represent improvement and generalization of the previously known results for solving equilibrium problems and variational inequality problems involving the nonconvex (convex) sets, see for example Noor [13], Pang et al. [14], and Xia and Ding [19].

• 한국통신학회논문지
• /
• 제21권7호
• /
• pp.1685-1695
• /
• 1996

The postprocessing of compressed images based on the projections onto convex sets and the constrained minimization imposes several constraints on the procesed data. The quantization constraint has been commonly used in various algorithms. Quantization is many-to-one mapping, by which all the dat in a quantization region are mapped to the corresponding representative level. The basic idea behind the projection onto the QCS(quantization constraint set) is to prevent the processed data from diverging from the original quantization region in order to redue the artifacts caused by filtering in postprocessing. However, there have been few efforts to analye the POQCS(projection onto the QCS). This paper analyzed mathematically the POQCS of filtered data from the viewpoint of minimizing the mean square error. Our analysis shows that a proper filtering technique followed by the POQCS can reduce the quantization distortion. In the conventional POQCS, the outside data of each quantization region are mapped into the corresponding boundary. Our analysis also shows that mappingthe outside data to the boundary of a subregion of the quantization region yields lower distortion than does the mapping to the boundary of the original region. In addition, several examples and discussions on the theory are introduced.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제7권2호
• /
• pp.83-94
• /
• 2003

Let K be a nonempty closed convex subset of a real Hilbert space H. Approximation solvability of a system of nonlinear variational inequality (SNVI) problems, based on the convergence of projection methods, is given as follows: find elements $x^*,\;y^*{\in}H$ such that $g(x^*),\;g(y^*){\in}K$ and $$<\;{\rho}T(y^*)+g(x^*)-g(y^*),\;g(x)-g(x^*)\;{\geq}\;0\;{\forall}\;g(x){\in}K\;and\;for\;{\rho}>0$$ $$<\;{\eta}T(x^*)+g(y^*)-g(x^*),\;g(x)-g(y^*)\;{\geq}\;0\;{\forall}g(x){\in}K\;and\;for\;{\eta}>0,$$ where T: $H\;{\rightarrow}\;H$ is a relaxed $g-{\gamma}-r-cocoercive$ and $g-{\mu}-Lipschitz$ continuous nonlinear mapping on H and g: $H{\rightarrow}\;H$ is any mapping on H. In recent years general variational inequalities and their algorithmic have assumed a central role in the theory of variational methods. This two-step system for nonlinear variational inequalities offers a great promise and more new challenges to the existing theory of general variational inequalities in terms of applications to problems arising from other closely related fields, such as complementarity problems, control and optimizations, and mathematical programming.

• 대한수학회보
• /
• 제30권2호
• /
• pp.251-263
• /
• 1993

The purpose of this paper is to study the solvability of the equation (E). In Section 2, we give preliminary definitions. In Section 3, we prove related two results (Theorem 1 and Corollary 1) concerning the closedness property of accretive operators in the class of spaces whose nonempty bounded closed convex subsets have the fixed point property for nonexpansive self-mapping. Using therem 1, we derive a result (Theorem 2) on the range of accetive operators in (.pi.)$_{1}$ spaces with a view to establishing a new result, which improves a result of Kartsatos [8] and Webb [15]. Further, we give an interesting consequence (Corollary 3) of Theorem 2. In section 4, we apply Corollary 1 to obtain two results (Theorem 3 and 4) for the range of sums of two accretive operators, which generalize two results of Reich [12].

• 대한수학회보
• /
• 제37권4호
• /
• pp.729-741
• /
• 2000

In this paper, we study in Banach spaces the existence of fixed points of asymptotically regular mapping T satisfying: for each x, y in the domain and for n=1, 2,…, $$\parallelT^nx-T^ny\parallel\leq$\leq$a_n\parallelx-y\parallel+b_n (\parallelx-T^nx\parallel+\parallely-T^ny\parallely)$$ where $a_n,\; b_n,\; C_n$ are nonnegative constants satisfying certain conditions. We also establish some fixed point theorems for these mappings in a Hibert space, in L(sup)p spaces, in Hardy space H(sup)p, and in Soboleve space $H^{k,p} for 1<\rho<\infty \; and \; k\geq0$. We extend results from papers [10], [11], and others.

• 대한수학회논문집
• /
• 제24권3호
• /
• pp.381-393
• /
• 2009

Strong convergence theorems on viscosity approximation methods for finding a common zero of a finite family accretive operators are established in a reflexive and strictly Banach space having a uniformly G$\hat{a}$teaux differentiable norm. The main theorems supplement the recent corresponding results of Wong et al. [29] and Zegeye and Shahzad [32] to the viscosity method together with different control conditions. Our results also improve the corresponding results of [9, 16, 18, 19, 25] for finite nonexpansive mappings to the case of finite pseudocontractive mappings.