• Title/Summary/Keyword: metric distance

Search Result 256, Processing Time 0.026 seconds

Analysis of Precision According to Photographing Position in Close-Range Digital Photogrammetry (근접수치사진측량의 촬영위치에 따른 정밀도 해석)

  • Seo, Dong-Ju;Lee, Jong-Chool
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.11 no.3 s.26
    • /
    • pp.3-11
    • /
    • 2003
  • This study has made photographing respectively by changing the photographic distance, converging angle, picturing direction by use of Rollei d7 metric and d7 $metric^{5}$ that is a measurement digital camera. And also in order to minimize the errors happened at the relative orientation, we have sorted out the round target that the relative orientation is automatically on the programming and have calculated RMSE by carrying out the bundle adjustment. We think that such a study could be used as very important basic data necessary in deriving the optimal photographic conditions by the close-range digital photogrammetry and in judging such a degree.

  • PDF

Correction for Misrecognition of Korean Texts in Signboard Images using Improved Levenshtein Metric

  • Lee, Myung-Hun;Kim, Soo-Hyung;Lee, Guee-Sang;Kim, Sun-Hee;Yang, Hyung-Jeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.722-733
    • /
    • 2012
  • Recently various studies on various applications using images taken by mobile phone cameras have been actively conducted. This study proposes a correction method for misrecognition of Korean Texts in signboard images using improved Levenshtein metric. The proposed method calculates distances of five recognized candidates and detects the best match texts from signboard text database. For verifying the efficiency of the proposed method, a database dictionary is built using 1.3 million words of nationwide signboard through removing duplicated words. We compared the proposed method to Levenshtein Metric which is one of representative text string comparison algorithms. As a result, the proposed method based on improved Levenshtein metric represents an improvement in recognition rates 31.5% on average compared to that of conventional methods.

A NEW STUDY IN EUCLID'S METRIC SPACE CONTRACTION MAPPING AND PYTHAGOREAN RIGHT TRIANGLE RELATIONSHIP

  • SAEED A.A. AL-SALEHI;MOHAMMED M.A. TALEB;V.C. BORKAR
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.2
    • /
    • pp.433-444
    • /
    • 2024
  • Our study explores the connection between the Pythagorean theorem and the Fixed-point theorem in metric spaces. Both of which center around the concepts of distance transformations and point relationships. The Pythagorean theorem deals with right triangles in Euclidean space, emphasizing distances between points. In contrast, fixed-point theorems pertain to the points that remain unchanged under specific transformations thereby preserving distances. The article delves into the intrinsic correlation between these concepts and presents a novel study in Euclidean metric spaces, examining the relationship between contraction mapping and Pythagorean Right Triangles. Practical applications are also discussed particularly in the context of image compression. Here, the integration of the Pythagorean right triangle paradigm with contraction mappings results in efficient data representation and the preservation of visual data relation-ships. This illustrates the practical utility of seemingly abstract theories in addressing real-world challenges.

On the Metric Dimension of Corona Product of a Graph with K1

  • Mohsen Jannesari
    • Kyungpook Mathematical Journal
    • /
    • v.63 no.1
    • /
    • pp.123-129
    • /
    • 2023
  • For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w1), d(v, w2), . . . , d(v, wk)) is called the metric representation of v with respect to W, where d(x, y) is the distance between the vertices x and y. A set W is called a resolving set for G if distinct vertices of G have distinct metric representations with respect to W. The minimum cardinality of a resolving set for G is its metric dimension dim(G), and a resolving set of minimum cardinality is a basis of G. The corona product, G ⊙ H of graphs G and H is obtained by taking one copy of G and n(G) copies of H, and by joining each vertex of the ith copy of H to the ith vertex of G. In this paper, we obtain bounds for dim(G ⊙ K1), characterize all graphs G with dim(G ⊙ K1) = dim(G), and prove that dim(G ⊙ K1) = n - 1 if and only if G is the complete graph Kn or the star graph K1,n-1.

Reduced Complexity K-BEST Lattice Decoding Algorithm for MIMO Systems (다중 송수신 안테나 시스템 기반에서 복잡도를 감소시킨 K-BEST 복호화 알고리듬)

  • Lee Sung-Ho;Shin Myeong-Cheol;Jung Sung-Hun;Seo Jeong-Tae;Lee Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.95-102
    • /
    • 2006
  • This paper proposes the KB-Fano algorithm which has lower decoding complexity by applying modified Fano-like metric bias to the conventional K-best algorithm. Additionally, an efficient K-best decoding algorithm, named the KR-Fano scheme, is proposed by jointly combining the K-reduction and the KB-Fano schemes. Simulations show that the proposed algerian provides the remarkable improvement from the viewpoints of the BER performance and the decoding complexity as compared to the conventional K-best scheme.

Mesh Simplification Algorithm Considering Volume Conservation (체적 보존을 고려한 메쉬 간략화 알고리듬)

  • 김종영;장태정
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.5
    • /
    • pp.51-58
    • /
    • 2004
  • In this paper, a mesh simplification algorithm is proposed which considers the conservation of the volume of a 3D model. In General, most of mesh simplification algorithm use a distance metric. The distance metric is very efficient to measure geometric error, but it causes volume changes between the original model and the simplified model. In this paper a mesh simplification algorithm which conserves the volume of the original model is suggested. A new vertex resulting from an edge contraction, takes a position which conserves the volume of the 3D model using the proposed algorithm. Although the new algorithm needs more time than the QEM algorithm, it is shown that it conserves the original volumn of the 3D model during the simplification.

TYPE SPACES AND WASSERSTEIN SPACES

  • Song, Shichang
    • Journal of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.447-469
    • /
    • 2018
  • Types (over parameters) in the theory of atomless random variable structures correspond precisely to (conditional) distributions in probability theory. Moreover, the logic (resp. metric) topology on the type space corresponds to the topology of weak (resp. strong) convergence of distributions. In this paper, we study metrics between types. We show that type spaces under $d^{\ast}-metric$ are isometric to Wasserstein spaces. Using optimal transport theory, two formulas for the metrics between types are given. Then, we give a new proof of an integral formula for the Wasserstein distance, and generalize some results in optimal transport theory.

A study on the traffic analysis of RIP and EIGRP for the most suitable routing (최적의 라우팅을 위한 RIP와 EIGRP 트래픽 분석 연구)

  • 이재완;고남영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.36-40
    • /
    • 2002
  • Routing algorithm uses metric to choose the route of Least cost to destination network, the best suited routing investigates all routes to the shortest destination among networks and is decided on the route given the minimum metric. This paper analyzed packet flow for setting up the best fitted path on the same network using RIP and EIGRP as the distance vector algorithm and measured the Link-efficiency.

Generalized 𝜓-Geraghty-Zamfirescu Contraction Pairs in b-metric Spaces

  • Morales, Jose R.;Rojas, Edixon M.
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.2
    • /
    • pp.279-308
    • /
    • 2021
  • The purpose of this paper is to introduce a class of contractive pairs of mappings satisfying a Zamfirescu-type inequality, but controlled with altering distance functions and with parameters satisfying the so-called Geraghty condition in the framework of b-metric spaces. For this class of mappings we prove the existence of points of coincidence, the convergence and stability of the Jungck, Jungck-Mann and Jungck-Ishikawa iterative processes and the existence and uniqueness of its common fixed points.