• 제목/요약/키워드: matching number

검색결과 794건 처리시간 0.03초

A𝛼-SPECTRAL EXTREMA OF GRAPHS WITH GIVEN SIZE AND MATCHING NUMBER

  • Xingyu Lei;Shuchao Li;Jianfeng Wang
    • 대한수학회보
    • /
    • 제60권4호
    • /
    • pp.873-893
    • /
    • 2023
  • In 2017, Nikiforov proposed the A𝛼-matrix of a graph G. This novel matrix is defined as A𝛼(G) = 𝛼D(G) + (1 - 𝛼)A(G), 𝛼 ∈ [0, 1], where D(G) and A(G) are the degree diagonal matrix and adjacency matrix of G, respectively. Recently, Zhai, Xue and Liu [39] considered the Brualdi-Hoffman-type problem for Q-spectra of graphs with given matching number. As a continuance of it, in this contribution we consider the Brualdi-Hoffman-type problem for A𝛼-spectra of graphs with given matching number. We identify the graphs with given size and matching number having the largest A𝛼-spectral radius for ${\alpha}{\in}[{\frac{1}{2}},1)$.

ON SOMBOR INDEX OF BICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER

  • XIAOLING, SUN;JIANWEI, DU
    • Journal of Applied and Pure Mathematics
    • /
    • 제4권5_6호
    • /
    • pp.249-262
    • /
    • 2022
  • Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. The Sombor index is a novel topological molecular descriptor introduced by Gutman in 2021. The research on determining extremal values for the Sombor index of a graph is very popular recently. In this paper, we present the maximum Sombor index of bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal bicyclic graphs.

폐색된 숫자를 인식하는 매칭 방법 (A Matching Strategy to Recognize Occluded Number)

  • ;최형일;김계영
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
    • /
    • pp.55-58
    • /
    • 2011
  • This paper proposes a method of occluded number recognition by matching interest points. Interest points of input pattern are found via SURF features extracting and matched to interest points of clusters in database following three steps: SURF matching, coordinate matching and SURF matching on coordinate matched points. Then the satisfied interest points are counted to compute matching rate of each cluster. The input pattern will be assigned to cluster having highest matching rate. We have experimented our method to different numerical fonts and got encouraging results.

  • PDF

Location Template Matching(LTM) 방법을 적용함에 있어서 진동 모드 수의 영향 (The Effect of the Number of Vibration Modes on the Application of the Location Template Matching(LTM) Method)

  • 신기홍
    • 한국소음진동공학회논문집
    • /
    • 제26권2호
    • /
    • pp.172-178
    • /
    • 2016
  • The location template matching (LTM) method is a technique of identifying an impact location on a structure, and is often applied to structural health monitoring and large scale human-computer interface (HCI) systems. The LTM method utilizes a certain measure of similarity between two time signals. The correlation coefficient is most widely used for this purpose, and the group delay based method is recently proposed to improve the accuracy of finding the best matching pair of signals. In practice, one of key essential consideration for implementing the LTM method is to guarantee that a sufficient number of vibration modes must be contained in the measured signal, and yet the lower sampling rate is needed for a real-time implementation. In this paper, the properties of correlation coefficient and group delay with respect to the number of vibration modes are investigated. A few important results are obtained through extensive computer simulations and experiments. If the number of vibration modes contained in the measured signal is more than four it is sufficient for the correlation based LTM method, while the group delay based LTM method requires smaller number of vibration modes.

SOME RESULTS ON BINDING NUMBER AND FRACTIONAL PERFECT MATCHING

  • Zhu, Yan;Liu, Guizhen
    • Journal of applied mathematics & informatics
    • /
    • 제25권1_2호
    • /
    • pp.339-344
    • /
    • 2007
  • The relationships between binding number and fractional edge (vertex)-deletability or fractional k-extendability of graphs are studied. Furthermore, we show that the result about fractional vertex-deletability are best possible.

공간 영상 처리를 위한 SIFT 매칭 기법의 성능 분석 (A Performance Analysis of the SIFT Matching on Simulated Geospatial Image Differences)

  • 오재홍;이효성
    • 한국측량학회지
    • /
    • 제29권5호
    • /
    • pp.449-457
    • /
    • 2011
  • As automated image processing techniques have been required in multi-temporal/multi-sensor geospatial image applications, use of automated but highly invariant image matching technique has been a critical ingredient. Note that there is high possibility of geometric and spectral differences between multi-temporal/multi-sensor geospatial images due to differences in sensor, acquisition geometry, season, and weather, etc. Among many image matching techniques, the SIFT (Scale Invariant Feature Transform) is a popular method since it has been recognized to be very robust to diverse imaging conditions. Therefore, the SIFT has high potential for the geospatial image processing. This paper presents a performance test results of the SIFT on geospatial imagery by simulating various image differences such as shear, scale, rotation, intensity, noise, and spectral differences. Since a geospatial image application often requires a number of good matching points over the images, the number of matching points was analyzed with its matching positional accuracy. The test results show that the SIFT is highly invariant but could not overcome significant image differences. In addition, it guarantees no outlier-free matching such that it is highly recommended to use outlier removal techniques such as RANSAC (RANdom SAmple Consensus).

정합 오차 기준을 확장한 제한된 1비트 변환 알고리즘 기반의 움직임 예측 (Constrained One-Bit Transform based Motion Estimation using Extension of Matching Error Criterion)

  • 이상구;정제창
    • 방송공학회논문지
    • /
    • 제18권5호
    • /
    • pp.730-737
    • /
    • 2013
  • 본 논문은 정합 오차 기준을 확장한 제한된 1비트 변환 (Constrained One-Bit Transform : C1BT) 기반의 움직임 예측 알고리즘을 제안하였다. 제한된 1비트 변환 기반의 움직임 예측 알고리즘에서는 정합 오차 기준으로 기존의 움직임 예측 방법인 전역 탐색 알고리즘 (Full Search Algorithm: FSA)에서 사용되는 SAD (Sum of Absolute Differences) 대신 NNMP (Number of Non-Matching Points)를 사용하여 하드웨어 구현을 용이하게 하고 연산량을 크게 줄였으나 움직임 예측의 정확도를 감소시켰다. 이 점을 개선하고자 이 논문에서는 제한된 1비트 변환의 정합 오차 기준을 확장하여 움직임 예측의 정확도를 높이는 알고리즘을 제안하였고 이는 기존의 알고리즘과 비교한 결과 PSNR (Peak Signal to Nosie Ratio) 측면에서 더 우수한 성능을 보였다.

Improvement of ASIFT for Object Matching Based on Optimized Random Sampling

  • Phan, Dung;Kim, Soo Hyung;Na, In Seop
    • International Journal of Contents
    • /
    • 제9권2호
    • /
    • pp.1-7
    • /
    • 2013
  • This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

우리나라의 지역별 일자리결합함수의 추정 (On the Estimation of Regional Job-matching Functions of Korea)

  • 양준석;김호연
    • 한국경제지리학회지
    • /
    • 제12권3호
    • /
    • pp.248-259
    • /
    • 2009
  • 본 연구에서는 2004년 1월부터 2007년 12월까지의 기간을 대상으로 우리나라 지역 노동시장의 일자리결합함수를 추정해보았다. 일자리 결합에 영향을 미치는 지역효과를 통제하기 위한 LSDV 기법과 지역 자료를 사용할 경우 발생하는 공간적 자기상관의 문제를 해결하기 위한 공간오차모형을 활용하였다. 주요 결과는 다음과 같다. 첫째, 지역 노동시장을 대상으로 일자리결합함수를 추정한 결과 이론과 합치하는 일자리 결합구조를 확인할 수 있었고, 구인기업의 채용이 구직자의 취업보다 상대적으로 용이하다는 결과를 얻었다. 둘째, 구직자 수와 일자리 수가 동일한 조건에서 수도권이 다른 지역에 비해 일자리 결합이 원활한 것으로 나타났다. 셋째, 인근 지역의 구직자 수가 적을수록, 그리고 공석의 일자리 수가 많을수록 당해 지역내에 거주하는 구직자의 취업건수가 증가하는 결과를 보여 일자리 결합과정에서 발생하는 지역간 파급효과를 포착할 수 있었다.

  • PDF

신경 회로망을 이용한 부품 조립 공정의 최적화 알고리즘 (Optimal algorithm of part-matching process using neural network)

  • 오제휘;차영엽
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.143-146
    • /
    • 1996
  • In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

  • PDF