2015 IEEE International Conference on Image Processing (ICIP) 2015
DOI: 10.1109/icip.2015.7351542
|View full text |Cite
|
Sign up to set email alerts
|

Semi-supervised learning based on group sparse for relative attributes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(6 citation statements)
references
References 21 publications
0
6
0
Order By: Relevance
“…Most of the previous works relevant to relative attributes depend on handcrafted features. 7,27,28,40 Recently, deep neural networks have also been extended for ranking applications. 35,36,41 Yaser et al 35 introduced a CNN-based model, which is composed of a feature learning and extraction part and a ranking part, to predict relative attributes.…”
Section: Relative Attributesmentioning
confidence: 99%
See 4 more Smart Citations
“…Most of the previous works relevant to relative attributes depend on handcrafted features. 7,27,28,40 Recently, deep neural networks have also been extended for ranking applications. 35,36,41 Yaser et al 35 introduced a CNN-based model, which is composed of a feature learning and extraction part and a ranking part, to predict relative attributes.…”
Section: Relative Attributesmentioning
confidence: 99%
“…Moreover, we cannot ensure that all the classified image sets contain only the given comparative image pairs, and so far, we have not found a dataset that satisfies this condition. Therefore, we start by sorting the images of S p in a descending order, using a group sparse-based semisupervised learning approach proposed by Hongxue et al 28 The ranked image collection is S 0 p ¼ fI 0 1 ; I 0 2 ; : : : ; I 0 m g. To initialize a single chain, we take the top N init images and select one patch from each image to form a patch set P ¼ fP 1 ; P 2 ; : : : ; P N init g. The appearance of each patch varies smoothly with its neighbors in the chain by minimizing the following objective function: E Q -T A R G E T ; t e m p : i n t r a l i n k -; e 0 0 6 ; 3 2 6 ; 3 7 3…”
Section: Regions Discoverymentioning
confidence: 99%
See 3 more Smart Citations