• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1007-1010
• /
• 2005

This paper presents a fingerprint image registration method. In the fingerprint system, the insufficiency of mutual information between a template and a query fingerprint is one of major factors to deteriorate recognition performance. To overcome this problem, we need to register multiple impressions and integrate their information. Our method matches the ridges from multiple impressions recursively and then registers the impressions to minimize the registration error calculated from the Distance map. Our method use regularized TPS model as the transformation model to compensate for the plastic deformation. We compare our method with 3 prior arts (ICP, Distance Map, Ross's method). Our registration error and its' variance is the smallest and also the average registration error is below 3 pixels.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.103-110
• /
• 2003

In this paper, we propose and evaluate the performance distance-based registration considering call arrival. We propose the mobility model, which can be used to analyze the performance of proposed registration schemes. Numerical results show that zone-based registration needs less number of registration than distance-based registration. On the other hand, the registration load of the distance-based registration is equally distributed to all cells in a location area. However, the registration load of the distance-based registration considering cail arrival is similar to that of zone-based registration and equally distributed to all cells in a location area. Therefore, the proposed scheme can be effectively used restricted radio resources.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2007.05a
• /
• pp.47-54
• /
• 2007

In this study, we consider the movement-based registration (MBR), location-based registration (LBR) and distance-based registration (DBR) schemes. Analytical models based on a 2-dimensional random walk in a hexagonal cell configuration are considered to analyze and compare the performances of these three schemes. We focus on the derivation of the registration costs of LBR and DBR using an analytical method and then show that DBR always outperforms both MBR and LBR. Numerical results are provided to demonstrate the validity of our models under various circumstances.

• IE interfaces
• /
• v.15 no.4
• /
• pp.401-408
• /
• 2002

An efficient mobility management for mobile stations plays an important role in mobile communication network. In this study, we consider movement-based registration(MBR) and distance-based registration(DBR). Analytical models based on 2-dimensional random walk in hexagonal cell configuration are considered to analyze the performance of MBR and DBR. Especially, we focus on the derivation of the registration cost of DBR scheme by using two analytical methods and then show that DBR always outperforms MBR. Numerical results are provided to demonstrate optimal condition under various circumstances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.180-194
• /
• 2021

For small image registration, feature-based approaches are likely to fail as feature detectors cannot detect enough feature points from low-resolution images. The classic FFT approach's prediction accuracy is high, but the registration time can be relatively long, about several seconds to register one image pair. To achieve real-time and high-precision rigid registration for small images, we apply deep neural networks for supervised rigid transformation prediction, which directly predicts the transformation parameters. We train deep registration models with rigidly transformed CIFAR-10 images and STL-10 images, and evaluate the generalization ability of deep registration models with transformed CIFAR-10 images, STL-10 images, and randomly generated images. Experimental results show that the deep registration models we propose can achieve comparable accuracy to the classic FFT approach for small CIFAR-10 images (32×32) and our LSTM registration model takes less than 1ms to register one pair of images. For moderate size STL-10 images (96×96), FFT significantly outperforms deep registration models in terms of accuracy but is also considerably slower. Our results suggest that deep registration models have competitive advantages over conventional approaches, at least for small images.

• Journal of Biomedical Engineering Research
• /
• v.27 no.6
• /
• pp.392-401
• /
• 2006

Image Guided Surgery (IGS) system which has variously tried in medical engineering fields is able to give a surgeon objective information of operation process like decision making and surgical planning. This information is displayed through 3D images which are acquired from image modalities like CT and MRI for pre-operation. The technique of image registration is necessary to construct IGS system. Image registration means that 3D model and the object operated by a surgeon are matched on the common frame. Major techniques of registration in IGS system have been used by recognizing fiducial markers placed on the object. However, this method has been criticized due to additional trauma, its invasive protocol inserting fiducial markers in patient's bone and generating noise data when 2D slice images are acquired by image modality because many markers are made of metal. Therefore, this paper developed shape-based registration technique to improve the limitation of fiducial marker based IGS system. Iterative Closest Points (ICP) algorithm was used to match corresponding points and quaternion based rotation and translation transformation using closed form solution applied to find the optimized cost function of transformation. we assumed that this algorithm were used in Total Knee replacement (TKR) operation. Accordingly, we have developed region-based 3D registration technique based on anatomical landmarks and this registration algorithm was evaluated in a femur model. It was found that region-based algorithm can improve the accuracy in 3D registration.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.45-55
• /
• 2015

In this paper, we consider curriculum mining as an application of process mining in the domain of education. The basic objective of the curriculum mining is to construct a registration pattern model by using logs of registration data. However, subject registration patterns of students are very unstructured and complicated, called a spaghetti model, because it has a lot of different cases and high diversity of behaviors. In general, it is typically difficult to develop and analyze registration patterns. In the literature, there was an effort to handle this issue by using clustering based on the features of students and behaviors. However, it is not easy to obtain them in general since they are private and qualitative. Therefore, in this paper, we propose a new framework of curriculum mining applying K-means clustering based on subject attributes to solve the problems caused by unstructured process model obtained. Specifically, we divide subject's attribute data into two parts : categorical and numerical data. Categorical attribute has subject name, class classification, and research field, while numerical attribute has ABEEK goal and semester information. In case of categorical attribute, we suggest a method to quantify them by using binarization. The number of clusters used for K-means clustering, we applied Elbow method using R-squared value representing the variance ratio that can be explained by the number of clusters. The performance of the suggested method was verified by using a log of student registration data from an 'A university' in terms of the simplicity and fitness, which are the typical performance measure of obtained process model in process mining.

• ETRI Journal
• /
• v.40 no.6
• /
• pp.736-744
• /
• 2018

This study considers zone-based registration (ZBR), which is adopted by most mobile cellular networks. In ZBR, a user equipment (UE) registers its location area (or zone) in a network database (DB) whenever it enters a new zone. Even though ZBR is implemented in most networks for a UE to keep only one zone (1ZR), it is also possible for a UE to keep multiple zones. Therefore, a ZBR with two zones (2ZR) is investigated, and some mathematical models for 2ZR are presented. With respect to ZBR with three zones (3ZR), several studies have been reported, but these employed computer simulations owing to the complexity of the cases, and there have been no reports on a mathematical 3ZR model to analyze its performance. In this study, we propose a new mathematical model for 3ZR for the first time, and analyze the performance of 3ZR using this model. The numerical results for various scenarios show that, as the UE frequently enters zones, the proposed 3ZR model outperforms 1ZR and 2ZR. Our results help determine the optimal number of zones that a UE keeps, and minimize the signaling cost for radio channels in mobile cellular networks.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.303-306
• /
• 2009

Registration of microscopic section images from an organism is of importance in analyzing and understanding the function of an organism. Microscopes usually suffer from the radial distortion due to the spherical aberration. In this paper, a correction scheme for the intra-section registration is proposed. The correction scheme uses two corresponding feature points under the radial distortion model. Proposing several variations of the proposed scheme, we extensively conducted experiments for real microscopic images. Iterative versions of the correction from multiple feature points provide good performance for the registration of the optical and scanning electron microscopic images.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.172-180
• /
• 2008

Many strategies have been proposed to reduce mobility management cost. Among them, in this paper, we study three schemes of zone-based registrationthat have been adopted by most of mobile systems. These special schemes are referred to as the single-zone-based registration (SZR), the two-zone-based registration (TZR) and the two-zone-based registration with outgoing call (TZRC) respectively. We propose a mathematical model to evaluate the performance of TZRC in order to compare with those of SZR and TZR. Numerical results show that TZRC outperforms not only SZR but also TZR in most cases.