• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.1A
• /
• pp.19-30
• /
• 2012

Recently, vision-based dynamic deflection measurement techniques have significant interests and are getting more popular owing to development of the high-quality and low-price camcorder and also image processing algorithm. However, there are still several research issues to be improved including the self-vibration of vision device, i.e. camcorder, and the image processing algorithm in device aspect, and also the application area should be extended to measure three dimensional movement of floating structures in application aspect. In this study, vision-based dynamic motion measurement technique using multiple targets is proposed to measure three dimensional dynamic motion of floating structures. And also a new scheme to select threshold value to discriminate the background from the raw image containing targets. The proposed method is applied to measure the dynamic motion of large concrete floating quay in open sea area under several wave conditions, and the results are compared with the measurement results from conventional RTK-GPS(Real Time Kinematics-Global Positioning System) and MRU(Motion Reference Unit).

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.17-30
• /
• 2005

A PAK(Password-Authenticated Key Exchange) protocol is used as a protocol to provide both the mutual authentication and allow the communication entities to share the session key for the subsequent secure communication, using the human-memorable portable short-length password, In this paper, we propose distributed key exchange protocols applicable to a smartcard using the MTI(Matsumoto, Takashima, Imai) key distribution protocol and PAK protocol. If only one server keeps the password verification data which is used for password authentication protocol. then It could easily be compromised by an attacker, called the server-compromised attack, which results in impersonating either a user or a server, Therefore, these password verification data should be distributed among the many server using the secret sharing scheme, The Object of this paper Is to present a password-based key exchange protocol which is to allow user authentication and session key distribution, using the private key in a smartcard and a password typed by a user. Moreover, to avoid the server-compromised attack, we propose the distributee key exchange protocols using the MTI key distribution protocol, And we present the security analysis of the proposed key exchange protocol and compare the proposed protocols with the existing protocols.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.51-61
• /
• 2004

In the dental field, the 3D tooth model in which each tooth can be manipulated individually is an essential component for the simulation of orthodontic surgery and treatment. To reconstruct such a tooth model from CT slices, we need to define the accurate boundary of each tooth from CT slices. However, the global threshold method, which is commonly used in most existing 3D reconstruction systems, is not effective for the tooth segmentation in the CT image. In tooth CT slices, some teeth touch with other teeth and some are located inside of alveolar bone whose intensity is similar to that of teeth. In this paper, we propose an image segmentation algorithm based on B-spline curve fitting to produce smooth tooth regions from such CT slices. The proposed algorithm prevents the malfitting problem of the B-spline algorithm by providing accurate initial tooth boundary for the fitting process. This paper proposes an optimal threshold scheme using the intensity and shape information passed by previous slice for the initial boundary generation and an efficient B-spline fitting method based on genetic algorithm. The test result shows that the proposed method detects contour of the individual tooth successfully and can produce a smooth and accurate 3D tooth model for the simulation of orthodontic surgery and treatment.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.116-127
• /
• 1996

In this paper, a scheme of classification of scaled textured images using normalized pattern spectrum incorporating arbitrary scale changes based on mathematical morphology is proposed in more general environments considering camera's zoom-in and zoom-out function. The normalized pattern spectrum means that firstly pattern spectrum is calculated and secondly interpolation is performed to incorporate scale changes according to scale change ratio in the same textured image class. Pattern spectrum is efficiently obtained by using both opening and closing, that is, we calculate pattern spectrum by opening method for pixels which have value more than threshold and calculate pattern spectrum by closing method for pixels which have value less than threshold. Also we compare classification accuracy between gray scale method and binary method. The proposed approach has the advantage of efficient information extraction, high accuracy, less computation, and parallel implementation. An important advantage of the proposed method is that it is possible to obtain high classification accuracy with only (1:1) scale images for training phase.

• Journal of Korea Multimedia Society
• /
• v.15 no.8
• /
• pp.1038-1047
• /
• 2012

The SIP(Session Initation Protocol) is an application layer protocol that is used to establish, release, and change the call session of the IP telephony. In the SIP signalling networks, when the number of the UA(User Agent) requested the call session increase, the number of messages to be processed by SIP proxy server increase. It often will be caused the overload of the SIP proxy server. In this paper, we proposed the overload control method with a normal queue and a delay queue in the SIP proxy server. When it is estimated the overload of the server by the excess of the high threshold in the normal queue, new INVITE messages will be put into the delay queue to reduce the load of the server. It results in some delay of the call session from the INVITE message. Subsequently when the number of messages in the normal queue is reduced below the low threshold, the INVITE messages in the delay queue is processed. The simulation results showed that the number of the retransmission messages by our proposed method was 45% less than the one by the method with single queue. The results also showed that the average call success rate by the proposed method was 2% higher than the one by the method with single queue.

• Journal of Service Research and Studies
• /
• v.7 no.4
• /
• pp.109-126
• /
• 2017

Designing cost-effective service recovery strategies mix has been recognized one of important issues by both service researchers and practitioners. In spite of the rising interest in them, there has been scarce studies on them. In this paper, we try to find cost-effective service recovery strategies mix via game-theoretic modeling. Especially, we focus on the possible incentives such as voucher type reward and service re-performance which have different cost structure. We investigated three questions about the topics as follows:(1) Should the service firm use the possible incentive scheme such as voucher and service re-performance for service recovery?, (2) How much voucher and service re-performance is adequate for service recovery under diverse service failure severity level?, (3) How much voucher and service re-performance is adequate for service recovery under diverse threshold level to make the customer repurchase? The results are as follows:(1) The use of both voucher and service re-performance for service recovery results in greater surplus for the service firm. (2) The higher gets the service failure severity level, the higher total incentives are required in the equilibrium. As service failure severity level gets higher, higher level of discount might be more useful to the service firm. However, service re-performance should be cut down above some critical level of service failure severity in the equilibrium. (3) The higher gets the threshold level to make the customer repurchase, the higher incentives are required in the equilibrium, and the higher portion of voucher incentive is required relative to that of service re-performance in the equilibrium.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.595-598
• /
• 2014

In order to provide the Mobile Stations operating in IEEE 802.11 Wireless LAN network with seamless handover, a comprehensive study on the functions of handover considering various networking environments and characteristics of Mobile Stations is required. Note that the channel scan process finding a new AP takes the major portion of handover time, and this is the most significant issue with seamless handover for real-time multimedia service in WLAN environment. In this paper the functions required to provide seamless handover in IEEE 802.11 WLAN network are identified, and a new scanning technique is proposed with which the Mobile Stations can selectively scan the channels to reduce the channel scan time in various network environments. Here each Mobile Station awares of the channels the neighbor APs are using by scanning them in advance according to the proposed technique. Afterwards, when handover is actually required, the optimal AP is decided quickly by scanning only the predetemined group of channels and order of scan without unnecessary scan of all the channels. In addition, proposes to enter the Scan Trigger Value and Handover Threshold Value in mobile phones in order to prevent the phenomenon can not handover.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.1
• /
• pp.20-27
• /
• 2010

This paper describes a design of 5-stage pipelined de-blocking filter with power reduction scheme and proposes a efficient memory architecture and filter order for high performance H.264/AVC Decoder. Generally the de-blocking filter removes block boundary artifacts and enhances image quality. Nevertheless filter has a few disadvantage that it requires a number of memory access and iterated operations because of filter operation for 4 time to one edge. So this paper proposes a optimized filter ordering and efficient hardware architecture for the reduction of memory access and total filter cycles. In proposed filter parallel processing is available because of structured 5-stage pipeline consisted of memory read, threshold decider, pre-calculation, filter operation and write back. Also it can reduce power consumption because it uses a clock gating scheme which disable unnecessary clock switching. Besides total number of filtering cycle is decreased by new filter order. The proposed filter is designed with Verilog-HDL and functionally verified with the whole H.264/AVC decoder using the Modelsim 6.2g simulator. Input vectors are QCIF images generated by JM9.4 standard encoder software. As a result of experiment, it shows that the filter can make about 20% total filter cycles reduction and it requires small transposition buffer size.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.409-418
• /
• 2004

Multicast services are provided on the Internet in fast increasing . Therefore it is important to keep security for multicast communication. Member leaving is deeply associated with scalability problem for group key management. If one member of the group is removed, new group key has to be generated and distributed to all remaining members of group. Minimizing the number of messages and operation cost for generation of the composite keys are important evaluating criteria of multicast key management scheme since generation and distribution of new keys for rekeying require expensive operation. Batch removal can reduce these important parameters rather than removing members sequentially In fashion one after another. In this paper, Hamming distance is calculated between eve교 members to be removed. The members with Hamming distance less than threshold are selected for rekeying procedure. With running the round assignment algorithm In the case of removing several members simultaneously, our model has advantages of reducing the number of message and operation cost for generation of the composite keys and eliminating possibility of collusion attack for rekeying.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.181-188
• /
• 2011

With the rapid proliferation of wireless networks and mobile computing applications, the landscape of the network security has greatly changed recently. Especially, Vehicular Ad Hoc Networks maintaining network topology with vehicle nodes of high mobility are self-organizing Peer-to-Peer networks that typically have short-lasting and unstable communication links. VANETs are formed with neither fixed infrastructure, centralized administration, nor dedicated routing equipment, and vehicle nodes are moving, joining and leaving the network with very high speed over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connection without centralized control. In this paper, we propose a weighted intrusion detection method using rough set that can identify malicious behavior of vehicle node's activity and detect intrusions efficiently in VANETs. The performance of the proposed scheme is evaluated by a simulation study in terms of intrusion detection rate and false alarm rate for the threshold of deviation number ${\epsilon}$.