1-8hit |
Nenghuan ZHANG Yongbin WANG Xiaoguang WANG Peng YU
Recently, multi-modal fusion methods based on remote sensing data and social sensing data have been widely used in the field of urban region function recognition. However, due to the high complexity of noise problem, most of the existing methods are not robust enough when applied in real-world scenes, which seriously affect their application value in urban planning and management. In addition, how to extract valuable periodic feature from social sensing data still needs to be further study. To this end, we propose a multi-modal fusion network guided by feature co-occurrence for urban region function recognition, which leverages the co-occurrence relationship between multi-modal features to identify abnormal noise feature, so as to guide the fusion network to suppress noise feature and focus on clean feature. Furthermore, we employ a graph convolutional network that incorporates node weighting layer and interactive update layer to effectively extract valuable periodic feature from social sensing data. Lastly, experimental results on public available datasets indicate that our proposed method yeilds promising improvements of both accuracy and robustness over several state-of-the-art methods.
Song GAO Chunheng WANG Baihua XIAO Cunzhao SHI Wen ZHOU Zhong ZHANG
In this paper, we propose a representation method based on local spatial strokes for scene character recognition. High-level semantic information, namely co-occurrence of several strokes is incorporated by learning a sparse dictionary, which can further restrain noise brought by single stroke detectors. The encouraging results outperform state-of-the-art algorithms.
Kitti KOONSANIT Chuleerat JARUSKULCHAI
Nowadays, clustering is a popular tool for exploratory data analysis, with one technique being K-means clustering. Determining the appropriate number of clusters is a significant problem in K-means clustering because the results of the k-means technique depend on different numbers of clusters. Automatic determination of the appropriate number of clusters in a K-means clustering application is often needed in advance as an input parameter to the K-means algorithm. We propose a new method for automatic determination of the appropriate number of clusters using an extended co-occurrence matrix technique called a tri-co-occurrence matrix technique for multispectral imagery in the pre-clustering steps. The proposed method was tested using a dataset from a known number of clusters. The experimental results were compared with ground truth images and evaluated in terms of accuracy, with the numerical result of the tri-co-occurrence providing an accuracy of 84.86%. The results from the tests confirmed the effectiveness of the proposed method in finding the appropriate number of clusters and were compared with the original co-occurrence matrix technique and other algorithms.
Suk Tae SEO In Keun LEE Seo Ho SON Hyong Gun LEE Soon Hak KWON
We propose a simple but effective image segmentation method not based on thresholding but on a merging strategy by evaluating joint probability of gray levels on co-occurrence matrix. The effectiveness of the proposed method is shown through a segmentation experiment.
Hui CAO Koichiro YAMAGUCHI Mitsuhiko OHTA Takashi NAITO Yoshiki NINOMIYA
We propose a novel representation called Feature Interaction Descriptor (FIND) to capture high-level properties of object appearance by computing pairwise interactions of adjacent region-level features. In order to deal with pedestrian detection task, we employ localized oriented gradient histograms as region-level features and measure interactions between adjacent histogram elements with a suitable histogram-similarity function. The experimental results show that our descriptor improves upon HOG significantly and outperforms related high-level features such as GLAC and CoHOG.
Suk Tae SEO Hye Cheun JEONG In Keun LEE Chang Sik SON Soon Hak KWON
An approach to image thresholding based on the plausibility of object and background regions by adopting a co-occurrence matrix and category utility is presented. The effectiveness of the proposed method is shown through the experimental results tested on several images and compared with conventional methods.
Masaki KUREMATSU Takamasa IWADE Naomi NAKAYA Takahira YAMAGUCHI
In this paper, we describe how to exploit a machine-readable dictionary (MRD) and domain-specific text corpus in supporting the construction of domain ontologies that specify taxonomic and non-taxonomic relationships among given domain concepts. In building taxonomic relationships (hierarchical structure) of domain concepts, some hierarchical structure can be extracted from a MRD with marked subtrees that may be modified by a domain expert, using matching result analysis and trimmed result analysis. In building non-taxonomic relationships (specification templates) of domain concepts, we construct concept specification templates that come from pairs of concepts extracted from text corpus, using WordSpace and an association rule algorithm. A domain expert modifies taxonomic and non-taxonomic relationships later. Through case studies with "the Contracts for the International Sales of Goods (CISG)" and "XML Common Business Library (xCBL)", we make sure that our system can work to support the process of constructing domain ontologies with a MRD and text corpus.
Kazuhiko SHIRANITA Kenichiro HAYASHI Akifumi OTSUBO
In this paper, we describe a method of determining meat quality using the concepts of "marbling score" and texture analysis. The marbling score is a measure of the density distribution of fat in the rib-eye region. Based on the results of an investigation carried out by handing out questionnaires to graders, we consider the marbling of meat to be a texture pattern and propose a method for the implementation of a grading system using a texture feature. In this system, we use a gray level co-occurrence matrix as the texture feature, which is a typical second-order statistic of gray levels of a texture image, and determine standard texture-feature vectors for each grade based on it. The grade of an unevaluated image is determined by comparing the texture-feature vector of this unevaluated image with the standard texture-feature vectors. Experimental results show the proposed method to be effective.