• Language and Information
• /
• v.9 no.1
• /
• pp.69-92
• /
• 2005

Pattern recognition in cognitive agents is based on (i) the uninterpreted input data (e.g. parameter values) provided by the agent's hardware devices and (ii) and interpreted patterns (e.g. templates) provided by the agent's memory. Computationally, the task consists in finding the memory data corresponding best to the input data, for any given input. Once the best fitting memory data have been found, the input is recognized by applying to it the interpretation which happens to be stored with the memorized pattern. This paper presents a fast converging procedure which starts from a few initially recognized items and then analyzes the remainder of the input by systematically checking for items shown by memory to have been related to the initial items in previous encounters. In this way, known patterns are tried first, and only when they have been exhausted, an elementary exploration of the input is commenced. Efficiency is improved further by choosing the candidate to be tested next according to frequency.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.159-162
• /
• 2003

컬러 특징을 나타내는 전형적인 방법으로 RGB 컬러히스토그램이 있다. RGB 컬러 히스토그램은 RGB 컬러 공간을 일련의 bin으로 나누고 각 bin의 컬러 값에 대응하는 영상 픽셀의 빈도 수를 카운트하는 것으로 영상 검색에서 널리 쓰이고 있다. 그러나 RGB 컬러히스토그램은 영상의 미세한 장면 변화에도 크게 달라지기 때문에 검색 결과에 많은 영향을 줄 수 있다. 본 논문에서는 RGB 컬러히스토그램의 이러한 특성을 개선할 수 있는 새로운 컬러 특징 표현 방법을 제안한다. 제안하는 방법은 RGB 컬러 공간으로부터 RG, GB, BR의 세 가지 평면으로 투영시킨 2차원 투영 맵(2D Projection Maps)을 사용한다. 영상 검색에 대한 실험 결과로부터 제안한 2차원 투영 맵이 RGB 컬러히스토그램보다 더 향상된 검색 효율을 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5323-5343
• /
• 2018

Mobile applications and social networks tend to enhance the need for high-quality content access. To address the rapid growing demand for data services in mobile networks, it is necessary to develop efficient content caching and distribution techniques, aiming at significantly reduction of redundant content transmission and thus improve content delivery efficiency. In this article, we develop optimal cooperative content cache and distribution policy, where a geographical cluster model is designed for content retrieval across the collaborative small cell base stations (SBSs) and replacement of cache framework. Furthermore, we divide the SBS storage space into two equal parts: the first is local, the other is global content cache. We propose an algorithm to minimize the content caching delay, transmission cost and backhaul bottleneck at the edge of networks. Simulation results indicates that the proposed neighbor SBSs cooperative caching scheme brings a substantial improvement regarding content availability and cache storage capacity at the edge of networks in comparison with the current conventional cache placement approaches.

• East Asian mathematical journal
• /
• v.40 no.3
• /
• pp.307-318
• /
• 2024

This paper explores the application of matrix factorization, specifically CUR decomposition, in the clustering of Korean language documents by topic. It addresses the unique challenges of Natural Language Processing (NLP) in dealing with the Korean language's distinctive features, such as agglutinative words and morphological ambiguity. The study compares the effectiveness of Latent Semantic Analysis (LSA) using CUR decomposition with the classical Singular Value Decomposition (SVD) method in the context of Korean text. Experiments are conducted using Korean Wikipedia documents and newspaper data, providing insight into the accuracy and efficiency of these techniques. The findings demonstrate the potential of CUR decomposition to improve the accuracy of document clustering in Korean, offering a valuable approach to text mining and information retrieval in agglutinative languages.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.1
• /
• pp.117-135
• /
• 2010

We designed a structured folksonomy system in which queries can be expanded through tag control; equivalent, synonym or related tags are bound together, in order to improve the retrieval efficiency (recall and precision) of image data. Then, we evaluated the proposed system by comparing it to a tag-based system without tag control in terms of recall, precision, and user satisfaction. Furthermore, we also investigated which query expansion method is the most efficient in terms of retrieval performance. The experimental results showed that the recall, precision, and user satisfaction rates of the proposed system are statistically higher than the rates of the tag-based system, respectively. On the other hand, there are significant differences among the precision rates of query expansion methods but there are no significant differences among their recall rates. The proposed system can be utilized as a guide on how to effectively index and retrieve the digital content of digital library systems in the Library 2.0 era.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.281-289
• /
• 2002

Few studies have been systematically pursued on a multimedia data mining in despite of the over-whelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

• Asian-Australasian Journal of Animal Sciences
• /
• v.25 no.5
• /
• pp.629-634
• /
• 2012

This study was conducted to improve the yield of mature oocytes from in vitro-culture of ovarian primary follicles by optimizing follicle retrieval from neonatal mice of different ages. Primary follicles of 75 to $99{\mu}m$ in diameter were collected daily from 7- to 14-day-old neonatal mice, and subsequently cultured in ${\alpha}$-MEM medium. Number of primary follicles isolated, growth of the follicle during in vitro-culture and maturation of intrafollicular oocytes were monitored. Overall, mean number of preantral follicles per animal was improved from 10.7 to 88.7 as the age of follicle donors was increased from 7 to 14-day-old. Number of primary follicles was increased gradually up to 11-day-old (35.7 follicle per an animal), then reduced to 29 in 14-day-old (p = 0.0013). More follicles retrieved from 10-day-old or 11-day-old females maintained their morphological normality at the end of primary culture than the follicles retrieved from 9-day-old. Of those cultured, primary follicles retrieved from 11-day-old mice yielded largest larger number of early secondary follicles than the follicles retrieved from in the other ages (39 vs. 13 to 29%). More than 3.3-times increase (0.86 to 2.86; p<0.05) in an average number of mature oocytes per animal was observed in the group of 11-day-old, compared with 9-day-old. However, no difference was found in the percentage of primary follicles developing into the pseudoantral stage (21 to 30%; p = 0.5222) and in the percentage of oocytes mucified (32 to 39%; p = 0.5792). In conclusion, a positive correlation between retrieval time and follicle growth was detected, which influences the efficiency to derive mature oocytes by follicle culture.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.357-368
• /
• 2003

Evaluation of shape similarity for 3D models is essential in many areas - medicine, mechanical engineering, molecular biology, etc. Moreover, as 3D models are commonly used on the Web, many researches have been made on the classification and retrieval of 3D models. In this paper, we describe methods for 3D shape representation and major concepts of similarity evaluation, and analyze the key features of recent researches for shape comparison after classifying them into four categories including multi-resolution, topology, 2D image, and statistics based methods. In addition, we evaluated the performance of the reviewed methods by the selected criteria such as uniqueness, robustness, invariance, multi-resolution, efficiency, and comparison scope. Multi-resolution based methods have resulted in decreased computation time for comparison and increased preprocessing time. The methods using geometric and topological information were able to compare more various types of models and were robust to partial shape comparison. 2D image based methods incurred overheads in time and space complexity. Statistics based methods allowed for shape comparison without pose-normalization and showed robustness against affine transformations and noise.

• Journal of Korea Multimedia Society
• /
• v.9 no.10
• /
• pp.1257-1265
• /
• 2006

As XML is increasingly used, the need of researches which are related with XML in various fields is also augmented. Many XML document management systems have been actively developed especially for the storage, processing and retrieval of XML documents. The BitCube is a three dimensional bitmap index system that could be manipulated efficiently and improves the performance of document retrieval. However, the site of index is increase rapidly, when a new bit is added to the axis. This problem is caused by its three dimensional memory structure with document, path and word. We suggest a path combining strategy of XML documents in this paper to solve the problem of BitCube that mentioned above. To reduce the size of index, our approach combines sibling nodes that has same ancestor paths, and transforms word axis into value axis. The method reduces the size of index, when the system com poses the three dimensional bitmap index. It also improves the speed of retrieving, and takes efficiency in storage space.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1165-1173
• /
• 2012

One of the most popular technologies in Web2.0 is tagging, and it widely applies to Web content as well as multimedia data such as image and video. Web users have expected that tags by themselves would be reused in information search and maximize the search efficiency, but wrong tag by irresponsible Web users really has brought forth a incorrect search results. In past papers, we have gathered various information resources and tags scattered in Web, mapped one tag onto other tags, and clustered these tags according to the corelation between them. A 3-tag based search algorithm which use the clustered tags of past papers, is proposed in this paper. For performance evaluation of the proposed algorithm, our algorithm is compared with image search result of Flickr, typical tag based site, and is evaluated in accuracy and recall factor.