• Korean Journal of Cognitive Science
• /
• v.14 no.3
• /
• pp.1-11
• /
• 2003

Two experiments were conducted to investigate effects of target types and retinal eccentricity on the search of a target while both target and background stimuli were static or moving. A visual search task was used in both experiments. The retinal eccentricity was determined by five concentric circles increasing by the unit of 1.6 and the target was different from the background stimuli in either orientation(orientation target) or a distinctive feature(feature target). In Experiment 1 where both the target and background stimuli were presented statically, an interaction between retinal eccentricity arid target type was found. While search time of the orientation target was not affected by the retinal eccentricity, that of the feature target increased as the retinal eccentricity increased. In Experiment 2 where all stimuli were moving, the interaction effect was also found. But the reason was not the same as that in Experiment 1. In the moving condition, while the search time of the orientation target decreased consistently as the retinal eccentricity increased, that of the feature target was not affected by the retinal eccentricity. The implications and limitations of the present results were discussed with respects to the real world situations such as driving cars or flying airplanes.

• Journal of Korea Multimedia Society
• /
• v.22 no.10
• /
• pp.1178-1186
• /
• 2019

In recent years, interest in drones has grown, and many countries are developing them into a strategic industry of the future. Drones are not only used in industries such as logistics and agriculture but also in various public sectors such as life rescue, disaster investigation, traffic control, and firefighting. One of the most important tasks of a drone is to accurately identify targets in these applications. Target recognition may vary depending on the search environment of the drone. Therefore, this study tests and analyzes the drone's target recognition performance according to changes in the search environment such as the search altitude and the search angle. In addition, we propose a new algorithm that improves upon the disadvantages of the Haar cascade method, which is the existing algorithm that recognizes the target by analyzing a captured image.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.05
• /
• pp.9-12
• /
• 1991

The correlation search method yields velocity information by tracking scatter patterns between medical image frames. The displacement vector between a target region and the best correlated search region indicates the magnitude and direction of the inter-frame motion of that particular region. However, if the noise sources in the target region and the search region are correlated Gaussian, then the cross-correlation technique fails to work well because it estimates the cross-correlation of both signals and noises. In this paper we develop a new correlation search method which seeks the best correlated third-order statistics between a target and the search region to suppress the effect of correlated Gaussian noise sources. Our new method yields better estimations of velocity than the conventional cross-correlation method.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.639-647
• /
• 2020

In the vibration target localization algorithms based on time difference of arrival (TDOA), Fang algorithm is often used in practice because of its simple calculation. However, when the delay estimation error is large, the localization equation of Fang algorithm has no solution. In order to solve this problem, one dimensional search location algorithm based on TDOA is proposed in this paper. The concept of search is introduced in the algorithm. The distance d1 between any single sensor and the vibration target is considered as a search variable. The vibration target location is searched by changing the value of d1 in the two-dimensional plane. The experiment results show that the proposed algorithm is superior to traditional methods in localization accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5624-5638
• /
• 2016

A novel method based on Surf points is proposed to detect and lock-track single ground target in aerial videos. Videos captured by moving cameras contain complex motions, which bring difficulty in moving object detection. Our approach contains three parts: moving target template detection, search area estimation and target tracking. Global motion estimation and compensation are first made by grids-sampling Surf points selecting and matching. And then, the single ground target is detected by joint spatial-temporal information processing. The temporal process is made by calculating difference between compensated reference and current image and the spatial process is implementing morphological operations and adaptive binarization. The second part improves KALMAN filter with surf points scale information to predict target position and search area adaptively. Lastly, the local Surf points of target template are matched in this search region to realize target tracking. The long-term tracking is updated following target scaling, occlusion and large deformation. Experimental results show that the algorithm can correctly detect small moving target in dynamic scenes with complex motions. It is robust to vehicle dithering and target scale changing, rotation, especially partial occlusion or temporal complete occlusion. Comparing with traditional algorithms, our method enables real time operation, processing $520{\times}390$ frames at around 15fps.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.33-41
• /
• 2003

It is not easy to find desired information in the world wide web. In this research, we introduce a notion of concept network that is useful in finding information if it is used in search engines that are specialized in domains such as medicine, law or engineering. The concept network that we propose is a network in which nodes represent significant concepts in the domain, and links represent relationships between the concepts. We may use the concept network constructor as a preprocessor to speci-alized search engines. When user enters a target word to find information, our system generates and displays a concept network in which nodes are con-cepts that are closely related with the target word. By reviewing the network, user may confirm that the target word is properly selected for his intention, otherwise he may replace the target word with better ones discovered in the network. In this research, we propose a detailed method to construct concept net-work, implemented a prototypical system that constructs concept networks, and illustrate its usefulness by demonstrating a practical case.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.4
• /
• pp.289-294
• /
• 2013

Due to sudden transition to intellectual society corresponding with fast technology progress, companies and nations need to focus on development and guarantee of intellectual property. The possession of intellectual property has been the important factor of competition power. In this paper we developed the efficient patent search process with big data analysis tool R. This patent search process consists of 5 steps. We result that at first this process obtain the core patent search key words and search the target patents through search formula using the combination of above patent search key words.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.677-680
• /
• 2003

Perceptual landmarks are an effective solution for a mobile robot realizing steady and reliable long distance navigation. But the prerequisite is those landmarks must be detected and recognized robustly at a higher speed under various lighting conditions. This made image processing more complicated so that its speed and reliability can not be both satisfied at the same time. Color based target detection technique can separate target color regions from non-target color regions in an image with a faster speed, and better results were obtained only under good lighting conditions. Moreover, in the case that there are other things with a target color, we have to consider other target features to tell apart the target from them. Such thing always happens when we detect a target with its single character. On the other hand, we can generally search for only one target for each time so that we can not make use of landmarks efficiently, especially when we want to make more landmarks work together. In this paper, by making use of the moment invariants of each landmark, we can not only search specified target from separated color region but also find multi-target at the same time if necessary. This made the finite landmarks carry on more functions. Because moment invariants were easily used with some low level image processing techniques, such as color based target detection and gradient runs based target detection etc, and moment invariants are more reliable features of each target, the ratio of target detection were improved. Some necessary experiments were carried on to verify its robustness and efficiency of this method.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.311-312
• /
• 2007

This dissertation proposes a global search and a local search method to track the object in real-time. The global search recognizes a target object among the candidate objects through the entire image search, and the local search recognizes and track only the target object through the block search. This dissertation uses the object color and feature information to achieve fast object recognition. Finally we conducted an experiment for the object tracking system based on a pan/tilt structure.