bluuebunny/crossref_metadata_2025_split huggingface dataset:
Parinaud syndrome: a 25‐year (1991–2016) review of 40 consecutive adult cases
Authors: Shields Melissa , Sinkar Swati , Chan WengOnn , Crompton John 
Published: October 2016

AbstractPurposeTo characterize the clinical features, aetiology and management of ophthalmic symptoms in adult patients with Parinaud syndrome.MethodsThis is a retrospective, non‐comparative observational case series. We reviewed 40 consecutive charts of adult patients with the clinical diagnosis of Parinaud syndrome at the Royal Adelaide Hospital Department of Ophthalmology in Adelaide, South Australia, between 1991 and 2016. Charts were reviewed for the following: (1) demographic information, (2) clinical presentation, (3) neuro‐ophthalmology signs, (4) aetiology of Parinaud syndrome, and (5) management. Examination findings were collected at initial evaluation, throughout the course of follow‐up, and at last follow‐up.ResultsAll the cases were assessed by one of the authors (JLC). The commonest presenting symptoms were diplopia (67.5%) and blurred vision (25%) followed by visual field defect (12.5%), ataxia (7.5%) and manifest squint (7.5%). The commonest presenting signs were vertical gaze palsy (100%), convergence‐retraction nystagmus (87.5%) and light‐near dissociation (65.0%). Only 65.0% patients had the classical triad of vertical gaze palsy, convergence‐retraction nystagmus and light‐near dissociation. Midbrain pathologies including haemorrhage (30.0%), infarction (20.0%) and tumour (15.0%) were the commonest aetiology. Pineal region tumours accounted for 30.0% of presentations. Symptoms were managed conservatively in 45% of cases with temporary occlusion, prisms or refractive correction, and observation in 42.5% of cases. Surgical intervention for refractory diplopia was required in 12.5% of cases, of which 80% reported symptom resolution following surgery.ConclusionOur series highlights the variable clinical presentation of Parinaud syndrome. The classic triad of conjugate upgaze paralysis, convergence‐retraction nystagmus and light‐near dissociation was only present in 65% of cases. Pineal neoplasms remain an important aetiological consideration; however, primary midbrain pathology including infarction and haemorrhage constituted the majority of our cases and should be considered in all patients. Conservative management approaches for ocular symptoms are sufficient in most cases although surgical treatment of upgaze palsy can be a useful option in refractory cases.
Antibodies to bovine viral diarrhoea virus (BVDV) in water buffalo (Bubalus bubalis) and cattle from the Northern Territory of Australia
Authors: Evans CA , Cockcroft PD , Reichel MP 
Published: October 2016

BackgroundFarmed and feral water buffaloes (Bubalus bubalis) populations often coexist with cattle in the Northern Territory of Australia, but their level of exposure to bovine viral diarrhoea virus (BVDV) is unknown.MethodsWater buffalo (n = 245) and cattle (n = 184) serum samples were collected by the NT Government as part of an ongoing disease surveillance scheme at varying intervals between 1993 and 2001. All samples were frozen and stored at −80°C until testing. Water buffalo samples from farming properties were identified as ‘farmed’ animals and the remaining samples as ‘feral’ populations. Serum samples were analysed using commercially available ELISAs to test for the presence of BVDV antibodies.ResultsTesting of historical water buffalo sera for BVDV antibodies revealed a low level of exposure, with 4.5% (95% CI ± 2.6%) being sero‐positive; cattle from the same geographical area and time period had higher levels of exposure at 74.5% (95% CI ± 6.3%).DiscussionThis survey showed that water buffalo are susceptible to infection with BVDV. No persistently infected water buffalo were identified in this study.
Diagnosis and long‐term outcome of renal cysts after laparoscopic partial nephrectomy in children
Authors: Esposito Ciro , Escolino Maria , Troncoso Solar Bernardita , Iacona Roberta , Esposito Rosanna , Settimi Alessandro , Mushtaq Imran 
Published: October 2016

ObjectiveTo document the imaging follow‐up of laparoscopic partial nephrectomy (LPN) in children and to investigate the natural history of cystic lesions following LPN.Patients and MethodsWe reviewed the ultrasonography (US) imaging reports performed during the follow‐up of 125 children (77 girls, 48 boys; mean age 3.2 years) who underwent LPN in two centres of paediatric surgery in the period 2005–2015.ResultsA transperitoneal approach was adopted in 83 children and a retroperitoneal approach in 42. The mean follow‐up was 4.2 years. At US, an avascular cyst related to the operative site was found after 61/125 procedures (48.8%). As for their appearance, 53/61 cysts were simple and anechoic, and eight of the 61 cysts appeared septated. The mean diameter of the cysts was 3.3 × 2.8 cm. As for their course, 13/61 cysts (21.3%) disappeared after a mean of 4 years, 26/61 (42.6%) did not significantly change in dimension, 17/61 (27.8%) decreased in size, and only five of the 61 cysts (8.3%) enlarged. The cysts were asymptomatic in 51 children (83.6%), while they were associated with urinary tract infections (UTIs) and abdominal pain in the remaining 10; none required a re‐intervention.ConclusionsThe US finding of a simple cyst at the operative site after LPN is common during follow‐up, with an incidence of ~50% in our series. In regard to aetiology, probably a seroma takes the place of the removed hemi‐kidney. There was no correlation between cyst formation and type of surgical technique adopted. As there was no correlation between cysts and clinical outcomes, renal cysts after LPN can be managed conservatively, with periodic US evaluations.
Geometrically Based Linear Iterative Clustering for Quantitative Feature Correspondence
Authors: Yan Qingan , Yang Long , Liang Chao , Liu Huajun , Hu Ruimin , Xiao Chunxia 
Published: October 2016

AbstractA major challenge in feature matching is the lack of objective criteria to determine corresponding points. Recent methods find match candidates first by exploring the proximity in descriptor space, and then rely on a ratio‐test strategy to determine final correspondences. However, these measurements are heuristic and subjectively excludes massive true positive correspondences that should be matched. In this paper, we propose a novel feature matching algorithm for image collections, which is capable of providing quantitative depiction to the plausibility of feature matches. We achieve this by exploring the epipolar consistency between feature points and their potential correspondences, and reformulate feature matching as an optimization problem in which the overall geometric inconsistency across the entire image set ought to be minimized. We derive the solution of the optimization problem in a simple linear iterative manner, where a k‐means‐type approach is designed to automatically generate consistent feature clusters. Experiments show that our method produces precise correspondences on a variety of image sets and retrieves many matches that are subjectively rejected by recent methods. We also demonstrate the usefulness of the framework in structure from motion task for denser point cloud reconstruction.
Planar Shape Interpolation Based On Teichmüller Mapping
Authors: Nian Xianshun , Chen Falai 
Published: October 2016

AbstractShape interpolation is a classical problem in computer graphics and has been widely investigated in the past two decades. Ideal shape interpolation should be natural and smooth which have good properties such as affine and conformal reproduction, bounded distortion, no fold‐overs, etc. In this paper, we present a new approach for planar shape interpolation based on Teichmüller maps ‐ a special type of maps in the class of quasi‐conformal maps. The algorithm consists of two steps. In the first step, a Teichmüller map is computed from the source shape to the target shape, and then the Beltrami coefficient is interpolated such that the conformal distortion is linear with respect to the time variable. In the second step, the intermediate shape is reconstructed by solving the Beltrami equation locally over each triangle and then stitching the mapped triangles by conformal transformations. The new approach preserves all the good properties mentioned above and produces more natural and more uniform intermediate shapes than the start‐of‐the‐art methods. Especially, the conformal distortion changes linearly with respect to the time variable. Experiment results show that our method can produce appealing results regardless of interpolating between the same or different objects.
Piecewise smooth reconstruction of normal vector field on digital data
Authors: Coeurjolly David , Foare Marion , Gueth Pierre , Lachaud Jacques‐Olivier 
Published: October 2016

AbstractWe propose a novel method to regularize a normal vector field defined on a digital surface (boundary of a set of voxels). When the digital surface is a digitization of a piecewise smooth manifold, our method localizes sharp features (edges) while regularizing the input normal vector field at the same time. It relies on the optimisation of a variant of the Ambrosio‐Tortorelli functional, originally defined for denoising and contour extraction in image processing [AT90]. We reformulate this functional to digital surface processing thanks to discrete calculus operators. Experiments show that the output normal field is very robust to digitization artifacts or noise, and also fairly independent of the sampling resolution. The method allows the user to choose independently the amount of smoothing and the length of the set of discontinuities. Sharp and vanishing features are correctly delineated even on extremely damaged data. Finally, our method can be used to enhance considerably the output of state‐of‐the‐art normal field estimators like Voronoi Covariance Measure [MOG11] or Randomized Hough Transform [BM12].
Anisotropic Superpixel Generation Based on Mahalanobis Distance
Authors: Cai Yiqi , Guo Xiaohu 
Published: October 2016

AbstractSuperpixels have been widely used as a preprocessing step in various computer vision tasks. Spatial compactness and color homogeneity are the two key factors determining the quality of the superpixel representation. In this paper, these two objectives are considered separately and anisotropic superpixels are generated to better adapt to local image content. We develop a unimodular Gaussian generative model to guide the color homogeneity within a superpixel by learning local pixel color variations. It turns out maximizing the log‐likelihood of our generative model is equivalent to solving a Centroidal Voronoi Tessellation (CVT) problem. Moreover, we provide the theoretical guarantee that the CVT result is invariant to affine illumination change, which makes our anisotropic superpixel generation algorithm well suited for image/video analysis in varying illumination environment. The effectiveness of our method in image/video superpixel generation is demonstrated through the comparison with other state‐of‐the‐art methods.
Image Recoloring with Valence‐Arousal Emotion Model
Authors: Kim Hye‐Rin , Kang Henry , Lee In‐Kwon 
Published: October 2016

AbstractWe introduce an affective image recoloring method for changing the overall mood in the image in a numerically measurable way. Given a semantically segmented source image and a target emotion, our system finds reference image segments from the collection of images that have been tagged via crowdsourcing with numerically measured emotion labels. We then recolorize the source segments using colors from the selected target segments while preserving the gradient of the source image to generate a seamless and natural result. User study confirms the effectiveness of our method in accomplishing the stated goal of altering the mood of the image to match the target emotion level.
Efficient modeling of entangled details for natural scenes
Authors: Guérin Eric , Galin Eric , Grosbellet François , Peytavie Adrien , Génevaux Jean‐David 
Published: October 2016

AbstractDigital landscape realism often comes from the multitude of details that are hard to model such as fallen leaves, rock piles or entangled fallen branches. In this article, we present a method for augmenting natural scenes with a huge amount of details such as grass tufts, stones, leaves or twigs. Our approach takes advantage of the observation that those details can be approximated by replications of a few similar objects and therefore relies on mass‐instancing. We propose an original structure, the Ghost Tile, that stores a huge number of overlapping candidate objects in a tile, along with a pre‐computed collision graph. Details are created by traversing the scene with the Ghost Tile and generating instances according to user‐defined density fields that allow to sculpt layers and piles of entangled objects while providing control over their density and distribution.
Facial Feature Exaggeration According to Social Psychology of Face Perception
Authors: Tian Lihui , Xiao Shuangjiu 
Published: October 2016

AbstractWe propose a personality trait exaggeration system emphasizing the impression of human face in images, based on multi‐level features learning and exaggeration. These features are called Personality Trait Model (PTM). Abstract level of PTM is social psychology trait of face perception such as amiable, mean, cute and so on. Concrete level of PTM is shape feature and texture feature. A training phase is presented to learn multi‐level features of faces from different images. Statistical survey is taken to label sample images with people's first impressions. From images with the same labels, we capture not only shape features but also texture features to enhance exaggeration effect. Texture feature is expressed by matrix to reflect depth of facial organs, wrinkles and so on. In application phase, original images will be exaggerated using PTM iteratively. And exaggeration rate for each iteration is constrained to keep likeness with the original face. Experimental results demonstrate that our system can emphasize chosen social psychology traits effectively.
Physically Based Video Editing
Authors: Bazin J.‐C. , (Kuster) C. Plüss , Yu G. , Martin T. , Jacobson A. , Gross M. 
Published: October 2016

AbstractConvincing manipulation of objects in live action videos is a difficult and often tedious task. Skilled video editors achieve this with the help of modern professional tools, but complex motions might still lack physical realism since existing tools do not consider the laws of physics. On the other hand, physically based simulation promises a high degree of realism, but typically creates a virtual 3D scene animation rather than returning an edited version of an input live action video. We propose a framework that combines video editing and physics‐based simulation. Our tool assists unskilled users in editing an input image or video while respecting the laws of physics and also leveraging the image content. We first fit a physically based simulation that approximates the object's motion in the input video. We then allow the user to edit the physical parameters of the object, generating a new physical behavior for it. The core of our work is the formulation of an image‐aware constraint within physics simulations. This constraint manifests as external control forces to guide the object in a way that encourages proper texturing at every frame, yet producing physically plausible motions. We demonstrate the generality of our method on a variety of physical interactions: rigid motion, multi‐body collisions, clothes and elastic bodies.
An Error Estimation Framework for Many‐Light Rendering
Authors: Nabata K. , Iwasaki K. , Dobashi Y. , Nishita T. 
Published: October 2016

AbstractThe popularity of many‐light rendering, which converts complex global illumination computations into a simple sum of the illumination from virtual point lights (VPLs), for predictive rendering has increased in recent years. A huge number of VPLs are usually required for predictive rendering at the cost of extensive computational time. While previous methods can achieve significant speedup by clustering VPLs, none of these previous methods can estimate the total errors due to clustering. This drawback imposes on users tedious trial and error processes to obtain rendered images with reliable accuracy. In this paper, we propose an error estimation framework for many‐light rendering. Our method transforms VPL clustering into stratified sampling combined with confidence intervals, which enables the user to estimate the error due to clustering without the costly computing required to sum the illumination from all the VPLs. Our estimation framework is capable of handling arbitrary BRDFs and is accelerated by using visibility caching, both of which make our method more practical. The experimental results demonstrate that our method can estimate the error much more accurately than the previous clustering method.
Decoupled Space and Time Sampling of Motion and Defocus Blur for Unified Rendering of Transparent and Opaque Objects
Authors: Widmer S. , Wodniok D. , Thul D. , Guthe S. , Goesele M. 
Published: October 2016

AbstractWe propose a unified rendering approach that jointly handles motion and defocus blur for transparent and opaque objects at interactive frame rates. Our key idea is to create a sampled representation of all parts of the scene geometry that are potentially visible at any point in time for the duration of a frame in an initial rasterization step. We store the resulting temporally‐varying fragments (t‐fragments) in a bounding volume hierarchy which is rebuild every frame using a fast spatial median construction algorithm. This makes our approach suitable for interactive applications with dynamic scenes and animations. Next, we perform spatial sampling to determine all t‐fragments that intersect with a specific viewing ray at any point in time. Viewing rays are sampled according to the lens uv‐sampling for depth‐of‐field effects. In a final temporal sampling step, we evaluate the predetermined viewing ray/t‐fragment intersections for one or multiple points in time. This allows us to incorporate all standard shading effects including transparency. We describe the overall framework, present our GPU implementation, and evaluate our rendering approach with respect to scalability, quality, and performance.
Reduced Aggregate Scattering Operators for Path Tracing
Authors: Blumer Adrian , Novák Jan , Habel Ralf , Nowrouzezahrai Derek , Jarosz Wojciech 
Published: October 2016

AbstractAggregate scattering operators (ASOs) describe the overall scattering behavior of an asset (i.e., an object or volume, or collection thereof) accounting for all orders of its internal scattering. We propose a practical way to precompute and compactly store ASOs and demonstrate their ability to accelerate path tracing. Our approach is modular avoiding costly and inflexible scene‐dependent precomputation. This is achieved by decoupling light transport within and outside of each asset, and precomputing on a per‐asset level. We store the internal transport in a reduced‐dimensional subspace tailored to the structure of the asset geometry, its scattering behavior, and typical illumination conditions, allowing the ASOs to maintain good accuracy with modest memory requirements. The precomputed ASO can be reused across all instances of the asset and across multiple scenes. We augment ASOs with functionality enabling multi‐bounce importance sampling, fast short‐circuiting of complex light paths, and compact caching, while retaining rapid progressive preview rendering. We demonstrate the benefits of our ASOs by efficiently path tracing scenes containing many instances of objects with complex inter‐reflections or multiple scattering.
Visual Contrast Sensitivity and Discrimination for 3D Meshes and their Applications
Authors: Nader G. , Wang K. , Hétroy‐Wheeler F. , Dupont f. 
Published: October 2016

AbstractIn this paper, we first introduce an algorithm for estimating the visual contrast on a 3D mesh. We then perform a series of psychophysical experiments to study the effects of contrast sensitivity and contrast discrimination of the human visual system for the task of differentiating between two contrasts on a 3D mesh. The results of these experiments allow us to propose a perceptual model that is able to predict whether a change in local contrast on 3D mesh, induced by a local geometric distortion, is visible or not. Finally, we illustrate the utility of the proposed perceptual model in a number of applications: we compute the Just Noticeable Distortion (JND) profile for smooth‐shaded 3D meshes and use the model to guide mesh processing algorithms.
Malleability of implicit associations across development
Authors: Gonzalez Antonya Marie , Dunlop William L. , Baron Andrew Scott 
Published: October 2016

AbstractThe prevalence of implicit intergroup bias in adults underscores the importance of knowing when during development such biases are most amenable to change. Although research suggests that implicit intergroup bias undergoes little change across development, no studies have directly examined whether developmental differences exist in the capacity for novel implicit associations to form or change. The present study examined this issue among children ages 5–12. Results from over 800 children provided evidence that novel implicit associations formed quickly, regardless of child age, association type (evaluative or non‐evaluative) or the target of the association (social or non‐social). Moreover, the magnitude of these changes was comparable across conditions. Coupled with similar findings among adults, these data underscore the importance of first impressions in shaping implicit intergroup bias and provide further evidence that the acquisition of implicit associations is governed by a domain‐general mechanism that may be fully in place by age 5.
Co‐sleeping in school‐aged children with a motor disability: a comparative population‐based study
Authors: Jacquier David , Newman Christopher John 
Published: October 2016

AimTo determine the prevalence and determinants of co‐sleeping in school‐aged children with a motor disability compared with the school‐aged general population.MethodA questionnaire on demographic characteristics and co‐sleeping habits, along with the Sleep Disturbance Scale for Children (SDSC), was sent to parents of children aged between 4 years and 18 years followed in our tertiary paediatric neurorehabilitation clinic, and to school‐aged children in a representative sample of state schools.ResultWe analysed responses for 245 children with motor disability (142 males, 103 females; mean age 10y 6mo, standard deviation [SD] 3y 10mo, range 4–18y) and 2891 of the general population (1484 males, 1497 females; mean age [SD] 9y 6mo [3y 5mo], range 4–18y) (response rates 37% and 26% respectively). Cerebral palsy was the most common diagnosis among children with motor disability. Weekly co‐sleeping was significantly more common in children with motor disability than in the general population (11.8% vs 7.9% respectively, p=0.032). Special care of the child with motor disability at night, mainly addressing epilepsy, was reported as a cause of co‐sleeping by two‐thirds of parents. Factors associated with co‐sleeping in the motor disability group were age, housing crowding, severe visual impairment, and pathological sleep according to the SDSC.InterpretationCo‐sleeping is common among children with motor disability. It is influenced by personal and medical factors, as well as the requirements for special care at night. Therefore, health professionals should explore sleeping arrangements in families of children with motor disability.