• 제목/요약/키워드: singular points

검색결과 142건 처리시간 0.023초

Gabor 필터를 이용한 효율적인 지문분류 (An Efficient Fingerprint Classification using Gabor Filter)

  • 심현보;박영배
    • 정보처리학회논문지B
    • /
    • 제9B권1호
    • /
    • pp.29-34
    • /
    • 2002
  • 지문인식 분야는 크게 지문의 분류(classification)와 정합(matching)으로 연구되고 있다. 분류는 일반적으로 좌제상문, 우제상문, 와상문, 궁상문, 솟은궁상문 등 크게 5종류로 나누며, 특정인의 지문이 어떤 분류에 속하는 지를 결정하는 것은 대형지문 데이터베이스에서 인덱스로 사용하여 매칭 시간의 단축과 정확도를 높여 주는데 있다. 기존의 지문분류는 특이점이라 불리는 핵과 삼각점의 개수 및 위치에 의한 분류방법이 주를 이루고 있는데, 이러한 방법은 지문분류의 정확성이 떨어지고, 특히 품질이 나쁜 지문이나 부분지문 등에서는 분류가 어려워 정확성이 더욱 떨어지는 문제점이 있다. 본 논문에서는 이러한 문제점을 해결하기 위해서, 품질이 나쁜 지문이나 부분지문가지도 방향성과 주파수 선택력이 강한 Gabor 필터의 특징을 이용하여 지문분류의 정확성을 향상시킬 수 있는 효율적인 방법을 제안하고 실험을 통하여 이를 증명하고자 한다.

Bypass, homotopy path and local iteration to compute the stability point

  • Fujii, Fumio;Okazawa, Shigenobu
    • Structural Engineering and Mechanics
    • /
    • 제5권5호
    • /
    • pp.577-586
    • /
    • 1997
  • In nonlinear finite element stability analysis of structures, the foremost necessary procedure is the computation to precisely locate a singular equilibrium point, at which the instability occurs. The present study describes global and local procedures for the computation of stability points including bifurcation points and limit points. The starting point, at which the procedure will be initiated, may be close to or arbitrarily far away from the target point. It may also be an equilibrium point or non-equilibrium point. Apart from the usual equilibrium path, bypass and homotopy path are proposed as the global path to the stability point. A local iterative method is necessary, when it is inspected that the computed path point is sufficiently close to the stability point.

ADAPTIVE GRID SIMULATION OF HYPERBOLIC EQUATIONS

  • Li, Haojun;Kang, Myungjoo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제17권4호
    • /
    • pp.279-294
    • /
    • 2013
  • We are interested in an adaptive grid method for hyperbolic equations. A multiresolution analysis, based on a biorthogonal family of interpolating scaling functions and lifted interpolating wavelets, is used to dynamically adapt grid points according to the physical field profile in each time step. Traditional finite-difference schemes with fixed stencils produce high oscillations around sharp discontinuities. In this paper, we hybridize high-resolution schemes, which are suitable for capturing singularities, and apply a finite-difference approach to the scaling functions at non-singular points. We use a total variation diminishing Runge-Kutta method for the time integration. The computational cost is proportional to the number of points present after compression. We provide several numerical examples to verify our approach.

SINGULAR INNER FUNCTIONS OF $L^{1}-TYPE$

  • Izuchi, Keiji;Niwa, Norio
    • 대한수학회지
    • /
    • 제36권4호
    • /
    • pp.787-811
    • /
    • 1999
  • Let M be the maximal ideal space of the Banach algebra $H^{\infty}$ of bounded analytic functions on the open unit disc $\triangle$. For a positive singular measure ${\mu}\;on\;{\partial\triangle},\;let\;{L_{+}}^1(\mu)$ be the set of measures v with $0\;{\leq}\;{\nu}\;{\ll}\;{\mu}\;and\;{{\psi}_{\nu}}$ the associated singular inner functions. Let $R(\mu)\;and\;R_0(\mu)$ be the union sets of $\{$\mid$\psiv$\mid$\;<\;1\}\;and\;\{$\mid${\psi}_{\nu}$\mid$\;<\;0\}\;in\;M\;{\setminus}\;{\triangle},\;{\nu}\;\in\;{L_{+}}^1(\mu)$, respectively. It is proved that if $S(\mu)\;=\;{\partial\triangle}$, where $S(\mu)$ is the closed support set of $\mu$, then $R(\mu)\;=\;R0(\mu)\;=\;M{\setminus}({\triangle}\;{\cup}\;M(L^{\infty}(\partial\triangle)))$ is generated by $H^{\infty}\;and\;\overline{\psi_{\nu}},\;{\nu}\;{\in}\;{L_1}^{+}(\mu)$. It is proved that %d{\theta}(S(\mu))\;=\;0$ if and only if there exists as Blaschke product b with zeros $\{Zn\}_n$ such that $R(\mu)\;{\subset}\;{$\mid$b$\mid$\;<\;1}\;and\;S(\mu)$ coincides with the set of cluster points of $\{Zn\}_n$. While, we proved that $\mu$ is a sum of finitely many point measure such that $R(\mu)\;{\subset}\;\{$\mid${\psi}_{\lambda}$\mid$\;<\;1}\;and\;S(\lambda)\;=\;S(\mu)$. Also it is studied conditions on \mu for which $R(\mu)\;=\;R0(\mu)$.

  • PDF

비선형 감마 곡선 알고리즘 개선을 위한 구간 분할 다항식 곡선 접합 (The Segmented Polynomial Curve Fitting for Improving Non-linear Gamma Curve Algorithm)

  • 장정훈;조호상;장원우;강봉순
    • 융합신호처리학회논문지
    • /
    • 제12권3호
    • /
    • pp.163-168
    • /
    • 2011
  • 본 논문은 감마보정을 위한 비선형 곡선 알고리즘의 개선에 관한 연구이다. 기존의 비선형 감마 곡선 생성 방법은 Gauss-Jordan 역행렬을 적용한 최소 자승 다항식(Least Square Polynomial)을 사용하였다. 이 방법은 다항식 계수 값 계산 과정 중 고차행렬의 역행렬 연산에서 $10^{-11}$ 이하의 매우 작은 값은 절단함으로써 곡선접합의 정밀도가 감소된다. 또한 입력으로 사용되는 샘플 포인트가 10-bit 기준으로 0~1023의 밝기 값에 대하여 고루 분포되어있는 경우에만 정확한 동작이 가능하다. 본 논문은 이러한 기존 알고리즘의 단점을 보완하기 위하여, 고차 다항식의 계수 값을 반데몬드 행렬(Vandemond Matrix)에 SVD분해(Singular Value Decomposition)와 QR분해법(QR Decomposition)을 적용하여 행렬의 고유치와 직교성분만으로 연산하였다 또한, 입력 데이터의 구간을 분할하여 각 구간의 다항식을 생성하고, 새롭게 생성된 다항식을 이용하여 곡선 접합을 수행하도록 하였다. 입력 데이터와 곡선 접합결과의 평균제곱오차(Mean Square Error: MSE)와 표준편차(Standard Deviation: STD)를 통한 오차율 비교 결과 최하위 비트(Least Significant Bit: LSB) 에러 범위에서 MSE가 약 $10^{-9}$ 이고 STD는 약 $10^{-5}$로 정밀도가 향상되었다.

CONNECTIONS ON REAL PARABOLIC BUNDLES OVER A REAL CURVE

  • Amrutiya, Sanjay
    • 대한수학회보
    • /
    • 제51권4호
    • /
    • pp.1101-1113
    • /
    • 2014
  • We give analogous criterion to admit a real parabolic connection on real parabolic bundles over a real curve. As an application of this criterion, if real curve has a real point, then we proved that a real vector bundle E of rank r and degree d with gcd(r, d) = 1 is real indecomposable if and only if it admits a real logarithmic connection singular exactly over one point with residue given as multiplication by $-\frac{d}{r}$. We also give an equivalent condition for real indecomposable vector bundle in the case when real curve has no real points.

A NUMERICAL METHOD FOR SOLVING THE FREDHOLM INTEGRAL EQUATION OF THE SECOND KIND

  • Sridharan, V.;Jayashree, P.R.
    • Journal of applied mathematics & informatics
    • /
    • 제5권2호
    • /
    • pp.293-300
    • /
    • 1998
  • The numerical method is used to solve the Fredholm integral equation of the second kind with weak singular kernels using the Toeplitz matrices. The solution has a computing time requir-ment of O(N2) where 2N+1 is the number of discretization points used. Also the error estimate is computed. Some numerical Exam-ples are computed using the Mathcad package.

Quasi-static 근사에 의한 코플래너 도파로 불연속의 경계요소 해석 (Boundary element characterization of coplanar waveguide discontinuities by quasi-static approximation)

  • 강연덕;이택경
    • 전자공학회논문지D
    • /
    • 제34D권6호
    • /
    • pp.1-10
    • /
    • 1997
  • By using the boundary element method, the cahracterization and the circuit modelling of the coplanar waveguide (CPW) discontinuities are performed bvia quasi-static approximation. The capacitive equivalent circuits are obtained by developing the 3-D boundary element method with collocation method. On the triangular patch, the numerical scheme employed the linear basis functions and the analytic solutions of the integrals on the singular points. The capacitive discontinuities of gaps, end-gaps, and open-ends are characterized and the results compared with the conductor backed coplanar waveguides.

  • PDF

Avoiding Indefiniteness in Criteria for Maximum Likelihood Bearing Estimation with Arbitrary Array Configuration

  • Suzuki, Masakiyo
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • pp.1807-1810
    • /
    • 2002
  • This paper presents a technique for avoid- ing indefiniteness in Maximum Likelihood (ML) criteria for Direction-of-Arrival (DOA) finding using a sensor ar- ray with arbitrary configuration. The ML criterion has singular points in the solution space where the criterion becomes indefinite. Solutions fly iterative techniques for ML bearing estimation may oscillate because of numerical instability which occurs due to the indefiniteness, when bearings more than one approach to the identical value. The oscillation makes the condition for terminating iterations complex. This paper proposes a technique for avoiding the indefiniteness in ML criteria.

  • PDF

SEMICASCADES OF TORIC LOG DEL PEZZO SURFACES

  • Hwang, DongSeon
    • 대한수학회보
    • /
    • 제59권1호
    • /
    • pp.179-190
    • /
    • 2022
  • A cascade of toric log del Pezzo surfaces of Picard number one was introduced as a language of classifying all such surfaces. In this paper, we introduce a generalized concept, a semicascade of toric log del Pezzo surfaces. As applications, we discuss Kähler-Einstein toric log del Pezzo surfaces and derive a bound on the Picard number in terms of the number of singular points, generalizing some results of Dais and Suyama.