• Title/Summary/Keyword: Corresponding Points

Search Result 736, Processing Time 0.026 seconds

ON FIXED POINTS ON COMPACT RIEMANN SURFACES

  • Gromadzki, Grzegorz
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.5
    • /
    • pp.1015-1021
    • /
    • 2011
  • A point of a Riemann surface X is said to be its fixed point if it is a fixed point of one of its nontrivial holomorphic automorphisms. We start this note by proving that the set Fix(X) of fixed points of Riemann surface X of genus g${\geq}$2 has at most 82(g-1) elements and this bound is attained just for X having a Hurwitz group of automorphisms, i.e., a group of order 84(g-1). The set of such points is invariant under the group of holomorphic automorphisms of X and we study the corresponding symmetric representation. We show that its algebraic type is an essential invariant of the topological type of the holomorphic action and we study its kernel, to find in particular some sufficient condition for its faithfulness.

A Study on The Coarse-to-fine Extraction Method of function Patterns by using The Dynamic Quantization of Parameter Space (매개변수공간의 동적 분할 방법에 의한 함수패턴의 단계적 분석 추출에 관한 연구)

  • 김민환;황희영
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.36 no.8
    • /
    • pp.594-602
    • /
    • 1987
  • This paper proposes a new method of reducing the processing time and the size of consummimg memories in Hough transform. In this method, only the functional patterns are considered. The candidate points which are accumulated into the parameter space are computed in a many-to-one fashion and the parameter space is quantized dynamically to maintain a fine precision where it is needed. And a coarse-to-fine extraction method is used to reduce the processing time. The many-to-one fashional computation results in a relatively high-densed accumulation of candidate points around the parameter points corresponding to the image patterns in the image space. So, the dynamic quantization procedure can be simplified and the local maxima can be determined easily. And more effective reduction can be obtained as the dimension of parameter space is increased.

  • PDF

Elastic Finite Element Analysis for a Flexible Beam Structure. (유연한 보구조물의 탄성유한요소해석)

  • Jung, Dong-Won;Lim, Sae-Young
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.11
    • /
    • pp.3441-3453
    • /
    • 1996
  • A finite element anlaysis is performed for large deformations of a felxible beam. The total Lagrangian formulation for a general large deformation, which involves finite rotations, is chosen and the exponential map is used to treat finite rotations from the Eulerian point of view. The finite elements results are confirmed for several cases of deformations through comparison to a first order elasticity solution obtained by numerical integration, and the agreement between the two is found to be excellent. For lateral buckling, the point of vanishing determinant of the resulting unsymmetric tangent stiffness is traced to examine its relationship to bifurcation points. It is found that the points of vanishing determinant is not corresponding to bifurcation points for large deformation in general, which suggests that the present unsymmetric tangent stiffness is not an exact first derivative of internal forces with respect to displacement.

Total Lagrangian Finite Element Analysis of Lateral Buckling for Thin Beam Structures (얇은 보 구조물의 횡좌굴에 대한 total lagrangian 유한요소해석)

  • 정동원
    • Journal of Ocean Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.7-22
    • /
    • 1997
  • A finite element analysis is performed for lateral buckling problems on the basis of a geometrically nonlinear formulation for a beam with small elastic strain but with possibly large rotations. The total Lagrangian formulation for a general large deformation, which involves finite rotations, is chosen and the exponential map is used to treat finite rotations from the Eulerian point of view. For lateral buckling, the point of vanishing determinant of the resulting unsymmetric tangent stiffness is traced to examine its relationship to bifurcation points. It is found that the points of vanishing determinant is not corresponding to bifurcation points for large deformations in general, which suggests that the present unsymmetric tangent stiffness is not an exact first derivative of internal forces with respect to displacement. This is illustrated through several numerical examples and followed by appropriate discussion.

  • PDF

An algorithm for pattern recognition of multichannel ECG signals using AI (AI기법을 이용한 멀티채널 심전도신호의 패턴인식 알고리즘)

  • 신건수;이병채;황선철;이명호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10a
    • /
    • pp.575-579
    • /
    • 1990
  • This paper describes an algorithm that can efficiently analyze the multichannel ECG signal using the frame. The input is a set of significant features (points) which have been extracted from an original sampled signal by using the split-and-merge algorithm. A signal from each channel can be hierarchical ADN/OR graph on the basis of the priori knowledge for ECG signal. The search mechanisms with some heuristics and the mixed paradigms of data-driven hypothesis formation are used as the major control mechanisms. The mutual relations among features are also considered by evaluating a score based on the relational spectrum. For recognition of morphologies corresponding to OR nodes, an hypothesis modification strategy is used. Other techniques such as instance, priority update of prototypes, and template matching facility are also used. This algorithm exactly recognized the primary points and supporting points from the multichannel ECG signals.

  • PDF

Correction of Ocular Fundus Fluorescein Angiogram in Nonlinear Distortion (비선형왜곡된 형광안저화상의 보정)

  • 고창림
    • Journal of Biomedical Engineering Research
    • /
    • v.11 no.1
    • /
    • pp.31-38
    • /
    • 1990
  • Image correction of the fluorescein angiogram with the low contrast and geometrically distorted is studied. The procedure is divided into two steps : A template matching step and a geometrical transformation step. Based on the sequential similiarity detection algorithm, more Improved matching results are obtained with edge enhanced image. For the reference points and the corresponding matchimg points, the geometrical transformationss by the use of the average value of the X, Y translational shifts and a pair of these points, respectively are described. Then the corrected images are obtained using bilinear interpolation. It is proven that the usefullness of this study for the image correction of the ocular fundus fluoresceln angiogram with low contrast and geometrically distorted mainly due to the eye movements.

  • PDF

Static and dynamic stability of a single-degree-of-freedom autonomous system with distinct critical points

  • Sophianopoulos, D.S.
    • Structural Engineering and Mechanics
    • /
    • v.4 no.5
    • /
    • pp.529-540
    • /
    • 1996
  • The dynamic buckling mechanism of a single-degree-of-freedom dissipative/nondissipative gradient system is thoroughly studied, employing energy criteria. The model is chosen in such a manner, that its corresponding static response is associated with all types of distinct critical points. Under a suddenly applied load of infinite duration, it is found that dynamic buckling, occurring always through a saddle, leads to an escaped motion, which is finally attracted by remote stable equilibrium positions, belonging sometimes also to complementary paths. Moreover, although the existence of initial imperfection changes the static behaviour of the system from limit point instability to bifurcation, it is established that the proposed model is dynamically stable in the large, regardless of the values of all other parameters involved.

A Scheme of Adaptive Search Point Placement using DCT

  • Park, Young-Min;Chang, Chu-Seok;Lee, Changsoo
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2001.05a
    • /
    • pp.318-324
    • /
    • 2001
  • In this paper we propose the adaptive scheme to place more search points as long as the operation tapability of the motion estimator in the video codec permits. And the proposed algorithm takes advantage of the intuitive fact that the quality of the decoded video is more degraded as the spatial frequency of the corresponding block is increased due to the augmentation of local minima per unit area. Thererore, we propose the scheme to enhance the quality by locating relatively more search points in the block with high frequency components by analyzing the spatial frequencies of the video sequence. As a result, the proposed scheme can adaptively place more search points possibly permitted by the motion estimator and guarantees better quality compared to the TSS and FS.

  • PDF

Inspection of Diamond Wheel through Boundary Detection and Processing (경계 추출 및 처리를 통한 다이아몬드 휠 검사)

  • Ha, Jong-Eun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.11
    • /
    • pp.932-936
    • /
    • 2016
  • In this paper, we present a method for the inspection of diamond wheels. In total, six items, including height, radius, and angle, need to be checked during the manufacturing of a diamond wheel. Automatic inspection through image processing is presented in this paper. First, a contour corresponding to the boundary of the diamond wheel is extracted from an image. Next, control points are selected by processing the contour. Seven control points are detected and used for the computation of the required item. Detailed procedures for the computation of the height, radius, and angle using control points are presented in this paper. Experimental results show the feasibility of the presented method.

Feature based matching using edge and intensity (에지 정보와 밝기 정보를 이용한 특징 기반 정합)

  • Kim, Jung-Ho;Um, Gi-Mun;Lee, Kwae-Hi
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.414-417
    • /
    • 1993
  • The methods for stereo matching are divided into two techniques: area-based matching and feature-based matching. To find corresponding points by area-based method, it takes a lot of time because there are many points to be matched. Feature-based matching algorithm is often used because with this method it matches only some feature points so that the processing time is fast even though it requires interpolation after matching. In this paper, we propose the smart technique by which we makes features simpler than conventional methods to match an image pair by feature-based matching algorithm.

  • PDF