• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.049 seconds

Content similarity matching for video sequence identification

  • Kim, Sang-Hyun
    • International Journal of Contents
    • /
    • v.6 no.3
    • /
    • pp.5-9
    • /
    • 2010
  • To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

Proposing the Technique of Shape Classification Using Homology (호몰로지를 이용한 형태 분류 기법 제안)

  • Hahn, Hee Il
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.1
    • /
    • pp.10-17
    • /
    • 2018
  • Persistence Betty numbers, which are the rank of the persistent homology, are a generalized version of the size theory widely known as a descriptor for shape analysis. They show robustness to both perturbations of the topological space that represents the object, and perturbations of the function that measures the shape properties of the object. In this paper, we present a shape matching algorithm which is based on the use of persistence Betty numbers. Experimental tests are performed with Kimia dataset to show the effectiveness of the proposed method.

A Study on Speaker Recognition using the Peak and valley pitch detection and the Fuzzy (국부 봉우리와 골에 의한 피치 검출과 퍼지를 이용한 화자 인식에 관한 연구)

  • 김연숙;김희주;김경재
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.1
    • /
    • pp.213-219
    • /
    • 2004
  • This paper proposes speaker recognition algorithm which includes the pitch parameter for the peak and valley. The time-frequency hybrid method for pitch extraction is valuable in that it can improve resolution in the time domain and accuracy in the frequency domain at the same time. It makes reference pattern using membership function and performs vocal track recognition of common character using fuzzy pattern matching in order to include time variation width for non-linear utterance for proposed method, speaker recognition experiments are carried out using vowels and number sounds.

Two-Bit Transform Algorithm using Adaptive Search Range (적응적 탐색 범위를 이용한 2비트 변환 알고리즘)

  • Lee, Sang-Gu;Kim, Yong-Hoon;Jeong, Je-Chang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.11a
    • /
    • pp.129-131
    • /
    • 2012
  • 본 논문은 2비트 변환 (two-bit transform : 2BT) 알고리즘의 탐색 범위를 적응적으로 조정하는 알고리즘을 제안하였다. 2BT는 정합 오차 기준으로 SAD (sum of absolute differences)를 사용하지 않고 Number of Non-Matching Points (NNMP)를 사용하여 속도를 향상시키고, 하드웨어 구현을 용이하게 했다. 그러나 움직임 예측 시 기존의 방법인 전역 탐색 (FS : Full Search) 알고리즘을 사용하여 방대한 연산량을 요구한다. 이 점을 개선하기 위해 이 논문에서는 2BT의 탐색 범위를 매 블록마다 적응적으로 조정하면서 알고리즘의 계산량을 줄이고 속도를 향상시키는 알고리즘을 제안하였다. 기존의 2BT와 제안하는 알고리즘을 비교한 실험결과는 PSNR이 거의 동일하나 복잡도 측면에서 제안하는 알고리즘이 훨씬 우수한 성능을 보여준다.

  • PDF

MOTION VECTOR DETECTION ALGORITHM USING THE STEEPEST DESCENT METHOD EFFECTIVE FOR AVOIDING LOCAL SOLUTIONS

  • Konno, Yoshinori;Kasezawa, Tadashi
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.460-465
    • /
    • 2009
  • This paper presents a new algorithm that includes a mechanism to avoid local solutions in a motion vector detection method that uses the steepest descent method. Two different implementations of the algorithm are demonstrated using two major search methods for tree structures, depth first search and breadth first search. Furthermore, it is shown that by avoiding local solutions, both of these implementations are able to obtain smaller prediction errors compared to conventional motion vector detection methods using the steepest descent method, and are able to perform motion vector detection within an arbitrary upper limit on the number of computations. The effects that differences in the search order have on the effectiveness of avoiding local solutions are also presented.

  • PDF

Rotordynamic Analysis of a Turbomolecular Pump (터보분자펌프의 회전체 동해석)

  • Han, Jeong-Sam
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2011.10a
    • /
    • pp.764-765
    • /
    • 2011
  • In this paper, rotordynamic analyses of the Campbell diagram, critical speeds, and harmonic responses for a TMP rotor system are performed. Since the finite element model of the TMP rotor system has a very large number of degrees of freedom because of its complex geometry, and dynamic analyses for investigating the critical speeds, stability, and harmonic response are repeated for various design parameters, model order reduction (MOR) is necessary to reduce the computational cost. The Krylov-based model order reduction via moment matching significantly speeds up the rotordynamic analyses for the TMP rotor system.

  • PDF

A KD-Tree-Based Nearest Neighbor Search for Large Quantities of Data

  • Yen, Shwu-Huey;Hsieh, Ya-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.3
    • /
    • pp.459-470
    • /
    • 2013
  • The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.

Nonlinear Acoustical Modeling of Poroelastic Materials (비선형성을 고려한 탄성 다공성 재질의 음향학적 모델링)

  • 김진섭;이수일;강영준
    • Journal of KSNVE
    • /
    • v.9 no.6
    • /
    • pp.1218-1226
    • /
    • 1999
  • In this paper, the extended Biot's semilinear model was developed. Combining the extended Biot model with the dynamic equation yields the nonlinear wave equation in poproelastic sound absorbing materials. Both perturbation and matching techniques are used to find solutions for nonlinear wave equations. By comparing results between linear and nonlinear wave solutions, characteristics of nonlinear waves in poroelastic sound abosrbing materials have been studied. Nonlinear waves were found to be attenuated faster than the linear ones. A maximum amplitude of the nonlinear wave occurred near its surface boundaries and decay quickly with distance from the surface. It has also been found that, if the amplitudes of linear waves are known at the surface boundaries, those of nonlinear ones can be determined. This will be the basis of finding effects of nonlinearity on the absorption coefficient and the transmission loss.

  • PDF

Comparisons of Various DEM Interpolation Techniques

  • Kim, Tae-Jung
    • Proceedings of the KSRS Conference
    • /
    • 1998.09a
    • /
    • pp.163-168
    • /
    • 1998
  • Extracting a Digital Elevation Model (DEM) from spaceborne imagery is important for cartographic applications of remote sensing data. The procedure for such DEM generation can be divided into stereo matching, sensor modelling and DEM interpolation. Among these, DEM interpolation contributes significantly to the completeness and accuracy of a DEM and, yet, this technique is often considered "trivial". However, na\ulcornere DEM interpolation may result in a less accurate and sometimes meaningless DEM. This paper reports the performance analysis of various DEM interpolation techniques. Using a manually derived DEM as reference, a number of sample points were created randomly. Different interpolation techniques were applied to the sample points to generate DEMs. The performance of interpolation was assessed by the accuracy of such DEMs. The results showed that kriging gave the best results at all times whereas nearest neighborhood interpolation provided a fast solution with moderate accuracy when sample points were large enough.

  • PDF

Visualizing Multi-Variable Prediction Functions by Segmented k-CPG's

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.1
    • /
    • pp.185-193
    • /
    • 2009
  • Machine learning methods such as support vector machines and random forests yield nonparametric prediction functions of the form y = $f(x_1,{\ldots},x_p)$. As a sequel to the previous article (Huh and Lee, 2008) for visualizing nonparametric functions, I propose more sensible graphs for visualizing y = $f(x_1,{\ldots},x_p)$ herein which has two clear advantages over the previous simple graphs. New graphs will show a small number of prototype curves of $f(x_1,{\ldots},x_{j-1},x_j,x_{j+1}{\ldots},x_p)$, revealing statistically plausible portion over the interval of $x_j$ which changes with ($x_1,{\ldots},x_{j-1},x_{j+1},{\ldots},x_p$). To complement the visual display, matching importance measures for each of p predictor variables are produced. The proposed graphs and importance measures are validated in simulated settings and demonstrated for an environmental study.