• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.1960-1969
• /
• 2016

In this paper, we propose an automatic hierarchical organ segmentation method on abdominal CT images. First, similar atlases are selected using bone-based similarity registration and similarity of liver, kidney, and pancreas area. Second, each abdominal organ is roughly segmented using image-based similarity registration and intensity-based locally weighted voting. Finally, the segmented abdominal organ is refined using mask-based affine registration and intensity-based locally weighted voting. Especially, gallbladder and pancreas are hierarchically refined using location information of neighbor organs such as liver, left kidney and spleen. Our method was tested on a dataset of 12 portal-venous phase CT data. The average DSC of total organs was $90.47{\pm}1.70%$. Our method can be used for patient-specific abdominal organ segmentation for rehearsal of laparoscopic surgery.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.1-7
• /
• 2008

In group location management, when a transportation system(TS) with multiple mobile subscribers(MSs) changes location area(LA), location management is performed by group location registration by TS, instead of individual location registrations by MSs. In previous works, although it is assumed that LA in group location management is the same as that in individual location management, it is not appropriate to assume the same sized LAs since MSs in a TS have different characteristics from MSs which are not in a TS from the aspect of the speed and aggregate call arrival rates. Thus, in this paper, we propose an efficient location management scheme based on individual and group location managements with different sized LAs, and the performance of the proposed scheme is analyzed from the aspect of signaling cost at the wireless interface. Results reveal that the proposed scheme outperforms the conventional scheme by selecting an appropriate sized LA for group location management.

• IE interfaces
• /
• v.23 no.4
• /
• pp.357-364
• /
• 2010

In this study, we consider performance analysis of distance-based registration (DBR). DBR causes a mobile station (MS) to register its location when the distance between the current base station (BS) and the BS in which it last registered exceeds a distance threshold D. In general, DBR has some advantages over the other registration schemes but has a tendency to causes an MS to register more frequently than zone-based registration (ZBR) that is adopted in most of mobile communication systems. The DBR with implicit registration (DBIR) was proposed to improve the performance of DBR. In this study, we point out some problems of the previous analytical model based on continuous time Markov chain and analyze exact performance of the DBIR. We show that the DBIR always outperforms the DBR by using our exact analytical model.

• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.56-65
• /
• 2007

For supporting seamless service in NGN, various schemes for mobility are studying in ITU-T, 3GPP, IETF, and so on. Currently, mobility support schemes such as MIPv6, IP2, Q.MMF, IMS was introduced. However the performance analysis and comparison of all existing schemes is not examined as yet. That is, the existing mobility methods need to be compared according to same performance parameter. So, in this paper, we investigate and compare the performances of MIPv6, IP2, Q.MMF on latency during location registration. The latency in location registration is consider as cost and time. Then, the performance analysis of Q.MMF Case1 has shown the best performance as it is measured the minimum cost and time. Q.MMF Case1 is the location registration process in case that MT moves within a local network. As LLM in a access network manages the location of MT in this case, Q.MMF Case1 has lower location cost and time than other cases.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.939-948
• /
• 2004

In this paper. we Propose a robust and fast image registration technique for motion correction in brain CT-CT angiography obtained from same patient to be taken at different time. First, the feature points of two images are respectively extracted by 3D edge detection technique, and they are converted to locally weighted 3D distance map in reference image. Second, we search the optimal location whore the cross-correlation of two edges is maximized while floating image is transformed rigidly to reference image. This optimal location is determined when the maximum value of cross-correlation does't change any more and iterates over constant number. Finally, two images are registered at optimal location by transforming floating image. In the experiment, we evaluate an accuracy and robustness using artificial image and give a visual inspection using clinical brain CT-CT angiography dataset. Our proposed method shows that two images can be registered at optimal location without converging at local maximum location robustly and rapidly by using locally weighted 3D distance map, even though we use a few number of feature points in those images.

• International journal of advanced smart convergence
• /
• v.7 no.3
• /
• pp.61-65
• /
• 2018

A Location Register(LR) system manages each subscriber's location information, which continuously changes in mobile cellular network. For this purpose, the LR database system provides backup management facilities. The objectives of this paper are to identify the problems of the current LR system through rigorous analysis, to suggest solutions to them. I proposed efficient backup methods that takes into account the characteristics of LR database transactions. In the proposed backup method, I use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration- location operations.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1179-1186
• /
• 1996

A previous location area scheme was proposed for cellular network, in which the size of location area of a user is dynamically determined by is current mobility and call arrival rate as the burden of system reaches the minimum. This scheme, however, doesn't consider other individual's movement pattern respectively because of allocating location area with a system's fixed pattern. When mobile subscribers move fast, this scheme allocates especially so large location area to reduce the number of location registration that it makes much paging cost. In this paper, we suggest new dynamic location area management which allocates location area according to each subscriber's mobility regarding its current location as center point. This new scheme allocates fast subscriber larger location area, which resulted in reducing the number of location registration. And small area paging reduces paging cost.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.360-365
• /
• 2008

We propose an efficient robot name registration and recognition method in order to enable a Call-and-Come service for home robots. In the proposed method for the name registration, the search space is first restricted by using monophone-based acoustic models. Second, the registration of robot names is completed by using triphone-based acoustic models in the restricted search space. Next, the parameter for the utterance verification is calculated to reduce the acceptance rate of false calls. In addition, acoustic models are adapted by using a distance speech database to improve the performance of distance speech recognition, Moreover, the location of a user is estimated by using a microphone array. The experimental result on the registration and recognition of robot names shows that the word accuracy of speech recognition is 98.3%.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.53-63
• /
• 2001

An efficient mobility management for mobile stations plays an important role in mobile communication network. This paper studies the mobility management scheme that combines a distance-based registration(DBR) and a selective paging (SP). We introduce an analytical model based on 2-dimensional random walk mobility model and evaluate the performance of the proposed mobility management scheme using the model to determine the optimal size of location area that results in the minimum signaling traffic on radio channels. Numerical results are provided to demonstrate the performance of the proposed mobility management scheme under various circumstances. These results can be used effectively in design and evaluation of registration methods considering the system circumstances.