the proceedings contain 59 papers. the topics discussed include: optical coherence tomography: optical biospy and functional imaging;intelligent patternrecognition and applications to biometrics in an interactive env...
ISBN:
(纸本)9789898111678
the proceedings contain 59 papers. the topics discussed include: optical coherence tomography: optical biospy and functional imaging;intelligent patternrecognition and applications to biometrics in an interactive environment;digital photography for computer graphics and its applications;redefining content creation for video games and films;fast spatially controllable 2D/3D texture synthesis and morphing for multiple input textures;facial normal map capture using four lights - an effective and inexpensive method of capturing the fine scale detail of human faces using four point lights;automatic trimap extraction for efficient alpha matting based on gradient field transforms;comparing GGNG3D and quadric error metrics methods to simplify 3D meshes;and implementation of 24-ARY grid representation for rectangular solid dissections.
Fuzzy pattern matching technique repre- sents a group of fuzzy methods for super- vised fuzzy patternrecognition. these methods build a prototype for each fea- ture and combine the partial estimations of each prototy...
详细信息
ISBN:
(纸本)8476538723
Fuzzy pattern matching technique repre- sents a group of fuzzy methods for super- vised fuzzy patternrecognition. these methods build a prototype for each fea- ture and combine the partial estimations of each prototype by a fusion operator. One of the major problems of this tech- nique is that it is not able to model the dependencies between features, and nowadays there is no heuristic in the lit- erature that solves this problem. In this paper we propose a solution to this prob- lem. In order to keep the good properties of fuzzy pattern matching, this heuristic will have the objective of minimizing the dependencies between features modelled. To show the accuracy of the proposed so- lution, we have tested the method on sev- eral data sets. In this paper, we present the results obtained in a simulated data set and a real data set.
the paper considers the problem of predicting the quality of metallurgical production in a general formulation, when a huge amount of historical data of technological processes and product quality can be partitioned i...
详细信息
the paper considers the problem of predicting the quality of metallurgical production in a general formulation, when a huge amount of historical data of technological processes and product quality can be partitioned into a set of discrete classes of efficiency. Assuming that in the production process the technological process route can be changed, the problem of choosing the optimal route becomes important. When constructing the decision tree that recognizes the class of efficiency of the technological process, a special criterion for optimality of the partitioning of the set of classes of efficiency into two classes is introduced corresponding to the left and right branches of the decision tree in the node under consideration. the partitioning obtained by the proposed approach is close to optimal and can form the basis for constructing a decision tree, withthe help of which a route is chosen to continue processing.
Annealing by Increasing Resampling (AIR, for short) is a stochastic hill-climbing optimization algorithm that evaluates the objective function for resamplings with increasing size. At the beginning stages, AIR makes s...
详细信息
ISBN:
(纸本)9783030400149;9783030400132
Annealing by Increasing Resampling (AIR, for short) is a stochastic hill-climbing optimization algorithm that evaluates the objective function for resamplings with increasing size. At the beginning stages, AIR makes state transitions like a random walk, because it uses small resamplings for which evaluation has large error at high probability. At the ending stages, AIR behaves like a local search because it uses large resamplings very close to the entire sample. thus AIR works similarly as the conventional Simulated Annealing (SA, for short). As a rationale for AIR approximating SA, we show that both AIR and SA can be regarded as a hill-climbing algorithm according to objective function evaluation with stochastic fluctuations. the fluctuation in AIR is explained by the probit, while in SA by the logit. We show experimentally that the logit can be replaced withthe probit in MCMC, which is a basis of SA. We also show experimental comparison of SA and AIR for two optimization problems, sparse pivot selection for dimension reduction, and annealing-based clustering. Strictly speaking, AIR must use resampling independently performed at each transition trial. However, it has been demonstrated by experiments that reuse of resampling within a certain number of times can speed up optimization without losing the quality of optimization. In particular, the larger the samples used for evaluation, the more remarkable the superiority of AIR is in terms of speed with respect to SA.
this part of the paper describes a base level modular interactive software system MISS developed to facilitate implementation of research oriented modular software systems. Also described is a powerful high level lang...
详细信息
LBP is renowned as most powerful texture descriptor. But major issue which LBP possesses is the noisy thresholding function. this sacrifices the discriminativity of the descriptor. To complement that three LBP variant...
详细信息
Feature plays a very important role in the area of image processing. Before getting features, various image preprocessing techniques like binarization, thresholding, resizing, normalization etc. are applied on the sam...
详细信息
ISBN:
(纸本)9781479949106
Feature plays a very important role in the area of image processing. Before getting features, various image preprocessing techniques like binarization, thresholding, resizing, normalization etc. are applied on the sampled image. After that, feature extraction techniques are applied to get features that will be useful in classifying and recognition of images. Feature extraction techniques are helpful in various image processing applications e.g. character recognition. As features define the behavior of an image, they show its place in terms of storage taken, efficiency in classification and obviously in time consumption also. Here in this paper, we are going to discuss various types of features, feature extraction techniques and explaining in what scenario, which features extraction technique, will be better. Hereby in this paper, we are going to refer features and feature extraction methods in case of character recognition application.
the interpretability of multivariate time series anomaly detection is crucial for understanding the reasons behind anomalies, enhancing the usability and credibility of models, and ensuring successful real-world appli...
详细信息
Recent studies have demonstrated the power of neural networks for different fields of artificial intelligence. In most fields, such as machine translation or speech recognition, neural networks outperform previously u...
详细信息
the paper will introduce into the subject of recognition of typical patterns in road networks. Especially we will describe the search for ring structures and its implementation in detail. applications to detect these ...
详细信息
ISBN:
(纸本)3540445269
the paper will introduce into the subject of recognition of typical patterns in road networks. Especially we will describe the search for ring structures and its implementation in detail. applications to detect these patterns and to use them for eliciting additional implicit knowledge in vector data are shown. We will familiarise the reader with different methods and approaches for the automatic detection of those patterns in vector data. the retrieval of implicit information in vector data can be very helpful for many tasks, ranging from generalisation of maps to the spatial analysis and enrichment of GIS data to make it searchable by search engines.
暂无评论