• Title/Summary/Keyword: 거리 정보

Search Result 5,309, Processing Time 0.035 seconds

Range finding algorithm of equidistance stereo catadioptric mirror (등거리 스테레오 전방위 렌즈 영상에 대한 위치 측정 알고리즘)

  • Choi, Young-Ho
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.149-161
    • /
    • 2005
  • Catadioptric mirrors are widely used in automatic surveillance system. The major drawback of catadioptric mirror is its unequal image resolution. Equidistance catadioptric mirror can be the solution to this problem. Even double panoramic structure can generate stereo images with single camera system. So two images obtained from double panoramic equidistance catadioptric mirror can be used in finding the depth and height values of object's points. But compared to the single catadioptric mirror. the image size of double panoramic system is relatively small. This leads to the severe accuracy problem in estimation. The exact axial alignment and the exact mount of mirror are the sources that can be avoided but the focal length variation is inevitable. In this paper, the effects of focal length variation on the computation of depth and height of object' point are explained and the effective focal length finding algorithm, using the assumption that the object's viewing angles are almost same in stereo images, is presented.

  • PDF

Interactive Facial Expression Animation of Motion Data using CCA (CCA 투영기법을 사용한 모션 데이터의 대화식 얼굴 표정 애니메이션)

  • Kim Sung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.6 no.1
    • /
    • pp.85-93
    • /
    • 2005
  • This paper describes how to distribute high multi-dimensional facial expression data of vast quantity over a suitable space and produce facial expression animations by selecting expressions while animator navigates this space in real-time. We have constructed facial spaces by using about 2400 facial expression frames on this paper. These facial spaces are created by calculating of the shortest distance between two random expressions. The distance between two points In the space of expression, which is manifold space, is described approximately as following; When the linear distance of them is shorter than a decided value, if the two expressions are adjacent after defining the expression state vector of facial status using distance matrix expressing distance between two markers, this will be considered as the shortest distance (manifold distance) of the two expressions. Once the distance of those adjacent expressions was decided, We have taken a Floyd algorithm connecting these adjacent distances to yield the shortest distance of the two expressions. We have used CCA(Curvilinear Component Analysis) technique to visualize multi-dimensional spaces, the form of expressing space, into two dimensions. While the animators navigate this two dimensional spaces, they produce a facial animation by using user interface in real-time.

  • PDF

Construction of Large Library of Protein Fragments Using Inter Alpha-carbon Distance and Binet-Cauchy Distance (내부 알파탄소간 거리와 비네-코시 거리를 사용한 대규모 단백질 조각 라이브러리 구성)

  • Chi, Sang-mun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.12
    • /
    • pp.3011-3016
    • /
    • 2015
  • Representing protein three-dimensional structure by concatenating a sequence of protein fragments gives an efficient application in analysis, modeling, search, and prediction of protein structures. This paper investigated the effective combination of distance measures, which can exploit large protein structure database, in order to construct a protein fragment library representing native protein structures accurately. Clustering method was used to construct a protein fragment library. Initial clustering stage used inter alpha-carbon distance having low time complexity, and cluster extension stage used the combination of inter alpha-carbon distance, Binet-Cauchy distance, and root mean square deviation. Protein fragment library was constructed by leveraging large protein structure database using the proposed combination of distance measures. This library gives low root mean square deviation in the experiments representing protein structures with protein fragments.

A Study on the Optimal Operation of Satellite Range Measurement for KOMPSAT II (다목적실용 위성 2호의 위성 거리 측정 최적 운용 방안 연구)

  • Kim, Young-Wan;Ahn, Sang-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.1
    • /
    • pp.31-37
    • /
    • 2010
  • Based on the analyses of satellite range measurement, the optimal operation for satellite range measurement of KOMPSAT II, which operates in the low-earth orbit, was proposed in this paper. The orbital motion of the satellite was analyzed in viewpoints of radial velocity, acceleration and speed of acceleration. Correspondingly the effects for satellite ranging signal due to satellite motion were analyzed in viewpoints of doppler phenomena, which are doppler frequency, doppler rate and speed of doppler rate. The accuracy and ambiguity probability of the satellite range measurement were quantitatively analyzed under various circumstances. The optimal operation parameters for satellite range measurement were also analyzed based on the analyzed results. The analyzed results in this paper can be utilized in design of small-sized ground station for satellite range measurement.

Implementation of IEEE 802.15.4a Software Stack for Ranging Accuracy Based on SDS-TWR (SDS-TWR 기반의 거리측정 정확도를 위한 IEEE 802.15.4a 소프트웨어 스택 구현)

  • Yoo, Joonhyuk;Kim, Hiecheol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.6
    • /
    • pp.17-24
    • /
    • 2013
  • The localization accuracy in wireless sensor networks using ranging-based localization algorithms is greatly influenced by the ranging accuracy. Software implementation of HAL(Hardware Abstraction Layer) and MAC(Medium Access Layer) should seamlessly deliver the raw performance of ranging-based localization provided by hardware capability fully to the applications without degrading the raw performance. This paper presents the design and implementation of the software stack for IEEE 802.15.4a which supports normal ranging mode of the Nanotron's NA5TR1 RF chip. The experiment results shows that average ranging error rate with our implementation is 24.5% for the normal mode of the SDS-TWR ranging scheme.

Applications of Geographic Information Systems in LIS (문헌정보학 분야에서의 지리정보시스템의 활용)

  • Park, Sung-Jae
    • Journal of the Korean Society for information Management
    • /
    • v.28 no.3
    • /
    • pp.163-178
    • /
    • 2011
  • Using the library users' data in Lake County Public Library Systems, Florida, US, this study discussed how geographic information systems can be applied in LIS fields. These data were analyzed with such GIS functions as geocoding, Thiessen polygon, density, buffer, and distance measurement. Results indicate that findings from a study of these functions allowed for, not only a better understanding of the geographic locations of library users and user's library activity patterns, but also for the ability to identify library market areas for future library service planning. Additionally, results from a study of the Thiesen polygon and buffer functions indicated the distance impact on library use. Regarding the travel distance of library users, the measurement of distance using road networks was suggested.

The Consensus String Problem based on Radius is NP-complete (거리반경기반 대표문자열 문제의 NP-완전)

  • Na, Joong-Chae;Sim, Jeong-Seop
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.3
    • /
    • pp.135-139
    • /
    • 2009
  • The problems to compute the distances or similarities of multiple strings have been vigorously studied in such diverse fields as pattern matching, web searching, bioinformatics, computer security, etc. One well-known method to compare multiple strings in the given set is finding a consensus string which is a representative of the given set. There are two objective functions that are frequently used to find a consensus string, one is the radius and the other is the consensus error. The radius of a string x with respect to a set S of strings is the smallest number r such that the distance between the string x and each string in S is at most r. A consensus string based on radius is a string that minimizes the radius with respect to a given set. The consensus error of a string with respect to a given set S is the sum of the distances between x and all the strings in S. A consensus string of S based on consensus error is a string that minimizes the consensus error with respect to S. In this paper, we show that the problem of finding a consensus string based on radius is NP-complete when the distance function is a metric.

A Range Dependent Structural HRTF Model for 3D Sound Generation in Virtual Environments (가상현실 환경에서의 3 차원 사운드 생성을 위한 거리 변화에 따른 구조적 머리전달함수 모델)

  • Lee, Young-Han;Lee, Gil-Ho;Kim, Hong-Kook
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.632-637
    • /
    • 2006
  • 본 논문에서는 가상현실 환경에서 방위각, 고도, 거리 등의 위치 정보를 인지할 수 있는 3 차원 사운드를 생성하기 위한 구조적 머리전달함수(Head-Related Transfer Function, HRTF) 모델을 제안하고 이를 구현한다. 이를 위해 우선 기존에 연구된 방위각과 고도에 관한 head model 과 pinna model 을 근간으로 거리의 변화를 고려하도록 하는 HRTF 모델을 제안한다. 제안된 거리 변화에 따른 HRTF 모델은 거리 차이에 따른 음압의 변화 모델과 근거리에서 사람의 머리에 의해 생기는 shadowing 모델로 구성된다. 본 논문에서는 제안한 모델로 부터 mono 사운드를 방위각, 고도, 거리를 인지할 수 있는 stereo 사운드로 변환하여 생성하는 3 차원 사운드 생성기를 구현하였고, 일반인을 대상으로 거리에 대한 청취 실험을 통하여 제안한 모델의 성능을 측정하였다. 그리고 제안된 모델을 가상현실의 실감모델인 MP3 에 구현하여 그 효과를 입증하였다.

  • PDF

A 3D Image Measurement Algorithm for the Distance Measurement to the Object on 3D Plane (평면상에 존재하는 물체의 거리계측을 위한 3차원 영상계측 알고리즘)

  • 김용준;서경호;김태효
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.12a
    • /
    • pp.65-68
    • /
    • 2000
  • 본 논문에서는 평면상에 존재하는 물체까지의 거리를 카메라시스템을 이용하여 실제 거리를 계측하는 알고기즘을 제안하였다. 계측 시스템을 교정하기 위해, 우선 3차인 실세계 좌표계와 2차원의 카메라 좌표계의 관계를 해석하고, 카메라의 변수들을 포함하는 카메라 좌표계의 변수들을 구하였다. 한편, 3파원 공간에서 계측면을 평면으로 가정하고 평면의 방정식과 좌표계 변환 방정식으로부터 뉴턴-랩슨법을 이용하여 최소값에 대응하는 근사치를 구함으로써 물체까지의 거리 정보를 추출하였다. 실제의 계측 실험에서, 도로에 표준 물체인 Ca]ibration 시트를 두고 승용차의 백미러 위치에 카메라를 설치하고 영상을 획득하였다. 계측 거리는 4m부터 lOm까지는 1m간격으로 계측하고, 10m부터 30m까지는 10m간격으로 계측하였다. 그 결과 4m에서는 약 1.4mm의 오차가 발생하였고, 30m의 거리에서는 3.5m의 오차를 보였는데 계측 거리가 길어질수록 오차가 지수함수적으로 증가함을 알 수 있었다.

  • PDF

Network Distance Estimation Scheme with Virtual Topology and Local Adjustment Term (가상 토폴로지와 지역 조정 항을 이용한 네트워크 거리 추정)

  • Lee, Sang-Hwan
    • 한국IT서비스학회:학술대회논문집
    • /
    • 2006.05a
    • /
    • pp.241-248
    • /
    • 2006
  • 네트워크 거리 (Network distance : 일반적으로 ping이나 traceroute 등으로 측정 가능한 round trip time 등 네트워크 상에서 패킷 전송 시간) 추정 기법은 인터넷상의 많은 응용프로그램들에서 유용하게 사용된다. 예를 들면 다수의 서버를 인터넷상에 설치하고자 하는 경우 사용자들 간의 네트워크 거리를 알고 있다면 서버와 사용자간의 왕복 전송 시간 (Round Trip Time)등을 최소화할 수 있도록 서버를 분산하여 설치하는 구성을 도출해 낼 수 있을 것이다. Peer to Peer 응용 프로그램들에서도 이 네트워크 거리 정보는 매우 유용하다. 기존에 존재하는 추정 기법들은 대부분 유클리드 공간 좌표 기반 기법들로서 유클리드 좌표 상의 거리가 실제 네트워크 거리와 유사하도록 유클리드 공간 좌표를 지정한다. 그러나 이런 방법들의 문제점은 인터넷 상의 네트워크 거리가 삼각 부등식을 만족하지 않는 경우가 존재하는 등 유클리드 공간의 기본적인 가정을 만족하지 못한다는데 있다. 이런 문제점 때문에 새로운 모델이 필요하고, 이 논문에서는 가상 토폴로지(Virtual Topology) 모델과 지역 조정 항 (Local Adjustment Term) 모델을 제시하고, 기본적인 성능 분석을 시도하였다.

  • PDF