• Journal of KIISE
• /
• v.42 no.3
• /
• pp.408-412
• /
• 2015

In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.249-255
• /
• 1998

This paper analyzes the impact of Call Setup Time on UPT performance based on the AIN platform. Call Setup Time is used as the performance parameter. In implementing UPT based on the AIN platform, the geographical location of VLR affects network performance. In order to find an optimum location of VLR among three different types of structures, i.e. VLR is located close to Service Switching Point and Cell Site Controller and located at Service Control Point, each Call Setup Time on proposed time delay model is calculated and compared. Network performance is analyzed by changing the number of STP in No.7 signaling network in UPT and the utilization ratio, $\rho$, for SSP, STP and SCP.

• Korean Journal of Cognitive Science
• /
• v.18 no.4
• /
• pp.445-455
• /
• 2007

We present a new biometric identification system based on multi-view features of teeth using principal components analysis(PCA). The multi-view features of teeth consist of the frontal view, the left side view and the right side view. In this paper, we try to stan the foundations of a dental biometrics for secure access in real life environment. We took the pictures of the three views teeth in the experimental environment designed specially and 42 principal components as the features for individual identification were developed. The classification for individual identification based on the nearest neighbor(NN) algorithm is created with the distance between the multi-view teeth and the multi-view teeth rotated. The identification performance after rotating two degree of test data is 95.2% on the left side view teeth and 91.3% on the right side view teeth as the average values.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.3
• /
• pp.199-212
• /
• 2014

This paper describes an autonomous air combat guidance law using a Virtual Pursuit Point (VPP) in one-on-one close engagement for Unmanned Combat Aerial Vehicle (UCAV). The VPPs that consist of virtual lag and lead points are introduced to carry out tactical combat maneuvers. The VPPs are generated based on fighter's aerodynamic performance and Basic Fighter Maneuver (BFM)'s turn circle, total energy and weapon characteristics. The UCAV determines a single VPP and executes pursuit maneuvers based on a smoothing function which evaluates probabilities of the pursuit types for switching maneuvers with given combat states. The proposed law is demonstrated by high-fidelity real-time combat simulation using commercial fighter model and X-Plane simulator.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.9-15
• /
• 2013

Recent works on ad hoc network study have shown that achievable throughput can be made to scale linearly with the number of receive antennas even if the transmitter has only a single antenna. In this paper, we propose a non-parametric linear minimum mean square error (MMSE) receiver for achieving further gain in performance when the channel state information at receiver (CSIR) of interferers is imperfect. The key feature to make our approach effective is to exploit the autocorrelation of the received signal. In fact, by incorporating the desired channel information on top of the observations including interference and noise only, the proposed method achieves large fraction of the optimal MMSE transmission capacity without transmission rate loss. From the SINR analysis as well as transmission capacity simulations in realistic ad hoc network system, we show that the proposed non-parametric linear MMSE receiver brings substantial performance gain over existing multiple receive antenna algorithms.

• Journal of the Korean Geographical Society
• /
• v.49 no.6
• /
• pp.865-883
• /
• 2014

This study investigated the carbon offset project activities as the activities of producing commodities by a case study on the Korean Clean Development Mechanism(CDM) industry. This study draw the networks of Korean CDM industry by extracting major agents and surrounding agents and by analyzing the characteristics of the linkages. The project participants owning the CDM projects hires CDM consultancies and designated operational entities(DOEs). The technical knowledge for carbon emission reduction made links between project participants and the CDM project operational knowledge made links between project participants and CDM consultancies. Links between project participants and DOEs are affected by social and geographical proximities. The value of the knowledge for CDM industrial activities determined the role of agents and type of linkages. The agents with the irreplaceable knowledge could be a project conducting firms. The agents without it became outsourcing contractors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6A
• /
• pp.614-623
• /
• 2008

A very low complexity QRD-M algorithm based on adaptive search area is proposed for MIMO systems. The conventional QRD-M scheme extends each survivor paths to all constellation symbols at each layer and selects M paths of minimum path metrics. We found that performance will not be degraded even if we adaptively restrict the survivor path extension only to the neighboring points of temporary detection symbol according to the channel condition at each layer. By employing this feature, we propose a new QRD-M algorithm achieving the near MLD performance with a reduced complexity. We employ the channel gain ratio among the layers as a channel condition indicator, which does not require SNR estimation. The simulation results show that the proposed scheme effectively achieves near MLD performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.54-61
• /
• 2009

This paper proposes a skin segmentation method based on region histograms of the color quantization map. First, we make a quantization map of the image using the JSEG algorithm and detect the skin pixel. For the skin region detection, the similar neighboring regions are set by its similarity of the size and location between the previous frame and the present frame from the each region of the color quantization map. Then we compare the similarity of histogram between the color distributions of each quantized region and the skin color model using the histogram distance. We select the skin region by the threshold value calculated automatically. The skin model is updated by the skin color information from the selected result. The proposed algorithm was compared with previous algorithms on the ECHO database and the continuous images captured under time varying illumination for adaptation test. Our approach shows better performance than previous approaches on skin color segmentation and adaptation to varying illumination.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.2
• /
• pp.213-219
• /
• 2013

Recently, with the rapid advancement in information and communication technology, indoor location-based services(LBSs) that require precise position tracking have been actively studied with outdoor-LBS using GPS. However, in case of a ship which consists of steel structure, it is difficult to measure a precise localization due to significant ranging error by the diffraction and refraction of radio waves. In order to reduce location measurement errors that occur in these indoor environments, this paper presents distance compensation algorithms that are suitable for a narrow passage such as ship corridors without any additional sensors by using UWB(Ultra-wide-band), which is robust to multi-path and has an error in the range of a few centimeters in free space. These improvement methods are that Pythagorean theory and adjacent node technique are used to solve the distance error due to the node deployment and distance variation analysis technique is applied to reduce the ranging errors which are significantly fluctuated in the corner section. The experimental results show that the number of nodes and the distance error are reduced to 66% and 57.41%, respectively, compared with conventional CSS(Chirp spread spectrum) method.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.4
• /
• pp.273-280
• /
• 2013

This paper presents novel OCS-LBP (Oriented Center Symmetric Local Binary Patterns) based on orientation of pixel gradient and image retrieval system based on BoF (Bag-of-Feature) and random forest classifier. Feature vectors extracted from training data are clustered into code book and each feature is transformed new BoF feature using code book. BoF features are applied to random forest for training and random forest having N classes is constructed by combining several decision trees. For testing, the same OCS-LBP feature is extracted from a query image and BoF is applied to trained random forest classifier. In contrast to conventional retrieval system, query image selects similar K-nearest neighbor (K-NN) classes after random forest is performed. Then, Top K similar images are retrieved from database images that are only labeled K-NN classes. Compared with other retrieval algorithms, the proposed method shows both fast processing time and improved retrieval performance.