text stringlengths 27 153 | label stringlengths 27 153 | id int64 0 40k |
|---|---|---|
feature original the aim to generated between samples. is and Our emphasize similarity samples | Our aim is to emphasize feature similarity between generated samples and the original samples. | 39,300 |
image method an medical The is becoming influential synthesis. cycleGAN in | The cycleGAN is becoming an influential method in medical image synthesis. | 39,301 |
recent on has two The been for re-identification person focused trends. research | The recent research for person re-identification has been focused on two trends. | 39,302 |
is to form more the descriptors. local part-based feature features learning One informative | One is learning the part-based local features to form more informative feature descriptors. | 39,303 |
is loss triplet metric as functions learning the other effective such loss family. The designing | The other is designing effective metric learning loss functions such as the triplet loss family. | 39,304 |
averaging been has frequencies. the Time mixed traditional sampling to approach handle | Time averaging has been the traditional approach to handle mixed sampling frequencies. | 39,305 |
However, information ignores possibly in high embedded frequency. it | However, it ignores information possibly embedded in high frequency. | 39,306 |
is are only together, however, co-registered allowing coherent This, comparisons. feasible graphs when multiple | This, however, is only feasible when graphs are co-registered together, allowing coherent multiple comparisons. | 39,307 |
technology of key The stands registration as therefore group-wise topologies analyses. for robust vascular enabling | The robust registration of vascular topologies stands therefore as key enabling technology for group-wise analyses. | 39,308 |
are matching real from vascular results angiographies. graphs synthetic and using found of Promising | Promising results of vascular matching are found using graphs from synthetic and real angiographies. | 39,309 |
are designs future and towards discussed potential clinical Observations applications. | Observations and future designs are discussed towards potential clinical applications. | 39,310 |
derivatives can band, higher this Gaussian communication order for energy-efficient In pulses nanodevices. of provide | In this band, higher order derivatives of Gaussian pulses can provide energy-efficient communication for nanodevices. | 39,311 |
advantage relatively to simple the also implement The being has proposed of computationally. method | The proposed method also has the advantage of being relatively simple to implement computationally. | 39,312 |
a system. real-time paper the anatomy In of we analysis describe this facial | In this paper we describe the anatomy of a real-time facial analysis system. | 39,313 |
To quality implement interpolated we with output a BEGAN Slerp. the increase the of | To increase the quality of the interpolated output we implement a BEGAN with Slerp. | 39,314 |
(SPG). introduced: Policy is Sampled algorithm new offline In Gradient paper, learning this actor-critic a | In this paper, a new offline actor-critic learning algorithm is introduced: Sampled Policy Gradient (SPG). | 39,315 |
a for VoxelMorph, registration. medical image learning-based deformable, We fast framework present pairwise | We present VoxelMorph, a fast learning-based framework for deformable, pairwise medical image registration. | 39,316 |
work, training two we explore strategies. In different this | In this work, we explore two different training strategies. | 39,317 |
available the setting, auxiliary we segmentations in the leverage data. second training In | In the second setting, we leverage auxiliary segmentations available in the training data. | 39,318 |
voxelmorph.csail.mit.edu. code at available Our is freely | Our code is freely available at voxelmorph.csail.mit.edu. | 39,319 |
simple by In multimodal and contrast, average like operators fusion concatenation. data is achieved | In contrast, multimodal data fusion is achieved by simple operators like average and concatenation. | 39,320 |
MFB features with explore classification. and different effectiveness in its combine We video video-level | We combine MFB with different video-level features and explore its effectiveness in video classification. | 39,321 |
and process However, intensive slow, is this unreliable. labor | However, this process is slow, labor intensive and unreliable. | 39,322 |
paper, this objective. propose we meet DocFace+ In this to | In this paper, we propose DocFace+ to meet this objective. | 39,323 |
great Fully success years. in (FCN) achieved parsing networks in recent have convolutional human | Fully convolutional networks (FCN) have achieved great success in human parsing in recent years. | 39,324 |
to labels. segmentation method We generate learning pseudo keypoint masks part iterative develop from an | We develop an iterative learning method to generate pseudo part segmentation masks from keypoint labels. | 39,325 |
we pseudo output FCN train to With parsing network pixel-level human an masks, predictions. these | With these pseudo masks, we train an FCN network to output pixel-level human parsing predictions. | 39,326 |
Full-CRFs methods expensive. for However, are too traditional | However, traditional methods for Full-CRFs are too expensive. | 39,327 |
by CRF we handle Then how to multi-label showing implement expansion moves. | Then we handle multi-label CRF by showing how to implement expansion moves. | 39,328 |
also We show approach the our effectiveness on task. segmentation semantic of | We also show the effectiveness of our approach on semantic segmentation task. | 39,329 |
considered its repertoire. Inhibition is pattern shape to activity, neural and broaden | Inhibition is considered to shape neural activity, and broaden its pattern repertoire. | 39,330 |
validate to used Simulation, and data phantom proposed have patient framework. AAA sets the been | Simulation, phantom and patient AAA data sets have been used to validate the proposed framework. | 39,331 |
also achieved accuracy, Performance were time-efficiency. in advantages terms of and robustness | Performance advantages were also achieved in terms of accuracy, robustness and time-efficiency. | 39,332 |
All will the source. code be open | All the code will be open source. | 39,333 |
and with primarily age. alterations on disease its Investigations focus | Investigations primarily focus on its alterations with disease and age. | 39,334 |
are differences significant Rasa between causing links the extracted The pairs statistically. | The significant links causing differences between the Rasa pairs are extracted statistically. | 39,335 |
It winning entry in robust the flow challenge. competition of is vision the the optical | It is the winning entry in the optical flow competition of the robust vision challenge. | 39,336 |
gains. our analyze the sources of Next, performance we experimentally | Next, we experimentally analyze the sources of our performance gains. | 39,337 |
concludes support AI of these four It that each technology areas. can | It concludes that AI technology can support each of these four areas. | 39,338 |
a be to good approach different there business circumstances. in take some may However, reasons | However, there may be good business reasons to take a different approach in some circumstances. | 39,339 |
of Graph have graph become Networks crucial (GCNs) representations vertices. learning a tool on Convolutional | Graph Convolutional Networks (GCNs) have become a crucial tool on learning representations of graph vertices. | 39,340 |
in We item graphs problems address this in paper. relocation | We address item relocation problems in graphs in this paper. | 39,341 |
item Our (CBS). approach (SMT) combines with modulo conflict-based search theory relocation for satisfiability solving | Our solving approach for item relocation combines satisfiability modulo theory (SMT) with conflict-based search (CBS). | 39,342 |
benchmarks evaluation SMT-CBS the CBS. several Experimental that shows outperforms standard the on significantly algorithm | Experimental evaluation on several benchmarks shows that the SMT-CBS algorithm significantly outperforms the standard CBS. | 39,343 |
explain algorithm. then define a and reliability Furthermore, we the of notion | Furthermore, we define a notion of reliability and then explain the algorithm. | 39,344 |
well known we simulations, demonstrate performance With over extended policy. the in gains the MaxWeight | With extended simulations, we demonstrate the gains in performance over the well known MaxWeight policy. | 39,345 |
group raters multiple evaluate a reliability who the Inter-Rater of quantifies subjects. between | Inter-Rater quantifies the reliability between multiple raters who evaluate a group of subjects. | 39,346 |
through of This pairs. accomplished permutations user is | This is accomplished through permutations of user pairs. | 39,347 |
layer propose We segmentation. unsupervised for domain scene adaption in semantic normalization a | We propose a normalization layer for unsupervised domain adaption in semantic scene segmentation. | 39,348 |
intractable makes the This power problem for systems. large-scale nonlinearity | This nonlinearity makes the problem intractable for large-scale power systems. | 39,349 |
allocation power for reliability approaches system two compares improvement. budget for paper This | This paper compares two approaches for budget allocation for power system reliability improvement. | 39,350 |
and is traditional from which first method suffers non-convexity one, the nonlinearity. the The | The first method is the traditional one, which suffers from the non-convexity and nonlinearity. | 39,351 |
modified system. applied are to RTBS the Both models | Both models are applied to the modified RTBS system. | 39,352 |
some cases, results directly data. experimental their can be also compared single-molecule In to | In some cases, their results can also be compared directly to single-molecule experimental data. | 39,353 |
Code results in are resulting showing given and samples online supplements. the animations | Code samples and resulting animations showing results are given in the online supplements. | 39,354 |
assessed the population. of migration of This dynamics on effects the study species a | This study assessed the effects of migration on the dynamics of a species population. | 39,355 |
Experimental the of efficacy demonstrate method. proposed results the | Experimental results demonstrate the efficacy of the proposed method. | 39,356 |
limited have resources However, computational power and capability. constrained these devices portable | However, these portable devices have constrained power resources and limited computational capability. | 39,357 |
separately. first abnormality proposed is trained each The network by | The proposed network is first trained by each abnormality separately. | 39,358 |
abnormalities. using network trained all the Then is | Then the network is trained using all abnormalities. | 39,359 |
of The of targetted network. balance regulates in inhibition and the association this span global | The balance of targetted and global inhibition regulates this span of association in the network. | 39,360 |
in nontrivial role and a anti-Hebbian Our memory. inhibitory engrams learning results of suggest associative | Our results suggest a nontrivial role of anti-Hebbian learning and inhibitory engrams in associative memory. | 39,361 |
proposed Quantitative other and techniques the have adversarial with illustrated model comparisons performance. qualitative | Quantitative and qualitative comparisons with other adversarial techniques have illustrated the proposed model performance. | 39,362 |
image by Local task. homography caused common global in a misalignment stitching is issue | Local misalignment caused by global homography is a common issue in image stitching task. | 39,363 |
a we problem. this propose method (GCPW) Warping paper, to Content-Preserving In Generalized alleviate this | In this paper, we propose a Generalized Content-Preserving Warping (GCPW) method to alleviate this problem. | 39,364 |
images our We optimal locally by grid align generated method. mesh an GCPW with | We align images locally with an optimal grid mesh generated by our GCPW method. | 39,365 |
is data depth The training of lack first models. the limitation for learning deep | The first limitation is the lack of depth data for training deep learning models. | 39,366 |
RGB-D multimodal more from complementary resulting The features. model benefits also | The resulting RGB-D model also benefits from more complementary multimodal features. | 39,367 |
motivates uncertainty in for the This Semantic managing Web. the need | This motivates the need for managing uncertainty in the Semantic Web. | 39,368 |
tableau algorithm. for of non-determinism, efficient handling its suitable Prolog, implementing is the with | Prolog, with its efficient handling of non-determinism, is suitable for implementing the tableau algorithm. | 39,369 |
of TRILLP implementation tableau and are Prolog algorithm. systems TRILL the offering a | TRILL and TRILLP are systems offering a Prolog implementation of the tableau algorithm. | 39,370 |
were outperform reasoners to reasoners. shown Both DL state-of-the-art | Both reasoners were shown to outperform state-of-the-art DL reasoners. | 39,371 |
An effectiveness the shows TORNADO. of comparison experimental | An experimental comparison shows the effectiveness of TORNADO. | 39,372 |
heart-rate field an Automated is sleep stage active of variability using classification research. | Automated sleep stage classification using heart-rate variability is an active field of research. | 39,373 |
Further, adds - a calibration-free environment both complexity to additional and reconstruction texture recovery. | Further, a calibration-free environment adds additional complexity to both - reconstruction and texture recovery. | 39,374 |
processes age similar composed bone assessment was of to the physicians' study The procedures. | The study was composed of processes similar to the physicians' bone age assessment procedures. | 39,375 |
also And which applicable well. adolescents method, we Sauvegrain as is presented the to | And we also presented the Sauvegrain method, which is applicable to adolescents as well. | 39,376 |
competition the in We a model. fixation two-species study of stochastic probability | We study the probability of fixation in a stochastic two-species competition model. | 39,377 |
an easy-to-use tools issue. to important science support has computational citizen Providing become | Providing easy-to-use computational tools to support citizen science has become an important issue. | 39,378 |
future to Code be will released work. facilitate | Code will be released to facilitate future work. | 39,379 |
Ornstein-Uhlenbeck Brownian studied for motion of evolution. It was trait models and | It was studied for Brownian motion and Ornstein-Uhlenbeck models of trait evolution. | 39,380 |
drift parameter of the Ornstein-Uhlenbeck on The the depends of value limit the process. | The limit depends on the value of the drift parameter of the Ornstein-Uhlenbeck process. | 39,381 |
of Even simplicity because used computational method so, its widely and cost. this low is | Even so, this method is widely used because of its simplicity and low computational cost. | 39,382 |
for speed processing existing image varies the augmentation. tools image Moreover, in | Moreover, the image processing speed varies in existing tools for image augmentation. | 39,383 |
person, classes gait for pathological normal, and walks. considered Five assisted each including different are | Five different gait classes are considered for each person, including normal, pathological and assisted walks. | 39,384 |
different styles recognized Five walking are with high accuracy. | Five different walking styles are recognized with high accuracy. | 39,385 |
that refers for reuse. freely Open data data to available is | Open data refers to data that is freely available for reuse. | 39,386 |
of retrieval. attacks video paper zero-example challenging the problem This | This paper attacks the challenging problem of zero-example video retrieval. | 39,387 |
effective encoding conceptually practically and is simple, end-to-end. Dual | Dual encoding is conceptually simple, practically effective and end-to-end. | 39,388 |
hierarchical interpretable has policy and The from an structure. resulting our framework | The policy resulting from our framework has an interpretable and hierarchical structure. | 39,389 |
experimentally proposed tasks. a robotic validate of set manipulation on We the method | We validate the proposed method experimentally on a set of robotic manipulation tasks. | 39,390 |
it under complementary consider three We angles. | We consider it under three complementary angles. | 39,391 |
the time visual of performance. both outperforms and method existing in Our terms method | Our method outperforms the existing method in terms of both visual and time performance. | 39,392 |
to challenging. super-resolution ground benchmark truth Capturing is data (SR) | Capturing ground truth data to benchmark super-resolution (SR) is challenging. | 39,393 |
rigorously from both statistical investigate evaluations between agreements perspective. a also We | We also rigorously investigate agreements between both evaluations from a statistical perspective. | 39,394 |
divided constraints can two constraints These and constraints. photometric into categories: roughly be geometric | These constraints can be roughly divided into two categories: geometric constraints and photometric constraints. | 39,395 |
framework. an combines warping mesh-based proposed image together method in them efficient therefore The | The proposed method therefore combines them together in an efficient mesh-based image warping framework. | 39,396 |
registration ConvNets supervised predefined using Thus of for far was training example registrations. | Thus far training of ConvNets for registration was supervised using predefined example registrations. | 39,397 |
However, trivial. is example not registrations obtaining | However, obtaining example registrations is not trivial. | 39,398 |
for image registration registration. image designs We deformable flexible affine and propose for ConvNets | We propose flexible ConvNets designs for affine image registration and for deformable image registration. | 39,399 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.