• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.382-386
• /
• 2004

Recently, with the machine learning trend, most of the machine translation systems on over the world use two syntax tree sets of two relevant languages to learn syntactic tree transfer rules. However, for the English-Vietnamese language pair, this approach is impossible because until now we have not had a Vietnamese syntactic tree set which is correspondent to English one. Building of a very large correspondent Vietnamese syntactic tree set (thousands of trees) requires so much work and take the investment of specialists in linguistics. To take advantage from our available English-Vietnamese Corpus (EVC) which was tagged in word alignment, we choose the SITG (Stochastic Inversion Transduction Grammar) model to construct English- Vietnamese syntactic tree sets automatically. This model is used to parse two languages at the same time and then carry out the syntactic tree transfer. This English-Vietnamese bilingual syntactic tree set is the basic training data to carry out transferring automatically from English syntactic trees to Vietnamese ones by machine learning models. We tested the syntax analysis by comparing over 10,000 sentences in the amount of 500,000 sentences of our English-Vietnamese bilingual corpus and first stage got encouraging result $(analyzed\;about\;80\%)[5].$ We have made use the TBL algorithm (Transformation Based Learning) to carry out automatic transformations from English syntactic trees to Vietnamese ones based on that parallel syntactic tree transfer set[6].

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.2 s.308
• /
• pp.11-19
• /
• 2006

In this paper, we propose a method to estimate camera extrinsic parameter based on projective and permutation invariance point features. Because feature informations in previous research is variant to c.:men viewpoint, extraction of correspondent point is difficult. Therefore, in this paper, we propose the extracting method of invariant point features, and new matching method using similarity evaluation function and Graham search method for reducing time complexity and finding correspondent points accurately. In the calculation of camera extrinsic parameter stage, we also propose two-stage motion parameter estimation method for enhancing convergent degree of LM algorithm. In the experiment, we compare and analyse the proposed method with existing method by using various indoor images to demonstrate the superiority of the proposed algorithms.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.755-762
• /
• 2003

For the route optimization in the MIPv6, MN(Mobile Node) sends CN(Correspondent Node) a binding update message to notify the binding of is HoA(Home Address) with its new CoA(Care-of Address). However, unautenticated binding updates expose the involved MN and CM to various sucurity attacks. Thus, protecting the binding update process becomes of paramount importance in the MIPv6, and several secure binding update protocols, and the performance of packet exchanges and cryptographic operations. Then, we analyze the four typical binding update protocols based on the presented criterions. In addition, we propose some improvement tips for secure binding updates.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1178-1188
• /
• 2003

In this paper, we describe image mosaicing techniques for constructing a large high-resolution image with images taken by a video camera in hand. we propose the method which is automatically retrieving the exact matching area using color information and shape information. The proposed method extracts first candidate areas which have similar form using a Voronoi Distance Matching Method which is rapidly estimating the correspondent points between adjacent images, and calculating initial transformations of them and finds the final matching area using color information. It is a method that creates Voronoi Surface which set the distance value among feature points and other points on the basis of each feature point of a image, and extracts the correspondent points which minimize Voronoi Distance in matching area between an input image and a basic image using the binary search method. Using the Levenberg-Marquadt method we turn an initial transformation matrix to an optimal transformation matrix, and using this matrix combine a basic image with a input image.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.61-70
• /
• 2007

An interworking translator for IPv6 and IPv4 services can be defined as an intermediate component between a native IPv4 host and a native IPv6 host to enable direct communication between them without requiring any modifications to the hosts. But if the host is a mobile node, triangle routing problem occurs, since Mobile IPv4 allows mobile node to roam transparently in my network. In this situation, mobile node must notify transfer information to its own home agent and correspondent node in IPv6 network. But current NAT-PT does not permit mobility header translation. Therefore, NAT-PT does not support efficient communication between Mobile IPv4 and Mobile IPv6. In this paper, we propose a mobility header conversion mechanism to resolve the triangle routing problem between Mobile IPv4 and Mobile IPv6.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.120-127
• /
• 2008

HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1269-1276
• /
• 2011

In the Proxy Mobile IPv6 (PMIPv6), the data transmission performance may be degraded when the two communicating hosts are located within the same mobile domain, since all the data packet shall be delivered by way of Local Mobility Anchor (LMA). In this paper we propose an extensional scheme of PMIPv6 using binding query. In the proposed Query-based PMIPv6 (Q-PMIPv6) scheme, the Mobile Access Gateway (NAG) of Correspondent Node (CN) sends a binding query to LMA to obtain the Proxy Care-of-Address of Mobile Node (MN). Since then, CN and MN can communicate with each other by using an optimized data path. For comparison, we performed the numerical analysis and the ns-2 simulations for the proposed Q-PMIPv6 scheme and the existing PMIPv6 and PMIPv6 Localized Routing (PMIPv6-LR). From the results, we can see that the proposed scheme outperforms the existing PMIPv6 and PMIPv6-LR schemes in terms of the signaling control and data delivery costs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.688-696
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) is a network localized mobility management protocol that is independent of global mobility management protocols. In a single mobility domain (LMD), the mobile node (MN) is not involved in any IP mobility-related signaling and uses only its PMIPv6 home address for all its communication. Subsequently, when the MN moves into another LMD, the MN must change its PMIPv6 home address. In such a circumstance, host-based mobility signaling is activated. Thus, the nature of the network-based mobility of the PMIPv6 cannot be retained. Additionally, if the MN does not support global mobility, it cannot maintain communication with its correspondent node (CN). In this paper, we propose a solution for global mobility support in PMIPv6 networks, called Global-PMIPv6 that allows current communication sessions of a MN without mobility protocol stacks to be maintained, even when the MN moves into another LMD. Thus, Global-PMIPv6 retains the advantages of the PMIPv6 for global mobility support. We then evaluate and compare network performance between our proposed solution and PMIPv6.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.5
• /
• pp.26-35
• /
• 1997

This paper deals with establishing correspondent points of feature pints and sampling period when we estimate object motion parameters from image information of freely moving objects in space of gravity-free state. Replacing the inertial coordinate system with the camera coordinate system which is equipped within a space robot, it is investigated to be able to analyze a problem of correspond points from image information, and to obtain sequence of angular velocity $\omega$ which determine a motion of object by means of computer simulation. And if a sampling period ${\Delta}t$ is shortened, the relative errors of angular velocity are increased because the relative errors against moving distance of feature points are increased by quantization. In reverse, if a sampling period ${\Delta}t$ is lengthened too much, the relative error are likewise increased because a sampling period is long for angular velocity to be approximated, and we confirmed the precision that grows according to ascending of resolution.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.677-684
• /
• 2003

IETF's Mobile IP protocol allows Mobile Node(MN) to keep connection to Correspondent Node(CN) no matter what the MN changes its point of attachment to the Internet. However, the protocol incurs triangle routing problem, because all packets for the MN are routed through its Home Agent(HA). Route optimization mechanism is proposed by IETF in order to resolve triangle routing problem, but it requires that any node in the Internet should also implement route optimization mechanism. In this paper, we propose a new route optimization algorithm. With the algorithm, routers between HA and CN are considered as Intermediate Agent(IA), and packets transmitted by CN are not forwarded to HA but intercepted by IA and tunneled to MN directly.