GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Association for the Advancement of Artificial Intelligence (AAAI) ; 2022
    In:  Proceedings of the AAAI Conference on Artificial Intelligence Vol. 36, No. 3 ( 2022-06-28), p. 3589-3597
    In: Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), Vol. 36, No. 3 ( 2022-06-28), p. 3589-3597
    Abstract: We address the overlooked unbiasedness in existing long-tailed classification methods: we find that their overall improvement is mostly attributed to the biased preference of "tail" over "head", as the test distribution is assumed to be balanced; however, when the test is as imbalanced as the long-tailed training data---let the test respect Zipf's law of nature---the "tail" bias is no longer beneficial overall because it hurts the "head" majorities. In this paper, we propose Cross-Domain Empirical Risk Minimization (xERM) for training an unbiased test-agnostic model to achieve strong performances on both test distributions, which empirically demonstrates that xERM fundamentally improves the classification by learning better feature representation rather than the "head vs. tail" game. Based on causality, we further theoretically explain why xERM achieves unbiasedness: the bias caused by the domain selection is removed by adjusting the empirical risks on the imbalanced domain and the balanced but unseen domain.
    Type of Medium: Online Resource
    ISSN: 2374-3468 , 2159-5399
    Language: Unknown
    Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
    Publication Date: 2022
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Association for the Advancement of Artificial Intelligence (AAAI) ; 2022
    In:  Proceedings of the AAAI Conference on Artificial Intelligence Vol. 36, No. 2 ( 2022-06-28), p. 2397-2405
    In: Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), Vol. 36, No. 2 ( 2022-06-28), p. 2397-2405
    Abstract: This paper proposes a novel active boundary loss for semantic segmentation. It can progressively encourage the alignment between predicted boundaries and ground-truth boundaries during end-to-end training, which is not explicitly enforced in commonly used cross-entropy loss. Based on the predicted boundaries detected from the segmentation results using current network parameters, we formulate the boundary alignment problem as a differentiable direction vector prediction problem to guide the movement of predicted boundaries in each iteration. Our loss is model-agnostic and can be plugged in to the training of segmentation networks to improve the boundary details. Experimental results show that training with the active boundary loss can effectively improve the boundary F-score and mean Intersection-over-Union on challenging image and video object segmentation datasets.
    Type of Medium: Online Resource
    ISSN: 2374-3468 , 2159-5399
    Language: Unknown
    Publisher: Association for the Advancement of Artificial Intelligence (AAAI)
    Publication Date: 2022
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2015
    In:  ACM Transactions on Intelligent Systems and Technology Vol. 5, No. 4 ( 2015-01-23), p. 1-19
    In: ACM Transactions on Intelligent Systems and Technology, Association for Computing Machinery (ACM), Vol. 5, No. 4 ( 2015-01-23), p. 1-19
    Abstract: The pervasive usage and reach of social media have attracted a surge of attention in the multimedia research community. Community discovery from social media has therefore become an important yet challenging issue. However, due to the subjective generating process, the explicitly observed communities (e.g., group-user and user-user relationship) are often noisy and incomplete in nature. This paper presents a novel approach to discovering communities from social media, including the group membership and user friend structure, by exploring a low-rank matrix recovery technique. In particular, we take Flickr as one exemplary social media platform. We first model the observed indicator matrix of the Flickr community as a summation of a low-rank true matrix and a sparse error matrix. We then formulate an optimization problem by regularizing the true matrix to coincide with the available rich context and content (i.e., photos and their associated tags). An iterative algorithm is developed to recover the true community indicator matrix. The proposed approach leads to a variety of social applications, including community visualization, interest group refinement, friend suggestion, and influential user identification. The evaluations on a large-scale testbed, consisting of 4,919 Flickr users, 1,467 interest groups, and over five million photos, show that our approach opens a new yet effective perspective to solve social network problems with sparse learning technique. Despite being focused on Flickr, our technique can be applied in any other social media community.
    Type of Medium: Online Resource
    ISSN: 2157-6904 , 2157-6912
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2015
    detail.hit.zdb_id: 2584437-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2023
    In:  IEEE Transactions on Image Processing Vol. 32 ( 2023), p. 1285-1299
    In: IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers (IEEE), Vol. 32 ( 2023), p. 1285-1299
    Type of Medium: Online Resource
    ISSN: 1057-7149 , 1941-0042
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2023
    detail.hit.zdb_id: 2034319-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2011
    In:  IEEE Transactions on Multimedia Vol. 13, No. 1 ( 2011-02), p. 82-91
    In: IEEE Transactions on Multimedia, Institute of Electrical and Electronics Engineers (IEEE), Vol. 13, No. 1 ( 2011-02), p. 82-91
    Type of Medium: Online Resource
    ISSN: 1520-9210 , 1941-0077
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2011
    detail.hit.zdb_id: 2033070-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2008
    In:  ACM Transactions on Multimedia Computing, Communications, and Applications Vol. 5, No. 1 ( 2008-10), p. 1-27
    In: ACM Transactions on Multimedia Computing, Communications, and Applications, Association for Computing Machinery (ACM), Vol. 5, No. 1 ( 2008-10), p. 1-27
    Abstract: Automatic video annotation is an important ingredient for semantic-level video browsing, search and navigation. Much attention has been paid to this topic in recent years. These researches have evolved through two paradigms. In the first paradigm, each concept is individually annotated by a pre-trained binary classifier. However, this method ignores the rich information between the video concepts and only achieves limited success. Evolved from the first paradigm, the methods in the second paradigm add an extra step on the top of the first individual classifiers to fuse the multiple detections of the concepts. However, the performance of these methods can be degraded by the error propagation incurred in the first step to the second fusion one. In this article, another paradigm of the video annotation method is proposed to address these problems. It simultaneously annotates the concepts as well as model correlations between them in one step by the proposed Correlative Multilabel (CML) method, which benefits from the compensation of complementary information between different labels. Furthermore, since the video clips are composed by temporally ordered frame sequences, we extend the proposed method to exploit the rich temporal information in the videos. Specifically, a temporal-kernel is incorporated into the CML method based on the discriminative information between Hidden Markov Models (HMMs) that are learned from the videos. We compare the performance between the proposed approach and the state-of-the-art approaches in the first and second paradigms on the widely used TRECVID data set. As to be shown, superior performance of the proposed method is gained.
    Type of Medium: Online Resource
    ISSN: 1551-6857 , 1551-6865
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2008
    detail.hit.zdb_id: 2182650-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2013
    In:  ACM Transactions on Multimedia Computing, Communications, and Applications Vol. 9, No. 1 ( 2013-02), p. 1-16
    In: ACM Transactions on Multimedia Computing, Communications, and Applications, Association for Computing Machinery (ACM), Vol. 9, No. 1 ( 2013-02), p. 1-16
    Abstract: Hashing-based approximate nearest-neighbor search may well realize scalable content-based image retrieval. The existing semantic-preserving hashing methods leverage the labeled data to learn a fixed set of semantic-aware hash functions. However, a fixed hash function set is unable to well encode all semantic information simultaneously, and ignores the specific user's search intention conveyed by the query. In this article, we propose a query-adaptive hashing method which is able to generate the most appropriate binary codes for different queries. Specifically, a set of semantic-biased discriminant projection matrices are first learnt for each of the semantic concepts, through which a semantic-adaptable hash function set is learnt via a joint sparsity variable selection model. At query time, we further use the sparsity representation procedure to select the most appropriate hash function subset that is informative to the semantic information conveyed by the query. Extensive experiments over three benchmark image datasets well demonstrate the superiority of our proposed query-adaptive hashing method over the state-of-the-art ones in terms of retrieval accuracy.
    Type of Medium: Online Resource
    ISSN: 1551-6857 , 1551-6865
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2013
    detail.hit.zdb_id: 2182650-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2024
    In:  IEEE Transactions on Image Processing Vol. 33 ( 2024), p. 3648-3661
    In: IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers (IEEE), Vol. 33 ( 2024), p. 3648-3661
    Type of Medium: Online Resource
    ISSN: 1057-7149 , 1941-0042
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2024
    detail.hit.zdb_id: 2034319-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Informa UK Limited ; 2011
    In:  International Journal of Computer Mathematics Vol. 88, No. 18 ( 2011-12), p. 3817-3833
    In: International Journal of Computer Mathematics, Informa UK Limited, Vol. 88, No. 18 ( 2011-12), p. 3817-3833
    Type of Medium: Online Resource
    ISSN: 0020-7160 , 1029-0265
    Language: English
    Publisher: Informa UK Limited
    Publication Date: 2011
    detail.hit.zdb_id: 2028443-3
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Scholarpedia ; 2008
    In:  Scholarpedia Vol. 3, No. 2 ( 2008), p. 3712-
    In: Scholarpedia, Scholarpedia, Vol. 3, No. 2 ( 2008), p. 3712-
    Type of Medium: Online Resource
    ISSN: 1941-6016
    Language: English
    Publisher: Scholarpedia
    Publication Date: 2008
    detail.hit.zdb_id: 2803876-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...