• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.319-321
• /
• 2003

모바일 컴퓨팅 환경은 크게 모바일 노드, 무선망, 그리고 이동성이라는 기술로 이루어진다. 이음새없는 (seamless) 이동성을 제공하기 위한 기존의 Shadow Registration 방법은 핸드오프가 발생하기 이전에 이웃한 모든 노드들(AAAF/sbu n/)에게 모바일 노드의 관련 정보를 사전등록(Shadow Registration)하는 방법을 제안하여 핸드오프 이후에 발생하는 끊김이나 지연을 방지하였다. 그러나 이러한 Shadow Registration의 경우 백본 네트워크에 불필요한 트래픽 발생 및 데이터 관리라는 문제를 야기시킨다. 본 논문은 이러한 문제점들을 개선하고자 새롭게 사전등록 트리거 영역(STR: Shadow Trigger Region)을 설정하고, STR 내에 모바일 노드(MN)가 위치할 경우 MN의 이동 방향을 이용하여 최소한의 사전등록영역(SRR: Shadow Registration Region)을 찾아내는 방법을 제안한다. 결과적으로 제안된 SRR 은 최대 2 개의 이웃노드(AAAF$_2$)에게만 사전등록을 요청하면 되므로, 기존의 방법에 비해 최대 ∑(n­2)번의 사전등록 횟수를 줄이면서 끊김과 지연도 방지할 수 있는 효과적인 방법이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1165-1168
• /
• 2003

모바일 컴퓨팅 환경에서 이동성은 등록을 통해 이루어지고 있으며, 이음새 없는(seamless) 이동성을 제공하고자 많은 연구들이 진행되어 있으며, 그 중 방문하고자 하는 네트워크(Foreign Network)에 등록하는 시점을 언제로 하느냐에 따라 크게 다음의 2 가지 방법으로 대별된다. SIP-Registration은 핸드오프가 발생한 이후 등록(AAAF)을 함으로써 통화하는 중에 끊김(disruption)이나 지연(delay)이 발생한다. 이를 개선한 SIP-Shadow-Registration 방법은 핸드오프가 발생하기 이전에 이웃한 모든 노드들$(AAAF_n)$에게 모바일 노드(MN)의 관련 정보를 사전등록(Shadow Registration)하여 핸드오프 이후에 발생하는 끊김이나 지연을 방지하였다. 그러나 SIP-Shadow-Registration은 실제 사용하지 않는 n-2 개의 MN와 관련된 백본 네트워크에 불필요한 데이터 전달 및 관리라는 문제를 야기시킨다. 본 논문은 이러한 문제점들을 개선하고자 사전등록영역(SRR: Shadow Registration Region)을 구성하고 이의 알고리즘을 제안한다. 결과적으로 SIP 기반의 이동성이 필요할 때, 최소한의 사전등록영역을 통해 끊김이나 지연도 방지하고 추가적인 데이터 관리 문제도 해결할 수 있는 효과적인 방법이다.

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

In mobile/wireless environment, mobility management is widely being focused as one popular researches. But, disruption happens when messages are exchanged between nodes as registration is made after handoff, and unnecessary traffic occurs because of the use of the Random-walk model, in which the probability for MN to move to neighboring cells is equal. In order to solve these problems, this study proposes a technique and algorithm for composing Directional Shadow Registration Region (DSRR) that provides seamless mobility. The core of DSRR is to prevent disruption and unnecessary traffic by minimizing the number o) neighboring cells with a high probability of handoff (AAAF). This study sensed the optimal time for handoff through regional cell division by introducing a division scheme, and then decided DSRR, the region for shadow registration, by applying direction vector (DV) obtained through directional cell sectoring. According to the result of the experiment, the proposed DSRR processes message exchange between nodes within the intra-domain, the frequency of disruptions decreased significantly compared to that in previous researches that process in inter-domain environment. In addition, traffic that occurs at every handoff happened twice in DSRR compared to n (the number of neighboring cells) times in Previous researches. As an additional effect, divided regions obtained from the process of composing DSRR filter MN that moves regardless of handoff.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.537-540
• /
• 1988

This paper presents a new shadow testing acceleration scheme for ray tracing called hybrid shadow testing(HST), based on conditional switching between the conventional shadow testing method and Crow's shadow volume method, with the object polygons as well as the shadow polygons registered onto the corresponding cells under the 3-D space subdivision environment. Despite the preprocessing time for the generation and registration of the shadow polygons, the total shadow testing time of the new algorithm was approximately 50 % of that of the conventional shadow testing method for several examples while the total ray tracing time was typically reduced by 30% from the conventional approach.

• IE interfaces
• /
• v.11 no.2
• /
• pp.107-117
• /
• 1998

This paper presents a useful method of registration in manufacturing of shadow color mask for cathode ray tubes of the FTM (Flat Tension Mask) type, wherein the shadow mask and front panel are interchangeable when mask-panels are assembled, which is called ICM system. Theoretical analysis and alignment process are presented. The pattern of mask aperture is registered with a screen pattern of corresponding geometry of the panel in flat tension mask tube. Registration accuracy of panel and mask affects the purity of color cathode ray tube concerned with mislanding. It tries to minimize the misregistration caused by variances, which are mechanical error, mask stretching position error, restrictive number of fiducial point, etc.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1153-1156
• /
• 2003

무선네트워킹의 급격한 확대와 휴대가 간편한 이동단말의 보급이 증가함에 따라 QoS와 이동성이 보장된 IP Telephony 서비스가 필요하게 되었다. 무선인터넷을 이용하는 Voice over IP 서비스는 IP 기반의 인터넷과 셀룰러 네트워크를 합쳐 놀은 것과 유사하며 모바일 노드의 이동성 확보가 핵심 기술이다. 특히 전화서비스의 이용자는 Web이나 FTP같은 데이터 기반의 서비스에 비하여 지연이나 끊어짐에 매우 민감하므로 가급적 지연시간이 적은 핸드오프 기법이 필요하다. 본 연구에서는 무선네트워킹을 이용하는 VoIP 서비스 프로토콜 중 하나인 SIP(Session Initiation Protocol)를 기반으로 이동성 관리를 위한 신호의 흐름과 발생 가능한 지연의 구성요소를 분석하였다. 또한 핸드오프 지연을 줄이기 위한 유용한 기법이지만 신호 트래픽을 과다하게 발생시키는 Shadow Registration에 예측기법을 적용하여 핸드오프 지연을 감소시키면서도 신호 트래픽을 최소화하는 PSR(Predictive Shadow registration) 기법을 제안하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.95-104
• /
• 1989

This paper presents a new shadow testing acceleration scheme for ray tracing called Hybrid Shadow Testing (HST) based on a conditional switching between the conventinal shadow testing method and Crow's shadow volume method, where the shadow polygons as well as the object polygons are registered onto the corresponding cells under the 3-D space subdivision environment. Despite the preprocessing time for the generation and registration of the shadow polygons, the total shadow testing time of the proposed algorithm, HST was approximately 50% of that of the conventional shadow testing method for several examples while the total ray tracing time was typically reduced by 30% from the conventional approach. This due to the selective use of the shadow volume method with a compromise between the maximal utilisation of shadow's spatial coherency and minimising the computational overhead for checking ray intersections with the shadow polygons. A parameter, $N_{th}$ denoting the critical number of shadow polygons between successive reflection points was used as a guideline for switching the shadow testing scheme between the conventional method and shadow volume method. A method for calculating $N_{th}$ from such statistical data as the number of object polygons, average polygon size average peripheral length of the polygons was proposed, resulting in good agreement with the experimental results.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1270-1281
• /
• 1989

This paper presents two new storage schemes of 3-D objects to accelerate the finding of the first intersecting object and the shadow computation steps in ray tracing. The 3-D objects which are potentially intersected with the first reflection (refraction)ray are enrolled within a so called reflection (refraction) frustum' for a polygon object. Only those objects registered in the corres ponding frustum are immediately checked for intersection with the secondary rays emanating from the same polygon. The other is called a shadow pyramid' which contains the candidate objects possibly blocking the path from the relevant light source to any point on the relevant polgon. The shadow testing of a point is performed only against the objects contained in the associated shadow pyramid. Despite the cost needed for registration of objects within frusta or shadow pyramids, the total rendering time of ray tracing using the proposed approaches was reduced by approximately 50% (10% in color rendering time and 70% in shadoe testing time) from the conventional cell 50% (10% in color rendering time and 70% in shadow testing time) from the conventional cell traversal scheme under the 3-D uniform subdivision environment due to the fast finding of candidate objects for intersection and the reduced number of intersection calculations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.445-447
• /
• 2003

최근 무선네트워크의 급속한 확대로 무선인터넷 접속 또한 크게 증가하고 있다. 무선인터넷을 이용하는 Voice over IP 서비스는 IP 기반의 인터넷과 셀룰러 네트워크를 합쳐 놓은 것과 유사하며 모바일 노드의 이동성 확보가 핵심 기술이다. 특히 VoIP 서비스 이용자는 지연이나 끊어짐에 대하여 매우 민감하므로 가급적 지연시간이 적은 핸드오프 기법이 필요하다. 본 연구에서는 무선네트워크를 이용하는 VoIP 서비스 프로토콜 중 하나인 SIP를 기반으로 이동성 관리를 위한 신호의 흐름을 도시하여 발생 가능한 지연의 구성요소를 분석하였으며 핸드오프 지연을 줄이기 위한 Prediction Shadow Registration을 제안하였다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.2
• /
• pp.128-139
• /
• 2005

Moving object boundary is very important for moving object segmentation. But the moving object boundary shows broken boundary We invent a novel space-oriented boundary linking algorithm to link the broken boundary The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundary and searches forward other terminating pixel to link within a radius. The boundary linking algorithm guarantees shortest distance linking. We also register the background from image sequence. We construct two object masks, one from the result of boundary linking and the other from the registered background, and use these two complementary object masks together for moving object segmentation. We also suppress the moving cast shadow using Roberts gradient operator. The major advantages of the proposed algorithms are more accurate moving object segmentation and the segmentation of the object which has holes in its region using these two object masks. We experiment the algorithms using the standard MPEG-4 test sequences and real video sequence. The proposed algorithms are very efficient and can process QCIF image more than 48 fps and CIF image more than 19 fps using a 2.0GHz Pentium-4 computer.