• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.217-229
• /
• 1999

Framework is the set of interrelated classes, constructing reusable design in specific domain or set of abstracted classes, and defines common architecture among applications included in domain. Developers can reuse not only class code but also wide range of knowledge on domain by reusing framework. In this papers, we present COM(Component-Oriented Methodology) for the reuse of framework, and develop construction environment for framework and domain development. That is, domain is analyzed by input of domain knowledge on real world to create software based on component, and hotspot is identified through analyzed information, and redesigned(refactoring) by putting additional information on users and developers. After that, I will create domain framework and application framework depending on domain. In this Component-oriented methodology, information is searched, understood and extracted or composite through component-pattern library storage internally. Then this information is classified into the information on component and pattern respectively, and used as additional information in redesigning. With this, developer can obtain reusability, easiness and portability by constructing infrastructure environment that allow to register, update and delete component through Component Pattern Management System(CPMS) under the development environment which can be easily applied to his own application using multimedia component, in this thesis, CORBA(Common Object Request Broker Architecture) environment.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.523-532
• /
• 2001

A Critical issue in the performance of a video-on-demand system is the required I/O bandwidth of the Video server in order to satisfy clients requests, and it is the crucial resource that may cause delay increasingly. Several approaches such as batching and piggybacking are used to reduce the I/O demand on the video server through sharing. Bathing approach is to make single I/O request for storage server by grouping the requests for the same object. Piggybacking is th policy for altering display rates of requests in progress for the same object to merge their corresponding I/O streams into a single stream, and serve it as a group of merged requests. In this paper, we propose a reservation-based hybrid disk bandwidth reduction policy that dynamically reserves the I/O stream capacity of a video server for popular videos according to the loads of video server in order to schedule the requests for popular videos immediately. The performance of the proposed policy is evaluated through simulations, and is compared with that of bathing and piggybacking. As a result, we know that the reservation-based hybrid disk bandwidth reduction policy provides better probability of service, average waithing time and percentage of saving in frames than batching and piggybacking policy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.212-215
• /
• 2022

In the era of so-called digital transformation today, the need for the construction and utilization of big data in various fields has increased. Today, a lot of data is produced and stored in a digital device and media-friendly manner, but the production and storage of data for a long time in the past has been dominated by print books. Therefore, the need for Optical Character Recognition (OCR) technology to utilize the vast amount of print books accumulated for a long time as big data was also required in line with the need for big data. In this study, a system for digitizing the structure and content of a document object inside a scanned book image is proposed. The proposal system largely consists of the following three steps. 1) Recognition of area information by document objects (table, equation, picture, text body) in scanned book image. 2) OCR processing for each area of the text body-table-formula module according to recognized document object areas. 3) The processed document informations gather up and returned to the JSON format. The model proposed in this study uses an open-source project that additional learning and improvement. Intelligent OCR proposed as a system in this study showed commercial OCR software-level performance in processing four types of document objects(table, equation, image, text body).

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Food Science and Preservation
• /
• v.18 no.4
• /
• pp.497-501
• /
• 2011

The object of this study was to evaluate the effect of gibberellins (GA) pasting on the bourse shoot, and not just on the fruit characteristics but also on the quality, of Niitaka pear (Pyrus pyryfolia L). The fruit stalk was treated with GA (control, 25mg/fruit stalk) 35 days after reaching full bloom. In the GA-treated tree, the occurrence of abnormal bourse shoot (52.5%) increased, and the spur bud and flower number decreased. The diameter of the GA-paste-treated fruit increased during the pear growth period with GA treatment. The diameter, length, and weight of the GA-paste-treated fruit increased at harvest time, but the hardness was lower than that of the control. The differences in soluble solid, acidity, and fruit color between the control and the GA-paste-treated fruit were not significant. Post-harvest, during the storage period, the hardness of the GA-paste-treated fruit was lower than that of the control, and its weight loss ratio was higher than that of the control on the $60^{th}$ days of storage.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.45 no.11
• /
• pp.1630-1637
• /
• 2016

The object of this study was to evaluate the quality characteristics and antioxidant activities of Sikhe added with 25%, 50%, and 100% Artemisia capillaris extract instead of water. The control group showed higher sweetness and lower pH than the other groups. Longer storage time was associated with increased turbidity. In the chromaticity determination, $L^*$ value decreased while $a^*$ and $b^*$ values increased as A. capillaris extracts increased. In terms of free sugars, sucrose and maltose were detected. Maltose was generated through glycosylated action with amylase. The total polyphenol and flavonoid contents and antioxidant activities proportionally increased with levels of A. capillaris extract. In the sensory evaluation, Sikhe made with 50% A. capillaris extract showed the highest preferences for color, taste, plumpness of rice granules, and overall acceptance. These results suggest that A. capillaris maybe a useful ingredient in Sikhe to improve quality and sensory properties.

• Journal of the Korean Home Economics Association
• /
• v.20 no.4
• /
• pp.155-168
• /
• 1982

What is attempted here is to find out an optimum method for the design of physical environments that could save human energy expenditures and safely perform household duties. There are, if any, very little amount of research done in this area. This is particulary so when the work relates to the designing of household storage facilities in the light of the energy metabolism of human body. The first step to this study, therefore, is to find out the ways by which we can determine the energy metabolism of human body accurately. To measure the volume and the concentration of human respiration continuously and automatically, a new apparatus is selected here. This includes the recording system with the Wright Respirometer and the Expired Gas Analyzer as well as the computer system to multiply volume by concentration of human respiration and to integrate them for a given time. Then, the author experimented on the reliability of this apparatus and came to the conclusion that this apparatus satisfied our need to research the energy metabolism of human body. Next, the general plan and procedures to experiment with this apparatus have been determined as follows: 1) subjects are three young and sound females. Their physical characteristics are shown in Table 1 and most approximates the standard characteristics of Japanese females, 2) height of open shelves is selected in such away as to correspond to the respective height of each subject(see Table 2), 3) utensils to be stored are box shaped object, which weight is 0.5kg, 1.0kg, 2.0kg or 3.0kg, 4) working motions are given while one or two hands as to place utensil on each shelf from the standard working board, 85 cm in height and then to place back it on the board from the shelf and repeated in constant velocity as 10 times per a minute, 5) each posture of motion is chosen by each subject in free, 6) procedures of measurement of human energy metabolism ard shown at(6), 1, Section 3 as specific methods for using this apparatus. Findings of this study are as follows: 1. Human energy expenditures for storing utensils on shelves by each subject are shown in quantity more accurately than in any other studies, under varying conditions about height of shelves, load of utensils and working motion with one hand and two hands (see Fig. 8~13 and Table 3). 2. Experimental formulae of human energy expenditure for that work are shown as formula (8), (9) and (10), to generalize results of 1. and to apply those for working motion under given conditions. 3. As results of analysis on gained data, we are able to show the standard model of human energy expenditures for storing untensils on shelves by the standard Japanese female (see Table 7 and Fig. 14).

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.