• Title/Summary/Keyword: metric distance

Search Result 257, Processing Time 0.026 seconds

FIXED POINT THEOREMS FOR SOME CONTRACTIVE MAPPINGS OF INTEGRAL TYPE WITH w-DISTANCE

  • LIU, ZEQING;WANG, HAOYUE;LIU, NA;KANG, SHIN MIN
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.5_6
    • /
    • pp.411-427
    • /
    • 2019
  • The existence, uniqueness and iterative approximations of fixed points for some contractive mappings of integral type defined in complete metric spaces with w-distance are proved. Four examples are given to demonstrate that the results in this paper extend and improve some well-known results in the literature.

A CIECAM02-based color edge detection method (CIECAM02 기반 컬러 에지 검출 방법)

  • Kang, Min-Sung;Kim, Bong-Joe;Sohn, Kwang-Hoon
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.843-844
    • /
    • 2008
  • In this paper, we propose a CIECAM02-based color edge detection method. The proposed method detects color edges with distance metric based on the characteristics of Human Visual System (HVS). The CIECAM02 is inherently strong in considering HVS. We use a vector gradient edge detector in a JCh components with newly proposed distance metric. The proposed method detect edges clearly. We subjectively confirm the performance with clearly enhanced images.

  • PDF

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.

Word Similarity Calculation by Using the Edit Distance Metrics with Consonant Normalization

  • Kang, Seung-Shik
    • Journal of Information Processing Systems
    • /
    • v.11 no.4
    • /
    • pp.573-582
    • /
    • 2015
  • Edit distance metrics are widely used for many applications such as string comparison and spelling error corrections. Hamming distance is a metric for two equal length strings and Damerau-Levenshtein distance is a well-known metrics for making spelling corrections through string-to-string comparison. Previous distance metrics seems to be appropriate for alphabetic languages like English and European languages. However, the conventional edit distance criterion is not the best method for agglutinative languages like Korean. The reason is that two or more letter units make a Korean character, which is called as a syllable. This mechanism of syllable-based word construction in the Korean language causes an edit distance calculation to be inefficient. As such, we have explored a new edit distance method by using consonant normalization and the normalization factor.

Common Fixed Point Theorems of Commuting Mappinggs

  • Park, Wee-Tae
    • The Mathematical Education
    • /
    • v.26 no.1
    • /
    • pp.41-45
    • /
    • 1987
  • In this paper, we give several fixed point theorems in a complete metric space for two multi-valued mappings commuting with two single-valued mappings. In fact, our main theorems show the existence of solutions of functional equations f($\chi$)=g($\chi$)$\in$S$\chi$∩T$\chi$ and $\chi$=f($\chi$)=g($\chi$)$\in$S$\chi$∩T$\chi$ under certain conditions. We also answer an open question proposed by Rhoades-Singh-Kulsherestha. Throughout this paper, let (X, d) be a complete metric space. We shall follow the following notations : CL(X) = {A; A is a nonempty closed subset of X}, CB(X)={A; A is a nonempty closed and founded subset of X}, C(X)={A; A is a nonempty compact subset of X}, For each A, B$\in$CL(X) and $\varepsilon$>0, N($\varepsilon$, A) = {$\chi$$\in$X; d($\chi$, ${\alpha}$) < $\varepsilon$ for some ${\alpha}$$\in$A}, E$\sub$A, B/={$\varepsilon$ > 0; A⊂N($\varepsilon$ B) and B⊂N($\varepsilon$, A)}, and (equation omitted). Then H is called the generalized Hausdorff distance function fot CL(X) induced by a metric d and H defined CB(X) is said to be the Hausdorff metric induced by d. D($\chi$, A) will denote the ordinary distance between $\chi$$\in$X and a nonempty subset A of X. Let R$\^$+/ and II$\^$+/ denote the sets of nonnegative real numbers and positive integers, respectively, and G the family of functions ${\Phi}$ from (R$\^$+/)$\^$s/ into R$\^$+/ satisfying the following conditions: (1) ${\Phi}$ is nondecreasing and upper semicontinuous in each coordinate variable, and (2) for each t>0, $\psi$(t)=max{$\psi$(t, 0, 0, t, t), ${\Phi}$(t, t, t, 2t, 0), ${\Phi}$(0, t, 0, 0, t)} $\psi$: R$\^$+/ \longrightarrow R$\^$+/ is a nondecreasing upper semicontinuous function from the right. Before sating and proving our main theorems, we give the following lemmas:

  • PDF

A Study on the Correction of tens Distortion by Plumb tine Method (Plumb Line Method에 의한 렌즈왜곡보정에 관한 연구)

  • 강준묵;오원진;윤희천
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.7 no.2
    • /
    • pp.45-51
    • /
    • 1989
  • Lens distortion would produce image displacement, therefore correction of lens distortion is required urgently to improve accuracy of results in photogrammetry. The objective of this study is to find out lens distortion coefficients versus focussing distance on non-metric and metric camera and to investigate propriety of application of lens distortion coefficients to three dimensional analysis. Analytical plumb line method which needs not perform control survey and space resection and requires only one photograph was used in order to get lens distortion coefficients. As the result of this study, the coefficients of radial and tangential distortion change as focussing distance changes, and consequently it is reasonable to apply the eigenvalues of lens distortion coefficients according to focussing distance. When these coefficients were applied to actual measurement, standard errors decreased about 30% or 76% remarkably.

  • PDF

Metric Defined by Wavelets and Integra-Normalizer (웨이브렛과 인테그라-노말라이저를 이용한 메트릭)

  • Kim, Sung-Soo;Park, Byoung-Seob
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.7
    • /
    • pp.350-353
    • /
    • 2001
  • In general, the Least Square Error method is used for signal classification to measure distance in the $l^2$ metric or the $L^2$ metric space. A defect of the Least Square Error method is that it does not classify properly some waveforms, which is due to the property of the Least Square Error method: the global analysis. This paper proposes a new linear operator, the Integra-Normalizer, that removes the problem. The Integra-Normalizer possesses excellent property that measures the degree of relative similarity between signals by expanding the functional space with removing the restriction on the functional space inherited by the Least Square Error method. The Integra-Normalizer shows superiority to the Least Square Error method in measuring the relative similarity among one dimensional waveforms.

  • PDF

Bio-Inspired Object Recognition Using Parameterized Metric Learning

  • Li, Xiong;Wang, Bin;Liu, Yuncai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.819-833
    • /
    • 2013
  • Computing global features based on local features using a bio-inspired framework has shown promising performance. However, for some tough applications with large intra-class variances, a single local feature is inadequate to represent all the attributes of the images. To integrate the complementary abilities of multiple local features, in this paper we have extended the efficacy of the bio-inspired framework, HMAX, to adapt heterogeneous features for global feature extraction. Given multiple global features, we propose an approach, designated as parameterized metric learning, for high dimensional feature fusion. The fusion parameters are solved by maximizing the canonical correlation with respect to the parameters. Experimental results show that our method achieves significant improvements over the benchmark bio-inspired framework, HMAX, and other related methods on the Caltech dataset, under varying numbers of training samples and feature elements.

Efficient Routing Protocol to Select a High-Performance Route in Wireless Mesh Networks

  • Youn, Joo-Sang
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.185-192
    • /
    • 2009
  • In wireless mesh networks multi-rate technology environment, a mesh node can dynamically modify the data transmission rate on a particular link, in response to link distance, or more accurately, the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric. Thus, these schemes may easily result in the network being overloaded. In this paper, a new route metric is proposed; it considers both per-hop service delay and link quality at mesh nodes. In addition, the Load-Aware AODV (LA-AODV) protocol using the proposed metric is presented. The performance evaluation is performed by simulation using the OPNET simulator. It is demonstrated that the LA-AODV protocol outperforms the existing routing protocols using other existing route metrics in multi-rate WMN environment.

Extended by Balk Metrics

  • DOVGOSHEY, OLEKSIY;DORDOVSKYI, DMYTRO
    • Kyungpook Mathematical Journal
    • /
    • v.55 no.2
    • /
    • pp.449-472
    • /
    • 2015
  • Let X be a nonempty set and $\mathcal{F}$(X) be the set of nonempty finite subsets of X. The paper deals with the extended metrics ${\tau}:\mathcal{F}(X){\rightarrow}\mathbb{R}$ recently introduced by Peter Balk. Balk's metrics and their restriction to the family of sets A with ${\mid}A{\mid}{\leqslant}n$ make possible to consider "distance functions" with n variables and related them quantities. In particular, we study such type generalized diameters $diam_{{\tau}^n}$ and find conditions under which $B{\mapsto}diam_{{\tau}^n}B$ is a Balk's metric. We prove the necessary and sufficient conditions under which the restriction ${\tau}$ to the set of $A{\in}\mathcal{F}(X)$ with ${\mid}A{\mid}{\leqslant}3$ is a symmetric G-metric. An infinitesimal analog for extended by Balk metrics is constructed.