• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.45-52
• /
• 2004

According tothe development of digital media technologies various algorithms for video sequence matching have been proposed to match the video sequences efficiently. A large number of video sequence matching methods have focused on frame-wise query, whereas a relatively few algorithms have been presented for video sequence matching or video shot matching. In this paper, we propose an efficientalgorithm to index the video sequences and to retrieve the sequences for video sequence query. To improve the accuracy and performance of video sequence matching, we employ the Cauchy function as a similarity measure between histograms of consecutive frames, which yields a high performance compared with conventional measures. The key frames extracted from segmented video shots can be used not only for video shot clustering but also for video sequence matching or browsing, where the key frame is defined by the frame that is significantly different from the previous fames. Several key frame extraction algorithms have been proposed, in which similar methods used for shot boundary detection were employed with proper similarity measures. In this paper, we propose the efficient algorithm to extract key frames using the cumulative Cauchy function measure and. compare its performance with that of conventional algorithms. Video sequence matching can be performed by evaluating the similarity between data sets of key frames. To improve the matching efficiency with the set of extracted key frames we employ the Cauchy function and the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed method yields the high matching performance and accuracy with a low computational load compared with conventional algorithms.

• Korean Journal of Food Science and Technology
• /
• v.36 no.6
• /
• pp.995-1000
• /
• 2004

Nutritional composition and antioxidative capacity of mulberry fruit (Ficus-4x) were investigated for evaluation as new red-colored fruit. Contents of moisture, crude fat, crude protein, and vitamin C were similar, whereas that of crude ash was higher, to those of other berry fruits. Contents of minerals (Ca, 14.33 mg/100 g; P, 39.98 mg/100 g; Fe, 6.01 mg/100 g; Zn, 4.04 mg/100 g; Mn, 2.26 mg/100 g), particularly Fe, were higher than those of other berry fruits. Hardness, springness, cohesiveness, gumminess, and chewiness of mulberry fruit were higher, and color values (L, 36.03; a, 1.80; b, 1.54) were lower than those of strawberry. Relative scavenging activities of mulberry fruit methanol extract and its cyanidine 3-glucoside on 1, 1-diphenyl-2-picrylhydrazy radical (DPPH) were 35.7 and 78.2%, respectively, using butylated hydroxyanisole (BHA) as standard. Antioxidant activities in corn oil (peroxide values and conjugated dienoic acid) were tertiary butylhydroquinone (TBHQ) > mulberry fruit ethanol extract > mulberry fruit water extract > butylated hydroxytoluene (BHT) > tocopherol. Results show mulberry fruit can be very useful red-colored fruit for development of functional foods with beneficial effects on radical scavenging and antioxidative capacities.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.114-129
• /
• 2006

Ontology mapping is the task of finding semantic correspondences between two ontologies. In order to improve the effectiveness of ontology mapping, we need to consider the characteristics and constraints of data models used for implementing ontologies. Earlier research on ontology mapping, however, has proven to be inefficient because the approach should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. In this paper, we propose a multi-strategic mapping approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the topic maps. Our multi-strategic mapping approach includes a topic name-based mapping, a topic property-based mapping, a hierarchy-based mapping, and an association-based mapping approach. And it also uses a hybrid method in which a combined similarity is derived from the results of individual mapping approaches. In addition, we don't need to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the topic maps. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Yahoo german literature dictionary as input ontologies. Our experiments show that the automatically generated mapping results conform to the outputs generated manually by domain experts, which is very promising for further work.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• Journal of the Korean Society for information Management
• /
• v.17 no.3
• /
• pp.21-43
• /
• 2000

Not only the infomatmn seeking bellavmr or acadenuc sources by social scientists was analyzed bnt its eiieclive usmg method was also presented in this paper. For thc purpose, the questionnaires were prepared md admmislered lo social sacnilsin who are the profcsso~s oi a large unlverslty m Taegu, Korea. and the survey for tiler academic environment and its sateiaclion, characterislics, inforn~ahon seeking behavior of academic sources, etc. was conducted. Also, iheir research mlercsts and period, informauon s e e h g behav~or and its dfficulties, reineval melhods, and uslng rrequcncies of current issues elc. were analyzed in lliis paper. The major hdings ol the quanm.live pa on the development 01 academic sources for soaal sciencc study and t11e11 uses for education md study m !hi7 study are: (1) Socid sclenhsts preferred acquiring matenal ihrougli internet. CD-ROM, and PC, etc, lo the traditional methods; (2) They spend approxinmtciy 41 days for collecihg matend they wanl. and each of them has petty various period la collect n~atenal and acquiring methods. (standard deviation : about 35 days); (3) The cilalion kequencies of fore~gu material was hi&r than domeslic one; (4) They, social sc~entists, have a pretty hard time to access and use the theses, journal, magazinc. mmol~ches and m s r o f i , CD-ROM malerid etc. technicdly; (5) The group that has morc sat~sIaclion to thesa aud more fiequenl participant ol seminar seek [or more recen issues of a journal lhrough ihc research modcl of melag. (6) The group thal has higher positioned and 1on.a tenure o: office can access lo shorter time at period lhau the one that bas lhe lowcr and the shortcr group. Also, tutule research topic and recommcndations [or a ~ocial saentlst are proposed and suggested when using a social science material

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.13-38
• /
• 2006

Range query is one of the most important operations for spatial objects, it retrieves all spatial objects that overlap a given query region in multi-dimensional space. The DOT(DOuble Transformation) is known as an efficient indexing methods, it transforms the MBR of a spatial object into a single numeric value using a space filling curve, and stores the value in a $B^+$-tree. The DOT index is possible to be employed as a primary index for spatial objects. However, the range query processing based on the DOT index requires much overhead for spatial transformations to get the query region in the final space. Also, the detailed range query processing method for 2-dimensional spatial objects has not been studied yet in this paper, we propose an efficient multi-dimensional range query processing technique based on the DOT index. The proposed technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-legions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the range query and thus improves the performance of range query processing. A visual simulator is developed to show the evaluation method and the performance of our technique.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.663-673
• /
• 2010

As a tool used for video maintenance, Video segmentation divides videos in hierarchical and structural manner. This technique can be considered as a core technique that can be applied commonly for various applications such as indexing, abstraction or retrieval. Conventional video segmentation used adaptive threshold to split video by calculating difference between consecutive frames and threshold value in window with fixed size. In this case, if the time difference between occurrences of cuts is less than the size of a window or there is much difference in neighbor feature, accurate detection is impossible. In this paper, Improved Adaptive threshold algorithm which enables determination of window size according to video format and reacts sensitively on change in neighbor feature is proposed to solve the problems above. Post-Processing method for decrement in error caused by camera flash and fast movement of large objects is applied. Evaluation result showed that there is 3.7% improvement in performance of detection compared to conventional method. In case of application of this method on modified video, the result showed 95.5% of reproducibility. Therefore, the proposed method is more accurated compared to conventional method and having reproducibility even in case of various modification of videos, it is applicable in various area as a video maintenance tool.

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

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• Science of Emotion and Sensibility
• /
• v.21 no.1
• /
• pp.99-114
• /
• 2018

Saekdong is a unique Korean fabric that has been used since ancient times, and it is woven with the plain or satin weave so that vertical stripes appear by various colored warp threads of equal spacing. Saekdong means pleasure, joy, serenity, heavenly blessing, spirituality, wind, and abundance, expressing the optimistic and positive sentiment of Korea's forefathers. This study investigated how ancient Saekdong occurred with meanings. As a research method, this study used literature review and surfing newspapers and photographs, museum and internet search, even from other fields such as earthenware, bronze, and traditional dance. We collected Saekdong and the lifestyles of ethnic Koreans living in China, investigated the Asuka culture of Japan, and the tomb murals of Takamatsu-Chong, which are Baekje and Goguryeo settlement areas. The results are as follows: First, it expresses happy occasion, pleasure, and joy, and expresses a desire for good things to be repeated and lasting. Second, it symbolizes simple beauty, order, equality and harmony of many tribes. Third, Saekdong is life and power which represent a sacred, heavenly, mysterious bird. Fourth, it symbolizes abundance and wealth, rain, wind or fields. Finally, this study showed the brilliance and pride of Korean hanbok through Saekdong. The significance of this study is to examine the symbolism and inherent aesthetic characteristics of Saekdong and to show the unique value and spiritual heritage of the Korean people.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1399-1404
• /
• 2004

The development of computer technology and the advancement of the technology of information and communications spread the technology of multimedia and increased the use of multimedia data with large capacity. Users can grasp the overall video data and they are able to play wanted video back. To grasp the overall video data it is necessary to offer the list of summarized video data information. In order to search video efficiently an index process of video data is essential and it is also indispensable skill. Therefore, this thesis suggested the effective method about the cut detection of frames which will become a basis of an index based on contents of video image data. This suggested method was detected as the unchanging pixel rotor intelligence value, classified into diagonal direction. Pixel value of color detected in each frame of video data is stored as A(i, i) matrix - i is the number of frames, i is an image height of frame. By using the stored pixel value as the method of UE(Mean Square Error) I calculated a specified value difference between frames and detected cut quickly and exactly in case it is bigger than threshold value set in advance. To carry out an experiment on the cut detection of lames comprehensively, 1 experimented on many kinds of video, analyzing and comparing efficiency of the cut detection system.