• 제목/요약/키워드: k-Symmetric points

검색결과 67건 처리시간 0.026초

ON CERTAIN CLASSES OF MULTIVALENT FUNCTIONS INVOLVING A GENERALIZED DIFFERENTIAL OPERATOR

  • Selvaraj, Chellian;Selvakumaran, Kuppathai A.
    • 대한수학회보
    • /
    • 제46권5호
    • /
    • pp.905-915
    • /
    • 2009
  • Making use of a generalized differential operator we introduce some new subclasses of multivalent analytic functions in the open unit disk and investigate their inclusion relationships. Some integral preserving properties of these subclasses are also discussed.

인접 영상 프레임에서 기하학적 대칭점을 이용한 카메라 움직임 추정 (Camera Motion Estimation using Geometrically Symmetric Points in Subsequent Video Frames)

  • 전대성;문성헌;박준호;윤영우
    • 전자공학회논문지CI
    • /
    • 제39권2호
    • /
    • pp.35-44
    • /
    • 2002
  • 카메라의 이동과 회전은 영상 프레임 전체에 영향을 미치는 전역 움직임(global motion)을 유발한다. 이러한 전역 움직임을 포함하는 영상을 부호화하는 경우, 변화성분 검출(change detection) 기법을 사용하여 정확한 오브젝트를 분할하는 것은 실제적으로는 불가능하며 큰 움직임 벡터로 인해 높은 압축률을 얻기 어렵다. 이러한 문제는 전역 움직임이 보상된 영상 시퀀스를 사용함으로써 해결할 수 있다. 전역 움직임 보상을 위한 기존의 카메라 움직임 추정 방법들은 계산량이 많다는 문제점을 가지고 있다. 따라서, 본 논문에서는 간단한 선 형식으로 구성되는 전역 움직임 추정 알고리즘을 제안한다 제안 알고리즘은 영상 프레임 내의 대칭점(symmetric points)의 움직임 정보를 이용하여 패닝(panning)과 틸팅(tilting), 줌잉(zooming)에 대한 전역 움직임 파라미터를 산출한다. 전역 움직임 계산에는 카메라 회전에 대해 깊이(depth)에 독립적인 원경만이 사용되며, 영상 내에서 원경을 구분하기 위한 판별식도 논문에 제시된다. 또한, MPEG 시험 영상을 사용한 실험 결과도 나타내었다. 본 논문에서 제안한 기법의 실시간 수행 능력은 많은 영상처리 분야의 전처리 단계에서 사용될 수 있다.

Envelope empirical likelihood ratio for the difference of two location parameters with constraints of symmetry

  • Kim, Kyoung-Mi;Zhou, Mai
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2002년도 춘계학술대회
    • /
    • pp.51-73
    • /
    • 2002
  • Empirical likelihood ratio method is a new technique in nonparametric inference developed by A. Owen (1988, 2001). Sometimes empirical likelihood has difficulties to define itself. As such a case in point, we discuss the way to define a modified empirical likelihood for the location of symmetry using well-known points of symmetry as a side conditions. The side condition of symmetry is defined through a finite subset of the infinite set of constraints. The modified empirical likelihood under symmetry studied in this paper is to construct a constrained parameter space $\theta+$ of distributions imposing known symmetry as side information. We show that the usual asymptotic theory (Wilks theorem) still hold for the empirical likelihood ratio on the constrained parameter space and the asymptotic distribution of the empirical NPMLE of difference of two symmetric points is obtained.

  • PDF

The Generalized Logistic Models with Transformations

  • Yeo, In-Kwon;Richard a. Johnson
    • Journal of the Korean Statistical Society
    • /
    • 제27권4호
    • /
    • pp.495-506
    • /
    • 1998
  • The proposed class of generalized logistic models, indexed by an extra parameter, can be used to model or to examine symmetric or asymmetric discrepancies from the logistic model. When there are a finite number of different design points, we are mainly concerned with maximum likelihood estimation of parameters and in deriving their large sample behavior A score test and a bootstrap hypothesis test are also considered to check if the standard logistic model is appropriate to fit the data or if a generalization is needed .

  • PDF

Adaptive M-estimation using Selector Statistics in Location Model

  • Han, Sang-Moon
    • Communications for Statistical Applications and Methods
    • /
    • 제9권2호
    • /
    • pp.325-335
    • /
    • 2002
  • In this paper we introduce some adaptive M-estimators using selector statistics to estimate the center of symmetric and continuous underlying distributions. This selector statistics is based on the idea of Hogg(1983) and Hogg et. al. (1988) who used averages of some order statistics to discriminate underlying distributions. In this paper, we use the functions of sample quantiles as selector statistics and determine the suitable quantile points based on maximizing the distance index to discriminate distributions under consideration. In Monte Carlo study, this robust estimation method works pretty good in wide range of underlying distributions.

An Optimal Algorithm for the Sensor Location Problem to Cover Sensor Networks

  • 김희선;박성수
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.17-24
    • /
    • 2006
  • We consider the sensor location problem (SLP) on a given sensor field. We present the sensor field as grid of points. There are several types of sensors which have different detection ranges and costs. If a sensor is placed in some point, the points inside of its detection range can be covered. The coverage ratio decreases with distance. The problem we consider in this thesis is called multiple-type differential coverage sensor location problem (MDSLP). MDSLP is more realistic than SLP. The coverage quantities of points are different with their distance form sensor location in MDSLP. The objective of MDSLP is to minimize total sensor costs while covering every sensor field. This problem is known as NP-hard. We propose a new integer programming formulation of the problem. In comparison with the previous models, the new model has a smaller number of constraints and variables. This problem has symmetric structure in its solutions. This group is used for pruning in the branch-and-bound tree. We solved this problem by branch-and-cut(B&C) approach. We tested our algorithm on about 60 instances with varying sizes.

  • PDF

Internet Banking Login with Multi-Factor Authentication

  • Boonkrong, Sirapat
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권1호
    • /
    • pp.511-535
    • /
    • 2017
  • Internet banking is one of many services provided by financial institutions that have become very popular with an increasing trend. Due to the increased amount of usage of the service, Internet banking has become a target from adversaries. One of the points that are at risk of an attack is the login process. Therefore, it is necessary to have a security mechanism that can reduce this risk. This research designs and develops a multi-factor authentication protocol, starting from a registration system, which generates authentication factors, to an actual authentication mechanism. These factors can be categorised into two groups: short term and long term. For the authentication protocol, only three messages need to be exchanged between a client and a financial institution's server. Many cryptographic processes are incorporated into the protocol, such as symmetric and asymmetric cryptography, a symmetric key generation process, a method for generating and verifying digital signatures. All of the authentication messages have been proved and analysed by the logic of GNY and the criteria of OWASP-AT-009. Even though there are additional factors of authentication, users do not really feel any extra load on their part, as shown by the satisfactory survey.

ON CONJUGATE POINTS OF THE GROUP H(2, 1)

  • Jang, Chang-Rim;Park, Keun;Lee, Tae-Hoon
    • East Asian mathematical journal
    • /
    • 제22권2호
    • /
    • pp.249-257
    • /
    • 2006
  • Let n be a 2-step nilpotent Lie algebra which has an inner product <,> and has an orthogonal decomposition $n=\delta{\oplus}\varsigma$ for its center $\delta$ and the orthogonal complement $\varsigma\;of\;\delta$. Then Each element Z of $\delta$ defines a skew symmetric linear map $J_Z:\varsigma{\rightarrow}\varsigma$ given by $=$ for all $X,\;Y{\in}\varsigma$. Let $\gamma$ be a unit speed geodesic in a 2-step nilpotent Lie group H(2, 1) with its Lie algebra n(2, 1) and let its initial velocity ${\gamma}$(0) be given by ${\gamma}(0)=Z_0+X_0{\in}\delta{\oplus}\varsigma=n(2,\;1)$ with its center component $Z_0$ nonzero. Then we showed that $\gamma(0)$ is conjugate to $\gamma(\frac{2n{\pi}}{\theta})$, where n is a nonzero intger and $-{\theta}^2$ is a nonzero eigenvalue of $J^2_{Z_0}$, along $\gamma$ if and only if either $X_0$ is an eigenvector of $J^2_{Z_0}$ or $adX_0:\varsigma{\rightarrow}\delta$ is not surjective.

  • PDF

한국인 성인에 대한 기성 tray의 적합도에 관한 연구 (A STUDY ON THE FITNESS OF STOCK TRAY IN KOREAN ADULTS)

  • 송대성;진태호;동진근
    • 대한치과보철학회지
    • /
    • 제27권2호
    • /
    • pp.131-141
    • /
    • 1989
  • This study was designed to investigate the fitness of stock tray in Korean adults. 107 dental students (male: 87, female: 20) who have normal occlusion and symmetric facial fom were selected. The upper and lower stock tray (Osungtray, Osung Co., Korea) fit with dental arch were selected for taking irreversible hydrocolloid impression. The author measured the thickness of impression material about two items, that is, width and length on the flange of stock tray. Several measuring points on the dental arches and palatal area were checked with Goldman Fox prove (Hu-Friedy, U.S.A.). The obtained results were as follows: 1. The width of impression material on buccal flange of upper and lower trays were narrower than any other measuring point, but the thickness of impression material on the palatal area of upper stock tray was the widest of all measuring points. 2. The length on buccal flange of lower stock tray was shorter, but the length on tray flange of lower stock tray at lingual frenum area was longer. 3. On upper dental arch, the upper extra-large tray was used in 53% of subjects, but upper small tray was not used. 4. On lower dental arch, the large tray was used in 55% of subjects. 5. There was not adequate tray on upper dental arch in 4 subjects.

  • PDF

왕복비대칭 가변이동속도에서의 효율적 배송차량경로 탐색해법 연구 (An Efficient Vehicle Routing Heuristic for Various and Unsymmetric Forward and Backward Vehicle Moving Speed)

  • 문기주;박성미
    • 산업경영시스템학회지
    • /
    • 제36권3호
    • /
    • pp.71-78
    • /
    • 2013
  • An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.