• 대한공간정보학회지
• /
• 제11권3호
• /
• pp.3-11
• /
• 2003

본 연구는 측량용 디지털 카메라인 Rollei d7 metric과 d7 $metric^{5}$를 이용하여 촬영거리, 수렴각, 촬영방향을 변화시켜가면서 촬영을 실시하였으며, 표정 시 발생하는 오차를 최소화하기 위해 프로그램 상에서 자동적으로 상호표정 되는 원형표지를 이용하였다. 그리고 자료처리체계로는 해석적 방법 중에서 현재 가장 좋은 정도를 얻을 수 있는 광속조정법(bundle adjustment)를 이용하였다. 이러한 연구는 차후 현장에서 요구하는 정도의 사진촬영과 예상되는 정도를 판단하는데 중요한 자료로 이용될 것으로 판단된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권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.

• Journal of applied mathematics & informatics
• /
• 제42권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.

• Kyungpook Mathematical Journal
• /
• 제63권1호
• /
• pp.123-129
• /
• 2023

For an ordered set W = {w₁, w₂, . . . , w_k} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w₁), d(v, w₂), . . . , d(v, w_k)) 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 ⊙ K₁), characterize all graphs G with dim(G ⊙ K₁) = dim(G), and prove that dim(G ⊙ K₁) = n - 1 if and only if G is the complete graph K_n or the star graph K_1,n-1.

• 대한전자공학회논문지TC
• /
• 제43권3호
• /
• pp.95-102
• /
• 2006

본 논문에서는 K-best 기법에서 심볼 검출 시 소요되는 불필요한 연산을 줄이고자 부분 유클리디언 거리(partial Euclidean distance)의 통계적 값으로서 수정된 Fano-like metric 바이어스를 할당하여 기존의 K-best 기법에 적용함으로써 평균 연산량을 감소시킨 KB-Fano 기법을 제안하였다. 또한 KB-Fano 기법에 K-reduction 기법을 연동한 KR-Fano 기법을 제안하여 모의 실험을 통해 K-reduction의 효과로 인한 비트 오차 확률 측면에서 높은 SNR 영역에서의 성능 개선과 함께 추가적인 평균 연산량 감소가 나타나는 것을 확인하였다.

• 전자공학회논문지CI
• /
• 제41권5호
• /
• pp.51-58
• /
• 2004

본 논문에서는 3D 모델의 체적 보존을 고려하는 메쉬 간략화 알고리듬을 제안하였다. 일반적으로 다른 대부분의 메쉬 간략화 알고리듬에서는 거리 기준을 사용한다. 거리는 기하학적인 오차를 측정하는 매우 효율적인 기준이기는 하지만 거리 기준만을 적용할 경우 원래 모델과 간략화된 모델 간에 체적 변화가 발생한다. 본 논문에서는 원래 모델의 간략화 과정 중에도 체적의 변화가 없는 메쉬 간략화 알고리듬을 제안한다. 본 알고리듬에서는 에지 하나를 줄이면서 체적의 변화가 일어나지 않는 정점 하나를 찾는 방식을 사용한다. 시뮬레이션을 통하여 제안하는 알고리듬이 비록 계산 시간은 좀 더 걸리지만 체적의 변화가 거의 없다는 장점을 가진 것을 확인하였다.

• 호남수학학술지
• /
• 제38권3호
• /
• pp.553-581
• /
• 2016

The purpose of this paper is to prove some fixed point theorems in a complete metric space equipped with a partial ordering using w-distances together with the aid of an altering functions and new functions of admissible type.

• 대한수학회지
• /
• 제55권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.

• 한국정보통신학회논문지
• /
• 제6권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.

• Kyungpook Mathematical Journal
• /
• 제61권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.