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

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.59-66
• /
• 2016

This paper presents an empirical evaluation on dimensionality reduction strategies by which dissimilarity-based classifications (DBC) can be implemented efficiently. In DBC, classification is not based on feature measurements of individual objects (a set of attributes), but rather on a suitable dissimilarity measure among the individual objects (pair-wise object comparisons). One problem of DBC is the high dimensionality of the dissimilarity space when a lots of objects are treated. To address this issue, two kinds of solutions have been proposed in the literature: prototype selection (PS)-based methods and dimension reduction (DR)-based methods. In this paper, instead of utilizing the PS-based or DR-based methods, a way of performing DBC in Eigen spaces (ES) is considered and empirically compared. In ES-based DBC, classifications are performed as follows: first, a set of principal eigenvectors is extracted from the training data set using a principal component analysis; second, an Eigen space is expanded using a subset of the extracted and selected Eigen vectors; third, after measuring distances among the projected objects in the Eigen space using $l_p$-norms as the dissimilarity, classification is performed. The experimental results, which are obtained using the nearest neighbor rule with artificial and real-life benchmark data sets, demonstrate that when the dimensionality of the Eigen spaces has been selected appropriately, compared to the PS-based and DR-based methods, the performance of the ES-based DBC can be improved in terms of the classification accuracy.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.27 no.7
• /
• pp.1004-1010
• /
• 2021

Ship-floating object accidents can lead not only to a delay in ship's operations, but also to large scale casualties. Hence, preventive measures are required to avoid them. This study analyzed the spatiotemporal aspects of such collisions based on the data on ship-floating object accidents in sea areas in the last five years, including the collisions in South Korea's territorial seas and exclusive economic zones. We also provide basic data for related research fields. To understand the distribution of the relative density of accidents involving floating objects, the sea area under analysis was visualized as a grid and a two-dimensional histogram was generated. A multinomial logistic regression model was used to analyze the effect of variables such as time of day and season on the collisions. The spatial analysis revealed that the collision density was highest for the areas extending from Geoje Island to Tongyeong, including Jinhae Bay, and that it was high near Jeongok Port in the West Sea and the northern part of Jeju Island. The temporal analysis revealed that the collisions occurred most frequently during the day (71.4%) and in autumn. Furthermore, the likelihood of collision with floating objects was much higher for professional fishing vessels, leisure vessels, and recreational fishing vessels than for cargo vessels during the day and in autumn. The results of this analysis can be used as primary data for the arrangement of Coast Guard vessels, rigid enforcement of regulations, removal of floating objects, and preparation of countermeasures involving preliminary removal of floating objects to prevent accidents by time and season.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1234-1240
• /
• 2009

Culture is not only a factor of a life worthy of man, but also that of beauty and fluency of life,so it works as a key to show differences in the quality of life. Paying attention to culture, which plays a role to create new things, is a source of high-added value. The term of cultural contents was derived in21C, combining digital skills with art. We are going to reconstruct and develope cultural properties such as remains, pottery, pictures, as a way of restoration for cultural contents with the view of reinterpretation. In this paper, we reinterpreted the pictures which were based on three particular elements in Chosun Dinasty- poetry, handwriting, and picture, and we produced 3D objects after analyzing texts and images in multimedia works applied with source pictures. As a highlighted method of restoration for cultural contents, we produced the work which can be interacted and has three dimensional objects getting out of appreciating of plane images. We presented a method of informing our culture with 3D Mong-yu-do-won-do, which used traditional paintings by being improved user friendliness and accessibility.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1033-1043
• /
• 2000

Recently as the user request on NoD (News-on-Demand) is largely increasing, there are a lot of researches to fulfill it. However, because of short life-cycle of new video data and periodical change of video data depending on anchor, it is difficult to apply the conventional video storage techniques to NOD applications directly. For this, we design and implement low-level storage manager for efficient storage and retrieval of multimedia data in NOD Services. Our low-level storage manager not only efficiently sotres video stream dat of new video itself, but also handles its index information. It provides an inverted file method for efficient text-based retrieval and an X-tree index structure for high-dimensional feature vectors. In addition, our low-level storage manager provides some application program interfaces (APIs) for storing video objects itself and index information extracted from hierarchial new video and some APIs for retrieving video objects easily by using cursors. Finally, we implement our low-level storage manager based on SHORE (Scalable Heterogeneous Object REpository) storage system by sunig a standard C++ language under UNIX operating system.

• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.248-257
• /
• 2002

Clustering is a method for grouping objects with similar properties into a same cluster. SVD(Singular Value Decomposition) is known as an efficient preprocessing method for clustering because of dimension reduction and noise elimination for a high dimensional and sparse data set like E-Commerce data set. However, it is hard to evaluate the worth of original attributes because of information loss of a converted data set by SVD. This research proposes a cluster feature selection method, called ENTROPY-SVD, to find important attributes for each cluster based on entropy weighting and SVD. Using SVD, one can take advantage of the latent structures in the association of attributes with similar objects and, using entropy weighting one can find highly dense attributes for each cluster. This paper also proposes a model-based collaborative filtering recommendation system with ENTROPY-SVD, called CFS-CF and evaluates its efficiency and utilization.

• Journal of Conservation Science
• /
• v.33 no.1
• /
• pp.11-16
• /
• 2017

This study reviews the structure of wooden printing blocks in Japan, focusing on the blocks as three-dimensional objects. Inspection is more effective three-dimensionally than two-dimensionally, and for the first time in wooden printing block research, the study uses a 3D CT scanner and a high-resolution 3D digitizer. The 3D CT scanner examines cross sections of the blocks and identifies their grain and contents, including insects surviving within them. The 3D digitizer enables observation of objects up to 0.02 mm; this allows detailed collection of block surface information, which is difficult to identify with a conventional microscope.

• 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.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.507-512
• /
• 2001

Feature-based similarity has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects. the performance of conventional multidimensional data structures tends to deteriorate as the number of dimensions of feature vectors increase. The $R^{*}-Tree$ is the most successful variant of the R-Tree. In this paper, we propose a SOM-based $R^{*}-Tree$ as a new indexing method for high-dimensional feature vectors. The SOM-based $R^{*}-Tree$ combines SOM and $R^{*}-Tree$ to achieve search performance more scalable to high-dimensionalties. Self-Organizingf Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two-dimensional space. The map is called a topological feature map, and preserves the mutual relationships (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. We experimentally compare the retrieval time cost of a SOM-based $R^{*}-Tree$ with of an SOM and $R^{*}-Tree$ using color feature vectors extracted from 40,000 images. The results show that the SOM-based $R^{*}-Tree$ outperform both the SOM and $R^{*}-Tree$ due to reduction of the number of nodes to build $R^{*}-Tree$ and retrieval time cost.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.5 no.2
• /
• pp.109-120
• /
• 1985

This thesis is a study on multiple close range photogrammetry, and the purpose of this study is to develop the most accurate adjustment method of three dimensional object coordinates. This was achieved by comparing the standard errors of actual data to the computed values from 2 photos and multiple photos. The conventional methods for multiple photos have been analyzed by using geometric model formation. But in this study, the equation of collinearity condition which has been applied to aerial photogrammetry was derived to be a basic principle of close range photogrammetry, and the algorithm for analyzing multiple photos was developed using simultaneous bundle adjustment. The method used in this study, showed more homogeneous accuracy in coordinate and more consistent variance of error than those of conventional methods. It was found that the cases using 3, 4, and 5 photos were more accurate than using 2 photos; the accuracies were improved to 15%, 35%, and 50%, for each case. Thus this study is expected to be useful in measuring the geometry of historic monuments and other structures requiring high accuracy. Also the combined case of multiple photos is considered to be effective for the precise analysis of the objects which are difficult to measure for obstacles.