• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.99-108
• /
• 2004

In this paper, a new fast detection and clutter rejection method is proposed for CCD-image-based Automatic Target Detection System. For defence application, fast computation is a critical point, thus we concentrated on the ability to detect various targets with simple computation. In training stage, 1D template set is generated by regional vertical projection and K-means clustering, and binary tree structure is adopted to reduce the number of template matching in test stage. We also use adaptive skip-width by Correlation-based Adaptive Predictive Search(CAPS) to further improve the detecting speed. In clutter rejection stage, we obtain Fourier Descriptor coefficients from boundary information, which are useful to rejected clutters.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.59-66
• /
• 2005

The organization of the web is progressively more being used to improve search and analysis of information on the web as a large collection of heterogeneous documents. Most people begin at a Web search engine to find information. but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is a intentionally biased web page like Google bombing that is based on the PageRank algorithm. one of many Web structuring techniques. In this thesis, we regard the World Wide Web as a directed labeled graph that Web pages represent nodes and link edges. In the Present work, we define the label of an edge as having a link context and a similarity measure between link context and target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. By suggesting a motivating example, it is explained how our proposed algorithm can filter the Web intentionally biased web Pages effective about $60\%% rather than the conventional PageRank.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2753-2758
• /
• 2009

The Navy is trying to develop a sonar-operation strategy that efficiently searches for underwater targets. To develop an efficient sonar-operation strategy, a simulation system, which can analyze the efficiency of various operation strategies, is needed. The simulation executes the strategical operation by collecting information of sea environment, destroyer, sonar, and target. Also, it should be able to provide diverse information according to its progression. In this study, the simulation system that can evaluate and analyze the effectiveness of the search strategy for underwater targets in different environments was designed and developed. The simulation system was developed, utilizing the sonar equation and the lateral-range-curve, and it portrays many patterns of realistic movements of a target. This system will contribute to developing and improving efficient sonar-operation strategies to find underwater targets in the future.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.63-73
• /
• 2021

The radar operated to detect/track aircraft targets is divided into a search radar that operates while the antenna rotating device rotates for the purpose of detecting the target according to the mission characteristics, and a tracking radar that periodically steers and tracks a beam to the predicted position of the target. The tracking radar has a shorter target information acquisition preiod than the search radar. Due to this characteristic, the tracking accuracy is better than that of the search radar, but as the prediction error increases due to the speed error at the beginning of the tracking, there are many cases in which tracking fails at the beginning of tracking due to failure to perform beam steering normally. In this paper, in order to solve the above-mentioned problems, we propose an algorithm for improving the accuracy of track initiation using radial velocity measurements in addition to the position of the measured, and confirm the performance of the proposed algorithm by comparing with the two point differential algorithm

• Proceedings of the PSK Conference
• /
• 2002.10a
• /
• pp.181-182
• /
• 2002

Recentadvancesin '-omics ' technologies enable us to discover more diverse disease- relevant target proteins, which encourages us to find out more target-specific novel lead compounds as new drug candidates. Therefore, high-throughput screening (HTS) becomes an essential tool in this area. Among many HTS tools, in silico HTS is a very fast and cost-effective tool to try to derive a new lead compound for any new targets, especially when the target protein structures are known or readily modeled. (omitted)

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.1
• /
• pp.5-25
• /
• 2009

In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.782-791
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots. In order to match up targets with measured azimuths, we apply the maximum likelihood (ML), depth-first, and breadth-first tree search algorithms, in which we use the measured azimuths and the number of pixels on IR screen for pruning branches and selecting candidates. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the probability of missing target, mean of the number of calculating nodes, and mean error of the estimated coordinates of the proposed algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.361-367
• /
• 2021

Information search in video streaming services such as YouTube is replacing traditional information search services. To find desired detailed information in such a video, users should repeatedly navigate several points in the video, resulting in a waste of time and network traffic. In this paper, we propose a method to assist users in searching for information in a video by using DBSCAN clustering and LSTM. Our LSTM model is trained with a dataset that consists of user search sequences and their final target points categorized by DBSCAN clustering algorithm. Then, our proposed method utilizes the trained model to suggest an expected category for the user's desired target point based on a partial search sequence that can be collected at the beginning of the search. Our experiment results show that the proposed method successfully finds user destination points with 98% accuracy and 7s of the time difference by average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2321-2326
• /
• 2011

Cervical vertebrae are a complex structure and an important part of human body connecting the head and the trunk. In this paper, we propose a method to extract sternocleidomastoid muscle from ultrasonography images of cervical vertabrae automatically. In our method, Region of Interests(ROI) is extracted first from an ultrasonography image after removing unnecessary auxiliary information such as metrics. Then we apply Ends-in search stretching algorithm in order to enhance the contrast of brightness. Average binarization is then applied to those pixels which its brightness is sufficiently large. The noise part is removed by image processing algorithms. After extracting fascia encloses sternocleidomastoid muscle, target muscle object is extracted using the location information of fascia according to the number of objects in the fascia. When only one object is to be extracted, we search downward first to extract the target muscle area and then search from right to left to extract the area and merge them. If there are two target objects, we extract first from the upper-bound of higher object to the lower-bound of lower object and then remove the fascia of the target object area. Smearing technique is used to restore possible loss of the fat area in the process. The thickness of sternocleidomastoid muscle is then calculated as the maximum thickness of those extracted objects. In this experiment with 30 real world ultrasonography images, the proposed method verified its efficacy and accuracy by health professionals.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.3
• /
• pp.362-370
• /
• 2011

This paper presents a K-band radar system installed on the ground moving vehicle to detect and track a high-speed target. The presented radar is separated into three search regions to satisfy a wide area detection and a limitation of the installing space of the radar, and each region performs detecting the target independently and tracking the detected target automatically. The presented radar radiating K-band FMCW waveform acquires range and velocity information of the target at the every dwell and receiving antenna of the radar is applied the multiple baseline interferometer to extract the precise angle information of the target. 3-dimensional tracking accuracy of the radar is 0.25 m RMSE measured actually through a fire experiment of an imitation target.