• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3578-3593
• /
• 2017

Given two collections of objects that carry both spatial and textual information in the form of tags, a $\text\underline{S}patio$-$\text\underline{T}extual$-based object $\text\underline{S}imilarity$ $\text\underline{JOIN}$ (ST-SJOIN) retrieves the pairs of objects that are textually similar and spatially close. In this paper, we have proposed a block index-based approach called BIST-JOIN to facilitate the efficient ST-SJOIN processing. In this approach, a dual-feature distance plane (DFDP) is first partitioned into some blocks based on four segmentation schemes, and the ST-SJOIN is then transformed into searching the object pairs falling in some affected blocks in the DFDP. Extensive experiments on real and synthetic datasets demonstrate that our proposed join method outperforms the state-of-the-art solutions.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.919-922
• /
• 2000

A robust optical security technique using ortho-gonally polarized lights in the interferometer is proposed. We use orthogonally polarized lights in order to minimize the noise generated by the refractive index change due to vibration, flow of air, change of temperature etc. To make orthogonally polarized lights the first beam splitter in the Mach-Zehnder interferometer is substituted by a polarizing beam splitter(PBS). Because of incoherence of orthogonally polarized lights, the noise generated by the change of refractive index is minimized. To encrypt an image we use the random partition and the diffusing of pixel. Finally we make Phase-only-filters of each image which is randomly partitioned and diffused pixel by pixel. Simulation results show the proposed system has the ability of encryption and decryption of an image.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.333-336
• /
• 2002

This paper presents a new image segmentation method using fuzzy measures which reflect the local property of an image as well as the global property of an image An image is globally segmented into the crisp region and the ambiguous region in terms of the Index of fuzziness measured over all pixels of an image. The ambiguous region is luther partitioned into background and object in terms of the index of fuzziness computed over the set of neighboring pixels reflecting the local property most. From the experimental results, this method shows the effective ambiguity handling capability in segmenting an image.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.225-236
• /
• 2003

MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4568-4587
• /
• 2014

Authentication of videos and images based on the content is becoming an important problem in information security. Unfortunately, previous studies lack the consideration of Kerckhoffs's principle in order to achieve this (i.e., a cryptosystem should be secure even if everything about the system, except the key, is public knowledge). In this paper, a solution to the problem of finding a relationship between a frame's index and its content is proposed based on the creative utilization of a robust manifold feature. The proposed solution is based on a novel semi-fragile watermarking scheme for H.264/AVC video content authentication. At first, the input I-frame is partitioned for feature extraction and watermark embedding. This is followed by the temporal feature extraction using the Isometric Mapping algorithm. The frame index is included in the feature to produce the temporal watermark. In order to improve security, the spatial watermark will be encrypted together with the temporal watermark. Finally, the resultant watermark is embedded into the Discrete Cosine Transform coefficients in the diagonal positions. At the receiver side, after watermark extraction and decryption, temporal tampering is detected through a mismatch between the frame index extracted from the temporal watermark and the observed frame index. Next, the feature is regenerate through temporal feature regeneration, and compared with the extracted feature. It is judged through the comparison whether the extracted temporal watermark is similar to that of the original watermarked video. Additionally, for spatial authentication, the tampered areas are located via the comparison between extracted and regenerated spatial features. Experimental results show that the proposed method is sensitive to intentional malicious attacks and modifications, whereas it is robust to legitimate manipulations, such as certain level of lossy compression, channel noise, Gaussian filtering and brightness adjustment. Through a comparison between the extracted frame index and the current frame index, the temporal tempering is identified. With the proposed scheme, a solution to the Kerckhoffs's principle problem is specified.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.459-470
• /
• 2003

It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

• Korean Journal of Soil Science and Fertilizer
• /
• v.45 no.1
• /
• pp.30-36
• /
• 2012

The active fraction of soil organic matter, which includes organic debris and light organic fraction, plays a major role in nutrient cycling. In addition, particulate organic matter is a valuable index of labile soil organic matter and can reflect differences in various soil behaviors. Since soil organic matter bound to soil mineral particles has its density lower than soil minerals, we partitioned soil organic matter into debris ($<1.5g\;cm^{-3}$), light fraction ($1.5-2.0g\;cm^{-3}$), and heavy fraction ($>2.0g\;cm^{-3}$), based on high density $ZnCl_{2-}$ sucrose solutions. Generally, partitioned organic bands were clearly separated, demonstrating that the $ZnCl_{2-}$ sucrose solutions are useful for such a density gradient centrifugation. The available gradient ranges from 1.2 to $2.0g\;cm^{-3}$. Although there was not a statistically meaningful difference in organic debris and organomineral fractions among the examined soils, there was a general trend that a higher content of organic debris resulted in a higher proportion of light organomineral fraction. In addition, high clay content was associated with increased fraction of light organomineals. Partitioning of soil organic carbon revealed that carbon content is reduced in the heavy fraction than in the light fraction, reflecting that the light fraction contains more fresh and abundant carbon than the passive resistant fraction. It was also found that carbon contents in the overall organic matter, debris, light fraction, and heavy fractions may differ considerably in response to different farming practices.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.495-512
• /
• 2006

Recently, researches on a future position prediction of moving objects have been progressed as the importance of the future position retrieval increases. New index structures are required to efficiently retrieve the consecutive positions of moving objects. Existing index structures significantly degrade the search performance of the moving objects because the search operation makes the unnecessary extension of the node in the index structure. To solve this problem, we propose a space partition based index structure considering the mobility of moving objects. To deal with the overflow of a node, our index structure first merges it and the sibling node. If it is impossible to merge them, our method splits the overflow node in which moving properties of objects are considered. Our index structure is always partitioned into overlap free subregions when a node is split. Our split strategy chooses the split position by considering the parameters such as velocities, the escape time of the objects, and the update time of a node. In the internal node, the split position Is determined from preventing the cascading split of the child node. We perform various experiments to show that our index structure outperforms the existing index structures in terms of retrieval performance. Our experimental results show that our proposed index structure achieves about $17%{\sim}264%$ performance gains on current position retrieval and about $107%{\sim}19l%$ on future position retrieval over the existing methods.

• Journal of Korea Game Society
• /
• v.10 no.6
• /
• pp.57-65
• /
• 2010

In this paper, mobility performance indices are proposed which may be used to estimate characteristics of output velocity space in six-degree-of-freedom parallel mechanism. In order for manipulability and condition number to not suffer from lack of the physical meaning due to dimensional inhomogeneity, output space is partitioned into translational velocity space and rotational velocity space, respectively. In each space, mobility ellipsoids corresponding to unit input space are defined and two types of mobility performance in translational velocity spaces indices are derived. Two types of mobility performance in rotational velocity spaces indices are derived.

• Journal of Cadastre & Land InformatiX
• /
• v.45 no.1
• /
• pp.169-179
• /
• 2015

Recently, as the amount of data increases rapidly, the development of IT technology entered the 'Big Data' era, dealing with large-volume of data at once. In the spatial field, a spatial data service technology is required to use that various and big amount of data. In this study, firstly, we explained the technology of typical spatial information data services abroad, and then we have developed large KML data processing techniques those can be applied as KML format to VWorld desktop. The test was conducted using a large KML data in order to verify the development KML partitioned methods and tools. As a result, the index file and the divided files are produced and it was visible in VWorld desktop.