liu.seSearch for publications in DiVA
Endre søk
Link to record
Permanent link

Direct link
Publikasjoner (10 av 31) Visa alla publikasjoner
Johnander, J., Brissman, E., Danelljan, M. & Felsberg, M. (2021). Video Instance Segmentation with Recurrent Graph Neural Networks. In: Bauckhage C., Gall J., Schwing A. (Ed.), Pattern Recognition: 43rd DAGM German Conference, DAGM GCPR 2021, Bonn, Germany, September 28 – October 1, 2021, Proceedings.. Paper presented at 43rd DAGM German Conference, DAGM GCPR 2021, Bonn, Germany, September 28 – October 1, 2021 (pp. 206-221). Springer
Åpne denne publikasjonen i ny fane eller vindu >>Video Instance Segmentation with Recurrent Graph Neural Networks
2021 (engelsk)Inngår i: Pattern Recognition: 43rd DAGM German Conference, DAGM GCPR 2021, Bonn, Germany, September 28 – October 1, 2021, Proceedings. / [ed] Bauckhage C., Gall J., Schwing A., Springer, 2021, s. 206-221Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Video instance segmentation is one of the core problems in computer vision. Formulating a purely learning-based method, which models the generic track management required to solve the video instance segmentation task, is a highly challenging problem. In this work, we propose a novel learning framework where the entire video instance segmentation problem is modeled jointly. To this end, we design a graph neural network that in each frame jointly processes all detections and a memory of previously seen tracks. Past information is considered and processed via a recurrent connection. We demonstrate the effectiveness of the proposed approach in comprehensive experiments. Our approach, operating at over 25 FPS, outperforms previous video real-time methods. We further conduct detailed ablative experiments that validate the different aspects of our approach.

sted, utgiver, år, opplag, sider
Springer, 2021
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 13024
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-183945 (URN)10.1007/978-3-030-92659-5_13 (DOI)001500565200013 ()2-s2.0-85124252424 (Scopus ID)978-3-030-92658-8 (ISBN)978-3-030-92659-5 (ISBN)
Konferanse
43rd DAGM German Conference, DAGM GCPR 2021, Bonn, Germany, September 28 – October 1, 2021
Tilgjengelig fra: 2022-03-28 Laget: 2022-03-28 Sist oppdatert: 2026-06-24bibliografisk kontrollert
Johnander, J., Danelljan, M., Brissman, E., Khan, F. S. & Felsberg, M. (2019). A generative appearance model for end-to-end video object segmentation. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR): . Paper presented at IEEE Conference on Computer Vision and Pattern Recognition. 2019, Long Beach, CA, USA, USA, 15-20 June 2019 (pp. 8945-8954). Institute of Electrical and Electronics Engineers (IEEE)
Åpne denne publikasjonen i ny fane eller vindu >>A generative appearance model for end-to-end video object segmentation
Vise andre…
2019 (engelsk)Inngår i: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Institute of Electrical and Electronics Engineers (IEEE), 2019, s. 8945-8954Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

One of the fundamental challenges in video object segmentation is to find an effective representation of the target and background appearance. The best performing approaches resort to extensive fine-tuning of a convolutional neural network for this purpose. Besides being prohibitively expensive, this strategy cannot be truly trained end-to-end since the online fine-tuning procedure is not integrated into the offline training of the network. To address these issues, we propose a network architecture that learns a powerful representation of the target and background appearance in a single forward pass. The introduced appearance module learns a probabilistic generative model of target and background feature distributions. Given a new image, it predicts the posterior class probabilities, providing a highly discriminative cue, which is processed in later network modules. Both the learning and prediction stages of our appearance module are fully differentiable, enabling true end-to-end training of the entire segmentation pipeline. Comprehensive experiments demonstrate the effectiveness of the proposed approach on three video object segmentation benchmarks. We close the gap to approaches based on online fine-tuning on DAVIS17, while operating at 15 FPS on a single GPU. Furthermore, our method outperforms all published approaches on the large-scale YouTube-VOS dataset.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2019
Serie
Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, IEEE Conference on Computer Vision and Pattern Recognition, ISSN 1063-6919, E-ISSN 2575-7075
Emneord
Segmentation; Grouping and Shape; Motion and Tracking
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-161037 (URN)10.1109/CVPR.2019.00916 (DOI)000542649302058 ()9781728132938 (ISBN)9781728132945 (ISBN)
Konferanse
IEEE Conference on Computer Vision and Pattern Recognition. 2019, Long Beach, CA, USA, USA, 15-20 June 2019
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)Swedish Foundation for Strategic ResearchSwedish Research Council
Tilgjengelig fra: 2019-10-17 Laget: 2019-10-17 Sist oppdatert: 2026-01-23bibliografisk kontrollert
Danelljan, M., Bhat, G., Khan, F. S. & Felsberg, M. (2019). ATOM: Accurate tracking by overlap maximization. In: 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019): . Paper presented at IEEE Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, June 16th - June 20th, 2019 (pp. 4655-4664). IEEE
Åpne denne publikasjonen i ny fane eller vindu >>ATOM: Accurate tracking by overlap maximization
2019 (engelsk)Inngår i: 2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), IEEE, 2019, s. 4655-4664Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

While recent years have witnessed astonishing improvements in visual tracking robustness, the advancements in tracking accuracy have been limited. As the focus has been directed towards the development of powerful classifiers, the problem of accurate target state estimation has been largely overlooked. In fact, most trackers resort to a simple multi-scale search in order to estimate the target bounding box. We argue that this approach is fundamentally limited since target estimation is a complex task, requiring highlevel knowledge about the object. We address this problem by proposing a novel tracking architecture, consisting of dedicated target estimation and classification components. High level knowledge is incorporated into the target estimation through extensive offline learning. Our target estimation component is trained to predict the overlap between the target object and an estimated bounding box. By carefully integrating targetspecific information, our approach achieves previously unseen bounding box accuracy. We further introduce a classification component that is trained online to guarantee high discriminative power in the presence of distractors. Our final tracking framework sets a new state-of-the-art on five challenging benchmarks. On the new large-scale TrackingNet dataset, our tracker ATOM achieves a relative gain of 15% over the previous best approach, while running at over 30 FPS. Code and models are available at https://github.com/visionml/pytracking.

sted, utgiver, år, opplag, sider
IEEE, 2019
Serie
Proceedings (IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Online), E-ISSN 2575-7075
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-163194 (URN)10.1109/CVPR.2019.00479 (DOI)000529484004085 ()978-1-7281-3293-8 (ISBN)
Konferanse
IEEE Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA, June 16th - June 20th, 2019
Merknad

Funding Agencies|SSF (SymbiCloud); Swedish Research Council (EMC2)Swedish Research Council [2018-04673]; ELLIIT; WASP

Tilgjengelig fra: 2020-01-22 Laget: 2020-01-22 Sist oppdatert: 2025-02-07bibliografisk kontrollert
Danelljan, M., Bhat, G., Gladh, S., Khan, F. S. & Felsberg, M. (2019). Deep motion and appearance cues for visual tracking. Pattern Recognition Letters, 124, 74-81
Åpne denne publikasjonen i ny fane eller vindu >>Deep motion and appearance cues for visual tracking
Vise andre…
2019 (engelsk)Inngår i: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 124, s. 74-81Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Generic visual tracking is a challenging computer vision problem, with numerous applications. Most existing approaches rely on appearance information by employing either hand-crafted features or deep RGB features extracted from convolutional neural networks. Despite their success, these approaches struggle in case of ambiguous appearance information, leading to tracking failure. In such cases, we argue that motion cue provides discriminative and complementary information that can improve tracking performance. Contrary to visual tracking, deep motion features have been successfully applied for action recognition and video classification tasks. Typically, the motion features are learned by training a CNN on optical flow images extracted from large amounts of labeled videos. In this paper, we investigate the impact of deep motion features in a tracking-by-detection framework. We also evaluate the fusion of hand-crafted, deep RGB, and deep motion features and show that they contain complementary information. To the best of our knowledge, we are the first to propose fusing appearance information with deep motion features for visual tracking. Comprehensive experiments clearly demonstrate that our fusion approach with deep motion features outperforms standard methods relying on appearance information alone.

sted, utgiver, år, opplag, sider
Elsevier, 2019
Emneord
Visual tracking, Deep learning, Optical flow, Discriminative correlation filters
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-148015 (URN)10.1016/j.patrec.2018.03.009 (DOI)000469427700008 ()2-s2.0-85044328745 (Scopus ID)
Merknad

Funding agencies: Swedish Foundation for Strategic Research; Swedish Research Council [2016-05543]; Wallenberg Autonomous Systems Program; Swedish National Infrastructure for Computing (SNIC); Nvidia

Tilgjengelig fra: 2018-05-24 Laget: 2018-05-24 Sist oppdatert: 2023-04-03bibliografisk kontrollert
Robinson, A., Järemo-Lawin, F., Danelljan, M. & Felsberg, M. (2019). Discriminative Learning and Target Attention for the 2019 DAVIS Challenge onVideo Object Segmentation. In: CVPR 2019 workshops: DAVIS Challenge on Video Object Segmentation. Paper presented at The IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
Åpne denne publikasjonen i ny fane eller vindu >>Discriminative Learning and Target Attention for the 2019 DAVIS Challenge onVideo Object Segmentation
2019 (engelsk)Inngår i: CVPR 2019 workshops: DAVIS Challenge on Video Object Segmentation, 2019Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In this work, we address the problem of semi-supervised video object segmentation, where the task is to segment a target object in every image of the video sequence, given a ground truth only in the first frame. To be successful it is crucial to robustly handle unpredictable target appearance changes and distracting objects in the background. In this work we obtain a robust and efficient representation of the target by integrating a fast and light-weight discriminative target model into a deep segmentation network. Trained during inference, the target model learns to discriminate between the local appearances of target and background image regions. Its predictions are enhanced to accurate segmentation masks in a subsequent refinement stage.To further improve the segmentation performance, we add a new module trained to generate global target attention vectors, given the input mask and image feature maps. The attention vectors add semantic information about thetarget from a previous frame to the refinement stage, complementing the predictions provided by the target appearance model. Our method is fast and requires no network fine-tuning. We achieve a combined J and F-score of 70.6 on the DAVIS 2019 test-challenge data

Emneord
video object segmentation, computer vision, machine learning
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-163334 (URN)
Konferanse
The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Tilgjengelig fra: 2020-02-01 Laget: 2020-02-01 Sist oppdatert: 2025-02-07
Johnander, J., Bhat, G., Danelljan, M., Khan, F. S. & Felsberg, M. (2019). On the Optimization of Advanced DCF-Trackers. In: Laura Leal-TaixéStefan Roth (Ed.), Computer Vision – ECCV 2018 Workshops: Munich, Germany, September 8-14, 2018, Proceedings, Part I. Paper presented at Conference on Computer Vision (ECCV) Workshops, Munich, Germany, 8-14 September, 2018 (pp. 54-69). Cham: Springer Publishing Company
Åpne denne publikasjonen i ny fane eller vindu >>On the Optimization of Advanced DCF-Trackers
Vise andre…
2019 (engelsk)Inngår i: Computer Vision – ECCV 2018 Workshops: Munich, Germany, September 8-14, 2018, Proceedings, Part I / [ed] Laura Leal-TaixéStefan Roth, Cham: Springer Publishing Company, 2019, s. 54-69Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Trackers based on discriminative correlation filters (DCF) have recently seen widespread success and in this work we dive into their numerical core. DCF-based trackers interleave learning of the target detector and target state inference based on this detector. Whereas the original formulation includes a closed-form solution for the filter learning, recently introduced improvements to the framework no longer have known closed-form solutions. Instead a large-scale linear least squares problem must be solved each time the detector is updated. We analyze the procedure used to optimize the detector and let the popular scheme introduced with ECO serve as a baseline. The ECO implementation is revisited in detail and several mechanisms are provided with alternatives. With comprehensive experiments we show which configurations are superior in terms of tracking capabilities and optimization performance.

sted, utgiver, år, opplag, sider
Cham: Springer Publishing Company, 2019
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11129
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-161036 (URN)10.1007/978-3-030-11009-3_2 (DOI)000594378400002 ()9783030110086 (ISBN)9783030110093 (ISBN)
Konferanse
Conference on Computer Vision (ECCV) Workshops, Munich, Germany, 8-14 September, 2018
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)
Merknad

Funding agencies: Swedish Foundation for Strategic Research (SymbiCloud); Swedish Research Council (EMC 2)Swedish Research Council [201605543]; CENIIT grant [18.14]; Swedish National Infrastructure for Computing; Wallenberg AI, Autonomous Systems and Software Program (WASP

Tilgjengelig fra: 2019-10-17 Laget: 2019-10-17 Sist oppdatert: 2025-02-01bibliografisk kontrollert
Kristan, M., Leonardis, A., Matas, J., Felsberg, M., Pflugfelder, R., Zajc, L. C., . . . He, Z. (2019). The Sixth Visual Object Tracking VOT2018 Challenge Results. In: Laura Leal-Taixé and Stefan Roth (Ed.), Computer Vision – ECCV 2018 Workshops: Munich, Germany, September 8–14, 2018 Proceedings, Part I. Paper presented at Computer Vision – ECCV 2018 Workshops, Munich, Germany, September 8–14, 2018 (pp. 3-53). Cham: Springer Publishing Company
Åpne denne publikasjonen i ny fane eller vindu >>The Sixth Visual Object Tracking VOT2018 Challenge Results
Vise andre…
2019 (engelsk)Inngår i: Computer Vision – ECCV 2018 Workshops: Munich, Germany, September 8–14, 2018 Proceedings, Part I / [ed] Laura Leal-Taixé and Stefan Roth, Cham: Springer Publishing Company, 2019, s. 3-53Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

The Visual Object Tracking challenge VOT2018 is the sixth annual tracker benchmarking activity organized by the VOT initiative. Results of over eighty trackers are presented; many are state-of-the-art trackers published at major computer vision conferences or in journals in the recent years. The evaluation included the standard VOT and other popular methodologies for short-term tracking analysis and a “real-time” experiment simulating a situation where a tracker processes images as if provided by a continuously running sensor. A long-term tracking subchallenge has been introduced to the set of standard VOT sub-challenges. The new subchallenge focuses on long-term tracking properties, namely coping with target disappearance and reappearance. A new dataset has been compiled and a performance evaluation methodology that focuses on long-term tracking capabilities has been adopted. The VOT toolkit has been updated to support both standard short-term and the new long-term tracking subchallenges. Performance of the tested trackers typically by far exceeds standard baselines. The source code for most of the trackers is publicly available from the VOT page. The dataset, the evaluation kit and the results are publicly available at the challenge website (http://votchallenge.net).

sted, utgiver, år, opplag, sider
Cham: Springer Publishing Company, 2019
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11129
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-161343 (URN)10.1007/978-3-030-11009-3_1 (DOI)000594378400001 ()2-s2.0-85061750502 (Scopus ID)9783030110086 (ISBN)9783030110093 (ISBN)
Konferanse
Computer Vision – ECCV 2018 Workshops, Munich, Germany, September 8–14, 2018
Merknad

Funding agencies: Slovenian research agencySlovenian Research Agency - Slovenia [P2-0214, P2-0094, J2-8175]; Czech Science FoundationGrant Agency of the Czech Republic [GACR P103/12/G084]; WASP; VR (EMC2); SSF (SymbiCloud); SNIC; AIT Strategic Research Programme 2017 Visua

Tilgjengelig fra: 2019-10-30 Laget: 2019-10-30 Sist oppdatert: 2026-02-13bibliografisk kontrollert
Bhat, G., Danelljan, M., Khan, F. S. & Felsberg, M. (2018). Combining Local and Global Models for Robust Re-detection. In: Proceedings of AVSS 2018. 2018 IEEE International Conference on Advanced Video and Signal-based Surveillance, Auckland, New Zealand, 27-30 November 2018: . Paper presented at 15th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS), 27-30 November, Auckland, New Zealand (pp. 25-30). Institute of Electrical and Electronics Engineers (IEEE)
Åpne denne publikasjonen i ny fane eller vindu >>Combining Local and Global Models for Robust Re-detection
2018 (engelsk)Inngår i: Proceedings of AVSS 2018. 2018 IEEE International Conference on Advanced Video and Signal-based Surveillance, Auckland, New Zealand, 27-30 November 2018, Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 25-30Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Discriminative Correlation Filters (DCF) have demonstrated excellent performance for visual tracking. However, these methods still struggle in occlusion and out-of-view scenarios due to the absence of a re-detection component. While such a component requires global knowledge of the scene to ensure robust re-detection of the target, the standard DCF is only trained on the local target neighborhood. In this paper, we augment the state-of-the-art DCF tracking framework with a re-detection component based on a global appearance model. First, we introduce a tracking confidence measure to detect target loss. Next, we propose a hard negative mining strategy to extract background distractors samples, used for training the global model. Finally, we propose a robust re-detection strategy that combines the global and local appearance model predictions. We perform comprehensive experiments on the challenging UAV123 and LTB35 datasets. Our approach shows consistent improvements over the baseline tracker, setting a new state-of-the-art on both datasets.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2018
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-158403 (URN)10.1109/AVSS.2018.8639159 (DOI)000468081400005 ()9781538692943 (ISBN)9781538692936 (ISBN)9781538692950 (ISBN)
Konferanse
15th IEEE International Conference on Advanced Video and Signal Based Surveillance (AVSS), 27-30 November, Auckland, New Zealand
Merknad

Funding Agencies|SSF (SymbiCloud); VR (EMC2) [2016-05543]; CENIIT grant [18.14]; SNIC; WASP

Tilgjengelig fra: 2019-06-28 Laget: 2019-06-28 Sist oppdatert: 2025-02-01bibliografisk kontrollert
Järemo Lawin, F., Danelljan, M., Khan, F. S., Forssén, P.-E. & Felsberg, M. (2018). Density Adaptive Point Set Registration. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition: . Paper presented at The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Salt Lake City, United States, 18-22 June, 2018 (pp. 3829-3837). IEEE
Åpne denne publikasjonen i ny fane eller vindu >>Density Adaptive Point Set Registration
Vise andre…
2018 (engelsk)Inngår i: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, s. 3829-3837Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Probabilistic methods for point set registration have demonstrated competitive results in recent years. These techniques estimate a probability distribution model of the point clouds. While such a representation has shown promise, it is highly sensitive to variations in the density of 3D points. This fundamental problem is primarily caused by changes in the sensor location across point sets.    We revisit the foundations of the probabilistic registration paradigm. Contrary to previous works, we model the underlying structure of the scene as a latent probability distribution, and thereby induce invariance to point set density changes. Both the probabilistic model of the scene and the registration parameters are inferred by minimizing the Kullback-Leibler divergence in an Expectation Maximization based framework. Our density-adaptive registration successfully handles severe density variations commonly encountered in terrestrial Lidar applications. We perform extensive experiments on several challenging real-world Lidar datasets. The results demonstrate that our approach outperforms state-of-the-art probabilistic methods for multi-view registration, without the need of re-sampling.

sted, utgiver, år, opplag, sider
IEEE, 2018
Serie
IEEE Conference on Computer Vision and Pattern Recognition
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-149774 (URN)10.1109/CVPR.2018.00403 (DOI)000457843603101 ()978-1-5386-6420-9 (ISBN)
Konferanse
The IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Salt Lake City, United States, 18-22 June, 2018
Merknad

Funding Agencies|EUs Horizon 2020 Programme [644839]; CENIIT grant [18.14]; VR grant: EMC2 [2014-6227]; VR grant [2016-05543]; VR grant: LCMM [2014-5928]

Tilgjengelig fra: 2018-07-18 Laget: 2018-07-18 Sist oppdatert: 2023-04-03bibliografisk kontrollert
Danelljan, M. (2018). Learning Convolution Operators for Visual Tracking. (Doctoral dissertation). Linköping: Linköping University Electronic Press
Åpne denne publikasjonen i ny fane eller vindu >>Learning Convolution Operators for Visual Tracking
2018 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Visual tracking is one of the fundamental problems in computer vision. Its numerous applications include robotics, autonomous driving, augmented reality and 3D reconstruction. In essence, visual tracking can be described as the problem of estimating the trajectory of a target in a sequence of images. The target can be any image region or object of interest. While humans excel at this task, requiring little effort to perform accurate and robust visual tracking, it has proven difficult to automate. It has therefore remained one of the most active research topics in computer vision.

In its most general form, no prior knowledge about the object of interest or environment is given, except for the initial target location. This general form of tracking is known as generic visual tracking. The unconstrained nature of this problem makes it particularly difficult, yet applicable to a wider range of scenarios. As no prior knowledge is given, the tracker must learn an appearance model of the target on-the-fly. Cast as a machine learning problem, it imposes several major challenges which are addressed in this thesis.

The main purpose of this thesis is the study and advancement of the, so called, Discriminative Correlation Filter (DCF) framework, as it has shown to be particularly suitable for the tracking application. By utilizing properties of the Fourier transform, a correlation filter is discriminatively learned by efficiently minimizing a least-squares objective. The resulting filter is then applied to a new image in order to estimate the target location.

This thesis contributes to the advancement of the DCF methodology in several aspects. The main contribution regards the learning of the appearance model: First, the problem of updating the appearance model with new training samples is covered. Efficient update rules and numerical solvers are investigated for this task. Second, the periodic assumption induced by the circular convolution in DCF is countered by proposing a spatial regularization component. Third, an adaptive model of the training set is proposed to alleviate the impact of corrupted or mislabeled training samples. Fourth, a continuous-space formulation of the DCF is introduced, enabling the fusion of multiresolution features and sub-pixel accurate predictions. Finally, the problems of computational complexity and overfitting are addressed by investigating dimensionality reduction techniques.

As a second contribution, different feature representations for tracking are investigated. A particular focus is put on the analysis of color features, which had been largely overlooked in prior tracking research. This thesis also studies the use of deep features in DCF-based tracking. While many vision problems have greatly benefited from the advent of deep learning, it has proven difficult to harvest the power of such representations for tracking. In this thesis it is shown that both shallow and deep layers contribute positively. Furthermore, the problem of fusing their complementary properties is investigated.

The final major contribution of this thesis regards the prediction of the target scale. In many applications, it is essential to track the scale, or size, of the target since it is strongly related to the relative distance. A thorough analysis of how to integrate scale estimation into the DCF framework is performed. A one-dimensional scale filter is proposed, enabling efficient and accurate scale estimation.

sted, utgiver, år, opplag, sider
Linköping: Linköping University Electronic Press, 2018. s. 71
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1926
HSV kategori
Identifikatorer
urn:nbn:se:liu:diva-147543 (URN)10.3384/diss.diva-147543 (DOI)9789176853320 (ISBN)
Disputas
2018-06-11, Ada Lovelace, B-huset, Campus Valla, Linköping, 13:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2018-05-03 Laget: 2018-04-25 Sist oppdatert: 2025-02-07bibliografisk kontrollert
Organisasjoner
Identifikatorer
ORCID-id: ORCID iD iconorcid.org/0000-0001-6144-9520