Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Yijing Yuan"'
Publikováno v:
Neurocomputing. 290:87-99
Non-negative matrix factorization (NMF) can map high-dimensional data into a low-dimensional data space. Feature selection can eliminate the redundant and irrelevant features from the alternative features. In this paper, we propose a feature selectio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b02e53d073a9bffbde1820873e04040
https://doi.org/10.1016/j.neucom.2018.02.044
https://doi.org/10.1016/j.neucom.2018.02.044
Autor:
Licheng Jiao, Rustam Stolkin, Biao Hou, Amir Masoud Ghalamzan Esfahani, Ronghua Shang, Yijing Yuan
Publikováno v:
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing. 10:5657-5673
Recent high-performance clustering methods process all pixels when segmenting an image, which results in a very large time complexity of these algorithms. Additionally, the performance of such algorithms can be severely affected by noise when dealing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b486cca6fd13606dd8857ed3d7ea7d36
https://doi.org/10.1109/jstars.2017.2743338
https://doi.org/10.1109/jstars.2017.2743338
Detecting changed regions between two given synthetic aperture radar images is very important to monitor change of landscapes, change of ecosystem and so on. This can be formulated as a classification problem and addressed by learning a classifier, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::380ca15957e52f7cbdf7b126e9b1b8cf
https://eprints.lincoln.ac.uk/id/eprint/34757/1/SIGPRO-D-16-01796R2.pdf
https://eprints.lincoln.ac.uk/id/eprint/34757/1/SIGPRO-D-16-01796R2.pdf
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811071782
BIC-TA
BIC-TA
In order to improve the accuracy of synthetic aperture radar (SAR) image change detection, a novel unsupervised non-parametric method for change detection is described. The method treats the prior data and the observed data as two independent events
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ea8a599ad5ae58585044b7560691993
https://doi.org/10.1007/978-981-10-7179-9_42
https://doi.org/10.1007/978-981-10-7179-9_42
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319687582
SEAL
SEAL
The capacitated arc routing problem is a classical NP-hard problem to solve in the field of combinatorial optimization. In recent years, due to its extensive use in our daily life, its importance has gradually emerged. Multi-objective capacitated arc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5a5f88931fb74cc75b419f6118dcfb4
https://doi.org/10.1007/978-3-319-68759-9_23
https://doi.org/10.1007/978-3-319-68759-9_23