• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1997.04a
• /
• pp.131-136
• /
• 1997

This paper represent the variable structure adaptive mode control technique which is new approach to implement the robust control of industrial robot manipulator with external disturbances and parameter uncertainties. Sliding mode control is a well-known technique for robust control of uncertain nonlinear systems. The robustness of sliding model controllers can be shown in contiuous time, but digital implementation may not preserve robustness properties because the sampling process limits the existence of a true sliding mode. the sampling process often forces the trajectory to oscillate in the neighborhood of the sliding surface. Adaptive control technique is particularly well-suited to robot manipulators where dynamic model is highly complex and may contain unknown parameters. Adaptive control algorithm is designed by using the principle of the model reference adaptive control method based upon the hyperstability theory. The proposed control scheme has a simple sturcture is computationally fast and does not require knowledge of the complex dynamic model or the parameter values of the manipulator or the payload. Simulation results show that the proposed method not only improves the performance of the system but also reduces the chattering problem of sliding mode control, Consequently, it is expected that the new adaptive sliding mode control algorithm will be suited for various practical applications of industrial robot control system.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.78-85
• /
• 2007

This paper presents a segmental scheme for regions-composed images in local normalization process. The scheme is based on local statistics computed through a moving window. The normalization algorithm uses linear or nonlinear functions to transfer the pixel distribution and the homogeneous affine of regions which is corrupted by additive noise. It adjusts the mean and standard deviation for nearest-neighbor interpoint distance between current and the normalized image signals and changes the segmentation performance according to local statistics and parameter variation adaptively. The performance of newly advanced local normalization algorithm is evaluated and compared to the performance of conventional normalization methods. Experimental results are presented to show the region segmentation properties of these approaches.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.4 s.316
• /
• pp.93-100
• /
• 2007

In this paper, a novel approach based on wavelet transform is proposed to process the scraped character which is represented on digital image. The basis idea is that the scraped character is described by its textured neighborhood, and it is decomposed into multiresolution features at different levels with its background region. The image is first decomposed into sub bands by applying Daubechies wavelets. Character features are extracted from the low frequency sub-bands by partition, FCM clustering and area-based region process. High frequency ones are activated by applying local energy density over a moving mask. Features are synthesized in order to reconstruct the original image state through inverse wavelet transform Background region is eliminated and character is extracted. The experimental results demonstrate the effectiveness of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.913-921
• /
• 2004

Steganography is a kind of data hiding which can hide secret information to digital media. It is performed so that another person does not recognize any information and make secret communication between each other. Specially, it is not easy to hide secret information without being visually recognized in scanned text image or cartoon image etc. In this paper, we propose an improved method that can embed a large quantity of secret information in a binary image without noticeable artifacts. Binary cartoon image is divided into block of 3-by-3 sizes. Secret information is embedded by using run-length of 8-neighborhood pixels except for the center pixel of the block. To improve the embedding capacity, we embed it into center pixel under to some condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3377-3395
• /
• 2015

Recently, several approaches to share road conditions and/or digital contents through VANETs have been proposed, and such approaches have generally considered the radial distance from the information source as well as the TTL to provision an ephemeral, geographically-limited information sharing service. However, they implement general MANETs and have not been tailored to the constrained movement of vehicles on roads that are mostly linear. In this paper, we propose a novel application-level mechanism that can be used to share road conditions, including accidents, detours and congestion, through a VANET. We assign probabilities to roads around each of the intersections in the neighborhood road network. We then use the graph representation of the road network to build a spanning tree of roads with the information source as the root node. Nodes below the root represent junctions, and the edges represent inter-connecting road segments. Messages propagate along the branches of the tree, and as the information propagates down the branches, the probability of replication decreases. The information is replicated until a threshold probability has been reached, and our method also ensures that messages are not delivered to irrelevant vehicles, independently of their proximity to the source. We evaluated the success rate and performance of this approach using NS-3 simulations, and we used IDM car following and MOBIL lane change models to provide realistic modeling of the vehicle mobility.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1996.10a
• /
• pp.217-227
• /
• 1996

The new filed of learning control develops controllers that learn to improve their performance at executing a given task , based on experience performing this specific task. In a previous work[6], authors presented a theory of indirect learning control based on use of indirect adaptive control concepts employing simultaneous identification and control. This paper develops improved indirect learning control algorithms, and studies the use of such controller indecentralized systems. The original motivation of the learning control field was learning in robots doing repetitive tasks such as on an asssembly line. This paper starts with decentralized discrete time systems. and progresses to the robot application, modeling the robot as a time varying linear system in the neighborhood of the nominal trajectory, and using the usual robot controllers that are decentralized, treating each link as if it is independent of any coupling with other links. The resultof the paper is to show that stability of the indirect learning controllers for all subsystems when the coupling between subsystems is turned off, assures convergence to zero tracking error of the decentralized indirect learning control of the coupled system, provided that the sample tie in the digital learning controller is sufficiently short.

• Journal of Communications and Networks
• /
• v.13 no.2
• /
• pp.102-112
• /
• 2011

In this paper, we propose a privacy-preserving emergency call scheme, called PEC, enabling patients in life-threatening emergencies to fast and accurately transmit emergency data to the nearby helpers via mobile healthcare social networks (MHSNs). Once an emergency happens, the personal digital assistant (PDA) of the patient runs the PEC to collect the emergency data including emergency location, patient health record, as well as patient physiological condition. The PEC then generates an emergency call with the emergency data inside and epidemically disseminates it to every user in the patient's neighborhood. If a physician happens to be nearby, the PEC ensures the time used to notify the physician of the emergency is the shortest. We show via theoretical analysis that the PEC is able to provide fine-grained access control on the emergency data, where the access policy is set by patients themselves. Moreover, the PEC can withstandmultiple types of attacks, such as identity theft attack, forgery attack, and collusion attack. We also devise an effective revocation mechanism to make the revocable PEC (rPEC) resistant to inside attacks. In addition, we demonstrate via simulation that the PEC can significantly reduce the response time of emergency care in MHSNs.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.141-145
• /
• 2005

In this paper, UWB system did research about effect that interference effect with neighborhood single equipment or nearby group equipment gets In DMB service. 2.6425GHz satellite digital multimedia broadcasting service(SDMB) that electric wave interference special quality is contiguity frequency-band including interference of signal by unnecessary radiation level that is radiated in UWB system, and 3.4125GHz broadcasting relay net that is In-band frequency-band and interference effect degree that get in service did comparative analysis. SDMB system was BER $1{\times}10^{-4}$ that interference effect happens from 6.5m point and broadcasting signal reception is possible at 4m point. Also, it was BER $1{\times}10^{-4}$ that interference effect begins to happen from 5.0m point about center frequency 3.4126GHz and broadcasting signal reception is possible at 2m point. And, confirmed that UWB system of impulse method is less interference effect about 2 dB than UWB system of OFDM method, to electric wave of UWB system that is small output

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1382-1396
• /
• 2017

In this paper, we analyze a recently proposed semi-fragile watermarking scheme based on local binary pattern (LBP) operators, and note that it has a fundamental flaw in the design. In this work, a binary watermark is embedded into image blocks by modifying the neighborhood pixels according to the LBP pattern. However, different image blocks might have the same LBP pattern, which can lead to false detection in watermark extraction process. In other words, one can modify the host image intentionally without affecting its watermark message. In addition, there is no encryption process before watermark embedding, which brings another potential security problem. To illustrate its weakness, two special copy-paste attacks are proposed in this paper, and several experiments are conducted to prove the effectiveness of these attacks. To solve these problems, an improved semi-fragile watermarking based on LBP operators is presented. In watermark embedding process, the central pixel value of each block is taken into account and Arnold transform is adopted to guarantee the security of watermark. Experimental results show that the improved watermarking scheme can overcome the above defects and locate the tampered region effectively.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.217-219
• /
• 2019

In response to the increased use of digital video device, more researches are actively made on the image processing technologies. Image processing is practically used on various applied fields such as medical photographic interpretation, and object recognition. The types of image noise include Gaussian Noise, Impulse Noise, and Salt and Pepper. Noise refers to the unnecessary information which damages the video and the noise is mainly removed by a filter. Typical noise removal methods are Median Filter and Average Filter. While Median Filter is effective for removing Salt and Pepper noise, the noise removal performance is relatively lower in the environment with high noise density. To address such issue, this study suggested an algorithm which utilizes neighboring pixels to remove noise.