• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.2
• /
• pp.21-28
• /
• 2008

This paper proposes a novel reduced-reference assessment method for video quality assessment, in which one-dimensional (1-D) histograms of motion vectors (MVs) are used as features of videos. The proposed method is more efficient than the conventional methods in view of computation time, because the proposed quality metric decodes MVs directly from video stream in the parsing process instead of reconstructing the distorted video at the receiver. Moreover, in view of data size, the propose method is efficient because a sender transmits 1-D histograms of MVs accumulated over whole input video sequences. Here, we use 1-D histograms of MVs accumulated over the whole video sequences, which is different from the conventional methods that assessed each image independently. For testing the similarity between histograms, we use histogram intersection and histogram difference methods. We compare the proposed method with the conventional methods for 52 video clips, which are coded under varying bit rate, image size, and frame rate. Experimental results show that the proposed method is more efficient than the conventional methods and that the proposed method is more similar to the mean opinion score (MOS) than conventional algorithms.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.285-291
• /
• 2001

This paper describes a natural language question answering system that can be used by students in getting as solution to their queries. Unlike AI question answering system that focus on the generation of new answers, the present system retrieves existing ones from question-answer files. Unlike information retrieval approaches that rely on a purely lexical metric of similarity between query and document, it uses a semantic knowledge base (WordNet) to improve its ability to match question. Paper describes the design and the current implementation of the system as an intelligent tutoring system. Main drawback of the existing tutoring systems is that the computer poses a question to the students and guides them in reaching the solution to the problem. In the present approach, a student asks any question related to the topic and gets a suitable reply. Based on his query, he can either get a direct answer to his question or a set of questions (to a maximum of 3 or 4) which bear the greatest resemblance to the user input. We further analyze-application fields for such kind of a system and discuss the scope for future research in this area.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1195-1203
• /
• 2008

Onomatopoeia of korean documents is to represent from natural or artificial sound to human language and it can express onomatopoeia language which is the nearest an object and also able to utilize as standard for clustering of Multimedia data. In this study, We get frequency of onomatopoeia in the experiment subject and select 100 onomatopoeia of use to our study In order to cluster onomatopoeia's relation, we extract feature of similarity and distance metric and then represent onomatopoeia's relation on vector space by using PCA. At the end, we can clustering onomatopoeia by using k-means algorithm.

• Asia pacific journal of information systems
• /
• v.13 no.1
• /
• pp.103-118
• /
• 2003

Software project planning is usually represented by a project activity network that is composed of stages of tasks to be done and precedence restrictions among them. The project network is very complex and its construction requires a vast amount of field knowledge and experience. So this study proposes a case-based reasoning approach that can generate the project network automatically based on the past cases and modification knowledge. For the case indexing, we have adopted 17 factors, each with a few alternative values. A special structure of this problem is that the modification effort can be identified by each factor independently. Thus it is manageable to identify 85 primitive modification actions(add and delete activities) and estimate its modification efforts in advance. A specific case requires a combination of primitive modifications. Based on the modification effort knowledge, we have adopted the Least Modification approach as a metric of similarity between a new project and past cases. Using the Least Modification approach and modification knowledge base, we can automatically generate the project network. To validate the performance of Least Modification approach, we have compared its performance with an ordinary minimal distance approach for 21 test cases. The experiment showed that the Least Modification approach could reduce the modification effort significantly.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.71-76
• /
• 2007

Object detection process which makes decision on the existence of meaningful objects in a given image is a crucial part of image recognition in computer vision system. Hausdorff distance metric has been used in object detection and shows good results in applications such as face recognition. It defines the dissimilarity between two sets of points and is used to find the object that is most similar to the given model. This paper proposes a Hausdorff distance based detection method that uses directional information of points to improve detection accuracy when the sets of points are derived from edge extraction as is in usual cases. In this method, elastic energy needed to make two directional points coincident is used as a measure of similarity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4886-4907
• /
• 2019

The use of mobile devices is increasing in multimedia applications. The multimedia contents are delivered to mobile users over heterogeneous networks. Due to fluctuation in bandwidth and user mobility, the service providers are facing difficulties in providing Quality of Service (QoS) guaranteed delivery for multimedia applications. Multimedia applications depend on QoS parameters such as delay, bandwidth, and jitter to offer better user experience. The existing schemes use the single source and multisource delivery but are unable to balance between stream quality and network congestion for mobile users. We proposed a Quality Oriented Multimedia Content Delivery Scheme (QOMCDS) for the mobile cloud to deliver better quality multimedia contents for the mobile user. The multimedia contents are delivered to the mobile device based on the device's parameters and network environment. The objective video quality assessment models like Peak Signal-to-Noise Ratio (PSNR), Structural Similarity (SSIM), and Video Quality Measurement (VQM) are used to measure the quality of the video. The client side Quality of Experience metric such as Startup delay, Rebuffering events, and Bitrate switch count was used for evaluation. The proposed scheme is evaluated using dash.js and is compared to existing schemes. The results show significant improvement over existing multimedia content delivery schemes.

• Journal of Forest and Environmental Science
• /
• v.29 no.3
• /
• pp.211-218
• /
• 2013

This study was conducted to examine the community structure of ground beetles between coniferous- and deciduous-dominant forest in agricultural landscapes, in Miryang-si, Yeongdong-gun, Icheon-si, and Cheolwon-gun during April to October in 2009. A total of 19 species belonging to 15 genera of 9 subfamilies were identified from 6,253 collected ground beetles. Dominant species from 4 regions were Synuchus nitidus (3,715 individuals, 59.4% of total) and Synuchus cyloderus (1,783 individuals, 28.5%) respectively. Non-metric multidimensional scaling based on Bray-Curtis similarity showed that ground beetle assemblage was not different between forest stands, but it was significantly different among regions. Overall, forest stands of secondary forests may not show a different community structure of ground beetle assemblages in our study. However, monitoring on the ground beetle fauna as well as other arthropods of secondary forests in agricultural landscapes is still important for the management and conservation of biodiversity, because forests provides important habitats for many predatory arthropods, such as ground beetles, spiders and rove beetles.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.663-676
• /
• 2020

Plant leaf classification is a significant application of image processing techniques in modern agriculture. In this paper, a multi-granular angle description method is proposed for plant leaf classification and retrieval. The proposed method can describe leaf information from coarse to fine using multi-granular angle features. In the proposed method, each leaf contour is partitioned first with equal arc length under different granularities. And then three kinds of angle features are derived under each granular partition of leaf contour: angle value, angle histogram, and angular ternary pattern. These multi-granular angle features can capture both local and globe information of the leaf contour, and make a comprehensive description. In leaf matching stage, the simple city block metric is used to compute the dissimilarity of each pair of leaf under different granularities. And the matching scores at different granularities are fused based on quotient space theory to obtain the final leaf similarity measurement. Plant leaf classification and retrieval experiments are conducted on two challenging leaf image databases: Swedish leaf database and Flavia leaf database. The experimental results and the comparison with state-of-the-art methods indicate that proposed method has promising classification and retrieval performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.426-445
• /
• 2012

Conventional rate control (RC) schemes for H.264 video coding usually regulate output bit rate to match channel bandwidth by adjusting quantization parameter (QP) at fixed full frame rate, and the passive frame skipping to avoid buffer overflow usually occurs when scene changes or high motions exist in video sequences especially at low bit rate, which degrades spatial-temporal quality and causes jerky effect. In this paper, an active content adaptive frame skipping scheme is proposed instead of passive methods, which skips subjectively trivial frames by structural similarity (SSIM) measurement between the original frame and the interpolated frame via motion vector (MV) copy scheme. The saved bits from skipped frames are allocated to coded key ones to enhance their spatial quality, and the skipped frames are well recovered based on MV copy scheme from adjacent key ones at the decoder side to maintain constant frame rate. Experimental results show that the proposed active SSIM-based frameskip scheme acquires better and more consistent spatial-temporal quality both in objective (PSNR) and subjective (SSIM) sense with low complexity compared to classic fixed frame rate control method JVT-G012 and prior objective metric based frameskip method.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.