Search (4 results, page 1 of 1)

  • × author_ss:"Xu, S."
  1. Li, Y.; Xu, S.; Luo, X.; Lin, S.: ¬A new algorithm for product image search based on salient edge characterization (2014) 0.00
    0.0036907129 = product of:
      0.011072138 = sum of:
        0.011072138 = product of:
          0.022144277 = sum of:
            0.022144277 = weight(_text_:of in 1552) [ClassicSimilarity], result of:
              0.022144277 = score(doc=1552,freq=28.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.32322758 = fieldWeight in 1552, product of:
                  5.2915025 = tf(freq=28.0), with freq of:
                    28.0 = termFreq=28.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=1552)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Visually assisted product image search has gained increasing popularity because of its capability to greatly improve end users' e-commerce shopping experiences. Different from general-purpose content-based image retrieval (CBIR) applications, the specific goal of product image search is to retrieve and rank relevant products from a large-scale product database to visually assist a user's online shopping experience. In this paper, we explore the problem of product image search through salient edge characterization and analysis, for which we propose a novel image search method coupled with an interactive user region-of-interest indication function. Given a product image, the proposed approach first extracts an edge map, based on which contour curves are further extracted. We then segment the extracted contours into fragments according to the detected contour corners. After that, a set of salient edge elements is extracted from each product image. Based on salient edge elements matching and similarity evaluation, the method derives a new pairwise image similarity estimate. Using the new image similarity, we can then retrieve product images. To evaluate the performance of our algorithm, we conducted 120 sessions of querying experiments on a data set comprised of around 13k product images collected from multiple, real-world e-commerce websites. We compared the performance of the proposed method with that of a bag-of-words method (Philbin, Chum, Isard, Sivic, & Zisserman, 2008) and a Pyramid Histogram of Orientated Gradients (PHOG) method (Bosch, Zisserman, & Munoz, 2007). Experimental results demonstrate that the proposed method improves the performance of example-based product image retrieval.
    Source
    Journal of the Association for Information Science and Technology. 65(2014) no.12, S.2534-2551
  2. Liu, Y.; Xu, S.; Blanchard, E.: ¬A local context-aware LDA model for topic modeling in a document network (2017) 0.00
    0.0034169364 = product of:
      0.010250809 = sum of:
        0.010250809 = product of:
          0.020501617 = sum of:
            0.020501617 = weight(_text_:of in 3642) [ClassicSimilarity], result of:
              0.020501617 = score(doc=3642,freq=24.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.2992506 = fieldWeight in 3642, product of:
                  4.8989797 = tf(freq=24.0), with freq of:
                    24.0 = termFreq=24.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=3642)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    With the rapid development of the Internet and its applications, growing volumes of documents increasingly become interconnected to form large-scale document networks. Accordingly, topic modeling in a network of documents has been attracting continuous research attention. Most of the existing network-based topic models assume that topics in a document are influenced by its directly linked neighbouring documents in a document network and overlook the potential influence from indirectly linked ones. The existing work also has not carefully modeled variations of such influence among neighboring documents. Recognizing these modeling limitations, this paper introduces a novel Local Context-Aware LDA Model (LC-LDA), which is capable of observing a local context comprising a rich collection of documents that may directly or indirectly influence the topic distributions of a target document. The proposed model can also differentiate the respective influence of each document in the local context on the target document according to both structural and temporal relationships between the two documents. The proposed model is extensively evaluated through multiple document clustering and classification tasks conducted over several large-scale document sets. Evaluation results clearly and consistently demonstrate the effectiveness and superiority of the new model with respect to several state-of-the-art peer models.
    Source
    Journal of the Association for Information Science and Technology. 68(2017) no.6, S.1429-1448
  3. Yuan, Q.; Xu, S.; Jian, L.: ¬A new method for retrieving batik shape patterns (2018) 0.00
    0.0034169364 = product of:
      0.010250809 = sum of:
        0.010250809 = product of:
          0.020501617 = sum of:
            0.020501617 = weight(_text_:of in 4186) [ClassicSimilarity], result of:
              0.020501617 = score(doc=4186,freq=24.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.2992506 = fieldWeight in 4186, product of:
                  4.8989797 = tf(freq=24.0), with freq of:
                    24.0 = termFreq=24.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=4186)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    Batik as a traditional art is well regarded due to its high aesthetic quality and cultural heritage values. It is not uncommon to reuse versatile decorative shape patterns across batiks. General-purpose image retrieval methods often fail to pay sufficient attention to such a frequent reuse of shape patterns in the graphical compositions of batiks, leading to suboptimal retrieval results, in particular for identifying batiks that use copyrighted shape patterns without proper authorization for law-enforcement purposes. To address the lack of an optimized image retrieval method suited for batiks, this study proposes a new method for retrieving salient shape patterns in batiks using a rich combination of global and local features. The global features deployed were extracted according to the Zernike moments (ZMs); the local features adopted were extracted through curvelet transformations that characterize shape contours embedded in batiks. The method subsequently incorporated both types of features via matching a weighted bipartite graph to measure the visual similarity between any pair of batik shape patterns through supervised distance metric learning. The derived similarity metric can then be used to detect and retrieve similar shape patterns appearing across batiks, which in turn can be employed as a reliable similarity metric for retrieving batiks. To explore the usefulness of the proposed method, the performance of the new retrieval method is compared against that of three peer methods as well as two variants of the proposed method. The experimental results consistently and convincingly demonstrate that the new method indeed outperforms the state-of-the-art methods in retrieving salient shape patterns in batiks.
    Source
    Journal of the Association for Information Science and Technology. 69(2018) no.4, S.578-599
  4. Xu, S.; Zhai, D.; Wang, F.; An, X.; Pang, H.; Sun, Y.: ¬A novel method for topic linkages between scientific publications and patents (2019) 0.00
    0.0022056228 = product of:
      0.006616868 = sum of:
        0.006616868 = product of:
          0.013233736 = sum of:
            0.013233736 = weight(_text_:of in 5360) [ClassicSimilarity], result of:
              0.013233736 = score(doc=5360,freq=10.0), product of:
                0.06850986 = queryWeight, product of:
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.043811057 = queryNorm
                0.19316542 = fieldWeight in 5360, product of:
                  3.1622777 = tf(freq=10.0), with freq of:
                    10.0 = termFreq=10.0
                  1.5637573 = idf(docFreq=25162, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=5360)
          0.5 = coord(1/2)
      0.33333334 = coord(1/3)
    
    Abstract
    It is increasingly important to build topic linkages between scientific publications and patents for the purpose of understanding the relationships between science and technology. Previous studies on the linkages mainly focus on the analysis of nonpatent references on the front page of patents, or the resulting citation-link networks, but with unsatisfactory performance. In the meanwhile, abundant mentioned entities in the scholarly articles and patents further complicate topic linkages. To deal with this situation, a novel statistical entity-topic model (named the CCorrLDA2 model), armed with the collapsed Gibbs sampling inference algorithm, is proposed to discover the hidden topics respectively from the academic articles and patents. In order to reduce the negative impact on topic similarity calculation, word tokens and entity mentions are grouped by the Brown clustering method. Then a topic linkages construction problem is transformed into the well-known optimal transportation problem after topic similarity is calculated on the basis of symmetrized Kullback-Leibler (KL) divergence. Extensive experimental results indicate that our approach is feasible to build topic linkages with more superior performance than the counterparts.
    Source
    Journal of the Association for Information Science and Technology. 70(2019) no.9, S.1026-1042