Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "pattern" wg kryterium: Temat


Tytuł:
Classification, Association and Pattern Completion Using Neural Similarity Based Methods
Autorzy:
Duch, W.
Adamczak, R.
Diercksen, G. H. F.
Powiązania:
https://bibliotekanauki.pl/articles/911147.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć neuronowa
klasyfikacja
rozpoznawanie obrazów
neural networks
classification
association
pattern recognition
Opis:
A framework for Similarity-Based Methods (SBMs) includes many classification models as special cases: neural networks of the Radial Basis Function type, Feature Space Mapping neurofuzzy networks based on separable transfer functions, Learning Vector Quantization, variants of the k nearest neighbor methods and several new models that may be presented in a network form. Multilayer Perceptrons (MLPs) use scalar products to compute a weighted activation of neurons, combining soft hyperplanes to provide decision borders. Distance-based multilayer perceptrons (D-MLPs) evaluate the similarity of inputs to weights offering a natural generalization of standard MLPs. A cluster- based initialization procedure determining the architecture and values of all adaptive parameters is described. Networks implementing SBM methods are useful not only for classification and approximation, but also as associative memories, in problems requiring pattern completion, offering an efficient way to deal with missing values. Non-Euclidean distance functions may also be introduced by normalization of the input vectors in an extended feature space. Both the approaches dramatically influence the shapes of decision borders. An illustrative example showing these changes is provided.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 4; 747-766
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Closest paths in graph drawings under an elastic metric
Autorzy:
Baran, M.
Powiązania:
https://bibliotekanauki.pl/articles/330666.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic shape analysis
pattern recognition
superpixel segmentation
analiza kształtu
rozpoznawanie wzorca
segmentacja obrazu
superpiksel
Opis:
This work extends the dynamic programming approach to calculation of an elastic metric between two curves to finding paths in pairs of graph drawings that are closest under this metric. The new algorithm effectively solves this problem when all paths between two given nodes in one of these graphs have the same length. It is then applied to the problem of pattern recognition constrained by a superpixel segmentation. Segmentations of test images, obtained without statistical modeling given two shape endpoints, have good accuracy.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 387-397
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bivariate Hahn moments for image reconstruction
Autorzy:
Wu, H.
Yan, S.
Powiązania:
https://bibliotekanauki.pl/articles/331058.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
bivariate Hahn moments
bivariate Hahn polynomials
image reconstruction
pattern recognition
odtworzenie obrazu
rozpoznawanie obrazu
Opis:
This paper presents a new set of bivariate discrete orthogonal moments which are based on bivariate Hahn polynomials with non-separable basis. The polynomials are scaled to ensure numerical stability. Their computational aspects are discussed in detail. The principle of parameter selection is established by analyzing several plots of polynomials with different kinds of parameters. Appropriate parameters of binary images and a grayscale image are obtained through experimental results. The performance of the proposed moments in describing images is investigated through several image reconstruction experiments, including noisy and noise-free conditions. Comparisons with existing discrete orthogonal moments are also presented. The experimental results show that the proposed moments outperform slightly separable Hahn moments for higher orders.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 417-428
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Correlation-based feature selection strategy in classification problems
Autorzy:
Michalak, K.
Kwaśnicka, H.
Powiązania:
https://bibliotekanauki.pl/articles/908379.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
selekcja cech
współzależność cech
klasyfikacja
feature selection
pairwise feature evaluation
feature correlation
pattern classification
Opis:
In classification problems, the issue of high dimensionality, of data is often considered important. To lower data dimensionality, feature selection methods are often employed. To select a set of features that will span a representation space that is as good as possible for the classification task, one must take into consideration possible interdependencies between the features. As a trade-off between the complexity of the selection process and the quality of the selected feature set, a pairwise selection strategy has been recently suggested. In this paper, a modified pairwise selection strategy is proposed. Our research suggests that computation time can be significantly lowered while maintaining the quality of the selected feature sets by using mixed univariate and bivariate feature evaluation based on the correlation between the features. This paper presents the comparison of the performance of our method with that of the unmodified pairwise selection strategy based on several well-known benchmark sets. Experimental results show that, in most cases, it is possible to lower computation time and that with high statistical significance the quality of the selected feature sets is not lower compared with those selected using the unmodified pairwise selection process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2006, 16, 4; 503-511
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
One-Dimensional Kohonens Lvq Nets for Multidimensional Patterns Recognition
Autorzy:
Skubalska-Rafajłowicz, E.
Powiązania:
https://bibliotekanauki.pl/articles/911149.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
krzywa przestrzenna
rozpoznawanie obrazów
space-filling curve
pattern recognition
learning vector quantization
reduction of dimension
Opis:
A new neural network based pattern recognition algorithm is proposed. The method consists in preprocessing the multidimensional data, using a space-filling curve based transformation into the unit interval, and employing Kohonen's vector quantization algorithms (of SOM and LVQ types) in one dimension. The space-filling based transformation preserves the theoretical Bayes risk. Experiments show that such an approach can produce good or even better error rates than the classical LVQ performed in a multidimensional space.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 4; 767-778
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of multibackground memory testing techniques
Autorzy:
Mrozek, I.
Powiązania:
https://bibliotekanauki.pl/articles/907769.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
testowanie RAM
błąd wzoru
test krokowy
RAM testing
pattern sensitive faults
march tests
multibackground testing
Opis:
March tests are widely used in the process of RAM testing. This family of tests is very efficient in the case of simple faults such as stuck-at or transition faults. In the case of a complex fault model-such as pattern sensitive faults-their efficiency is not sufficient. Therefore we have to use other techniques to increase fault coverage for complex faults. Multibackground memory testing is one of such techniques. In this case a selected March test is run many times. Each time it is run with new initial conditions. One of the conditions which we can change is the initial memory background. In this paper we compare the efficiency of multibackground tests based on four different algorithms of background generation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 191-205
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Experimental Tests of the Vector II Slab in Field Conditions, Slab and Strip Model
Autorzy:
Zając, Jakub
Drobiec, Łukasz
Jasiński, Radosław
Wieczorek, Mirosław
Kisiołek, Artur
Powiązania:
https://bibliotekanauki.pl/articles/1838083.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
crack pattern
flexural analysis
interface
precast
slab
short-term load
pęknięcia
zginanie
prefabrykaty
płyty
obciążenie krótkotrwałe
Opis:
Vector II slab was tested on a natural scale (a slab with a dimension of 6.30 × 6.30 m) and a strip 6.30 m long and 1.20 m wide. The Vector II slab is built by precast panel 60 cm wide, 4 cm thick and 14-20 cm thick concrete overtopping on the construction site. The main purpose of the slab tests on a natural scale was to observe the "faulting" effect and temporary deflections. During the tests, the displacements in the area of the panel joints in the middle of the slab span were recorded. The maximum difference in displacement between adjacent panels of the slab model was 0.16 mm, and the vertical displacement was 1.9 mm. The strip model had no cracks that could indicate a interface cracks between the precast element and the concrete overlay. After completion of the field tests, the load was left on the slab model to verify long-term effects.
Źródło:
Civil and Environmental Engineering Reports; 2021, 31, 1; 54-69
2080-5187
2450-8594
Pojawia się w:
Civil and Environmental Engineering Reports
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Experimental Tests of the Vector II Slab in Field Conditions, Slab and Strip Model
Autorzy:
Zając, Jakub
Drobiec, Łukasz
Jasiński, Radosław
Wieczorek, Mirosław
Kisiołek, Artur
Powiązania:
https://bibliotekanauki.pl/articles/1838085.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
crack pattern
flexural analysis
interface
precast
slab
short-term load
pęknięcia
zginanie
prefabrykaty
płyty
obciążenie krótkotrwałe
Opis:
Vector II slab was tested on a natural scale (a slab with a dimension of 6.30 × 6.30 m) and a strip 6.30 m long and 1.20 m wide. The Vector II slab is built by precast panel 60 cm wide, 4 cm thick and 14-20 cm thick concrete overtopping on the construction site. The main purpose of the slab tests on a natural scale was to observe the "faulting" effect and temporary deflections. During the tests, the displacements in the area of the panel joints in the middle of the slab span were recorded. The maximum difference in displacement between adjacent panels of the slab model was 0.16 mm, and the vertical displacement was 1.9 mm. The strip model had no cracks that could indicate a interface cracks between the precast element and the concrete overlay. After completion of the field tests, the load was left on the slab model to verify long-term effects.
Źródło:
Civil and Environmental Engineering Reports; 2021, 31, 1; 54-69
2080-5187
2450-8594
Pojawia się w:
Civil and Environmental Engineering Reports
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Procedural generation of aesthetic patterns from dynamics and iteration processes
Autorzy:
Gdawiec, K.
Powiązania:
https://bibliotekanauki.pl/articles/329905.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
dynamical system
dynamics process
iteration process
aesthetic pattern
układ dynamiczny
proces dynamiczny
proces iteracji
wzorzec estetyczny
Opis:
Aesthetic patterns are widely used nowadays, e.g., in jewellery design, carpet design, as textures and patterns on wallpapers, etc. Most of the work during the design stage is carried out by a designer manually. Therefore, it is highly useful to develop methods for aesthetic pattern generation. In this paper, we present methods for generating aesthetic patterns using the dynamics of a discrete dynamical system. The presented methods are based on the use of various iteration processes from fixed point theory (Mann, S, Noor, etc.) and the application of an affine combination of these iterations. Moreover, we propose new convergence tests that enrich the obtained patterns. The proposed methods generate patterns in a procedural way and can be easily implemented on the GPU. The presented examples show that using the proposed methods we are able to obtain a variety of interesting patterns. Moreover, the numerical examples show that the use of the GPU implementation with shaders allows the generation of patterns in real time and the speed-up (compared with a CPU implementation) ranges from about 1000 to 2500 times.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 827-837
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nuclei segmentation for computer-aided diagnosis of breast cancer
Autorzy:
Kowal, M.
Filipczuk, P.
Powiązania:
https://bibliotekanauki.pl/articles/330248.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
computer aided diagnosis
breast cancer
pattern analysis
fast marching
diagnostyka wspomagana komputerowo
rak piersi
analiza obrazu
Opis:
Breast cancer is the most common cancer among women. The effectiveness of treatment depends on early detection of the disease. Computer-aided diagnosis plays an increasingly important role in this field. Particularly, digital pathology has recently become of interest to a growing number of scientists. This work reports on advances in computer-aided breast cancer diagnosis based on the analysis of cytological images of fine needle biopsies. The task at hand is to classify those as either benign or malignant. We propose a robust segmentation procedure giving satisfactory nuclei separation even when they are densely clustered in the image. Firstly, we determine centers of the nuclei using conditional erosion. The erosion is performed on a binary mask obtained with the use of adaptive thresholding in grayscale and clustering in a color space. Then, we use the multi-label fast marching algorithm initialized with the centers to obtain the final segmentation. A set of 84 features extracted from the nuclei is used in the classification by three different classifiers. The approach was tested on 450 microscopic images of fine needle biopsies obtained from patients of the Regional Hospital in Zielona Góra, Poland. The classification accuracy presented in this paper reaches 100%, which shows that a medical decision support system based on our method would provide accurate diagnostic information.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 19-31
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recognition of species and genera of bacteria by means of the product of weights of the classifiers
Autorzy:
Plichta, Anna
Powiązania:
https://bibliotekanauki.pl/articles/329978.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
pattern recognition
bacterial cells
product of weights of the classifiers
rozpoznanie obrazowe
komórki bakteryjne
iloczyn masy klasyfikatorów
Opis:
In microbiology, computer methods are applied in the analysis and recognition of laboratory-acquired microscopic images concerning, for example, bacterial cells or other microorganisms. Proper recognition of the species and genera of bacteria is a key stage in the microbiological diagnostics process, because it allows a quick start of the appropriate therapy. The original method proposed in the paper concerns the automatic recognition of selected species and genera of bacteria presented in digital images. The classification was made on the basis of the analysis of the physical characteristics of bacterial cells using the product of classifier confidence weights. The end result of the classification process is the classification list, sorted in descending order according to the weights of the classifiers. In addition to the correct classification, a list of other possible results of the analysis is obtained. The method thus allows not only the classification, but also an analysis of the confidence level of the selection made. The proposed method can be used to recognize not only bacterial cells, but also other microorganisms, for example, fungi that exhibit similar morphological characteristics. In addition, the use of the method does not require the application of specialized computer equipment, which widens the scope of applications regardless of the laboratory IT infrastructure, not only in microbiological diagnostics, but also in other diagnostic laboratories.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 463-473
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Statistical testing of segment homogeneity in classification of piecewise-regular objects
Autorzy:
Savchenko, A. V.
Belova, N. S.
Powiązania:
https://bibliotekanauki.pl/articles/330652.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
statistical pattern recognition
testing of segment homogeneity
probabilistic neural network
rozpoznawanie obrazu
jednorodność segmentu
probabilistyczna sieć neuronowa
Opis:
The paper is focused on the problem of multi-class classification of composite (piecewise-regular) objects (e.g., speech signals, complex images, etc.). We propose a mathematical model of composite object representation as a sequence of independent segments. Each segment is represented as a random sample of independent identically distributed feature vectors. Based on this model and a statistical approach, we reduce the task to a problem of composite hypothesis testing of segment homogeneity. Several nearest-neighbor criteria are implemented, and for some of them the well-known special cases (e.g., the Kullback–Leibler minimum information discrimination principle, the probabilistic neural network) are highlighted. It is experimentally shown that the proposed approach improves the accuracy when compared with contemporary classifiers.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 915-925
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modeling of distributed objects computing pattern combinations using a formal specification language
Autorzy:
Taibi, T.
Ngo, D. C. L.
Powiązania:
https://bibliotekanauki.pl/articles/908185.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
Balanced Pattern Specification Language (BPSL)
First-Order Logic (FOL)
Temporal Logic of Actions (TLA)
substitution
addition
elimination
Opis:
Design patterns help us to respond to the challenges faced while developing Distributed Object Computing (DOC) applications by shifting developers' focus to high-level design concerns, rather than platform specific details. However, due to the inherent ambiguity of the existing textual and graphical descriptions of the design patterns, users are faced with difficulties in understanding when and how to use them. Since design patterns are seldom used in isolation but are usually combined to solve complex problems, the above-mentioned difficulties have even worsened. The formal specification of design patterns and their combination is not meant to replace the existing means of describing patterns, but to complement them in order to achieve accuracy and to allow rigorous reasoning about them. The main problem of the existing formal specification languages for design patterns is the lack of completeness. This is mainly because they tend to focus on specifying either the structural or behavioral aspects of design patterns but not both of them. Moreover, none of them even ventured in specifying DOC patterns and pattern combinations. We propose a simple yet Balanced Pattern Specification Language (BPSL) aimed to achieve equilibrium by specifying both the aspects of design patterns. The language combines two subsets of logic: one from the First-Order Logic (FOL) and the other from the Temporal Logic of Actions (TLA).
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 2; 239-253
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A connectionist computational method for face recognition
Autorzy:
Pujol, F. A.
Mora, H.
Girona-Selva, J. A.
Powiązania:
https://bibliotekanauki.pl/articles/330558.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
pattern recognition
face recognition
neural network
self organizing map
rozpoznawanie wzorca
rozpoznawanie twarzy
sieć neuronowa
samodzielne organizowanie map
Opis:
In this work, a modified version of the elastic bunch graph matching (EBGM) algorithm for face recognition is introduced. First, faces are detected by using a fuzzy skin detector based on the RGB color space. Then, the fiducial points for the facial graph are extracted automatically by adjusting a grid of points to the result of an edge detector. After that, the position of the nodes, their relation with their neighbors and their Gabor jets are calculated in order to obtain the feature vector defining each face. A self-organizing map (SOM) framework is shown afterwards. Thus, the calculation of the winning neuron and the recognition process are performed by using a similarity function that takes into account both the geometric and texture information of the facial graph. The set of experiments carried out for our SOM-EBGM method shows the accuracy of our proposal when compared with other state-of the-art methods.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 451-465
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Classification in the Gabor time-frequency domain of non-stationary signals embedded in heavy noise with unknown statistical distribution
Autorzy:
Świercz, E.
Powiązania:
https://bibliotekanauki.pl/articles/907771.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sygnał niestacjonarny
klasyfikacja sygnału
rozpoznawanie obrazów
transformator czas-częstotliwość
non-stationary signals
signal classification
pattern recognition
time-frequency transforms
Opis:
A new supervised classification algorithm of a heavily distorted pattern (shape) obtained from noisy observations of nonstationary signals is proposed in the paper. Based on the Gabor transform of 1-D non-stationary signals, 2-D shapes of signals are formulated and the classification formula is developed using the pattern matching idea, which is the simplest case of a pattern recognition task. In the pattern matching problem, where a set of known patterns creates predefined classes, classification relies on assigning the examined pattern to one of the classes. Classical formulation of a Bayes decision rule requires a priori knowledge about statistical features characterising each class, which are rarely known in practice. In the proposed algorithm, the necessity of the statistical approach is avoided, especially since the probability distribution of noise is unknown. In the algorithm, the concept of discriminant functions, represented by Frobenius inner products, is used. The classification rule relies on the choice of the class corresponding to the max discriminant function. Computer simulation results are given to demonstrate the effectiveness of the new classification algorithm. It is shown that the proposed approach is able to correctly classify signals which are embedded in noise with a very low SNR ratio. One of the goals here is to develop a pattern recognition algorithm as the best possible way to automatically make decisions. All simulations have been performed in Matlab. The proposed algorithm can be applied to non-stationary frequency modulated signal classification and non-stationary signal recognition.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 135-147
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies