On the selection of anchors and targets for video hyperlinking

A problem not well understood in video hyperlinking is what qualifies a fragment as an anchor or target. Ideally, anchors provide good starting points for navigation, and targets supplement anchors with additional details while not distracting users with irrelevant, false and redundant information....

Full description

Saved in:
Bibliographic Details
Main Authors: CHENG, Zhi-Qi, ZHANG, Hao, WU, Xiao, NGO, Chong-wah
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2017
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/6486
https://ink.library.smu.edu.sg/context/sis_research/article/7489/viewcontent/3078971.3079025.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-7489
record_format dspace
spelling sg-smu-ink.sis_research-74892022-01-10T05:13:30Z On the selection of anchors and targets for video hyperlinking CHENG, Zhi-Qi ZHANG, Hao WU, Xiao NGO, Chong-wah A problem not well understood in video hyperlinking is what qualifies a fragment as an anchor or target. Ideally, anchors provide good starting points for navigation, and targets supplement anchors with additional details while not distracting users with irrelevant, false and redundant information. The problem is not trivial for intertwining relationship between data characteristics and user expectation. Imagine that in a large dataset, there are clusters of fragments spreading over the feature space. The nature of each cluster can be described by its size (implying popularity) and structure (implying complexity). A principle way of hyperlinking can be carried out by picking centers of clusters as anchors and from there reach out to targets within or outside of clusters with consideration of neighborhood complexity. The question is which fragments should be selected either as anchors or targets, in one way to reflect the rich content of a dataset, and meanwhile to minimize the risk of frustrating user experience. This paper provides some insights to this question from the perspective of hubness and local intrinsic dimensionality, which are two statistical properties in assessing the popularity and complexity of data space. Based these properties, two novel algorithms are proposed for low-risk automatic selection of anchors and targets. 2017-06-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/6486 info:doi/10.1145/3078971.3079025 https://ink.library.smu.edu.sg/context/sis_research/article/7489/viewcontent/3078971.3079025.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Hubness Local intrinsic dimensions Video hyperlinking Computer Sciences Graphics and Human Computer Interfaces
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Hubness
Local intrinsic dimensions
Video hyperlinking
Computer Sciences
Graphics and Human Computer Interfaces
spellingShingle Hubness
Local intrinsic dimensions
Video hyperlinking
Computer Sciences
Graphics and Human Computer Interfaces
CHENG, Zhi-Qi
ZHANG, Hao
WU, Xiao
NGO, Chong-wah
On the selection of anchors and targets for video hyperlinking
description A problem not well understood in video hyperlinking is what qualifies a fragment as an anchor or target. Ideally, anchors provide good starting points for navigation, and targets supplement anchors with additional details while not distracting users with irrelevant, false and redundant information. The problem is not trivial for intertwining relationship between data characteristics and user expectation. Imagine that in a large dataset, there are clusters of fragments spreading over the feature space. The nature of each cluster can be described by its size (implying popularity) and structure (implying complexity). A principle way of hyperlinking can be carried out by picking centers of clusters as anchors and from there reach out to targets within or outside of clusters with consideration of neighborhood complexity. The question is which fragments should be selected either as anchors or targets, in one way to reflect the rich content of a dataset, and meanwhile to minimize the risk of frustrating user experience. This paper provides some insights to this question from the perspective of hubness and local intrinsic dimensionality, which are two statistical properties in assessing the popularity and complexity of data space. Based these properties, two novel algorithms are proposed for low-risk automatic selection of anchors and targets.
format text
author CHENG, Zhi-Qi
ZHANG, Hao
WU, Xiao
NGO, Chong-wah
author_facet CHENG, Zhi-Qi
ZHANG, Hao
WU, Xiao
NGO, Chong-wah
author_sort CHENG, Zhi-Qi
title On the selection of anchors and targets for video hyperlinking
title_short On the selection of anchors and targets for video hyperlinking
title_full On the selection of anchors and targets for video hyperlinking
title_fullStr On the selection of anchors and targets for video hyperlinking
title_full_unstemmed On the selection of anchors and targets for video hyperlinking
title_sort on the selection of anchors and targets for video hyperlinking
publisher Institutional Knowledge at Singapore Management University
publishDate 2017
url https://ink.library.smu.edu.sg/sis_research/6486
https://ink.library.smu.edu.sg/context/sis_research/article/7489/viewcontent/3078971.3079025.pdf
_version_ 1770575974094602240