Color descriptors are one of the important features used in content-based in, age retrieval. The dominant color descriptor （DCD） represents a few perceptually dominant colors in an image through color quantization. ...Color descriptors are one of the important features used in content-based in, age retrieval. The dominant color descriptor （DCD） represents a few perceptually dominant colors in an image through color quantization. For image retrieval based on DCD, the earth mover＇s distance （EMD） and the optimal color composition distance were proposed to measure the dissimilarity between two images. Although providing good retrieval results, both methods are too time-consuming to be used in a large image database. To solve the problem, we propose a new distance function that calculates an approximate earth mover＇s distance in linear time. To calculate the dissimilarity in linear time, the proposed approach employs the space-filling curve for multidimensional color space. To improve the accuracy, the proposed approach uses multiple curves and adjusts the color positions. As a result, our approach achieves order-of-magnitude time improvement but incurs small errors. We have performed extensive experiments to show the effectiveness and efficiency of the proposed approach. The results reveal that our approach achieves almost the same results with the EMD in linear time.展开更多
In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direc...In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direct the planning process. Control-flow actions and conventional actions are planned/scheduled in an integrated way and can interact with each other. Control-flow actions are then executed by the planning engine itself. The approach is illustrated by examples, e.g., for hierarchical planning, in which tasks that are temporally still far away impose only rough constraints on the current schedule, and control-flow tasks ensure that these tasks are refined as they approach the current time. Using the same mechanism, anytime algorithms can change appropriate search methods or parameters over time, and problems like scheduling critical time-outs for garbage collection can be made part of the planning itself.展开更多
基金supported by the MSIP(Ministry of Science,ICT,and Future Planning),Korea,under the IT-CRSP(IT Convergence Research Support Program)with No.NIPA-2013-H0401-13-1001 supervised by the NIPA(National IT Industry Promotion Agency)the NRF(National Research Foundation)of Korea Grant funded by the Korean Government with No.NRF-2011-330-B00076supported by the Basic Science Research Program through the NRF funded by the Ministry of Education,Science and Technology of Korea under Grant Nos.2012R1A1A2007817 and 2013R1A6A3A03027153
文摘Color descriptors are one of the important features used in content-based in, age retrieval. The dominant color descriptor （DCD） represents a few perceptually dominant colors in an image through color quantization. For image retrieval based on DCD, the earth mover＇s distance （EMD） and the optimal color composition distance were proposed to measure the dissimilarity between two images. Although providing good retrieval results, both methods are too time-consuming to be used in a large image database. To solve the problem, we propose a new distance function that calculates an approximate earth mover＇s distance in linear time. To calculate the dissimilarity in linear time, the proposed approach employs the space-filling curve for multidimensional color space. To improve the accuracy, the proposed approach uses multiple curves and adjusts the color positions. As a result, our approach achieves order-of-magnitude time improvement but incurs small errors. We have performed extensive experiments to show the effectiveness and efficiency of the proposed approach. The results reveal that our approach achieves almost the same results with the EMD in linear time.
文摘In many planning situations, computation itself becomes a resource to be planned and scheduled. We model such computational resources as conventional resources which are used by control-flow actions, e.g., to direct the planning process. Control-flow actions and conventional actions are planned/scheduled in an integrated way and can interact with each other. Control-flow actions are then executed by the planning engine itself. The approach is illustrated by examples, e.g., for hierarchical planning, in which tasks that are temporally still far away impose only rough constraints on the current schedule, and control-flow tasks ensure that these tasks are refined as they approach the current time. Using the same mechanism, anytime algorithms can change appropriate search methods or parameters over time, and problems like scheduling critical time-outs for garbage collection can be made part of the planning itself.
