Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2017
DOI: 10.1016/j.neucom.2016.11.068
|View full text |Cite
|
Sign up to set email alerts
|

Fast smooth rank function approximation based on matrix tri-factorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…In this paper, we propose to formulate the problem of removing adversarial noise from attacked images while preserving important semantic structure information for successful recognition as a low-rank matrix completion problem [12,13]. Specifically, let X = [x ij ] m×n ∈ R m×n be the original image of size m × n. M = [m ij ] m×n is the random binary mask.…”
Section: Rank Function Minimizationmentioning
confidence: 99%
“…In this paper, we propose to formulate the problem of removing adversarial noise from attacked images while preserving important semantic structure information for successful recognition as a low-rank matrix completion problem [12,13]. Specifically, let X = [x ij ] m×n ∈ R m×n be the original image of size m × n. M = [m ij ] m×n is the random binary mask.…”
Section: Rank Function Minimizationmentioning
confidence: 99%
“…Semantic structures of objects and images are inherently low rank [27]. Recently, methods for low-rank matrix approximation have been developed to characterize the lowrank structures in images [7,12,28,33,29]. In this paper, we propose to formulate the problem of removing adversarial noise from attacked images while preserving important semantic structure information for successful recognition as a low-rank matrix completion problem.…”
Section: Low-rank Image Completion Based On Nuclear Norm Minimizationmentioning
confidence: 99%
“…In this regard, a logical solution for search work on constructing and processing images of a helical surface would be to study the accuracy at a given step discreteness when moving the camera. Another approach is to determine the nodal points that limit the search area with local discontinuities in the image brightness values that arise at the boundaries of objects [70][71][72][73][74][75].…”
Section: Introductionmentioning
confidence: 99%