• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.459-468
• /
• 2006

Current routing in sensor networks focuses on finding methods for energy-efficient route setup and reliable relaying of data from the sensors to the sink so that the lifetime of the network is maximized. The existing routing protocols do not have routing tables to determine a path when packets are transferred. A sensor network by a routing table increases a cost of maintaining and updating a path, because sensor nodes have characteristics to be mobile and constrained capacity and resources. This paper proposes a new routing algorithm by broadcasting a bitmap in order to reduce the number of messages transferred when routing paths are established. Each node has a routing table with a bitmap, which contains link information. A bitmap is formed two-dimensional array, which consists of each row and column represented with a bit. The node only updates its own bitmap if it receives a bitmap from another adjacent nodes after the broadcasting. There by, each node has a bitmap with partial links information not total links information on the network. The proposed routing algorithm reduces the number of messages for routing establishment at least 10% compared with the previous algorithms.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.143-154
• /
• 2008

RFID events are large volume of stream data which come out continuously. Many studies have been done to detect a business event in RFID stream. However, the existing methods have many problems which increase unnecessary operations when business events do not satisfy minimum conditions. In this paper, to remove unnecessary operations, we define the minimum condition of business events and propose an efficient method that detects business events only when the minimum condition is satisfied. To check the minimum condition of business events, we register business queries in a query index. We detect business events using the query index and bitmap. It is shown through various experiment that the proposed method outperforms the existing methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.236-238
• /
• 2003

Human face detection is often the first step in applications such as video surveillance, human computer interface, fare recognition, and image database management. We have constructed a simple and fast system to detect frontal human faces in complex environment and different illumination. This paper presents a fast segmentation method to combine neighboring pixels with similar hue. The algorithm constructs eye, mouth, and boundary maps for verifying each fare candidate. We test the system on images in complex environment and with confusing objects. The experiment shows a robust detection result with few false detected fates.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.321-333
• /
• 2002

As web-based services are becoming more and more popular, concurrent updates of spatial data should be possible in the web-based environments in order to use the various services. Web-based GIS applications are characterized by large quantity of data providing and these data should be continuously updated according to various user's requirements. Faced with such an enormous data providing system, it is inefficient for a server to do all of the works of updating spatial data requested by clients. Besides, the HTTP protocol used in the web environment is established under the assumption of 'Connectionless'and 'Stateless'. Lots of problems may occur if the scheme of transaction processing based on the LAN environment is directly applied to the web environment. Especially for long transactions of updating spatial data, it is very difficult to control the concurrency among clients and to keep the consistency of the server data. This paper proposes a solution of keeping consistency during updating directly spatial data in the client-side by resolving the Dormancy Region Lock problem caused by the 'Connectionless'and 'Stateless'feature of the HTTP protocol. The RX(Region-eXclusive) lock and the periodically sending of ALIVE_CLIENTi messages can solve this problem. The protocol designed here is verified as effective enough through implementing in the main memory spatial database system, called CyberMap.

• Korean Journal of Remote Sensing
• /
• v.25 no.5
• /
• pp.399-409
• /
• 2009

Many researches have shown that NDVI provides a potential methods to derive meaningful metrics that describe ecosystem functions. In this paper we investigated the use of the MODIS NDVI (Normalized Difference Vegetation Index) to monitor vegetation phenology dynamics of Northern plateau region, North Korea, during last 9-years (2000~2008). The findings of this paper can be summarized as follows. First, the length of growing season ranged from a low of 128 days in 2003 to a high of 176 days in 2000 and 2005. On the average of the last 9 years, the highest NDVI of 0.86 was marked on 28 July. Greenup onset occurs at the start of May, while the senescence begins between late September and October. Second, these annual vegetation cycles were compared with Seorak and Jiri Mountain regions of South Korea which have similar vegetation condition. Greenup onsets in South Korea were observed earlier than those of North Korea and the average time lag between the South and North Korea in Greenup was about 16 days which is a time-resolution of remotely sensed data. Sub-alpine conifers of such areas may be severely affected by the large of phenological characteristics due to the global warming trend.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.13-21
• /
• 2000

Online analytical processing (OLAP) systems are introduced to support decision support systems. Many researches focussed on efficient processing of aggregate functions that usually occur in OLAP queries. However, most previous researches in the literature are deal with the situation in which aggregate functions arc applied to all the values in a given range. Since those approaches utilize characteristic of aggregate functions applied to a range, they are difficult to be applied to a muitipoint query that is a query considering only some points in a given range. In this paper, we propose the Ranking Index and the flanking Decision Tree (RDT) for efficient evaluation of multipoints MAX/MIN queries. The ranking of possible MAX/MIN values are computed with RDT Then MAX/MIN values can be acquired from the Ranking Index. We show through experiments that our method provides high performance in most situations. In other words, the proposed method is robust as well as efficient. A single common set of precomputed results for both MAX and MIN values is another advantage of the proposed method.

• Journal of KIISE:Software and Applications
• /
• v.36 no.1
• /
• pp.54-61
• /
• 2009

This paper proposes a skin segmentation method based on region histograms of the color quantization map. First, we make a quantization map of the image using the JSEG algorithm and detect the skin pixel. For the skin region detection, the similar neighboring regions are set by its similarity of the size and location between the previous frame and the present frame from the each region of the color quantization map. Then we compare the similarity of histogram between the color distributions of each quantized region and the skin color model using the histogram distance. We select the skin region by the threshold value calculated automatically. The skin model is updated by the skin color information from the selected result. The proposed algorithm was compared with previous algorithms on the ECHO database and the continuous images captured under time varying illumination for adaptation test. Our approach shows better performance than previous approaches on skin color segmentation and adaptation to varying illumination.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.353-362
• /
• 2006

A data warehouse is a data repository that enables users to store large volume of data and to analyze it effectively. In this research, we investigate an algorithm to establish a multidimensional data cube which is a powerful analysis tool for the contents of data warehouses and databases. There exists an inevitable retrieval overhead in a multidimensional data cube due to the sparsity of the cube. In this paper, we propose a dense sub-cube extraction algorithm that identifies dense regions from a large sparse data cube and constructs the sub-cubes based on the dense regions found. It reduces the retrieval overhead remarkably by retrieving those small dense sub-cubes instead of scanning a large sparse cube. The algorithm utilizes the bitmap and histogram based techniques to extract dense sub-cubes from the data cube, and its effectiveness is demonstrated via an experiment.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.279-289
• /
• 2011

The latest hardware and software techniques are combined to give safe walking guidance and convenient service of realtime walking assistance system for visually impaired person. This system consists of obstacle detection and perception, place recognition, and sign recognition for pedestrian can safely walking to arrive at their destination. In this paper, we exploit the sign object detection system in subway station for sign recognition that one of the important factors of walking assistance system. This paper suggest the adaptive feature map that can be robustly extract the sign object region from complexed environment with light and noise. And recognize a sign using fast zernike moment features which is invariant under translation, rotation and scale of object during walking. We considered three types of signs as arrow, restroom, and exit number and perform the training and recognizing steps through adaboost classifier. The experimental results prove that our method can be suitable and stable for real-time system through yields on the average 87.16% stable detection rate and 20 frame/sec of operation time for three types of signs in 5000 images of sign database.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.5
• /
• pp.651-657
• /
• 2023

Railroad alignment improvements and operating speed increase occupy considerable portion in recent railroad market. Developing countries have limitations to construction of new high speed railroads due to the burden of budgets and the lack of demands, and the projects of operating speed increase arepracticallyrecommended. Thisstudy developed the methodologyto provide the railroad alignment design alternatives and the costs by upgrading the "Intelligent Railroad Alignment Design Program (ei-Rail)" which has been used to obtain the alignment plans and construction costs for railroad construction projects. The program provides the cost for alignment improvement, design drafts and the effects of operating speed increase with the input of target improvement speed and the prevailing railroad alignment on the numerical map. It is then expected for the ei-Rail program to be used for the supporting tool for the railroad alignment improvement projects.