• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.455-462
• /
• 2006

Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.2
• /
• pp.47-54
• /
• 2012

Additional high resolution satellite images, other period or site, are essential for efficient city modeling and analysis. However, the same ground objects have a radiometric inconsistency in different satellite images and it debase the quality of image processing and analysis. Moreover, in an urban area, buildings, trees, bridges, and other artificial objects cause shadow effects, which lower the performance of relative radiometric normalization. Therefore, in this study, we exclude shadow areas and suggest the selective histogram matching methods for image based application without supplementary digital elevation model or geometric informations of sun and sensor. We extract the shadow objects first using adjacency informations with the building edge buffer and spatial and spectral attributes derived from the image segmentation. And, Outlier objects like a asphalt roads are removed. Finally, selective histogram matching is performed from the shadow masked multi-temporal Quickbird-2 images.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.54-66
• /
• 2008

A spatio-temporal join is an expensive operation that is commonly used in spatio-temporal database systems. In order to generate an efficient query plan for the queries involving spatio-temporal join operations, it is crucial to estimate accurate selectivity for the join operations. Given two dataset $S_1,\;S_2$ of discrete data and a timestamp $t_q$, a spatio-temporal join retrieves all pairs of objects that are intersected each other at $t_q$. The selectivity of the join operation equals the number of retrieved pairs divided by the cardinality of the Cartesian product $S_1{\times}S_2$. In this paper, we propose aspatio-temporal histogram to estimate selectivity of spatio-temporal join by extending existing geometric histogram. By using a wide spectrum of both uniform dataset and skewed dataset, it is shown that our proposed method, called Spatio-Temporal Histogram, can accurately estimate the selectivity of spatio-temporal join. Our contributions can be summarized as follows: First, the selectivity estimation of spatio-temporal join for discrete data has been first attempted. Second, we propose an efficient maintenance method that reconstructs histograms using compression of spatial statistical information during the lifespan of discrete data.

• Journal of the Korean Wood Science and Technology
• /
• v.36 no.1
• /
• pp.79-87
• /
• 2008

Many researchers have studied on rooftop greening that can be installed in abandoned spaces on a building roof. The most important issue in rooftop greening is the soil weight problem. The light greening materials are needed to solve this problem. Therefore, many alternative materials against the soil were investigated for rooftop greening. In this study, the waste wood chips and the waste paper slurry were evaluated as the lightweight vegetation foundation for rooftop greening. It also has a meaning for recycling of waste materials. The mixture ratio of waste wood chips to waste paper slurry for the board (the foundation of greening) was 60 to 40. The wet strength resin and the sizing agent were additionally added with different amount. After the forming of the board, physical and chemical properties were tested with the variation of wet strength resin and sizing agent. As the result of the test, the board with 15% of wet strength resin in the wet condition showed the highest strength. Futhermore, the moisture evaporation loss from the board surface with sizing agent was much lower than that from the board without sizing agent. Therefore, it was clear that the sizing agent was effective for water retention. The change of thickness in the wet condition was less than 1 mm, and it showed that the board is the predominant material on the dimensional stability. The average pH value of the board was ranged from 7.6 to 8.25.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.365-372
• /
• 2000

he paper introduces evolutionary computing to Fractal Image Compression(FIC). In Fractal Image Compression(FIC) a partitioning of the image into ranges is required. As a solution to this problem there is a propose that evolution computation should be applied in image partitionings. Here ranges are connected sets of small square image blocks. Populations consist of $N_p$ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces $\sigma$ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion Collage Theorem. As the optimum image includes duplication in image data, it gets smaller in saving space more efficient in speed and more capable in image quality than any other technique in which other coding is used. Fractal Image Compression(FIC) using evolution computation in multimedia image processing applies to such fields as recovery of image and animation which needs a high-quality image and a high image-compression ratio.

• The Journal of the Korea Contents Association
• /
• v.16 no.8
• /
• pp.592-600
• /
• 2016

AAPM CT performance for special medical equipment quality control checks using a standard phantom for evaluation, using the evaluator's subjective assessment as to minimize errors due computerized assessment program to evaluate their usefulness. Phantom for evaluation AAPM CT Performance Phantom: was used, the default shooting conditions are the same as quality control checks. And, we use IMAGE J to evaluate the program. Quantitative evaluation with CT attenuation coefficient and the noise measurement, the uniformity measurement, the slice thickness measurement, contrast resolution of the measurement, a phantom image of the spatial resolution determined by the evaluation program is evaluated as self-extracting the result after processing the image, CT uniformity measurement for the evaluation that was smaller and the standard deviation of a video image processing more uniform slice thickness measurements it is difficult to evaluate due to the difference of the ratio of the measured value of the phantom image. Contrast resolution was measured cylindrical diameter 6th evaluate the shape of a circle obtained a mean value and a standard deviation of diameters, the spatial resolution of the group of source, including acceptance criteria automatically extracted result as a result of both the number of the extracted circularIt appeared. Evaluate the source image and video processing, and video to qualitative evaluation by gross were processed video image is shown excellent results. If the evaluators in order to minimize the errors of subjective judgment based on the results of the above should be done with a quantitative evaluation and qualitative evaluation utilizes a computerized assessment program is considered that further evaluation be made more efficient.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.299-309
• /
• 2006

Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cell phone or PDA becomes increasingly popular. As different devices require different applications, various new services are being developed to satisfy the needs. One of the popular services under heavy demand is the Location-based Service (LBS) that exploits the spatial information of moving objects per temporal changes. In order to support LBS efficiently, it is necessary to be able to index and query well a large amount of spatio-temporal information of moving objects. Therefore, in this paper, we investigate how such location information of moving objects can be efficiently stored and indexed. In particular, we propose a novel location encoding method based on hierarchical administrative district information. Our proposal is different from conventional approaches where moving objects are often expressed as geometric points in two dimensional space, (x,y). Instead, in ours, moving objects are encoded as one dimensional points by both administrative district as well as road information. Our method is especially useful for monitoring traffic situation or tracing location of moving objects through approximate spatial queries.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.567-584
• /
• 2004

As XML becomes popular as the way of presenting information on the web, how to secure XML data becomes an important issue. So far study on XML security has focused on security of data communications by using digital sign or encryption technology. But, it now requires not just to communicate secure XML data on communication but also to manage query process to access XML data since XML data becomes more complicated and bigger. We can manage XML data queries by access control technique. Right now current XML data access control only deals with read operation. This approach has no option to process update XML queries. In this paper, we present XML access control model and technique that can support both read and update operations. In this paper, we will propose the operation for XML document update. Also, We will define action type as a new concept to manage authorization information and process update queries. It results in both minimizing access control steps and reducing memory cost. In addition, we can filter queries that have no access rights at the XML data, which it can reduce unnecessary tasks for processing unauthorized query. As a result of the performance evaluation, we show our access control model is proved to be better than other access control model in update query. But it has a little overhead to decide action type in select query.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.251-258
• /
• 1998

The purpose of this study is to develop the District-level Planning Support System (DPSS) by using GIS. The district-level planning which is related for district-level control of city, needs the various parcel-level information which is composing the urban physical environment. The information has to be stored and analyzed for recognizing the study area, then the district-level planning will be efficiently managed. The use of GIS in the process of district-level planning is restricted for the creation of thematic map. GIS is not used for the analysis of spatial patterns and planning process. This study evaluates the characteristics of current district-level planning and the basic components of urban physical environment. And the database model is built. The topology among components is defined by using the spatial relationship. Then the spatial query machine for district-level planing is developed by using ArcView 3.1, Avenue and Dialog Extension. This spatial query machine is applied for case study. This study shows 1) the possibility of the district-level planning support system for analyzing spatial relationship, 2) the needs of the up-to-date topographic map showing current building's footlines and the complete integration with cadastral maps, it will reduce the uncertainty in the spatial decision making process, 3) the methodology for the construction of spatial decision making rules, 4) the further study for the using of raster, network, image and three dimension data.