• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.1
• /
• pp.31-39
• /
• 2008

Sensor Node OS should support unified API and efficient sensor device management system to overcome the diversity of sensors and actuators. However, conventional OSs like Tiny-OS and Nano-Q+ do not. In this paper, we propose a sensor device driver management system that present application programmers with unified API and easy deployment of sensors. When a sensor is deployed in our device management system, the device driver is downloaded. This scheme differs from traditional OS like SOS in that only sensor device driver is downloaded, not the whole application image. We designed and implemented the system into Nano-Q+. We described the comparison with other OSs and showed that our system obtains the considerable speedup of downloading.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1239-1246
• /
• 2015

Cell counting is extensively used to analyze cell growth in biomedical research, and as a result automated cell counting methods have been developed to provide a more convenient and means to analyze cell growth. However, there are still many challenges to improving the accuracy of the cell counting for cells that proliferate abnormally, divide rapidly, and cluster easily, such as cancer cells. In this paper, we present an automated cell counting method for HeLa cells, which are used as reference for cancer research. We recognize and classify the morphological conditions of the cells by using a cell segmentation algorithm based on cell membrane extraction, and we then apply a cell back-tracking algorithm to improve the cell counting accuracy in cell clusters that have indistinct cell boundary lines. The experimental results indicate that our proposed segmentation method can identify each of the cells more accurately when compared to existing methods and, consequently, can improve the cell counting accuracy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.518-528
• /
• 2000

Messages in distributed real-time systems are categorized into two groups: synchronous messages and asynchronous messages. Synchronous messages, such as sampled audio and image data,are generated periodically with delivery time constraints. Protocols should guarantee the end-to-enddeadlines for such messages. Asynchronous messages are non-periodic and may arrive in a randomway with no strict time constraints.In this paper, we propose TTP/C(timed token protocol with concession), an extension of TTPprotocol, to achieve higher timeliness guarantee for synchronous messages in distributed real-timesystems. In TTP/C, a node concedes the allocated bandwidth to other nodes with urgent synchronousmessages to be sent provided that the node has no urgent messages, TTP/C works very well evenif the synchronous messages are generated with some jittering by nodes. The simulation results showthe improved performance of TTP/C protocol for guaranteeing synchronous messages deadlinescomeared to the existing TTP protocols.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.449-460
• /
• 2005

This paper proposes a method to track persons robustly in illumination changes and partial occlusions in color video frames acquired from a fixed camera. To solve a problem of changing appearance by illumination change, a time-independent intrinsic image is used to remove noises in an frame and is adaptively updated frame-by-frame. We use a hierarchical human model including body color information in order to track persons in occlusion. The tracked human model is recorded into a persons' list for some duration after the corresponding person's exit and is recovered from the list after her reentering. The proposed method was experimented in several indoor and outdoor scenario. This demonstrated the potential effectiveness of an adaptive model-base method that corrected distorted person's color information by lighting changes, and succeeded tracking of persons which was overlapped in a frame.

• Journal of KIISE:Software and Applications
• /
• v.34 no.10
• /
• pp.929-936
• /
• 2007

The novel vision-based scheme for real-time extracting traffic parameters is proposed in this paper. Detecting and tracking of vehicle is processed at local region installed by operator. Local region is divided to segmented regions by edge and frame difference, and the segmented regions are classified into vehicle, road, shadow and headlight by statistical and geometrical features. Vehicle is detected by the result of the classification. Traffic parameters such as velocity, length, occupancy and distance are estimated by tracking using template matching at local region. Because background image are not used, it is possible to utilize under various conditions such as weather, time slots and locations. It is performed well with 90.16% detection rate in various databases. If direction, angle and iris are fitted to operating conditions, we are looking forward to using as the core of traffic monitoring systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.1
• /
• pp.56-65
• /
• 2006

Recently the study on service robots has been proliferated in many fields, and there are active developments for indoor services such as supporting for elderly people. It is important for robot to recognize objects and situations appropriately for effective and accurate service. Conventional object recognition methods have been based on the pre-defined geometric models, but they have limitations in indoor environments with uncertain situation such as the target objects are occluded by other ones. In this paper we propose a Bayesian network model to reason the probability of target objects for effective detection. We model the relationships between objects by activities, which are applied to non-static environments more flexibly. Overall structure is constructed by combining common-cause structures which are the units making relationship between objects, and it makes design process more efficient. We test the performance of two Bayesian networks for verifying the proposed Bayesian network model through experiments, resulting in accuracy of $86.5\%$ and $89.6\%$ respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• Journal of KIISE
• /
• v.42 no.5
• /
• pp.681-689
• /
• 2015

Personal information includes information about a living human individual. It is the information identifiable through name, resident registration number, and image, etc. Personal information which is collected by institutions can be wrongfully used, because it contains confidential information of an information object. In order to prevent this, a method is used to remove personal identification elements before distributing and sharing the data. However, even when the identifier such as the name and the resident registration number is removed or changed, personal information can be exposed in the case of a linking attack. This paper proposes a new anonymization technique to enhance data utility. To achieve this, attributes that are utilized in service tend to anonymize at a low level. In addition, the anonymization technique of the proposal can provide two or more anonymized data tables from one original data table without concern about a linking attack. We also verify our proposal by using the cooperative game theory.

• Journal of KIISE:Software and Applications
• /
• v.27 no.6
• /
• pp.632-641
• /
• 2000

Conventional character extraction methods extract character regions using methods such as color reduction, region split and merge and texture analysis from the whole image. Because these methods use many heuristic variables and thresholding values derived from a priori knowledge, it is difficult to generalize them algorithmically. In this paper, we propose a method that can extract character regions using a topographical feature extraction method and a point-line-region extension method. The proposed method can also solve the problems of conventional methods by reducing heuristic variables and generalizing thresholding values. We see that character regions can be extracted by generalized variables and thresolding values without using a priori knowledge of character region. Experimental results show that the candidate region extraction rate is 100%, and the character region extraction rate is over 98%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.655-662
• /
• 2003

In some volume visualization fields such as medical imaging, anisotropic volume data are more common than isotropic ones. In this paper, we propose an efficient rendering method for anisotropic volume data, which directly computes the intensity of intermediate samples by interpolating the intensity of two corresponding voxels on consecutive slices. Unlike density interpolation method, it does not require a preprocessing step for generating intermediate slices or additional memory for storing them. Additionally, we propose an adaptive intermediate voxel insertion method that avoids overblurring on object surfaces. This may occur when we render high frequency areas using the intensity interpolation method. Using these methods, we can improve the rendering speed without sacrificing image quality.