High-Accuracy Population-Based Image Search - DZone AI


Established in 2018, the Machine Intelligence Technology Laboratory comprises of a group of outstanding scientists and engineers, with research centers located in Hangzhou, Beijing, Seattle, Silicon Valley, and Singapore. Machine Intelligence Technology Laboratory is Alibaba's core team responsible for the research and development of artificial intelligence technologies. Relying on Alibaba's valuable massive data and machine learning/deep learning technologies, the lab has developed image recognition, speech interaction, natural language understanding, intelligent decision-making, and other core artificial intelligence technologies. It fully empowers Alibaba Group's important businesses such as e-commerce, finance, logistics, social interaction, and entertainment, and also provides outputs to ecosystem partners to jointly build a smart future. Image Search is an intelligent image search product that enables search by image using image recognition and search functions, based on deep learning and large-scale machine learning technologies.

Korean IBM Watson to launch in 2017 ZDNet


IBM will launch a Korean version of its AI platform Watson next year in cooperation with local IT service vendor SK C&C, the companies have announced. SK announced Monday that it signed a cooperation agreement with Big Blue on May 4 and will together build an integrated system to market Watson in South Korea. They will develop Korean data analysis solutions based on machine learning and natural language semantic analysis technology for Watson within this year, and will commercialise it sometime in the first half of 2017, SK said. IBM and SK will also build a "Watson Cloud Platform" at the Korean company's datacentre in Pangyo -- the local version of Silicon Valley -- that IT developers and managers can access to make their own applications. For example, an open market business can apply the Watson solution to its product search features to make a personalized contents recommendation solution.

Multi-Year Vector Dynamic Time Warping Based Crop Mapping

arXiv.org Machine Learning

Abstract: Recent automated crop mapping via supervised le arning - based methods have demonstrated unprecedented improvement over classical techniques. However, m ost crop mapping studies are limited to same - year crop mapping in which the present year's labeled data is used to predict the same year's crop map. Cross - y ear crop mapping is more useful as it allows the prediction of the following years' crop maps using previously labeled data. We propose Vector Dynamic Time Warping ( VD TW), a novel multi - year classification approach based on warping of angular distances between phenological vectors. The results prove that the proposed VDTW method is robust to temporal and spectral v ariations compensating for different farming practices, climate and atmospheric effects, and measurement errors between years. We also describe a method for determining the most discriminative time window that allows high classification accuracies with lim ited data. We carried out test s of our approach with Lan dsat 8 time - series imagery from years 2013 to 2016 for classification of corn and cotton in the Harran Plain, and corn, cotton, and soybean in the Bismil Plain of Southeastern Turkey. In addition, we tested VDTW corn and soybean in Kansas, the US for 2017 and 2018 with the Harmonized Landsat Sentinel data . The VDTW method achieved 99.85% and 99.74% overall accuracies for the same and cross years, respectively with fewer training samples compared to oth er state - of - the - art approaches, i.e. spectral angle mapp er ( SAM), dynamic time warping ( DTW), time - weighted DTW ( TWDTW), random forest (RF), support vector machine ( SVM) and deep long short - term memory ( LSTM) methods. The proposed method could be expanded for other crop types and/or geographical areas. Keywords: Time series; phenology; multi - year classification; dynamic programming; Landsat; crop mapping; land use; corn; cotton; soybean 1. Introduction T he world population is expected to exceed nine billion in 2050 [1] . Providing adequate nutrition for the increasing human population is a significant concern. Advanced agri cultural technologies, such as precision agriculture and precision irrigation are rapidly emerging to optimize water, fertilizers, and pesticides; thereby enabling higher crop yield. Accurate crop maps are the first requirements of advanced agriculture app lications such as yield forecasting . Early - season crop yield estimates are a crucial factor for food security and monitor ing agricultural subventio ns. Crop maps are also an essential tool for statistical purposes to analyze annual changes in agricultural p roduction. However, there are a variety of field crops with similar phenologies and spectral signatures.

Modelling High-Dimensional Sequences with LSTM-RTRBM: Application to Polyphonic Music Generation

AAAI Conferences

We propose an automatic music generation demo based on artificial neural networks, which integrates the ability of Long Short-Term Memory (LSTM) in memorizing and retrieving useful history information, together with the advantage of Restricted Boltzmann Machine (RBM) in high dimensional data modelling. Our model can generalize to different musical styles and generate polyphonic music better than previous models.

Towards reduction of autocorrelation in HMC by machine learning

arXiv.org Machine Learning

In this paper we propose new algorithm to reduce autocorrelation in Markov chain Monte-Carlo algorithms for euclidean field theories on the lattice. Our proposing algorithm is the Hybrid Monte-Carlo algorithm (HMC) with restricted Boltzmann machine. We examine the validity of the algorithm by employing the phi-fourth theory in three dimension. We observe reduction of the autocorrelation both in symmetric and broken phase as well. Our proposing algorithm provides consistent central values of expectation values of the action density and one-point Green's function with ones from the original HMC in both the symmetric phase and broken phase within the statistical error. On the other hand, two-point Green's functions have slight difference between one calculated by the HMC and one by our proposing algorithm in the symmetric phase. Furthermore, near the criticality, the distribution of the one-point Green's function differs from the one from HMC. We discuss the origin of discrepancies and its improvement.