• The Transactions of the Korea Information Processing Society
• /
• v.2 no.6
• /
• pp.903-917
• /
• 1995

In most database systems images have been indexed indirectly using related texts such as captions, annotations and image attributes. But there has been an increasing requirement for the image database system supporting the storage and retrieval of images directly by content using the information contained in the images. There has been a few indexing methods based on contents. Among them, Pertains proposed an image indexing method considering spatial relationships and properties of objects forming the images. This is the expansion of the other studies based on '2-D string. But this method needs too much storage space and lacks flexibility. In this paper, we propose a more flexible index structure based on kd-tree using paging techniques. We show an example of extracting keys using normalization from the from the raw image. Simulation results show that our method improves in flexibility and needs much less storage space.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.113-118
• /
• 2010

Recently, 3D-reconstruction for geographic information and study of geospatial information is progressing in various fields through national policy such as R&D business and pilot project. LiDAR system has a advantage of acquisition the 3D information data easily and densely so that is used in many different fields. Considering to characterist of the point data formed with 3D, it need a high specification CPU because it requires a number of processing operation for 2D form expressed by monitor. In contrast, 2D grid structure, like DEM, has a advantage on costs because of simple structure and processing speed. Therefore, purpose of this study is to solve the problem of requirement of more storage space, when LiDAR data stored in forms of 3D is used for 3D-geographic and 3D-buliding representation. Additionally, This study reconstitutes 2D-gird data to supply the representation data of 3D-geographic and presents the storage method which is available for detailed representation applying tree-structure and reduces the storage space.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.1-19
• /
• 1996

Non-manifold topological representations can provide a single unified representation for mixed dimensional models or cellular models and thus have a great potential to be applied in many application areas. Various boundary representations for non-manifold topology have been proposed in recent years. These representations are mainly interested in describing the sufficient adjacency relationships and too redundant as a result. A model stored in these representations occupies too much storage space and is hard to be manipulated. In this paper, we proposed a compact hierarchical non-manifold boundary representation that is extended from the half-edge data structure for solid models by introducing the partial topological entities to represent some non-manifold conditions around a vertex, edge or face. This representation allows to reduce the redundancy of the existing schemes while full topological adjacencies are still derived without the loss of efficiency. To verify the statement above, the storage size requirement of the representation is compared with other existing representations and present some main procedures for querying and traversing the representation. We have also implemented a set of the generalized Euler operators that satisfy the Euler-Poincare formula for non-manifold geometric models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.923-948
• /
• 2013

The main concern in mobile peer-to-peer (P2P) networks is security because jamming or eavesdropping on a wireless link is much easier than on a wired one and such damage can be incurred without physical access or contact. In particular, authentication has increasingly become a requirement in mobile P2P environments. This paper presents a new mutual authentication mechanism which requires less storage space and maintains a high level of security in mobile P2P networks. The proposed mechanism improves efficiency by avoiding the use of centralized entities and is designed to be agile in terms of both reliability and low-cost implementation. The mechanism suggested in the simulation evaluates the function costs occurring in authentication between the devices under mobile P2P network environment comparing to existing method in terms of basic operation costs, traffic costs, communications costs, storage costs and scalability. The simulation results show that the proposed mechanism provides high authentication with low cryptography processing overhead.

• Journal of Biomedical Engineering Research
• /
• v.14 no.1
• /
• pp.9-16
• /
• 1993

For efficient storage and transmission of medical images, the requirement of image com pression is increasing. Because differences between reconstructed images and original images are related with errors In the diagnosis, lossless compression is generally preferred in mod- ical images. in Run Length Coding which is one of the lossless compression method, we have applied modified scanning direction based on the Hilbert curve, which is a kind of space fill ins curve. We have substituted the traditional raster scanning by Hilbert curve direction scanning. Using this method, we have studied enhancement of compression efficiency for medical images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.106-114
• /
• 1994

A new merging technique is adopted for combining rectangular parallelepipes produced by 2-D rectangular code into more intuitive 30D volume elements. Rectangular parallelepiped codes (RP codes) can be used in volume-based representation of a three-dimensional object. We proposed more regularity-conserving 2-D rectangular coding scheme to merge rectangular cells represented by RP codes in three-dimensional space. After being constructed from modified 2-D rectangular code, 3-D RP codes are merged in the two orthogonal directions using new merging algorithm. The shape of merged 3-D object reconstructed by proposed algorithm is shown to be much closer to the original object shape than that of conventional RP codes. The storage requirement of merged object can be also reduced.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.886-893
• /
• 2002

The standard Hough transform has been dominantly used to detect straight lines in an image. However, massive storage requirement and low precision in estimating line parameters due to the quantization of parameter space are the major drawbacks of the Hough transform technique. In this paper, to overcome the drawbacks, an iterative algorithm based on a self-organizing map is presented. The self-organizing map can be adaptively learned such that image points are clustered by prominent lines. Through the procedure of the algorithm, a set of lines are sequentially detected one at a time. Computational results for synthetically generated images are given. The promise of the algorithm is also demonstrated with its application to two natural images of inserts.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.141-149
• /
• 2007

Multiple-input multiple-output (MIMO) transmit pre-coding/beamforming can significantly improve system spectral efficiency. However, several obstacles prevent precoding from wide deployment in early wireless networks: The significant feedback overhead, performance degradation due to feedback delay, and the large storage requirement at the mobile devices. In this paper, we propose a precoding method that addresses these issues. In this approach, only 3 or 6 bits feedback is needed to select a precoding matrix from a codebook. There are fifteen codebooks, each corresponding to a unique combination of antenna configuration (up to 4 antennas) and codebook size. Small codebooks are prestored and large codebooks are efficiently computed from the prestored codebook, modified Hochwald method and Householder reflection. Finally, the feedback delay is compensated by channel prediction. The scheme is validated by simulations and we have observed significant gains comparing to space-time coding and antenna selection. This solution was adopted as a part of the IEEE 802.16e specification in 2005.

• Journal of Software Assessment and Valuation
• /
• v.15 no.2
• /
• pp.129-140
• /
• 2019

In the IoT environment, there is a huge amount of heterogeneous devices with limited capacity. Existing trust evaluation methods are not adequate to accommodate this requirement due to the limited storage space and computational resources. In addition, since IoT devices are mainly human operated devices, the trust evaluation should reflect the social relations among device owners. There is also a need for a mechanism that reflects the tendency of the trustor and environmental factors. In this paper, we propose an adaptable trust evaluation method for SOA-based IoT system to deal with these issues. The proposed model is designed to minimize the confidence bias and to dynamically respond to environmental changes by combining direct evaluation and indirect evaluation. It is expected that it will be possible to secure trust through quantitative evaluation by providing feedback based on social relationships.

• Korean Journal of Human Ecology
• /
• v.20 no.3
• /
• pp.691-711
• /
• 2011

This study examines the preliminary license and approval facilitation standards for improvements in quality for childcare centers focusing on the number of children, building space standards, facilities and equipment, and childcare program. Data from 48 caese was collected from childcare centers nationwide in Korea through a questionnaire and building plan. The first step for starting care licensing is to work out the ages and numbers of children within four or five age ranges. The second step is to work out the number of children as small, medium, or large considering staff to child ratios and building size. The Nnext step is to make a choice about childcare service quality classification as minimum, fair, or good, considering space requirements per child for the building, the classroom and the outdoor playground. The next step is to make a choice of space organization relating to service programs, considering the sleeping and eating area, indoor play area, toilet & washing facilities, classroom layouts such as cluster type, double zone type, single zone type, and others. Also, each room and entrance, office, kitchen, storage, laundry, teacher's area, and chilldren's area, need to be checked for space requirements and performances. The last step is to arrange the childcare program with the building and site plan. In conclusion childcare service quality will get better by upgrading of license regulation especially in minimum space requirements per child, corresponding with an increase in GNP and housing area per person. This is needed for childcare licensing in order to determine the quality level of childcare service.