The search session has expired. Please query the service again.

Displaying 641 – 660 of 1507

Showing per page

Integrated region-based segmentation using color components and texture features with prior shape knowledge

Mehryar Emambakhsh, Hossein Ebrahimnezhad, Mohammad Hossein Sedaaghi (2010)

International Journal of Applied Mathematics and Computer Science

Segmentation is the art of partitioning an image into different regions where each one has some degree of uniformity in its feature space. A number of methods have been proposed and blind segmentation is one of them. It uses intrinsic image features, such as pixel intensity, color components and texture. However, some virtues, like poor contrast, noise and occlusion, can weaken the procedure. To overcome them, prior knowledge of the object of interest has to be incorporated in a top-down procedure...

Interpretability of linguistic variables: a formal account

Ulrich Bodenhofer, Peter Bauer (2005)

Kybernetika

This contribution is concerned with the interpretability of fuzzy rule-based systems. While this property is widely considered to be a crucial one in fuzzy rule-based modeling, a more detailed formal investigation of what “interpretability” actually means is not available. So far, interpretability has most often been associated with rather heuristic assumptions about shape and mutual overlapping of fuzzy membership functions. In this paper, we attempt to approach this problem from a more general...

Invariance groups of finite functions and orbit equivalence of permutation groups

Eszter K. Horváth, Géza Makay, Reinhard Pöschel, Tamás Waldhauser (2015)

Open Mathematics

Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...

Inverse problem for networks of laser interferometers

Piotr Jaranowski (1997)

Banach Center Publications

Estimation of the parameters of the gravitational-wave signal from a coalescing binary by a network of laser interferometers is considered. A generalization of the solution of the inverse problem found previously for the network of 3 detectors to the network of N detectors is given. Maximum likelihood and least squares estimators are applied to obtain the solution. Accuracy of the estimation of the parameters is assessed from the inverse of the Fisher information matrix. The results of the Monte...

Inversion of square matrices in processors with limited calculation abillities

Krzysztof Janiszowski (2003)

International Journal of Applied Mathematics and Computer Science

An iterative inversion algorithm for a class of square matrices is derived and tested. The inverted matrix can be defined over both real and complex fields. This algorithm is based only on the operations of addition and multiplication. The numerics of the algorithm can cope with a short number representation and therefore can be very useful in the case of processors with limited possibilities, like different neuro-computers and accelerator cards. The quality of inversion can be traced and tested....

Isosceles sets.

Ionin, Yury J. (2009)

The Electronic Journal of Combinatorics [electronic only]

Currently displaying 641 – 660 of 1507