• Title/Summary/Keyword: convex points

Search Result 204, Processing Time 0.023 seconds

ON THE STRONG CONVERGENCE THEOREMS FOR ASYMPTOTICALLY NONEXPANSIVE SEMIGROUPS IN BANACH SPACES

  • Chang, Shih-Sen;Zhao, Liang Cai;Wu, Ding Ping
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.13-23
    • /
    • 2009
  • Some strong convergence theorems of explicit iteration scheme for asymptotically nonexpansive semi-groups in Banach spaces are established. The results presented in this paper extend and improve some recent results in [T. Suzuki. On strong convergence to common fixed points of nonexpansive semigroups in Hilbert spaces, Proc. Amer. Math. Soc. 131(2002)2133-2136; H. K. Xu. A strong convergence theorem for contraction semigroups in Banach spaces, Bull. Aust. Math. Soc. 72(2005)371-379; N. Shioji and W. Takahashi. Strong convergence theorems for continuous semigroups in Banach spaces, Math. Japonica. 1(1999)57-66; T. Shimizu and W. Takahashi. Strong convergence to common fixed points of families of nonexpansive mappings, J. Math. Anal. Appl. 211(1997)71-83; N. Shioji and W. Takahashi. Strong convergence theorems for asymptotically nonexpansive mappings in Hilbert spaces, Nonlinear Anal. TMA, 34(1998)87-99; H. K. Xu. Approximations to fixed points of contraction semigroups in Hilbert space, Numer. Funct. Anal. Optim. 19(1998), 157-163.]

  • PDF

Point Pattern Matching Algorithm Using Unit-Circle Parametrization

  • Choi, Nam-Seok;Lee, Byung-Gook;Lee, Joon-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.6
    • /
    • pp.825-832
    • /
    • 2010
  • This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

Approximating Common Fixed Points of One-step Iterative Scheme with Error for Asymptotically Quasi-nonexpansive Type Nonself-Mappings

  • Puturong, Narongrit
    • Kyungpook Mathematical Journal
    • /
    • v.49 no.4
    • /
    • pp.667-674
    • /
    • 2009
  • In this paper, a new one-step iterative scheme with error for approximating common fixed points of asymptotically quasi-nonexpansive type nonself-mappings in Banach space is defined. The results obtained in this paper extend and improve the recent ones, announced by H. Y. Zhou, Y. J. Cho, and S. M. Kang [Zhou et al.,(2007), namely, A new iterative algorithm for approximating common fixed points for asymptotically non-expansive mappings, published to Fixed Point Theory and Applications 2007 : 1-9], and many others.

Computing the Dominating-Free Set by Two Point Sets in the Plane

  • Kim, Soo-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.1
    • /
    • pp.105-109
    • /
    • 2011
  • In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.

Moving object segmentation and tracking using feature based motion flow (특징 기반 움직임 플로우를 이용한 이동 물체의 검출 및 추적)

  • 이규원;김학수;전준근;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.1998-2009
    • /
    • 1998
  • An effective algorithm for tracking rigid or non-rigid moving object(s) which segments local moving parts from image sequence in the presence of backgraound motion by camera movenment, predicts the direction of it, and tracks the object is proposed. It requires no camera calibration and no knowledge of the installed position of camera. In order to segment the moving object, feature points configuring the shape of moving object are firstly selected, feature flow field composed of motion vectors of the feature points is computed, and moving object(s) is (are) segmented by clustering the feature flow field in the multi-dimensional feature space. Also, we propose IRMAS, an efficient algorithm that finds the convex hull in order to cinstruct the shape of moving object(s) from clustered feature points. And, for the purpose of robjst tracking the objects whose movement characteristics bring about the abrupt change of moving trajectory, an improved order adaptive lattice structured linear predictor is used.

  • PDF

TWO POINTS DISTORTION ESTIMATES FOR CONVEX UNIVALENT FUNCTIONS

  • Okada, Mari;Yanagihara, Hiroshi
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.3
    • /
    • pp.957-965
    • /
    • 2018
  • We study the class $C{\mathcal{V}} ({\Omega})$ of analytic functions f in the unit disk ${\mathbb{D}}=\{z{\in}{\mathbb{C}}$ : ${\mid}z{\mid}$ < 1} of the form $f(z)=z+{\sum}_{n=2}^{\infty}a_nz^n$ satisfying $$1+\frac{zf^{{\prime}{\prime}}(z)}{f^{\prime}(z)}{\in}{\Omega},\;z{\in}{\mathbb{D}}$$, where ${\Omega}$ is a convex and proper subdomain of $\mathbb{C}$ with $1{\in}{\Omega}$. Let ${\phi}_{\Omega}$ be the unique conformal mapping of $\mathbb{D}$ onto ${\Omega}$ with ${\phi}_{\Omega}(0)=1$ and ${\phi}^{\prime}_{\Omega}(0)$ > 0 and $$k_{\Omega}(z)={\displaystyle\smashmargin{2}{\int\nolimits_{0}}^z}{\exp}\({\displaystyle\smashmargin{2}{\int\nolimits_{0}}^t}{\zeta}^{-1}({\phi}_{\Omega}({\zeta})-1)d{\zeta}\)dt$$. Let $z_0,z_1{\in}{\mathbb{D}}$ with $z_0{\neq}z_1$. As the first result in this paper we show that the region of variability $\{{\log}\;f^{\prime}(z_1)-{\log}\;f^{\prime}(z_0)\;:\;f{\in}C{\mathcal{V}}({\Omega})\}$ coincides wth the set $\{{\log}\;k^{\prime}_{\Omega}(z_1z)-{\log}\;k^{\prime}_{\Omega}(z_0z)\;:\;{\mid}z{\mid}{\leq}1\}$. The second result deals with the case when ${\Omega}$ is the right half plane ${\mathbb{H}}=\{{\omega}{\in}{\mathbb{C}}$ : Re ${\omega}$ > 0}. In this case $CV({\Omega})$ is identical with the usual normalized class of convex univalent functions on $\mathbb{D}$. And we derive the sharp upper bound for ${\mid}{\log}\;f^{\prime}(z_1)-{\log}\;f^{\prime}(z_0){\mid}$, $f{\in}C{\mathcal{V}}(\mathbb{H})$. The third result concerns how far two functions in $C{\mathcal{V}}({\Omega})$ are from each other. Furthermore we determine all extremal functions explicitly.

Online Handwritten Digit Recognition by Smith-Waterman Alignment (Smith-Waterman 정렬 알고리즘을 이용한 온라인 필기체 숫자인식)

  • Mun, Won-Ho;Choi, Yeon-Seok;Lee, Sang-Geol;Cha, Eui-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.27-33
    • /
    • 2011
  • In this paper, we propose an efficient on-line handwritten digit recognition base on Convex-Concave curves feature which is extracted by a chain code sequence using Smith-Waterman alignment algorithm. The time sequential signal from mouse movement on the writing pad is described as a sequence of consecutive points on the x-y plane. So, we can create data-set which are successive and time-sequential pixel position data by preprocessing. Data preprocessed is used for Convex-Concave curves feature extraction. This feature is scale-, translation-, and rotation-invariant. The extracted specific feature is fed to a Smith-Waterman alignment algorithm, which in turn classifies it as one of the nine digits. In comparison with backpropagation neural network, Smith-Waterman alignment has the more outstanding performance.

WEAK AND STRONG CONVERGENCE CRITERIA OF MODIFIED NOOR ITERATIONS FOR ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN THE INTERMEDIATE SENSE

  • Banerjee, Shrabani;Choudhury, Binayak Samadder
    • Bulletin of the Korean Mathematical Society
    • /
    • v.44 no.3
    • /
    • pp.493-506
    • /
    • 2007
  • In this paper weak and strong convergence theorems of modified Noor iterations to fixed points for asymptotically nonexpansive mappings in the intermediate sense in Banach spaces are established. In one theorem where we establish strong convergence we assume an additional property of the operator whereas in another theorem where we establish weak convergence assume an additional property of the space.

FIXED POINTS ON NONCOMPACT AND NONCONVEX SETS

  • Bae, Jong-Sook
    • Bulletin of the Korean Mathematical Society
    • /
    • v.21 no.2
    • /
    • pp.87-89
    • /
    • 1984
  • Let X be a Banach space, and let B(X) (resp. CB(X), K(X), CV(X)) denote the family of all nonvoid (resp. closed bounded, compact, convex) subsets of X. The Kuratowski measure of noncompactness is defined by the mapping .alpha.$_{k}$: B(X).rarw. $R_{+}$ with .alpha.$_{k}$(A) = inf {r>0 vertical bar A can be covered by a finite number of sets with diameter less than r}.an r}.

  • PDF

FIXED POINTS OF SUMS OF NONEXPANSIVE MAPS AND COMPACT MAPS

  • Bae, Jongsook;An, Daejong
    • Korean Journal of Mathematics
    • /
    • v.10 no.1
    • /
    • pp.19-23
    • /
    • 2002
  • Let X be a Banach space satisfying Opial's condition, C a weakly compact convex subset of $X,F:C{\rightarrow}X$ a nonexpansive map, and let $G:C{\rightarrow}X$ be a compact and demiclosed map. We prove that F + G has a fixed point in C if $F+G:C{\rightarrow}X$ is a weakly inward map.

  • PDF