• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.552-554
• /
• 2003

Searching and enhancement of shadow area in the satellite imagery is one of growing interest because of new possible needs of application in this field. This paper proposes an algorithm to search and enhance the shadow areas caused by buildings such as apartments which are very common in Korean satellite imagery. The proposed searching algorithm makes use of characteristics of histogram of images in the spatial domain and also uses the fast Fourier transform and correlation in Frequency domain. Further, the enhancement algorithm is only applied to the shadow areas searched and preserves the areas which are naturally dark.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.824-830
• /
• 2010

It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.

• Korean Journal of Organic Agriculture
• /
• v.17 no.4
• /
• pp.463-481
• /
• 2009

Regional Agricultural Cluster(RAC) at Asan area has been formed with Purundeul farming union corporation(Purundeul) as the center from the year 2005. Originally, RAC has been proceeded by Ministry for Food, Agriculture, Forestry and Fisheries (MFAFF) all over the nation from 2005. This RAC has helped Asan area to establish the foundation of environmentally friendly agriculture(EFA) searching for nutritional cycle. This also made jumping age turn developing age in EFA at Asan area. The number of Purundeul producer members was 386 farmers in 2008. Purundeul introduced organic livestock farming(Korean beef cattle; Hanwoo) for proceeding EFA searching for nutritional cycle in 2007, and had 719 cattle at the end of March 2009. Feedstuff materials for organic livestock is mostly produced from seeding farming by-products within Asan or the country. Asan RAC had built factories for feedstuff producing and beef processing with producers' investment.

• The Korean Journal of Applied Statistics
• /
• v.9 no.2
• /
• pp.145-159
• /
• 1996

We propose an adaptive searching method using some spatial relations among sample points to estimate the interesting area in the spatial population. The fundamental idea is to observe the neighboring sample points when a sample point is satified with some condition of an adaptive searching observation. For obseving the sample points with this method to estimate the area the sample size is decreased. From this result, we may expect to reduce the cost and time consuming in observation the sample points and to draw the shape of the interesting area without prior information of an spatial population. Some analytical simulation results are also presented.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.542-546
• /
• 2009

This paper introduces a Mixed-Reality based Software technology in Smart-Phone Environment. The field of Mixed-Reality in mobile environment is relatively young. but Cause to develop Mobile infra and improvement of mobile device, open-platform mobile OS, the request extended This paper suggest the method for Marker Detection and Marker Tracking method. This method is the one of some kind of a base-technology in Mixed Reality. this method is to effect to location and registration. This paper suggest the method in low CPU computing power. Using a deformable searching area, the method improve computing power. and Using a Cam-shift algorithm, we suggest a calibration free method.

• The Research Journal of the Costume Culture
• /
• v.10 no.2
• /
• pp.186-199
• /
• 2002

This study is carried out to examine the purpose of utilization and the degree of satisfaction on the information collected from the Internet site for the understanding of the reality of clothing information for college students. The results are as fellows; 1 . Three primary factors have been abstracted for the satisfaction of information. 2. The difference in the purpose of utilizing information, depending on the individual characteristic of students and the features related to computer, was shown in the difference of major and school year, number of the internet connection per day, capability of using computer, period of using computer, and frequency of information searching. The more the number of internet connection per day, the less the capability of using computer, and searching for information when required, internet can be utilized for study and work. 3. The difference in the degree of information satisfaction, depending on the individual characteristic of students and the features related to computer, was shown in the difference of major, school year, opportunity to take computer-related course, frequency of searching information, and etc. More positive and satisfactory response was derived from these not majoring in clothing rather than those majoring, those taking computer course related to clothing, and those searching for clothing information periodically. 4. The primary factors affecting the satisfaction on the overall information of clothing show difference in terms of sex and frequency of searching information. Female students show lower degree of satisfaction than male students and more satisfaction on the information searched as the frequency of searching becomes less.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.57-64
• /
• 2020

In this paper, we propose an scalable re-detection for correlation filter in visual tracking. In real world, there are lots of target disappearances and reappearances during tracking, thus failure detection and re-detection methods are needed. One of the important point for re-detection is that a searching area must be large enough to find the missing target. For robust visual tracking, we adopt kernelized correlation filter as a baseline. Correlation filters have been extensively studied for visual object tracking in recent years. However conventional correlation filters detect the target in the same size area with the trained filter which is only 2 to 3 times larger than the target. When the target is disappeared for a long time, we need to search a wide area to re-detect the target. Proposed algorithm can search the target in a scalable area, hence the searching area is expanded by 2% in every frame from the target loss. Four datasets are used for experiments and both qualitative and quantitative results are shown in this paper. Our algorithm succeed the target re-detection in challenging datasets while conventional correlation filter fails.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.2D
• /
• pp.147-154
• /
• 2008

A variety of activity happens around the sidewalk in the city. Particularly, a large variety of activity happens in shopping area, but it causes an obstruction of economical revitalization since the pedestrians require time and cost to find what they want. So, this study will develop the path searching method to minimize the economical loss of shoppers by providing the significant path and supporting the walking movement. Firstly, consider existing network expression techniques and approach three points which are physical and environmental factor, the recognition of the pedestrians' space when changing the direction, and the recognition of restriction of vision and accessibility. Try to design the network DB and simulate the algorithm. As a result, it is now possible to do the path searching that considers variety of recognition factors and show the method how to make the path-searching algorithm for pedestrian.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.361-366
• /
• 2006

It is widely known that the dynamic optimal path algorithm, adopting real-time path finding, can be supporting an optimal route with which users are satisfied economically and accurately. However, this system has to search optimal routes frequently for updating them. The proposed concept of optimizing search area lets it reach heuristic optimal path rapidly and efficiently. Since optimal path should be increased in proportion to an distance between origin and destination, tremendous calculating time and highly efficient computers are required for searching long distance journey. In this paper, as a result of which the concepts of partial solution and representative path are suggested. It was possible to find an optimal route by decreasing a half area in comparison with the previous method. Furthermore, as the size of the searching area is uniform, comparatively low efficient computer is required for long distance trip.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.