• Journal of Korean Society of Transportation
• /
• v.14 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2438-2446
• /
• 1999

Most of block based stereo pair compression schemes utilize the constant block size and searching area size for all the stereo pairs to find the best matching block. However, it is not efficient to use the same block size and size of searching area to all the stereo pairs, since each stereo pair has different disparity. In this Paper, we propose a method to calculate the total disparity of stereo pairs, and show how to determine the size of the block and searching area which are applied for the block based compression of the stereo pairs.

• Journal of Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.385-393
• /
• 2006

In this paper, we proposed a location estimation algorithm considering an extension of searching area in 2.45GHz band RTLS and analyzed its performance in terms of an average estimation error distance. The extendable searching area was assumed to be square of $300m{\times}300m$ and 2 dimensions. The arrangement shape of available readers was considered circle, rectangle, and shrinkage rectangle for extendable searching area. Also, we assumed that propagation path was LOS (Line-Of-Sight) environment, and analyzed the estimation error performance as a function of the number of received sub-blink considering an arrangement shape of available readers in searching area. From the results, compared with rectangle shape, circle shape showed the higher estimation accuracy. Also, we confirmed that the proposed location estimation algorithm provided high estimation accuracy in the shrinkage rectangle shape that was suitable for extension of searching area.

• Korean Institute of Interior Design Journal
• /
• v.23 no.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.

• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.163-178
• /
• 1999

Conventional shortest path searching a1gorithms are based on the partial searching method such as Dijsktra, Moore etc. The a1gorithms are effective to find a shortest path in mini-modal condition of a network. On the other hand, in multi-modal case they do not find a shortest path or calculate a shortest cost without network expansion. To copy with the problem, called Searching Area Problem (SAP), a global searching method is developed in this paper with Genetic Algorithm. From the results of two examples, we found that the a1gorithm is useful to solving SAP without network expansion.

• Communications for Statistical Applications and Methods
• /
• v.8 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.112-115
• /
• 2009

PI code searching method of RDS(Radio Data System) are unique method of maintain desired channel on moving machine like vehicle. Efficient and fast PI code search method are researching on the all of RDS related systems for both find more better channel before Original channel signal go to bad and find desired good signal quickly when get out of Weak signal Area. But Embedded system has limited environment like memory size, so It is very difficult to apply many well known PI code searching method. This thesis suggests simple and effective method of searching PI code, considering a Embedded System Environment.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.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.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• 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.