• 충청수학회지
• /
• 제33권4호
• /
• pp.387-394
• /
• 2020

Matthews introduced the concepts of partial metric spaces and proved the Banach fixed point theorem in complete partial metric spaces. Dukic, Kadelburg, and Radenovic proved fixed point theorems for Geraghty-type mappings in complete partial metric spaces. In this paper, we prove the fixed point theorem for some contractive mapping in a complete partial metric space.

• Korean Journal of Mathematics
• /
• 제30권4호
• /
• pp.665-678
• /
• 2022

The aim of this paper is to introduce a new iterative process and show that our iteration scheme is faster than other existing iteration schemes with the help of numerical examples. Next, we have established convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some convergence results for the approximation of the fixed points of a nonexpansive mapping.

• 대한수학회보
• /
• 제50권3호
• /
• pp.993-1005
• /
• 2013

In this paper, to include more generalized cases, the authors present a modified concept for the tripled and quadruple fixed point of the mixed monotone mappings. Also, they investigate the existence and uniqueness of fixed point of the ordered monotone operator with the Matkowski contractive conditions in the partial ordered metric spaces. As the direct consequences, the existence of coupled fixed point, tripled fixed point and quadruple fixed point are explored at the common framework and some previous results in [T. G. Bhaskar and V. Lakshmikan-tham, Fixed point theory in partially ordered metric spaces and applications, Nonlinear Anal. 65 (2006), 1379-1393; V. Berinde and M. Borcut, Tripled fixed point theorems for contractive type mappings in partially ordered metric spaces, Nonlinear Anal. 74 (2011), no. 15, 4889-4897; E. Karapinar and N. V. Luong, Quadruple fixed point theorems for nonlinear contractions, Computers and Mathematics with Applications (2012), doi:10.1016/j.camwa.2012.02061] are improved. Finally, some fixed point theorems are proved.

• Journal of applied mathematics & informatics
• /
• 제29권1_2호
• /
• pp.257-265
• /
• 2011

In this paper, we first prove a common fixed point theorem for generalized nonlinear contraction mappings in complete metric spaces there by generalizing and extending some known results. Then we present this result in the context of ordered metric spaces by using monotone non-decreasing mapping.

• East Asian mathematical journal
• /
• 제32권5호
• /
• pp.701-716
• /
• 2016

We establish a tripled coincidence and common tripled fixed point theorem for hybrid pair of mappings satisfying new contractive condition. To find tripled coincidence points, we do not use the continuity of any mapping involved therein. An example is also given to validate our result. We improve, extend and generalize several known results.

• Kyungpook Mathematical Journal
• /
• 제55권4호
• /
• pp.773-777
• /
• 2015

The aim of this paper is to prove a fixed point theorem on a generalised cone metric spaces for maps satisfying general contractive type conditions.

• 충청수학회지
• /
• 제22권4호
• /
• pp.645-652
• /
• 2009

In this paper, we give a generalized contractive type condition for a pair of multivalued mappings and analyze the existence of common fixed point for these mappings.

• Korean Journal of Mathematics
• /
• 제31권1호
• /
• pp.121-122
• /
• 2023

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.358-360
• /
• 2004

The digital images contain a significant amount of redundancy and require a large amount of data for their storage and transmission. Therefore, the image compression is necessary to treat digital images efficiently. The goal of image compression is to reduce the number of bits required for their representation. The image compression can reduce the size of image data using contractive mapping of original image. Among the compression methods, the mapping is affine transformation to find the block(called range block) which is the most similar to the original image. In this paper, we applied the neural network(SOM) in encoding. In order to improve the performance of image compression, we intend to reduce the similarities and unnecesaries comparing with the originals in the codebook. In standard image coding, the affine transform is performed with eight isometries that used to approximate domain blocks to range blocks.

• 한국통신학회논문지
• /
• 제22권8호
• /
• pp.1707-1714
• /
• 1997

This paper proposes a novel algorithm for fractal coding of image sequence, based on the CPM (Circular Prediction Mapping) and the NCIM (Non Contractive Interframe Mapping). In the CPM and the NCIM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Also, in this paepr, we propose a coding scheme of color components and an algorithm for controlling the bit rate, resepectively, for practical implementation of the fractal coder. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, below 256 Kbps.