It is proved that the optimal solution for the matching problem in multi-target tracking can be found from among n different matching. We show in this paper by simulation that the costs of the n different possible sol...
详细信息
ISBN:
(纸本)0780384032
It is proved that the optimal solution for the matching problem in multi-target tracking can be found from among n different matching. We show in this paper by simulation that the costs of the n different possible solutions constitute a bimodal sequence, which suggests an algorithm of O(N logN) complexity, lower than most of known algorithms.
In this paper we present a learning-based approach for the modeling of complex movement sequences. Based on the method of Spatio-Temporal Morphable Models (STMMs) we derive a hierarchical algorithm that, in a first st...
详细信息
Decision trees and extension matrixes are two methodologies for (fuzzy) rule generation. This paper gives an initial study on the comparison between the two methodologies. Their computational complexity and the qualit...
详细信息
ISBN:
(纸本)0780384032
Decision trees and extension matrixes are two methodologies for (fuzzy) rule generation. This paper gives an initial study on the comparison between the two methodologies. Their computational complexity and the quality of rule generation are analyzed. The experimental results have shown that the number of generated rules of the heuristic algorithm based on extension matrix is fewer than the decision tree algorithm. Moreover, regarding the testing accuracy (i.e., the generalization capability for unknown cases), experiments have also shown that the extension matrix method is better than the other method.
Fuzzy extension matrix induction is an extraction technique of fuzzy rules, which can be used in handling ambiguous classification problems related to human's thought and sense. The entire process of building heur...
详细信息
ISBN:
(纸本)0780384032
Fuzzy extension matrix induction is an extraction technique of fuzzy rules, which can be used in handling ambiguous classification problems related to human's thought and sense. The entire process of building heuristic algorithm based on fuzzy extension matrix is dependent of three specified parameters that seriously affect the computational effort and the rule extraction accuracy. Since, the value of three parameters is usually given in terms of human experience or real requirements, it is very difficult to determine its optimal value. This paper makes an initial attempt to give some guidelines of how to automatically choose these parameters by analyzing the relationship between the values of parameters and the number of rules generated.
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distribution over (xi, yi) is specified. In parti...
We propose a convex optimization based strategy to deal with uncertainty in the observations of a classification problem. We assume that instead of a sample (xi, yi) a distribution over (xi, yi) is specified. In particular, we derive a robust formulation when the distribution is given by a normal distribution. It leads to Second Order Cone Programming formulation. Our method is applied to the problem of missing data, where it outperforms direct imputation.
A method is proposed for reducing power consumption in memory ECC checker circuitry that provides SEC-DED. The degrees of freedom in selecting the parity check matrix are used to minimize power with little or no impac...
详细信息
A method is proposed for reducing power consumption in memory ECC checker circuitry that provides SEC-DED. The degrees of freedom in selecting the parity check matrix are used to minimize power with little or no impact on area and delay. The power minimization method is applied to two popular SEC-DED codes: standard Hamming codes and odd-column-weight Hsiao codes. Experiments on actual memory traces of Spec and MediaBench benchmarks indicate that considering power in addition to area and delay when selecting the parity check matrix can result in power reductions of up to 27% for Hsiao codes and up to 41% for Hamming codes.
It is important to study the relationship between pruning algorithms and the selection of parameters in fuzzy decision tree generation for controlling the tree size. This paper selects a pruning algorithm and a method...
详细信息
ISBN:
(纸本)0780384032
It is important to study the relationship between pruning algorithms and the selection of parameters in fuzzy decision tree generation for controlling the tree size. This paper selects a pruning algorithm and a method of fuzzy decision tree generation to experimentally show the relationship for some existing databases. It aims to give some guidelines for how to select an appropriate parametric value in fuzzy decision tree generation. When a suitable parametric value is selected, the pruning for fuzzy decision tree generation seems to be unnecessary.
It is proved that the optimal solution for the matching problem in multi-target tracking can be found from among n different matching. We show in this paper by simulation that the costs of the n different possible sol...
详细信息
ISBN:
(纸本)0780384032
It is proved that the optimal solution for the matching problem in multi-target tracking can be found from among n different matching. We show in this paper by simulation that the costs of the n different possible solutions constitute a bimodal sequence, which suggests an algorithm of O(N logN) complexity, lower than most of known algorithms.
An approach of rough set-based case-based reasoning (CBR) approach is proposed to tackle the task of text categorization (TC). The initial work of integrating both feature and document reduction/selection in TC using ...
详细信息
An approach of rough set-based case-based reasoning (CBR) approach is proposed to tackle the task of text categorization (TC). The initial work of integrating both feature and document reduction/selection in TC using rough sets and CBR properties is presented. Rough set theory is incorporated to reduce the number of feature terms through generating reducts. On the other hand, two concepts of case coverage and case reachability in CBR are used in selecting the representative documents. The main contribution of this paper is that both the number of features and the documents are reduced with minimal loss of useful information. Some experiments are conducted on the text datasets of Reuters21578. The experimental results show that, although the number of feature terms and documents are reduced greatly, the problem-solving quality in terms of classification accuracy is still preserved.
The top unresolved problems in visualization were investigated by panelists from both the information and scientific visualization domains. One of the key unresolved challenges in visualization is collaboration in its...
详细信息
ISBN:
(纸本)0780387880
The top unresolved problems in visualization were investigated by panelists from both the information and scientific visualization domains. One of the key unresolved challenges in visualization is collaboration in its broadest sense. Visualization 'scientists' need to spend more time understanding the underlying science applications in order to create effective visual representations. In order to 'evolve' visualization into a more scientific enquiry, visualization scientists need to understand and use the scientific method such as formulation of an hypothesis to explain the phenomena. Effective human computer interaction continues to be one of the top research and development goals for both visualization and computer graphics.
暂无评论