• 대한교통학회지
• /
• 제14권3호
• /
• pp.45-59
• /
• 1996

The shortest path algorithm for route guidance is implicitly required not only to support geometrical variations of transportation network such as U-TURN or P-TURN but to efficiency search reasonable routes in searching mechanism. The purpose of this paper is to integrate such two requirements ; that is, to allow U-TURN and P-TURN possibilities and to cut down searching time in locating routes between two points (origin and destination) in networks. We also propose a new type of link searching algorithm which can solve the limitation of vine building algorithm at consecutively left-turn prohibited intersections. The test site is a block of Gangnam road network that has some left-turn prohibited and allowed U-TURN intersections. Four models have been identified to be comparatively analyzed in terms of searching efficiency. The Models are as follows : (i) Model 1 - Link Searching Dijkstra Algorithm without Searching Area Extraction (SAE) ; (ii) Model 2 - Link Searching Dijkstra Algorithm with SAE ; (iii) Model 3 - Link Searching Bidirectional Dijkstra Algorithm without SAE ; and (iv) Model 4 - Link Searching Bidirectional Dijkstra Algorithm with SAE. The results of comparative evaluation show that Model 4 can effectively find optimum path faster than any other models as expected. Some discussions and future research agenda have been presented in the light of dynamic route guidance application of the urban ATIS.

• 한국통신학회논문지
• /
• 제24권12B호
• /
• pp.2438-2446
• /
• 1999

대부분의 블록기반 스테레오 쌍 압축 기술들은 모든 스테레오 쌍에서 가장 일치하는 블록을 찾기 위해 일정한 블록크기와 탐색영역 크기를 사용한다. 그러나 각 스테레오 쌍마다 서로 다른 불일치를 가지기 때문에 모든 스테레오 쌍에 동일한 블록 크기와 탐색영역 크기를 적용하는 것은 효과적이지 못하다. 본 논문에서는 스테레오 쌍의 전체 불일치를 구하는 방법을 제시하고 구하여진 전체 불일치를 사용하여 블록기반 스테레오 쌍의 압축에 적용할 블록 크기와 탐색영역 크기를 결정한다.

• 한국항행학회논문지
• /
• 제10권4호
• /
• pp.385-393
• /
• 2006

본 논문에서는 2.45GHz 대역 RTLS 환경에서 탐색범위 확장을 고려한 위치추정 알고리즘을 제안하고 평균 추정오차 성능을 분석하였다. 확장 가능한 탐색범위는 $300m{\times}300m$, 2차원 평면상의 정사각형으로, 가용리더의 배치 형태는 원형 배치와 사각형 배치 그리고 탐색범위 확장을 위한 축소된 사각형 배치를 고려하였다. 또한, RTLS의 위치추정 실험 조건으로 LOS 전파환경을 가정하였으며, 수신된 sub-blink 수에 따른 가용리더의 배치 형태별로 위치추정 성능을 분석하였다. 본 논문에서 제안하는 위치추정 알고리즘을 적용하여 위치를 추정한 결과, 원형 리더 배치가 탐색범위 확장이 유리한 사각형 리더 배치에 비하여 우수한 위치추정 정확도를 보였다. 이에, 위치추정의 정확도가 우수한 원형배치와 확장이 유리한 사각형 배치의 장점을 절충하여 탐색범위 확장을 위한 축소 사각형 배치를 제안하였으며, 실험 결과, 제안한 위치추정 알고리즘이 탐색범위 확장을 고려한 축소된 사각형 리더 배치에서도 높은 위치추정 성능이 나타남을 확인하였다.

• 한국실내디자인학회논문집
• /
• 제23권2호
• /
• pp.90-98
• /
• 2014

This study has analyzed the meaning of observation time in the course of acquiring the information of subjects who observed the space of hall in subway stations to figure out the process of spatial information excluded and the features of intensive searching. The followings are the results from the analysis of searching process with the interpretation of the process for information acquirement through the interpretation of observation area and time. First, based on the general definition of observation time, the reason for analyzing the features of acquiring spatial information according to the subjects' observation time has been established. The feature of decreased analysis data reflected that of observation time in the process of perceiving and recognizing spatial information, which showed that the observation was focused on the enter of the space during the time spent in the process of observing the space and the spent time with considerable exclusion of bottom end (in particular, right bottom end). Second, while the subjects were observing the space of hall in subway stations, they focused on the top of the left center and the signs on the right exit the most, which was followed by the focus on the both side horizontally and the clock on the top. Third, the analysis of consecutive observation frequency enabled the comparison of the changes to the observation concentration by area. The difference of time by area produced the data with which the change to the contents of spatial searching in the process of searching space could be known. Fourth, as the observation frequency in the area of I changed [three times -> six times -> 9 times], the observation time included in the area increased, which showed the process for the change from perception to recognition of information with the concentration of attention through visual information. It makes it possible to understand that more time was spent on the information to be acquired with the exclusion of the unnecessary information around.

• 대한교통학회지
• /
• 제17권2호
• /
• pp.163-178
• /
• 1999

교통분야에서 이용되는 최단경로 알고리듬은 분할탐색 기법에 기초를 두고 있다. 분할탐색 기법이란 기점으로부터 일정 영역을 분할하여 경로를 탐색, 종점가지의 경로를 구축하는 방법으로써 수형망(Tree Building)알고리듬이나 덩굴망(Vine Building) 알고리듬 등이 여기에 속한다. 그러나 이러한 분할탐색기법의 경우 교통망내에서 복수 수단간의 환승비용이 고려될 경우나 동적 최단경로를 탐색하는 경우에는 교통망을 확장하지 않으면 기종점간의 올바른 최단경로를 찾을 수 없다는 문제점을 가지고 있다. 이러한 문제를 본 연구에서는 탐색 영역 문제(Searching Area Problem)라고 정의하였다. 본 연구에서는 탐색영역문제를 교통망 확장없이 해결할 수 있는 전역 탐색기법으로 유전 알고리듬을 이용하여 개발하였다.

• Communications for Statistical Applications and Methods
• /
• 제8권1호
• /
• pp.73-85
• /
• 2001

The spatial population existing in a plane ares, such as an animal or aerial population, have certain relationships among regions which are located within a fixed distance from one selected region. We consider with the adaptive searching estimation in spatial sampling for a spatial population. The adaptive searching estimation depends on values of sample points during the survey and on the nature of the surfaces under investigation. In this paper we study the estimation by the adaptive searching in a spatial sampling for the purpose of estimating the area possessing a particular characteristic in a spatial population. From the viewpoint of adaptive searching, we empirically compare systematic sampling with stratified sampling in spatial sampling through the simulation data.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.397-401
• /
• 2006

In this paper, we proposed a high precision location estimation algorithm using an enhanced decision scheme for RTLS and analyzed its performance in point of an average estimation error distance at 2D coordinates searching area, $300m\times300m$ and LOS propagation environments. Also the performance was compared with that of conventional TDOA algorithm according to the number of available reader and received sub-blink. From the results, we confirmed that the proposed location estimation algorithm using an enhanced decision scheme was able to improve an estimation accuracy even in boundary region of searching area. Moreover, effectively reduced an error distance in entire searching area so that increased the stability of location estimation in RTLS. Therefore, we verified that the proposed algorithm provided a more higher estimation accuracy and stability than conventional TDOA.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 추계학술대회
• /
• pp.112-115
• /
• 2009

RDS(Radio Data System) 에서의 PI Code 검색 기법은 이동체(Vehicle)에서 원하는 방송을 지속적으로 자동 선국할 수 있는 유일한 방법이다. Original channel의 신호가 나빠지기 전에 좀더 낳은 신호를 찾기 위한, 또한 Weak signal Area에서 벗어나면서 원하는 방송을 빠르게 찾기 위한, 효율적이면서도 빠른 PI Code 검색 기법은 모든 RDS System에서 연구되고 있으나, Embedded system 특성상 Memory size의 제약 등으로 인해, 기 알려진 여러 방법을 쉽게 적용할 수 없는 상황이다. 본 논문은 Embedded System Environment를 십분 고려하여, 간략하면서도 효율적인 PI Code 검출에 대한 기법을 제안한다.

• 전자공학회논문지B
• /
• 제33B권10호
• /
• pp.80-89
• /
• 1996

This paper proposes a new COA (center of area) defuzzifier that is working in the accurate and fast manner. The proposed COA defuzzifier involves both membership values and the spans of membership functions in clauclating a crisp value. In additon, it avoid division by replacing the COA calculation with the searching of the momentum equilibrium point. The moment equilibrium point is searched in the coarse-to-fine manner such that the moment computing points during the coarse searching are moved in the interval of fuzzy terms until they are reached at two adjacent fuzzy terms searching method accerlates the finding of the moment equilibrium point by O(M) mazimally when compared iwth the equal interval searching method of ruitz. In order to verify the accuracy of the proposed COA defuzzifier, the crisp values obtained form the proposed coarse-to-fine searching are compared with the precise crisp values from the arithmetic calculation. Application to the truck backer-upper control problem of the proposed COA defuzzifier is presented. The control performance is compared with that of the conventional COA defuzzifier in tems of the average tracing distance.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.757-760
• /
• 1998

A new motion estimation algorithm with lower computational complexity and good image quality when compared to the FBMA will be presented in this paper. In the proposed method, by considering the relation between neighboring blocks, the searching area in the algorithm is adjustable according to mean absolute difference of the block. By the computer simulation the computation amount of the proposed than that of the FBMA and the good result of the PSNR can be attained.