Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Plane extraction of point cloud data plays an important role in the three-dimensional scene reconstruction, while region growing algorithm which could separate the points with specific attributes is a typical method to deal with this kind of problem. In this paper, methods of plane extraction based on region growing algorithm are studied, and they are divided into four categories according to the...
The urgent demand in miRNA research has call for the high performance computational methods for mature miRNA identification to supplement the biological experiment methods. In this study, we analyzed the secondary structure of pre-miRNA and extracted the important features. Then the current computational methods are investigated, and the flow chart of mature miRNAs location prediction methods is summarized...
This paper proposes a novel vehicle color classification method which uses the concept of probabilistic latent semantic analysis (pLSA) to overcome the problem of sparse representation in data classification. Sparse representation is widely used and quite successful in many vision-based applications. However, it needs to calculate the sparse reconstruction cost (SRC) of each sample to find the best...
A fast image stitching algorithm based on improved speeded up robust feature (SURF) is proposed to overcome the real-time performance and robustness of the original SURF based stitching algorithms. The machine learning method is adopted to build a binary classifier, which identify the key feature points extracted by SURF and remove the non-key feature points. In addition, the RELIEF-F algorithm is...
Traditional image retrieval depends on the images embedded in text messages, text description of the limitations of image content, resulting in low quality of image retrieval. The local information extracted image itself, the use of local features LSH image matching algorithm, memory requirements has led to a linear growth. To overcome these shortcomings, then propose the method of image retrieval...
How to extract envelopes accurately is the most important problem in analyzing heart sound signals, especially for abnormal heart sound signals. An effective envelope extraction is a key to the detection of S1 and S1 periods and noise separation, moreover, for estimating the type of heart disease. This paper compares six efficient envelope extraction methods based on abnormal heart sounds, with comparisons...
The cascade correlation algorithm that is CC algorithms, CC network structure and CC network weights learning algorithm are introduced, based on the operation data of Wanjiazhai hydropower station, the network model of energy characteristics is established based on CC algorithm, the relationship curve between head H and output N is gained under some efficiency. The results show that the CC algorithm...
A new search strategy proposed in this paper, which is used in n-dimensional spectral feature space to find reasonable end-members based on maximum volume transform (MVT), is implemented to improve the performance of N-FINDR algorithm. The N-FINDR algorithm, as a successfully used end-member extraction tool, produces inconsistent result in many cases and consumes lots of computing time if it carries...
In this paper, we present a text-clustering algorithm of frequent term set-based clustering (FTSC), which uses frequent term sets for texts clustering. This algorithm can reduce the dimensionality of the text data efficiently, thus it can improve accurate rate and running speed of the clustering algorithm. The results of clustering texts by the FTSC algorithm cannot reflect the overlap of texts' classes...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.