• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.103-114
• /
• 2012

The many DE based data hiding schemes and the many data hiding schemes based on Histogram shifting are researched in spatial domain. The data hiding scheme based on Histogram shifting have an advantage of low distortion of the stego image. But the capacity is low than other schemes. On the other hands, the DE based data hiding schemes have an advantage of high capacity. But the quality of the stego image is low. In this paper, new data hiding scheme which has the similar capacity but the increased quality of the stego image is proposed. The prediction error is divided into blocks to embed the secret data in this scheme. The prediction errors in the block are scanned before the secret data is embedded. If one prediction error is low than the threshold at least, the block is changed to embed the secret data. Otherwise the secret data is not embedded. The distortion of the stego image is minimized by this method. But the block that the secret data embedded is marked in location map. So the additional information to extract the secret data and recover the cover image is needed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1076-1084
• /
• 2006

In this paper, we first review a concept of hybrid division duplexing (HDD) scheme, which has been proposed as a new type of duplexing scheme useful for a next generation mobile communication system and its implementation issues, including the unified radio resource management for HDD scheme. The HDD scheme maintains the advantages of both TDD and FDD at the same time while providing a useful structure to control the inter-cell interference, caused by an asymmetric traffic load of multimedia services over uplink and downlink in the TDD scheme. Employing two frequency bands, one for TDD scheme and the other for FDD scheme, uplink is operating under the TDD scheme only, while downlink is operating under the TDD or FDD scheme, depending on the location of mobile station. In the HDD scheme, therefore, it must determine a type of duplexing scheme to employ in the downlink and futhermore, a ratio of uplink and downlink duration to meet a given traffic load of asymmetric service, which requires some unified radio resource management for handling the subsequent inter-cell interference. In this paper, we propose a distributed adaptive control approach as a means of unified radio resource management for a HDD system that maximizes the overall system efficiency by fully utilizing the resource in TDD band, while minimizing the inter-cell interference.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.3
• /
• pp.322-331
• /
• 2013

Wireless Mesh Networks(WMNs) is generally composed of radio nodes in the mesh topology. WMNs consists of mesh client, mesh router and gateway connected to a wired network. Each client and router relay messages to the gateway for communication. WMNs is widely used recently in many areas can provide extended coverage based on multi-hop communication and ubiquitous communication at any time and any location. However the competition and collision between each node to transmit data is inevitable when the same channel is used for transmission. The transmission opportunities and the throughput of nodes located far from gateway decrease more if the communication channel is accessed based on competitive CSMA/CA scheme using DCF(Distributed Coordination Function) provided by IEEE 802.11 MAC. In this paper, we improve the performance of the TCP fairness and throughput of the nodes with more than 2 hops by applying various algorithms for controlling contention window values. Also, we evaluate the performance using ns-2 simulator, According to the results, proposed scheme can enhance the fairness characteristic of each node irrespective of data to the gateway.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.129-134
• /
• 2018

Research on the technique for estimating the indoor position has been actively carried out. In particular, the WiFi fingerprint method, which does not require any additional infrastructure, is being partially used because of its high economic efficiency. The KNN method which estimates similar points to the corresponding points by comparing intensity information of the WLAN reception signal measured at various points in advance with intensity information measured at a specific point in the future is simple but has a good performance. However, in the conventional KNN scheme, since the number K of average candidate positions is constant, there is a problem that the position estimation error is not optimized according to a specific point. In this paper, we proposed an algorithm that adaptively changes the K value for each point and applied it to experimental data and evaluated its performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1469-1482
• /
• 1993

A new image coding technique has been proposed based on the wavelet transform. To achieve lower ceding rates and good qualities in reconstructed images, some of wavelet coefficients were removed by thresholding and quantized in accordance with the sensitivity of the human visual system(HVS). For each block of subimages in wavelet transform domain, block thresholding scheme has been used to remove the unimportant wavelet coefficients according to the frequency characteristic and statistical property of wavelet coefficients. The location information of quantized blocks and removed blocks were encoded using run-length coder which is effective for the exponential distribution. Quantized coefficients were encoded using variable length coder which matches well to their distribution. Simulation results show that the reconstructed images maintain high quality with the low bit rate, below 1.0 bits per pel.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.482-489
• /
• 2004

Paging extensions for Mobile IP was proposed to avoid unnecessary registration signaling overhead of Mobile IP. In order to support the paging function in Mobile IP, the slates of a mobile node arc divided into active on, active off, idle. The active on state means when any incoming or outgoing data session arrives to a mobile node. After data session is completed, the state of the motile node is changed into active off from active on. At this moment, the active timer starts to be operated. If the active timer expires, the mobile node moves to idle state. If a mobile node has very frequently data sessions at the same cell, the mobile node is better to move slowly into idle state. The other way, if the mobile node very frequently moves into new cell area and receives or sends little data, the mobile node is better to move earlier into idle state. In this raper, the active timer is adaptively set by the mobile nodes traffic and mobility characteristics and the paging scheme using this active timer is proposed to reduce the location registration cost.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.955-961
• /
• 2010

In this paper, we describe a study of a vehicle detection method based on a Boosting Classifier which uses Histogram of Oriented Gradient (HOG) features and Image Segmentation techniques. An input image is segmented by means of a split and merge algorithm. Then, the two largest segmented regions are removed in order to reduce the search region and speed up processing time. The HOG features are then calculated for each pixel in the search region. In order to detect the vehicle region we used the AdaBoost (adaptive boost) method, which is well known for classifying samples with two classes. To evaluate the performance of the proposed method, 537 training images were used to train and learn the classifier, followed by 500 non-training images to provide the recognition rate. From these experiments we were able to detect the proper image 98.34% of the time for the 500 non-training images. In conclusion, the proposed method can be used for detecting the location of a vehicle in an intelligent vehicle control system.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.6
• /
• pp.15-29
• /
• 2018

This paper proposes an enhanced object tracking algorithm to compensate the lack of temporal information in existing particle swarm optimization based object trackers using the trajectory of the target object. The proposed scheme also enables the tracking and documentation of the location of an online updated set of distractions. Based on the trajectories information and the distraction set, a rule based approach with adaptive parameters is utilized for occlusion detection and determination of the target position. Compare to existing algorithms, the proposed approach provides more comprehensive use of available information and does not require manual adjustment of threshold values. Moreover, an effective weight adjustment function is proposed to alleviate the diversity loss and pre-mature convergence problem in particle swarm optimization. The proposed weight function ensures particles to search thoroughly in the frame before convergence to an optimum solution. In the existence of multiple objects with similar feature composition, this algorithm is tested to significantly reduce convergence to nearby distractions compared to the other existing swarm intelligence based object trackers.

• Journal of the Society of Disaster Information
• /
• v.17 no.4
• /
• pp.802-816
• /
• 2021

Purpose: In this paper, we propose a direction of future research and development to be carried out in the passive tracking field by deriving a white space with enhanced search formula of patent analysis. Method: In this paper, we derive a white space by identifying the direction and the flow of technology change and by matrixing the object and solution through extensive patent search with enhanced search formula and analysis in the field of passive tracking technology. Result: By the proposed scheme, 'multi-target positioning and tracking' and '3D positioning technology' using artificial intelligence, adaptive/hybrid positioning technology, and radar/antenna were derived as white space technologies and confirmed with absence of any services or products. Conclusion: The derived white space technologies from this paper are the areas where patent applications are not active and there are not many prior patents, thus it is necessary to secure the rights through more active R&D and patent application activities.