• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.12
• /
• pp.1207-1215
• /
• 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 consideration of obstacles. In order to match up targets with measured azimuths, to add to the depth-first search (DFS) algorithms in free-obstacle environment, we suggest the expanded DFS (EDS) algorithm including bypass path search, partial path search, middle level ending, and the supplementation of decision metric. 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 error rate of estimated location, mean number of calculating nodes, and mean distance between real coordinates and estimated coordinates of the proposed algorithms.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.651-659
• /
• 2005

For segmentation of constrained and handwritten Hangul, a new method, which has been not introduced, was proposed and implemented to use virtual network search system in the space between characters. The proposed system was designed to be used in all cases in unconstrained handwritten Hangul by various writers and to make a number of curved segmentation path using a virtual network to the space between characters. The proposed system prevented Process from generating a path in a wrong position by changing search window upon target block within a search process. From the experimental results, the proposed virtual network search system showed segmentation accuracy of $91.4\%$ from 800 word set including touched and overlapped characters collected from various writers.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.1-7
• /
• 2023

In this paper, we propose a base address candidate selection method using the $gp register and page granularity as a way to build a static analysis environment for firmware based on MIPS architecture. As a way to shorten the base address search time, which is a disadvantage of the base address candidate selection method through inductive reasoning in existing studies, this study proposes a method to perform page-level search based on the $gp register in the existing base address candidate selection method as a reference point for search. Then, based on the proposed method, a base address search tool is implemented and a static analysis environment is constructed to prove the validity of the target tool. The results show that the proposed method is faster than the existing candidate selection method through inductive reasoning.

• BMB Reports
• /
• v.35 no.6
• /
• pp.623-628
• /
• 2002

The Th1 vs. Th2 balance is critical for the maintenance of immune homeostasis. Therefore, the genes that are selectively-regulated by the Th1 and Th2 cytokines are likely to play an important role in the Th1 and Th2 immune responses. In order to search for and identify the novel target genes that are differentially regulated by the Th1/Th2 cytokines, the human PBMC mRNAs differentially expressed upon the stimulation with IL-4 or IL-12, were screened by employing the differential display-polymerase chain reaction. Among a number of clones selected, DC21 was identified as a novel target gene that is regulated by IL-4 and IL-12. The DC21 gene expression was up-regulated either by IL-4 or IL-12, yet counter-regulated by co-treatment with IL-4 and IL-12. DC21 is a dendritic cell protein with an unknown function. The sequence analysis and conserved-domain search revealed that it has two AU-rich motifs in the 3'UTR, which is a target site for the regulation of mRNA stability by cytokines, and that it belongs to the N-acetyltransferase family. The induction of DC21 by IL-12 peaked around 8-12 h, and lasted until 24 h. LY294002 and SB203580 significantly suppressed the IL-12-induced DC21 gene expression, which implies that PI3K and p38/JNK are involved in the IL-12 signal transduction pathway that leads to the DC21 expression. Furthermore, tissue blot data indicated that DC21 is highly expressed in tissues with specialized-resident macrophages, such as the lung, liver, kidney, and placenta. Together, these data suggest a possible role for DC21 in the differentiation and maturation of dendritic cells regulated by IL-4 and IL-12.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.12
• /
• pp.856-864
• /
• 2019

The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.10
• /
• pp.1062-1068
• /
• 2014

In this paper, a novel approach estimating target's rotation velocity(RV) is proposed for inverse synthetic aperture radar(ISAR) cross-range scaling(CRS). Scale invariant feature transform(SIFT) is applied to two sequently generated ISAR images for extracting non-fluctuating scatterers. Considering the fact that the distance between target's rotation center(RC) and SIFT features is same, we can set a criterion for estimating RV. Then, the criterion is optimized through the proposed method based on particle swarm optimization(PSO) combined with exhaustive search method. Simulation results show that the proposed algorithm can precisely estimate RV of a scenario based maneuvering target without RC information. With the use of the estimated RV, ISAR image can be correctly re-scaled along the cross-range direction.

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

In this paper, we propose a target image exchange model to improve performance of the object tracking algorithm based on a Siamese network. The object tracking algorithm based on the Siamese network tracks the object by finding the most similar part in the search image using only the target image specified in the first frame of the sequence. Since only the object of the first frame and the search image compare similarity, if tracking fails once, errors accumulate and drift in a part other than the tracked object occurs. Therefore, by designing a CNN(Convolutional Neural Network) based model, we check whether the tracking is progressing well, and the target image exchange timing is defined by using the score output from the Siamese network-based object tracking algorithm. The proposed model is evaluated the performance using the VOT-2018 dataset, and finally achieved an accuracy of 0.611 and a robustness of 22.816.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.5
• /
• pp.373-381
• /
• 2017

DBS(Doppler Beam Sharpening) algorithm is a way to improve azimuth resolution performance in radar. Since DBS image includes the is information about the search area of radar, various clutter components exist besides the target to be detected. To detect and track the desired target in a DBS image, it must be able to identify a target and the clutter components. In this paper, we describe how to use image size and terrain information(DTED) to identify the target in a DBS image. By using morphological filter and chain code, it acquires image size and excludes the clutter components. By matching with DTED, we determine target.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1166-1191
• /
• 2011

This paper presents an adaptive active tracking system with sector based scanning for a single PTZ camera. Dividing sectors on an image reduces the search space to shorten selection time so that the system can cover many targets. Upon the selection of a target, the system estimates the target trajectory to predict the zooming location with a finite amount of time for camera movement. Advanced estimation techniques using probabilistic reason suffer from the unknown object dynamics and the inaccurate estimation compromises the zooming level to prevent tracking failure. The proposed system uses the simple piecewise estimation with a few frames to cope with fast moving objects and/or slow camera movements. The target is tracked in multiple steps and the zooming time for each step is determined by maximizing the zooming level within the expected variation of object velocity and detection. The number of zooming steps is adaptively determined according to target speed. In addition, the iterative estimation of a zooming location with camera movement time compensates for the target prediction error due to the difference between speeds of a target and a camera. The effectiveness of the proposed method is validated by simulations and real time experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.