• Korean Journal of Remote Sensing
• /
• v.20 no.4
• /
• pp.275-288
• /
• 2004

This paper presents a fuzzy relaxation labeling approach incorporated to the fuzzy logic fusion scheme for the classification of multi-sensor remote sensing images. The fuzzy logic fusion and iterative relaxation labeling techniques are adopted to effectively integrate multi-sensor remote sensing images and to incorporate spatial neighboring information into spectral information for contextual classification, respectively. Especially, the iterative relaxation labeling approach can provide additional information that depicts spatial distributions of pixels updated by spatial information. Experimental results for supervised land-cover classification using optical and multi-frequency/polarization images indicate that the use of multi-sensor images and spatial information can improve the classification accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4814-4832
• /
• 2019

Plagiarism detection is increasingly exploiting text alignment. Text alignment involves extracting the plagiarism passages in a pair of the suspicious document and its source document. The heuristics have achieved excellent performance in text alignment. However, the further improvements of the heuristic methods mainly depends more on the experiences of experts, which makes the heuristics lack of the abilities for continuous improvements. To address this problem, machine learning maybe a proper way. Considering the position relations and the context of text segments pairs, we formalize the text alignment task as a problem of sequence labeling, improving the current methods at the model level. Especially, this paper proposes to use the probabilistic graphical model to tag the observed sequence of pairs of text segments. Hence we present the sequence labeling approach for text alignment in plagiarism detection based on Conditional Random Fields. The proposed approach is evaluated on the PAN@CLEF 2012 artificial high obfuscation plagiarism corpus and the simulated paraphrase plagiarism corpus, and compared with the methods achieved the best performance in PAN@CLEF 2012, 2013 and 2014. Experimental results demonstrate that the proposed approach significantly outperforms the state of the art methods.

• International journal of advanced smart convergence
• /
• v.12 no.4
• /
• pp.111-118
• /
• 2023

In the ever-changing landscape of finance, the fusion of artificial intelligence (AI)and pair trading strategies has captured the interest of investors and institutions alike. In the context of supervised machine learning, crafting precise and accurate labels is crucial, as it remains a top priority to empower AI models to surpass traditional pair trading methods. However, prevailing labeling techniques in the financial sector predominantly concentrate on individual assets, posing a challenge in aligning with pair trading strategies. To address this issue, we propose an inventive approach that melds the Triple Barrier Labeling technique with pair trading, optimizing the resultant labels through genetic algorithms. Rigorous backtesting on cryptocurrency datasets illustrates that our proposed labeling method excels over traditional pair trading methods and corresponding buy-and-hold strategies in both profitability and risk control. This pioneering method offers a novel perspective on trading strategies and risk management within the financial domain, laying a robust groundwork for further enhancing the precision and reliability of pair trading strategies utilizing AI models.

• Journal of Digital Convergence
• /
• v.11 no.4
• /
• pp.259-266
• /
• 2013

Binary connected-components labeling, which is widely used in the field of the pattern recognition, has been researched for a long time as one of the basic image processing techniques. Two-scan algorithm has been mainly used in the researches of the connected-components labeling. Recently, for the first scan in the two-scan algorithm, block-based labeling approaches have been used and reported as the fastest methods. In this paper, a new efficient scan mask for connected-components labeling with a block-based labeling approach is proposed. Labeling with the new pixel-based scan mask is more efficient than any other existing method. The results of the experiments show that the proposed method is faster than the existing fastest method.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1817-1824
• /
• 1990

This paper describes a shape matching algorithm for occluded or distorted two-dimensional objects. In our approach, the shape matchin is viewed as a segment matching problem. A shape matching algorithm, based on both the stochastic labeling technique and the hypothesis generate-test paradigm, is proposed, and a simple technique which performs the stochastic labeling process in accordance with the definition of consisten labeling assignment without requiring an iterative updating process of probability valiues is also proposed. Several simulation results show that the proposed algorithm is very effective when occlusion, scaling or change of orientation has occurred in the object.

• Nutrition Research and Practice
• /
• v.1 no.2
• /
• pp.89-93
• /
• 2007

Many countries such as The Republic of Korea have established their own nutritional standards, collectively termed Nutrient Reference Values (NRVs), and they vary due to the science which was reviewed, the purposes for which they are developed, and issues related to nutrition and food policy in the country. The current effort by the Codex Alimentarius Committee on Nutrition and Foods for Special Dietary Uses (CNFSDU) to update the NRVs that were established following the Helsinki Consultation in 1988 represents an opportunity to develop a set of reference values reflecting current scientific information to be used or adapted by many countries. This paper will focus on possible approaches to selecting or developing reference values which would serve the intended purpose for nutrition labeling to the greatest extent possible. Within the United States, the Food and Drug Administration (U.S. FDA) is currently reviewing regulations on nutrition labeling to better address current health issues, and is expected to enter into a process in the next few months to begin to explore how best to update nutrient Daily Values (DVs), most of which are still based on the Recommended Dietary Allowances (RDAs) of the Food and Nutrition Board, U.S. National Academy of Sciences, last reviewed and revised in 1968. In this presentation, I review the current purposes in the U.S. for nutrition labeling as identified in the 1938 Food, Drug, and Cosmetic Act as amended, the scientific basis for current nutrition labeling regulations in the United States, and the recommendations made by the recent Committee on Use of Dietary Reference Intakes in Nutrition Labeling of the Institute of Medicine (2003) regarding how to use the DRIs in developing new DVs to be used on the label in the United States and Canada. Based on these reviews, I then provide examples of the issues that arise in comparing one approach to another. Much of the discussion focuses on the appropriate role of nutrient labeling within the Nutrition Facts panel, one of the three major public nutrition education tools in the United States (along with MyPyramid and Dietary Guidelines for Americans).

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.180-188
• /
• 2009

Recently, the needs for an efficient and secure access control method of dynamic XML data in a ubiquitous data streams environment have become an active research area. In this paper, we proposed an improved role-based prime number labeling scheme for an efficient and secure access control labeling method in dynamic XML data streams. And we point out the limitations of existing access control and labeling schemes for XML data assuming that documents are frequently updated. The improved labeling method where labels are encoded ancestor-descendant and sibling relationships between nodes but need not to be regenerated when the document is updated. Our improved role-based prime number labeling scheme supports an infinite number of updates and guarantees the arbitrary nodes insertion at arbitrary position of the XML tree without label collisions. Also we implemented an efficient access control using a role-based prime number labeling. Finally, we have shown that our approach is an efficient and secure through experiments.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2011

This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.541-550
• /
• 2015

In this paper, we propose a classification-based approach for hybridizing statistical machine translation and rulebased machine translation. Both the training dataset used in the learning of our proposed classifier and our feature extraction method affect the hybridization quality. To create one such training dataset, a previous approach used auto-evaluation metrics to determine from a set of component machine translation (MT) systems which gave the more accurate translation (by a comparative method). Once this had been determined, the most accurate translation was then labelled in such a way so as to indicate the MT system from which it came. In this previous approach, when the metric evaluation scores were low, there existed a high level of uncertainty as to which of the component MT systems was actually producing the better translation. To relax such uncertainty or error in classification, we propose an alternative approach to such labeling; that is, a cut-off method. In our experiments, using the aforementioned cut-off method in our proposed classifier, we managed to achieve a translation accuracy of 81.5% - a 5.0% improvement over existing methods.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.201-209
• /
• 2020

The graph data structure is popular because it can intuitively represent real-world knowledge. Graph databases have attracted attention in academia and industry because they can be used to maintain graph data and allow users to mine knowledge. Mining reachability relationships between two nodes in a graph, termed reachability query processing, is an important functionality of graph databases. Online traversals, such as the breadth-first and depth-first search, are inefficient in processing reachability queries when dealing with large-scale graphs. Labeling schemes have been proposed to overcome these disadvantages. The state-of-the-art is the 2-hop labeling scheme: each node has in and out labels containing reachable node IDs as integers. Unfortunately, existing 2-hop labeling schemes generate huge 2-hop label sizes because they only consider local features, such as degrees. In this paper, we propose a more efficient 2-hop label size reduction approach. We consider the topological sort index, which is a global feature. A linear combination is suggested for utilizing both local and global features. We conduct experiments over real-world and synthetic directed acyclic graph datasets and show that the proposed approach generates smaller labels than existing approaches.