• Korean Journal of Remote Sensing
• /
• v.28 no.4
• /
• pp.347-355
• /
• 2012

A fast algorithm for endmember extraction is proposed in this study which extracts min. and max. pixels from each band after MNF transform as candidate pixels for endmember. This method finds endmembers not from the entire image pixels but only from the previously extracted candidate pixels. The experimental results by N-FINDR using a simulated hyperspectral image data and AVIRIS Cuprite image data showed that the proposed fast algorithm extracts the same endmembers with the conventional methods. More studies on the effect of noise and more adaptive criteria in extracting candidate pixels are expected to increase the usability of this method for more fast and efficient analysis of hyperspectral image data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.802-812
• /
• 2007

A Fast handover protocols for Mobile IPv6 networks can support seamless service by reducing handover latency to mobile nodes. To gain advantage derived from the fast handover in IEEE 802.16e networks, we propose a new fast handover protocol using a multiple simultaneous binding mechanism and a handover protocol based on trigger event for IEEE 802.21 in order to integrate IEEE 802.16e handover protocol and FMIPv6 handover protocol using link layer trigger. Through the numerical analysis, we compare performance of the proposed protocol and FMIPv6 protocol.

• Journal of Information Technology Services
• /
• v.8 no.1
• /
• pp.165-177
• /
• 2009

This paper reviews diverse IP mobility and fast handover mechanisms for seamless Internet services. Especially, fast handover mechanisms for the Proxy Mobile IPv6( PMIPv6) are categorized according to their approaches. Then, a new fast handover PMIPv6(FH-PMIPv6) mechanism is proposed using only L3 signaling message exchange. In the proposed FH-PMIPv6 mechanism, only local mobility anchor(LMA) exchanges L3 signaling messages with mobility access gateways(MAGs) for the fast handover operation. That is, inter-MAG signalling messages are not required for the fast handover operation. Therefore, unlike existing fast handover mechanisms, two relevant neighbouring MAGs need not set up the security association(SA) to protect fast handover related signaling messages and share SA related information. Moreover, the L3 triggering message is defined newly by standard ICMPv6 to trigger promptly the proposed mechanism. Analysis and comparison of the handover latency are performed for the proposed mechanism and existing mechanisms, which shows that the proposed FH-PMIPv6 mechanism has the favorable performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.107-119
• /
• 2013

This paper reinforced security under the network evaluation of wire wireless integration of NEMO (NEwork MObility) supporting mobility and network-based PMIPv6 (Proxy Mobile IPv6). It also proposes $SK-L^2AS$ (Symmetric Key-Based Local-Lighted Authentication Scheme) based on simple key which reduces code calculation and authentication delay costs. Moreover, fast handover technique was also adopted to reduce handover delay time in PMIPv6 and X-FPMIPv6 (eXtension of Fast Handover for PMIPv6) was used to support global mobility. In addition, AX-FPMIPv6 (Authentication eXtension of Fast Handover for PMIPv6) is proposed which integrated $SK-L^2AS$ and X-FPMIPv6 by applying Piggybacks method to reduce the overhead of authentication and signaling. The AX-FPMIPv6 technique suggested in this paper shows that this technique is better than the existing schemes in authentication and handover delay according to the performance analysis.

• 한국IT서비스학회:학술대회논문집
• /
• 2006.11a
• /
• pp.329-334
• /
• 2006

최근 방송통신융합 기술에 대한 관심이 높아지고 있는 상황에서 주문형비디오 서비스에 대한 관심도 증가하고 있다. 본 논문에서는 주문형비디오 서비스의 구현을 위해 기존의 배칭 기법 중 Fast Data broadcasting 방식을 활용한 패칭 기법을 제안한다. 대역폭이 제한되어 있는 통신 환경에서 사용자는 요청한 비디오를 시청하기까지 일정 시간을 기다려야 하는데, 사용자 요청 시점 이전 데이터를 Fast Data broadcasting 방식을 적용한 패칭 채널을 통해 전송함으로써 대기 시간을 크게 줄이는 효과를 얻을 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.51-56
• /
• 2009

Flash memory has rapidly deployed as data storage. However, the flash memory has a major disadvantage that recorded data cannot be dynamically overwritten. In order to solve this "erase-before-write" problem, the log block buffer scheme used Flash memory file system. however, the current managements of the log buffer, in case random write pattern, BAST technique have problem of frequent merge operation, but FAST technique don't consider merge operation by frequently updated data. Previous methods not consider merge operation cost and frequently updated data. In this paper, we propose a new log buffer management scheme, called JBB. Our proposed method evaluates the worth of the merge of log blocks, so we conducts the merge operation between infrequently updated data and its data blocks, and postpone the merge operation between frequently updated data and its data blocks. Through the method, we prevent the unnecessary merge operations, reduce the number of the erase operation, and improve the utilization of the flash memory storage. We show the superiority of our proposed method through the performance evaluation with BAST and FAST.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.301-310
• /
• 2008

In the existing literature, the handover process reveals numerous problems manifested by high movement detection latency. FMIPv6 can reduce packet loss using a tunnel-based handover mechanism. However, this mechanism may cause performance degradation due to the out-of-sequence packets. Recently. Proxy Mobile IPv6 is proposed for network-based mobility management to reduce overhead in mobile node. PMIPv6 can decrease handover latency which related overhead in MN by using network agent. In this paper, we proposed optimized fast handover scheme called Fast Proxy Mobile IPv6 (EF-PMIPv6). The proposed EF-PMIPv6 can support fast handover using fast IAPP and ND schemes. Further, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach focuses on the reduction of handover latency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.4
• /
• pp.53-60
• /
• 2007

In a known plaintext scenario, fast correlation attack is very powerful attack on stream ciphers. Most of fast correlation attacks consider the cryptographic problem as the suitable decoding problem. In this paper, we introduce advanced multi-pass fast correlation attack which is based on the fast correlation attack, which uses parity check equation and Fast Walsh Transform, proposed by Chose et al. and the Multi-pass fast correlation attack proposed by Zhang et al. We guess some bits of initial states of the target LFSR with the same method as previously proposed methods, but we can get one more bits at each passes and we will recover the initial states more efficiently.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.204-206
• /
• 2000

주기억 데이터베이스 시스템은 주기억장치에 데이터베이스 전체를 상주시킴으로써 빠른 성능을 보장하므로 실시간 데이터베이스 시스템에 적합하다. 그러나, 시스템에 장애가 발생했을 때는 주기억 데이터베이스와 내용 전체가 손실될 수 있다. 그러므로, 주기억 데이터베이스 시스템의 회복 작업은 매우 중요하다. 또한 빠른 회복을 해줄 수 있어야 실시간 확경에 적합할 것이다. 로그를 사용하는 주기억 데이터베이스 시스템에서 빠른 회복을 위해서 검사점 방법을 사용한다. 검사점을 사용하여 주기적으로 변경된 내용을 디스크로 옮김으로써 회복할 때 분석해야 할 로그의 양을 줄일 수 있다. 본 논문에서는 기존의 검사점 방법들 중 주기억 데이터베이스 환경에 가장 좋은 성능을 보이는 퍼지 검사점에 관한 방법들을 분석 및 보완하여 빠른 회복을 위한 새로운 기법을 제안하고 이를 FastDB 주기억 데이터베이스 시스템에 구현하였다. 구체적으로, FastDB를 로그를 사용하는 회복 방법으로 바꾸고, FastDB가 사용하는 메모리 영역을 n개의 파티션으로 나눈다. 그리고 파티션별 갱신 횟수에 따라 일정한 검사점 수행 간격을 유지하여 회복시 필요한 로그의 양을 효과적으로 줄일 수 있는 일정 간격 퍼지 검사점 기법을 구현하였다. 실험 결과에 의하면 일정 간격 퍼지 검사점 기법을 사용한 시스템이 기존 방법을 사용한 시스템보다 회복 성능에서 우수함을 보여준다.