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ę "noise clustering algorithm" wg kryterium: Temat


Wyświetlanie 1-2 z 2
Tytuł:
Wild Image Retrieval with HAAR Features and Hybrid DBSCAN Clustering For 3D Cultural Artefact Landmarks Reconstruction
Autorzy:
Pitchandi, Perumal
Powiązania:
https://bibliotekanauki.pl/articles/2201730.pdf
Data publikacji:
2022
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
outliers removal
culturalartefact objects
3D reconstruction
particle swarm optimization
PSO
spatial clustering
density based spatial clustering
noise clustering algorithm
Opis:
In this digital age large amounts of information, images and videos can be found in the web repositories which accumulate this information. These repositories include personal, historic, cultural, and business event images. Image mining is a limited field in research where most techniques look at processing images instead of mining. Very limited tools are found for mining these images, specifically 3D (Three Dimensional) images. Open source image datasets are not structured making it difficult for query based retrievals. Techniques extracting visual features from these datasets result in low precision values as images lack proper descriptions or numerous samples exist for the same image or images are in 3D. This work proposes an extraction scheme for retrieving cultural artefact based on voxel descriptors. Image anomalies are eliminated with a new clustering technique and the 3D images are used for reconstructing cultural artefact objects. Corresponding cultural 3D images are grouped for a 3D reconstruction engine’s optimized performance. Spatial clustering techniques based on density like PVDBSCAN (Particle Varied Density Based Spatial Clustering of Applications with Noise) eliminate image outliers. Hence, PVDBSCAN is selected in this work for its capability to handle a variety of outliers. Clustering based on Information theory is also used in this work to identify cultural object’s image views which are then reconstructed using 3D motions. The proposed scheme is benchmarked with DBSCAN (Density-Based Spatial Clustering of Applications with Noise) to prove the proposed scheme’s efficiency. Evaluation on a dataset of about 31,000 cultural heritage images being retrieved from internet collections with many outliers indicate the robustness and cost effectiveness of the proposed method towards a reliable and just-in-time 3D reconstruction than existing state-of-the-art techniques.
Źródło:
Advances in Science and Technology. Research Journal; 2022, 16, 3; 269--281
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel fuzzy c-regression model algorithm using a new error measure and particle swarm optimization
Autorzy:
Soltani, M.
Chaari, A.
Ben Hmida, F.
Powiązania:
https://bibliotekanauki.pl/articles/330134.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model rozmyty Takagi-Sugeno
algorytm grupowania
metoda najmniejszych kwadratów
optymalizacja rojem cząstek
Takagi-Sugeno fuzzy models
noise clustering algorithm
fuzzy c-regression model
orthogonal least squares
particle swarm optimization (PSO)
Opis:
This paper presents a new algorithm for fuzzy c-regression model clustering. The proposed methodology is based on adding a second regularization term in the objective function of a Fuzzy C-Regression Model (FCRM) clustering algorithm in order to take into account noisy data. In addition, a new error measure is used in the objective function of the FCRM algorithm, replacing the one used in this type of algorithm. Then, particle swarm optimization is employed to finally tune parameters of the obtained fuzzy model. The orthogonal least squares method is used to identify the unknown parameters of the local linear model. Finally, validation results of two examples are given to demonstrate the effectiveness and practicality of the proposed algorithm.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 617-628
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-2 z 2

    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