• 제목/요약/키워드: Line Search

검색결과 634건 처리시간 0.038초

변형된 절두체 컬링을 이용한 3차원 FPS 게임에서의 오브젝트 탐색 연구 (A Study on the Object Search in 3D FPS Games Using Modified Frustum Culling)

  • 최원태;박창민
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2007년도 춘계종합학술대회
    • /
    • pp.105-108
    • /
    • 2007
  • 최근, 3차원 슈팅 게임들은 빠른 화면 전환과 카메라 시야에 있는 오브젝트들을 상대로 게임을 한다. 특히 온라인 게임에서는 플레이어의 시야에 있지 않은 상대 오브젝트들의 위협성을 인식하는 것이 매우 중요하다. 본 논문에서는 변형된 절두체 컬링을 이용하여 3차원 FPS 게임에서의 오브젝트를 효율적으로 탐색하는 방법을 제시하였다. 플레이어가 감지하지 못하는 오브젝트를 위해 플레이어와 카메라 위치를 일치 시켰으며, 위협적인 오브젝트들의 개수를 파악하기 위해 플레이어와 오브젝트들의 거리를 이용하였다. 제안한 방법은 향후 3차원 FPS 게임의 발전에 주요한 역할을 할 것이다.

  • PDF

CELP보코더에서 Line Spectrum Frequency를 이용한 고속 피치검색 (A New Fast Pitch Search Algorithm using Line Spectrum Frequency in the CELP Vocoder)

  • 배명진;손상목;유하영;변경진
    • 한국음향학회지
    • /
    • 제15권2호
    • /
    • pp.90-94
    • /
    • 1996
  • 부호여기된 선형예측(CELP) 음성부호화기는 4.8kbps이하의 낮은 전송 비율에서도 좋은 성능을 갖는다. CELP형 부호기의 단점은 많은 계산량을 필요로 한다는 것이다. 본 논문에서, 우리는 복잡성을 줄이면서 CELP보코더의 음질을 유지하는 새로운 피치검색법을 제안하였다. 이 방법은 CELP보코더의 포만트 필터단에서 찾은 제 1 포만트를 이용하여 예비피치를 찾고, 피치검색을 예비피치 구간에서만 수행하는 것이다. 제안한 방법을 CELP보코더에 적용하므로써, 기존의 방법에 비해 약 64%의 복잡성이 감소되었다.

  • PDF

광전소자 제조를 위한 최대 광 결합점 검색 알고리즘 (Maximum Optical Coupling Point Search Algorithm for Manufacturing of Optical Device)

  • 한일호;김회율
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(5)
    • /
    • pp.9-12
    • /
    • 2001
  • Optical aligning process to archive the maximum optical coupling is crucial in many optical device manufacturing line such as laser diode module. Due to the three-dimensional nature of housing module and the aligning process for laser diode coupler, large amount of the manufacturing time, typically ranging from tens of minutes to an hour has to be devoted to the aligning process alone. In this thesis, we propose a new optical aligning process that employee a two-pass algorithm: coarse-to-fine search. Coarse search is a kind of blind search that finds the candidate region where the maximum optical coupling might mostly occur, followed by a fine searching that finds the maximum within the candidate region. The algorithm has been tested on 50 samples of cam-type laser diode modules, and the experimental results are analyzed in terms of aligning time and coupling efficiency.

  • PDF

배전계통 재구성 문제를 위한 Harmony Search 알고리즘 응용 (Harmony Search Algorithm for Network Reconfiguration Problem in Distribution Systems)

  • 이상봉;김규호;김철환
    • 전기학회논문지
    • /
    • 제58권9호
    • /
    • pp.1667-1673
    • /
    • 2009
  • This paper presents a application of new algorithm for feeder reconfiguration problem in distribution systems. Harmony Search (HS) algorithm, which is motivated from the musical performance, is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off the sectionalizing and the tie-line switches. In optimization processing, the HS algorithm has searching ability for the global optimal solution, simple coding of the iteration procedure, and fast convergence to get the solution. The HS algorithm is tested on 15 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate switching options without the occurrence of any misdetermination in switching and get the minimum power loss.

윈도우 버튼 배열 구조의 사용성 평가 (Usability Evaluation of a Window Button Arrangement)

  • 김태훈;한성호;권민정;이승희
    • 대한인간공학회지
    • /
    • 제25권2호
    • /
    • pp.23-32
    • /
    • 2006
  • Window buttons located on a task bar provide information about windows that have been open as well as active. When the number of buttons on the task bar increases, the button size gets smaller and as a result, it is more difficult to identify. This study proposes new alternatives of presenting window buttons to search for a target button efficiently. An experiment was conducted to evaluate the usability of the new. Factors manipulated in the experiment include 'button arrangement methods' and 'order of buttons'. The 'button arrangement methods' factor is composed of three levels, 'one line', 'changeable line', and 'grouping buttons'. The 'order of buttons' factor is composed of three levels, 'fixed order', 'click-right', and 'order control by user'. The results showed that the main effects were significant in search time. In subjective satisfaction, the interaction effect was also significant. The results could be applied to the design of small screens such as PDA or cellular phones.

유니사이클 로봇의 주행경로를 변경하기 위한 퍼지룰의 구성

  • 김중완;안찬우;전언찬;한근조
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1997년도 춘계학술대회 논문집
    • /
    • pp.761-765
    • /
    • 1997
  • Our study of rider's postulator stability and tracking control on a unicycle began form the observation of a human riding. The system including unicycle and human operationg his unicycle is a fuzzy intelligent biomechanical model on basis of instinct and intuition search mechanisms. We proposed a robotic unicycle with one wheel and one body as a basic mode and derived equation of motion to this model. Our works is in making out fuzzy look-up table to control robotic unicycle. Fuzzy look-up table were determined for staight line and curve under reasonable inference emulating human's instinct and intuition riding a unicyale. Simulation results show that postulator stability and tracking control on both straight line and curve were successful by using proposed each fuzzy look-up table.

  • PDF

A HYBRID METHOD FOR NCP WITH $P_0$ FUNCTIONS

  • Zhou, Qian;Ou, Yi-Gui
    • Journal of applied mathematics & informatics
    • /
    • 제29권3_4호
    • /
    • pp.653-668
    • /
    • 2011
  • This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.

GLOBAL CONVERGENCE OF A MODIFIED BFGS-TYPE METHOD FOR UNCONSTRAINED NON-CONVEX MINIMIZATION

  • Guo, Qiang;Liu, Jian-Guo
    • Journal of applied mathematics & informatics
    • /
    • 제24권1_2호
    • /
    • pp.325-331
    • /
    • 2007
  • To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

3축 자계 측정 시스템의 개발 (The Development of Magnetic Field Measurement System of 3 Axis)

  • 김기준
    • 한국전기전자재료학회논문지
    • /
    • 제30권4호
    • /
    • pp.253-257
    • /
    • 2017
  • Nowadays, it is increasingly important to detect whether cables are live for the operator's safety if there is a sudden power failure. It is especially hard to detect the electrical field of an underground line because of shielding. This paper on detection of live-line states in cables studied the detection characteristics of the change in the magnetic field and axis as the frequency, voltage, and distance at the same load are changed using 3 axes. A search coil type was used as a magnetic field sensor with non-contact. We found that magnetic fields decrease proportionally to the square of the distance and the decrease of rated voltage with load effected to magnetic field. The magnetic field was detected by 3-axis sensors given correct proximity, but appeared as noise components beyond a distance of 2 cm.

ON STRONG CONVERGENCE THEOREMS FOR A VISCOSITY-TYPE TSENG'S EXTRAGRADIENT METHODS SOLVING QUASIMONOTONE VARIATIONAL INEQUALITIES

  • Wairojjana, Nopparat;Pholasa, Nattawut;Pakkaranang, Nuttapol
    • Nonlinear Functional Analysis and Applications
    • /
    • 제27권2호
    • /
    • pp.381-403
    • /
    • 2022
  • The main goal of this research is to solve variational inequalities involving quasimonotone operators in infinite-dimensional real Hilbert spaces numerically. The main advantage of these iterative schemes is the ease with which step size rules can be designed based on an operator explanation rather than the Lipschitz constant or another line search method. The proposed iterative schemes use a monotone and non-monotone step size strategy based on mapping (operator) knowledge as a replacement for the Lipschitz constant or another line search method. The strong convergences have been demonstrated to correspond well to the proposed methods and to settle certain control specification conditions. Finally, we propose some numerical experiments to assess the effectiveness and influence of iterative methods.