[CVPR 2020, Oral] "Sketch Less for More: On-the-Fly Fine-Grained Sketch Based Image Retrieval”, IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2020. .
Fine-grained sketch-based image retrieval (FG-SBIR) addresses the problem of retrieving a particular photo instance given a user's query sketch. Its widespread applicability is however hindered by the fact that drawing a sketch takes time, and most people struggle to draw a complete and faithful sketch. In this paper, we reformulate the conventional FG-SBIR framework to tackle these challenges, with the ultimate goal of retrieving the target photo with the least number of strokes possible. We further propose an on-the-fly design that starts retrieving as soon as the user starts drawing. To accomplish this, we devise a reinforcement learning-based cross-modal retrieval framework that directly optimizes rank of the ground-truth photo over a complete sketch drawing episode. Additionally, we introduce a novel reward scheme that circumvents the problems related to irrelevant sketch strokes, and thus provides us with a more consistent rank list during the retrieval. We achieve superior early-retrieval efficiency over state-of-the-art methods and alternative baselines on two publicly available fine-grained sketch retrieval datasets.READ FULL TEXT VIEW PDF
[CVPR 2020, Oral] "Sketch Less for More: On-the-Fly Fine-Grained Sketch Based Image Retrieval”, IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2020. .
Due to the rapid proliferation of touch-screen devices, the computer vision community has witnessed significant research progress in sketch-related computer vision problems[49, 41, 29, 6, 9, 4]. Among these methods, sketch-based image retrieval (SBIR) [4, 6, 9] has received particular attention due to its potential commercial applications. SBIR was initially posed as a category-level retrieval problem. However, it became apparent that the key advantage of sketch over text/tag-based retrieval was conveying fine-grained detail  – leading to a focus on fine-grained SBIR that aims to retrieve a particular photo within a gallery. Great progress has been made on FG-SBIR [49, 41, 29], but two barriers hinder its widespread adoption in practice – the time taken to draw a complete sketch, and the drawing skill shortage of the user. Firstly, while sketch can convey fine-grained appearance details more easily than text, drawing a complete sketch is slow compared to clicking a tag or typing a search keyword. Secondly, although state-of-the-art vision systems are good at recognising badly drawn sketches [36, 50], users who perceive themselves as someone who “can’t sketch” worry about getting details wrong and receiving inaccurate results.
In this paper we break these barriers by taking a view of “less is more” and propose to tackle a new fine-grained SBIR problem that aims to retrieve the target photo with just a few strokes, as opposed to requiring the complete sketch. This problem assumes a “on-the-fly” setting, where retrieval is conducted at every stroke drawn. Figure 1 offers an illustrative example of our on-the-fly FG-SBIR framework. Due to stroke-by-stroke retrieval, and a framework optimised for few-stroke retrieval, users can usually “stop early” as soon as their goal is retrieved. This thus makes sketch more comparable with traditional search methods in terms of time to issue a query, and more easily – as those inexperienced at drawing can retrieve their queried photo based on the easiest/earliest strokes possible , while requiring fewer of the detailed strokes that are harder to draw correctly.
Solving this new problem is non-trivial. One might argue that we can directly feed incomplete sketches into the off-the-shelf FG-SBIR frameworks [49, 36], perhaps also enhanced by including synthesised sketches in the training data. However, those frameworks are not fundamentally designed to handle incomplete sketches. This is particularly the case since most of them employ a triplet ranking framework where each triplet is treated as an independent training example. So they struggle to perform well across a whole range of sketch completion points. Also, the initial sketch strokes could correspond to many possible photos due to its highly abstracted nature, thus more likely to give a noisy gradient. Last, there is no specific mechanism that can guide an existing FG-SBIR model to retrieve the photo with minimal sketch strokes, leaving it struggling to perform well across a complete sketch rendering episode during on-the-fly retrieval.
A novel on-the-fly FG-SBIR framework is proposed in this work. First and foremost, instead of the de facto choice of triplet networks that learn an embedding where sketch-photo pairs lie close, we introduce a new model design that optimizes the rank of the corresponding photo over a sketch drawing episode. Secondly, the model is optimised specifically to return the true match within a minimum number of strokes. Lastly, efforts are taken to mitigate the effect of misleading noisy strokes on obtaining a consistent photo ranking list as users add details towards the end of a sketch.
More concretely, we render the sketch at different time instants of drawing, and feed it through a deep embedding network to get a vector representation. While the other SBIR frameworks[49, 36] use triplet loss  in order to learn an embedding suited for comparing sketch and photo, we optimise the rank of the target photo with respect to a sketch query. By calculating the rank of the ground-truth photo at each time-instant and maximizing the sum of over a complete sketching episode, we ensure that the correct photo is retrieved as early as possible. Since ranking is a non-differential operation, we use a Reinforcement Learning (RL)  based pipeline to achieve this goal. We further introduce a global reward to guard against harmful noisy strokes especially during later stages of sketching where details are typically added. This also stabilises the RL training process, and produces smoother retrieval results.
Our contributions can be summarised as follows: (a) We introduce a novel on-the-fly FG-SBIR framework trained using reinforcement learning to retrieve photo using an incomplete sketch, and do so with the minimum possible drawing. (b) To this end, we develop a novel reward scheme that models the early retrieval objective, as well as one based on Kendall-Tau  rank distance that takes into account the completeness of the sketch and associated uncertainty. (c) Extensive experiments on two public datasets demonstrate the superiority of our framework.
. Contemporary research directions can be broadly classified into traditional SBIR, zero-shot SBIR and sketch-image hashing. In traditional SBIR[3, 5, 4, 2], object classes are common to both training and testing. Whereas zero-shot SBIR [47, 6, 9, 24] asks models to generalise across disjoint training and testing classes in order to alleviate annotation costs. Sketch-image hashing [23, 39] aims to improve the computational cost of retrieval by embedding to binary hash-codes rather than continues vectors.
While these SBIR works assume a single-step retrieval process, a recent study by Collomosse et al.  proposed an interactive SBIR framework. Given an initial sketch query, if the system is unable to retrieve the user’s goal in the first try, it resorts to providing some relevant image clusters to the user. The user can now select an image cluster in order to disambiguate the search, based on which the system generates new query sketch for following iteration. This interaction continues until the user’s goal is retrieved. This system used Sketch-RNN  for sketch query generation after every interaction. However Sketch-RNN is acknowledged to be weak in multi-class sketch generation . As a result, the generated sketches often diverge from the user’s intent leading to poor performance. Note that though such interaction through clusters is reasonable in the case of category-level retrieval, it is not applicable to our FG-SBIR task where all photos belong to a single class and differ in subtle ways only.
Fine-grained SBIR: FG-SBIR is a more recent addition to sketch analysis and also less studied compared to the category-level SBIR task. One of the first studies 
addressed it by graph-matching of deformable-part models. A number of deep learning approaches subsequently emerged[49, 41, 30, 29]. Yu et al.  proposed a deep triplet-ranking model for instance-level FG-SBIR. This paradigm was subsequently improved through hybrid generative-discriminative cross-domain image generation ; and providing an attention mechanism for fine-grained details as well as more sophisticated triplet losses . Recently Pang et al.  studied cross-category FG-SBIR in analogy to the ‘zero-shot’ SBIR mentioned earlier. In this paper, we open up a new research direction by studying FG-SBIR framework design for on-the-fly and early photo retrieval.
One of the most popular areas for studying incomplete or partial data is image inpainting[48, 51]. Significant progress has been made in this area using contextual-attention 
and Conditional Variational Autoencoder (CVAE). Following this direction, works have attempted to model partial sketch data [22, 13, 12]. Sketch-RNN  learns to predict multiple possible endings of incomplete sketches using a Variational Autoencdoer (VAE). While Sketch-RNN works on sequential pen-coordinates, Liu et al. 
extend conditional image-to-image translation to rasterized sparse sketch domain for partial sketch completion, followed by an auxiliary sketch recognition task. Ghoshet al.  proposed an interactive sketch-to-image translation method, which completes an incomplete object outline, and thereafter it generates a final synthesised image. Overall, these works first try to complete the partial sketch by modelling a conditional distribution based on image-to-image translation, and subsequently focus on specific task objective, be it sketch recognition or sketch-to-image generation. Unlike these two-stage inference frameworks, we focus on instance-level photo retrieval with a minimum number of sketch strokes, thus enabling partial sketch queries in a single step.
Reinforcement Learning in Vision: There has been significant progress in leveraging Reinforcement Learning (RL)  techniques in various computer vision problems [44, 14]. Vision applications benefiting from RL include visual relationship detection , automatic face aging , vision-language navigation  and 3D scene completion . In terms of sketch analysis, RL was leveraged to study abstraction and summarisation by trading off between recognisability of a sketch and number of strokes [34, 27]. While these studies aimed to discover salient strokes by using RL to filter out unnecessary strokes from a given complete sketch, we focus on leveraging RL to retrieve a photo on-the-fly with a minimum number of strokes.
Overview: Our objective is to design an ‘on-the-fly’ FG-SBIR framework, where we perform live analysis of the sketch as the user draws. The system should re-rank candidate photos based on the sketch information up to that instant and retrieve the target photo at the earliest stroke possible (see Figure 2 for an example of how the framework works in practice). To this end, we first pre-train a state-of-the-art FG-SBIR model [49, 41] using triplet loss. Thereafter, we keep the photo branch fixed, and fine-tune the sketch branch through a non-differentiable ranking based metric over complete sketch drawing episodes using reinforcement-learning.
Formally, a pre-trained FG-SBIR model learns an embedding function mapping a rasterized sketch or photo to a dimensional feature. Given a gallery of photo images , we obtain a list of dimensional vectors using . Now, for a given query sketch , and some pairwise distance metric, we obtain the top- retrieved photos from , denoted as . If the ground truth (paired) target photo appears in the top- list, we consider top- accuracy to be true for that sketch sample. Since we are dealing with on-the-fly retrieval, a sketch is represented as , where denotes one sketch coordinate tuple , and stands for maximum number of points. We assume that there exists a sketch rendering operation , which takes a list of the first coordinates in , and produces one rasterized sketch image. Our objective is to train the framework so that the ground-truth paired photo appears in with a minimum value of .
(a)). Following recent state-of-the-art sketch feature extraction pipelines[6, 41], we use soft spatial attention  to focus on salient parts of the feature map. Our baseline model consists of three specific modules: (a) is initialised from pre-trained InceptionV3  weights, (b) is modelled using 1x1 convolution followed by a softmax operation, (c) is a final fully-connected layer with normalisation to obtain an embedding of size D. Given a feature map , the output of the attention module is computed by . Global average pooling is then used to get a vector representation, which is again fed into to get the final feature representation used for distance calculation. We considered , , and to be wrapped as an overall embedding function . The training data are triplets containing sketch anchor, positive and negative photos respectively. The model is trained using triplet loss  that aims to reduce the distance between sketch anchor and positive photo , while increasing the distance between sketch anchor and negative photo . Hence, the triplet loss can be formulated as , where
is the margin hyperparameter.
Overview: We model an on-the-fly FG-SBIR model as a sequential decision making process . Our agent takes actions by producing a feature vector representation of the sketch at each rendering step, and is rewarded by retrieving the paired photo early. Due to computation overhead, instead of rendering a new sketch at every coordinate instant, we rasterize the sketch a total of times, i.e., at steps of interval . As the photo branch remains constant, we get using the baseline model. We train the agent (sketch-branch) to deal with partial sketches. In this stage we fine-tune the sketch branch only, aiming to make it competent in dealing with partial sketches. Considering one sketch rendering episode as , the agent takes state as input at every time step , producing a continuous ‘action’ vector . Based on that, the retrieval environment returns one reward , mainly taking into account the pairwise distance between and . The goal of our RL model, is to find the optimal policy for the agent that maximises the total reward under a complete sketch rendering episode.
Triplet loss [41, 45] considers only a single instant of a sketch. However, due to creation of multiple partially-completed instances of the same sketch, a diversity is created which confuses the triplet network. In contrast, our approach takes into account the complete episode of progressive sketch generation before updating the weights, thus providing a more principled and practically reliable way to model partial sketches.
Model: The sketch branch acts as our agent in RL framework, based on a stochastic continuous Gaussian policy 
, where action generation is represented with a multivariate Normal distribution. Following the typical RL notation, we define our policy as. encases the parameters of policy network comprised of pre-trained and which remains fixed, and a fully-connected trainable layer that finally predicts the mean vector
of the multivariate Gaussian distribution. Please refer to Figure3(b) for an illustration. At each time step , a policy distribution is constructed from the distribution parameters predicted by our deep network. Following this, an action is sampled from this distribution, acting as a dimensional feature representation of the sketch at that instant, i.e. . Mathematically, this Gaussian policy is defined as:
where the mean , and is obtained via a pre-trained and that take state as its input. Meanwhile, is a standalone trainable diagonal covariance matrix. We sample action , where and
Local Reward: In line with existing works leveraging RL to optimize non-differentiable task metrics in computer vision (e.g., ), our optimisation objective is the non-differentiable ranking metric. The distance between a query sketch embedding and the paired photo should be lower than the distance between the query and all other photos in . In other words, our objective is to minimise the rank of paired photo in the obtained rank list. Following the notion of maximising the reward over time, we maximise the inverse rank. For sketch rendering steps under a complete episode of each sketch sample, we obtain a total of scalar rewards that we intend to maximize:
From a geometric perspective, assuming a high value of T, this reward design can be visualised as maximising the area under a curve, where the and axes correspond to percentage of sketch and respectively. Maximising this area therefore requires the model to achieve early retrieval of the required photo.
Global Reward: During the initial steps of sketch rendering, the uncertainty associated with the sketch representation is high because an incomplete sketch could correspond to various photos (e.g., object outline with no details yet). The more it progresses towards completion, the representation becomes more concrete and moves towards one-to-one mapping with a corresponding photo. To model this observation, we use Kendall-Tau-distance  to measure the distance between two rank lists obtained from sequential sketching steps and . Kendall-Tau measures the distance between two ranking lists  as the number of pairwise disagreements (pairwise ranking order change) between them. Given the expectation of more randomness associated with early ambiguous partial sketches, the Kendall-Tau-distance between two successive rank lists from the initial steps of an episode is expected to be higher. Towards its completion, this value should decrease as the sketch becomes more unambiguous. With this intuition, we add a regularizer that encourages the normalised Kendall-Tau-distance between two successive rank lists to be monotonically decreasing over a sketch rendering episode:
This global regularisation reward term serves three purposes: (a) It models the extent of uncertainty associated with the partial sketch. (b) It discourages excessive change in the rank list later in an episode, making the retrieved result more consistent. This is important for user experience: if the returned top-ranked photos are changing constantly and drastically as the user adds more strokes, the user may be dissuaded from continuing. (c) Instead of simply considering the rank of the target, it considers the behaviour of the full ranking list and its consistency at each rendering step.
Training Procedure: We aim at maximising the sum of two proposed rewards
The RL literature provides several options for optimisation. The vanilla policy gradient  is the simplest, but suffers from poor data efficiency and robustness. Recent alternatives such as trust region policy optimization (TRPO)  are more data efficient, but involves complex second order derivative matrices. We therefore employ Proximal Policy Optimization (PPO) . Using only first order optimization, it is data efficient as well as simple to implement and tune. PPO tries to limit how far the policy can change in each iteration, so as to reduce the likelihood of taking wrong decisions. More specifically, in vanilla policy gradient, the current policy is used to compute the policy gradient whose objective function is given as:
PPO uses the idea of importance sampling  and maintains two policy networks, where evaluation of the current policy is done by collecting samples from the older policy , thus helping in sampling efficiency. Hence, along-with importance sampling, the overall objective function written as:
is the probability ratio, which measures the difference between two polices. Maximising Eq. 6 would lead to a large policy update, hence it penalises policies moving away from 1, and the new clipped surrogate objective function becomes:
where is a hyperparameter set to 0.2 in this work. Please refer to  for more details. Empirically, we found the actor-only version of PPO with clipped surrogate objective to work well for our task. More analysis is given in Sec. 4.3.
Datasets: We use QMUL-Shoe-V2 [29, 34, 40] and QMUL-Chair-V2  datasets that have been specifically designed for FG-SBIR. Both datasets contain coordinate-stroke information, enabling us to render the rasterized sketch images at intervals, for training our RL framework and evaluating its retrieval performance over different stages of a complete sketch drawing episode. QMUL-Shoe-V2 contains a total of 6,730 sketches and 2,000 photos, of which we use 6,051 and 1,800 respectively for training, and the rest for testing. For QMUL-Chair-V2, we split it as 1,275/725 sketches and 300/100 photos for training/testing respectively.
We implemented our framework in PyTorch conducting experiments on a 11 GB Nvidia RTX 2080-Ti GPU. An Inception-V3 
(excluding the auxiliary branch) network pre-trained on ImageNet datasets, is used as the backbone network for both sketch and photo branches. In all experiments, we use Adam optimizer  and set as the dimension of final feature embedding layer. We train the base model with a triplet objective having a margin of , for epochs with batch size and a learning rate of . During RL based fine-tuning of sketch branch, we train the final layer of sketch branch (keeping and fixed) with for epochs with an initial learning rate of 0.001 till epoch 100, thereafter reducing it to 0.0001. The rasterized sketch images are rendered at steps, and the gradients are updated by averaging over a complete sketch rendering episode of different sketch samples. In addition to normalising the sampled action vector , normalisation is also used after global adaptive average pooling layer as well as after the final feature embedding layer in image branch. The diagonal elements of are initialised with , and , and are set to 1, and 0.2 respectively.
Evaluation Metric: In line with on-the-fly FG-SBIR setting, we consider results appearing at the top of the list to matter more. Thus, we quantify the performance using Acc.@ accuracy, i.e. percentage of sketches having true-match photos appearing in the top- list. Moreover, in order to capture the early retrieval performance, shadowing some earlier image retrieval works , we use plots of (i) ranking percentile and (ii) versus percentage of sketch. In this context, a higher value of the mean area under the curve for (i) and (ii) signifies better early sketch retrieval performance, and we use m@A and m@B as shorthand notation for them in the rest of the paper, respectively.
To the best of our knowledge, there has been no prior work dealing with early retrieval in SBIR. Thus, based on some earlier works, we chose existing FG-SBIR baselines and their adaptations towards the new task to verify the contribution of our proposed RL based solution.
[wide, labelwidth=!, labelindent=0pt, nosep, topsep=0pt]
B2: We train a standard triplet model, but use all intermediate sketches as training data, so that the model also learns to retrieve incomplete sketches.
B3: We train different models (as ) for the sketch branch, and each model is trained to deal with a specific percentage of sketch (like 5%, 10%, …, 100%), thus increasing the number of trainable parameters times than the usual baseline. Different models are deployed at different stages of completion – again not required by any other compared methods.
B4: As an alternative to our usage of RL to optimize the non-differentiable ranking metric, we consider a pre-trained differentiable sorter  to implement an end-to-end trainable model with ranking objective. We follow a similar setup of cross-modal retrieval as designed by Engilberge et al.  and impose combination of triplet loss and ranking loss at T different instants of the sketch.
The performance of our proposed on-the-fly sketch based image retrieval is shown in Figure 4 against the baselines methods. We observe: (i) State-of-the-art triplet loss based baseline B1 performs poorly for early incomplete sketches, due to the absence of any mechanism for learning incomplete retrieval. (ii) B2’s imposition of triplet-loss at every sketch-rendering step provides improved retrieval performance over B1 for a few initial instants, but its performance declines towards the completion of sketch. This is mainly due to the fact that imposing triplet loss over incomplete sketches destabilises the learning process as it generates noisy gradients. In contrast, our RL based pipeline takes into account a complete sketch rendering episode along-with the associated uncertainty of early incomplete sketches before updating the gradients. (iii) Designing 20 different sketch models in B3 for different sketch rendering steps, improves performance towards the end of sketch rendering episode after 40% of sketch rendering in comparison to B1. However, it is poor for sketches before that stage due to its incompleteness which could correspond to various possible photos. (iv) An alternative of RL method – differential sorter described in B4, fares well against baseline B1, but is much weaker in comparison to our RL based non-differentiable ranking method. A qualitative result can be seen in Figure 2 where B1 is the baseline.
In addition to the four baselines, following the recent direction of dealing with partial sketches [12, 22], we tried a two stage framework for our early retrieval objective referred as TS in Table 1. At any given drawing step, a conditional image-to-image translation model  is used to generate the complete sketch. Thereafter, it is fed to an off-the-shelf baseline model for photo retrieval. However, this choice of using an image translation network to complete the sketch from early instances, fails miserably. Moreover, it merely produces the input sketch with a few new random noisy strokes.
Different RL Methods: We compare Proximal Policy Optimization (PPO), used here for continuous-action reinforcement learning, with some alternative RL algorithms. Although we intended to use a complete actor-critic version of PPO combining the policy surrogate Eq. 7 and value function error  term, using the actor-only version works better in our case. Additionally we evaluate this performance with (i) vanilla policy gradient  and (ii) TRPO . Empirically we observe a higher performance with clipped surrogate objective when compared with the adaptive KL penalty (with adaptive co-efficient 0.01) approach of PPO. Table 2 shows that our actor-only PPO with clipped surrogate objective outperforms other alternatives.
In contrast to the complex design of efficient optimization approaches for non-differentiable rank based loss functions[26, 11]
, we introduce a simple reinforcement learning based pipeline that can optimise a CNN to achieve any non-differentiable metric in a cross modal retrieval task. To justify our contribution and understand the variance in retrieval performance with different plausible reward designs, we conduct a thorough ablative study. The positive scalar reward value is assigned to 1, when the paired photo appears in top-list. This value could be controlled based on the requirements. Instead of reciprocating the rank value, taking its negative is also a choice. To address the concern that our inverse rank could produce too small a number, we alternatively evaluate the square root of reciprocal rank. From the results in Table 3, we can see that our designed reward function (Eq. 4) achieves the best performance.
|Vanilla Policy Gradient||80.36||32.34||82.56||19.67|
Significance of Global Reward: While using our local reward (Eq. 2) achieves an excellent rank in early rendering steps, we noticed that the rank of a paired photo might worsen at a certain sketch-rendering step later on, as illustrated in Figure 5
. As the user attempts to convey more fine-grained detail later on in the process, they may draw some noisy, irrelevant, or outlier stroke that degrades the performance. Our global-reward term in Eq.4 alleviates this issue by imposing a monotonically decreasing constraint on the normalised Kendall-Tau-distance  between two successive rank lists over an episode (Figure 5). We quantify the identified adverse impacts of inconsistent strokes, via a new metric, termed stroke-backlash index. It is formulated as , where denotes the ranking percentile of paired photo at sketch-rendering step which is averaged over all sketch samples in test split. Whenever a newly introduced stroke produces a decline in the ranking percentile, it is considered as a negative performance. Please note that the lower the value of this index, the better will be the ranking list consistency performance. We get a decline in stroke-backlash index from () to () in Chair-V2 (Shoe-V2) dataset when including the global reward. Furthermore, as shown in Table 3, this global reward term improves the early retrieval performance m@A and (m@B) by 1.11% (0.98%) and 1.31% (0.90%) for Chair-V2 and Shoe-V2 respectively. Instead of imposing the monotonically decreasing constraint over Kendall-Tau-distance that actually considers the relative ranking position of all the photos, we could have imposed the same monotonically decreasing constraint on the specific ranking of the paired-photo only. However, we notice that the stroke-backlash index arises to () and overall m@A value decreases by 0.78% (0.86%) for Chair-V2 (Shoe-V2), thus justifying the importance of using Kendall-Tau distance in our context.
Further Analysis: (i) We evaluate the performance of our framework with a varying embedding space dimension in Table 4, confirming our choice of . (ii) Instead of using a standalone-trainable diagonal covariance matrix for the actor network, we tried employing a separate fully-connected layer to predict the elements of
. However, the m@A and m@B performance deteriorates by 5.64% (4.67%) and 4.48% (3.51%), for Chair-V2 and (Shoe-V2) datasets respectively. (iii) In the context of on-the-fly FG-SBIR where we possess online sketch-stroke information, a reasonable alternative could be using a recurrent neural network like for modelling the sketch branch instead of CNN. Following SketchRNN’s  vector representation, a five-element vector is fed at every LSTM unit, and the hidden state vector is passed through a fully connected layer at any arbitrary instant, thus predicting the sketch feature representation. This alleviates the need of feeding a rendered rasterized sketch-image every time. However, replacing the CNN-sketch branch by RNN and keeping rest of the setup unchanged, performance drops significantly. As a result a top@5 accuracy of 19.62% (15.34%) is achieved compared to 76.34% (65.77%) in case of CNN for Chair-V2 (Shoe-V2) dataset. (iv) Different people have different stroke orders for sketching. Keeping this in mind we conducted an experiment by randomly shuffling stroke orders to check the consistency of our model. We obtain m@A and m@B values of 85.04% (34.84%) and 85.11% (20.92%) for Chair-V2 (Shoe-V2) datasets, respectively, demonstrating our robustness to such variations.
We have introduced a fine-grained sketch-based image retrieval framework designed to mitigate the practical barriers to FG-SBIR by analysing user sketches on-the-fly, and retrieve photos at the earliest instant. To this end, we have proposed a reinforcement-learning based pipeline with a set of novel rewards carefully designed to encode the ‘early retrieval’ scheme and stabilise the learning procedure against inconsistently drawn strokes. This provides considerable improvement on conventional baselines for on-the-fly FG-SBIR.
Image-to-image translation with conditional adversarial networks. In CVPR, Cited by: §4.2.
Self-critical sequence training for image captioning. In CVPR, Cited by: §3.2.
Sketch-based 3d shape retrieval using convolutional neural networks. In CVPR, Cited by: §2.
Reinforced cross-modal matching and self-supervised imitation learning for vision-language navigation. In CVPR, Cited by: §2.