The Kernel Trick for Content-Based Media Retrieval in Online Social Networks


Guang-Ho Cha, Journal of Information Processing Systems Vol. 17, No. 5, pp. 1020-1033, Oct. 2021  

10.3745/JIPS.02.0167
Keywords: content-based retrieval, Dimensionality Curse, Nearest Neighbor Query, Online Social Network, Kernel method, kernel principal component analysis, similarity search, social network service
Fulltext:

Abstract

Nowadays, online or mobile social network services (SNS) are very popular and widely spread in our society and daily lives to instantly share, disseminate, and search information. In particular, SNS such as YouTube, Flickr, Facebook, and Amazon allow users to upload billions of images or videos and also provide a number of multimedia information to users. Information retrieval in multimedia-rich SNS is very useful but challenging task. Content-based media retrieval (CBMR) is the process of obtaining the relevant image or video objects for a given query from a collection of information sources. However, CBMR suffers from the dimensionality curse due to inherent high dimensionality features of media data. This paper investigates the effectiveness of the kernel trick in CBMR, specifically, the kernel principal component analysis (KPCA) for dimensionality reduction. KPCA is a nonlinear extension of linear principal component analysis (LPCA) to discovering nonlinear embeddings using the kernel trick. The fundamental idea of KPCA is mapping the input data into a highdimensional feature space through a nonlinear kernel function and then computing the principal components on that mapped space. This paper investigates the potential of KPCA in CBMR for feature extraction or dimensionality reduction. Using the Gaussian kernel in our experiments, we compute the principal components of an image dataset in the transformed space and then we use them as new feature dimensions for the image dataset. Moreover, KPCA can be applied to other many domains including CBMR, where LPCA has been used to extract features and where the nonlinear extension would be effective. Our results from extensive experiments demonstrate that the potential of KPCA is very encouraging compared with LPCA in CBMR.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Guang-Ho Cha (2021). The Kernel Trick for Content-Based Media Retrieval in Online Social Networks. Journal of Information Processing Systems, 17(5), 1020-1033. DOI: 10.3745/JIPS.02.0167.

[IEEE Style]
G. Cha, "The Kernel Trick for Content-Based Media Retrieval in Online Social Networks," Journal of Information Processing Systems, vol. 17, no. 5, pp. 1020-1033, 2021. DOI: 10.3745/JIPS.02.0167.

[ACM Style]
Guang-Ho Cha. 2021. The Kernel Trick for Content-Based Media Retrieval in Online Social Networks. Journal of Information Processing Systems, 17, 5, (2021), 1020-1033. DOI: 10.3745/JIPS.02.0167.