varunr14/newsummary huggingface dataset:
3D video has recently seen a massive increase in exposure in our lives . However differences between the viewing and shooting conditions for a film lead to disparities between the reformed media and the original three dimensional effect which cause severe visual fatigue to viewers and result in headaches and dizziness . In this paper a series of image processing algorithms are introduced to overcome these problems . The image processing pipeline is composed of four steps eye pupil detection stereo correspondence computation saliency map generation and 3D warping . Each step is implemented in an S3DS 3D rendering system and its time complexity is measured . From the results it was found that real time stereoscopic 3D rendering is impossible using only a software implementation because SIFT and optical flow calculation requires a significant amount of time . Therefore these two algorithm blocks should be implemented with hardware acceleration . Fortunately active research is being conducted on these issues and real time processing is expected to become available soon for applications beyond full HD TV screens . In addition it was found that saliency map generation and 3D warping blocks also need to be implemented in hardware for full HD display although they do not have significant time complexity compared to SIFT and optical flow algorithm blocks . 


Summary: We present a real time stereoscopic 3D rendering pipeline to reduce visual fatigue when watching 3D TV. We implement the rendering pipeline in a system based on Linux and Windows. Each algorithm of the pipeline is programmed into the system. Computational complexity of each algorithm blocks are evaluated with sample 720p and 1080p stereo frames. It is found that the real time stereoscopic 3D rendering is impossible with software implementation only.
Smooth freeform skins from simple panels constitute a challenging topic arising in contemporary architecture . We contribute to this problem area by showing how to approximate a negatively curved surface by smoothly joined rational bilinear patches . The approximation problem is solved with help of a new computational approach to the hyperbolic nets of Huhnen Venedey and R rig and optimization algorithms based on it . We also discuss its limits which lie in the topology of the input surface . Finally freeform deformations based on Darboux transformations are used to generate smooth surfaces from smoothly joined Darboux cyclide patches in this way we eliminate the restriction to surfaces with negative Gaussian curvature . 


Summary: We approximate negatively curved surfaces by smooth unions of rational bilinear patches. We prove vertex consistency of hyperbolic nets using a CAGD approach. We generate smooth surfaces composed of Darboux cyclide patches.
Graphical abstract In this paper we present a novel image based framework capturing and rendering with the lighting found in real world scenes . The framework is based on recent developments in HDR video capture enabling efficient capture of the full dimensionality of the illumination in large environments exhibiting both complex spatial and angular variations . The image shows a comparison between traditional image based lighting and our method . It is evident that the lighting complexity enabled by HDR video based scene capture increases the realism and visual interest in the resulting renderings significantly . 


Summary: We present a production ready systems pipeline for image based capture and processing of real world scenes. High dynamic range video is used for scene capture. We show algorithms for reconstruction and modeling of the geometric and radiometric properties of the scene. We show how our methods can be used to create highly realistic computer graphics renderings.
Large screens have become more popular in recent years . Because of the increasing size of displays the amount of information presented in the peripheral visual field has gained importance in many tasks on visual display units . Users of displays are often exposed to some change or difference in luminance in or between different areas of a display which in turn may produce a phenomenon known as discomfort glare . Discomfort glare is likely to affect cognitive performance . The performance in the visual periphery is more susceptible to disturbances as is the case for the performance in the central visual field . This study explored the effects of discomfort glare on detecting and processing peripheral visual information in a complex visual task . The task consisted of comparing the orientation of arrows presented in the central visual field and at 18 in the periphery . The arrows were superimposed on a background video and presented by a projection system in virtual reality . 50 of the presentations were preceded by a mild glare scene with a luminance of 25cd m2 flashed prior to the stimulus . Experimental results of 56 participants were analyzed using the theory of signal detection . A significant difference in detectability of stimuli was obtained when comparing the performance in the two situations of glare . Results show that discomfort glare impairs peripheral visual performance in attending stimuli in a virtual reality environment . We therefore propose to consider discomfort glare as a factor affecting performance in detecting peripheral visual information . Discomfort glare should be included as a quality criterion in rating visual information as is done in present standards of displays and lighting . 


Summary: Glare experiments are achievable for evaluating visual attention in display media. Discomfort glare results in reduced visual performance in all ages. Discomfort glare reduces performance in detecting peripheral information. Discomfort glare as a distracter shares the resource for processing information. To consider discomfort glare as a serious issue in a complex visual environment.
We consider a cubic spline space defined over a triangulation with Powell Sabin refinement . The space has some local super smoothness and can be seen as a close extension of the classical cubic Clough Tocher spline space . In addition we construct a suitable normalized B spline representation for this spline space . The basis functions have a local support they are nonnegative and they form a partition of unity . We also show how to compute the B zier control net of such a spline in a stable way . 


Summary: We consider a cubic spline space defined over a Powell Sabin refined triangulation. The space has some local super smoothness and can be seen as a close extension of the classical cubic Clough Tocher spline space. We construct a suitable normalized B spline representation for this spline space. We also show how to compute the B zier control net of such a spline in a stable way.
Online social networks such as Twitter have emerged as an important mechanism for individuals to share information and post user generated content . However filtering interesting content from the large volume of messages received through Twitter places a significant cognitive burden on users . Motivated by this problem we develop a new automated mechanism to detect personalised interestingness and investigate this for Twitter . Instead of undertaking semantic content analysis and matching of tweets our approach considers the human response to content in terms of whether the content is sufficiently stimulating to get repeatedly chosen by users for forwarding . This approach involves machine learning against features that are relevant to a particular user and their network to obtain an expected level of retweeting for a user and a tweet . Tweets observed to be above this expected level are classified as interesting . We implement the approach in Twitter and evaluate it using comparative human tweet assessment in two forms through aggregated assessment using Mechanical Turk and through a web based experiment for Twitter users . The results provide confidence that the approach is effective in identifying the more interesting tweets from a user s timeline . This has important implications for reduction of cognitive burden the results show that timelines can be considerably shortened while maintaining a high degree of confidence that more interesting tweets will be retained . In conclusion we discuss how the technique could be applied to mitigate possible filter bubble effects . 


Summary: Twitter information streams present a lot of unfiltered noisy information. The cognitive burden on users viewing these streams is increased. We propose a method for identifying and ranking interesting information. We implement the method by applying it to Twitter timelines. Our crowdsourced validations give confidence that the approach is effective.
Electronic visual displays have shown a rapid technological evolution in the last two decades . With reference to the ergonomic requirements for video display terminal workstations at an international level attention is focused on the human system interaction . With reference to visual ergonomics the aim of this study is to assess luminance conditions through in field measurements in order to evaluate luminance and contrast ratios luminance and contrast non uniformities . The assessment was applied to widespread flat screen displays and repeated for fourteen combinations of Contrast Brightness . The analysis carried out by the Authors shows the importance of realizing a simple and quick procedure to determine the performance levels of displays used in VDT workstations . The proposed assessment could be used as a practical tool for staff assigned to assess the risks arising from VDT use in the workplace within the Occupational Health and Safety Assessment Procedure . 


Summary: We have analyzed the International Standards on ergonomics of human system interaction. We have assessed luminance conditions of displays through in field measurements. Displays were rated on 14 different Contrast Brightness combinations. Displays have met the requirements only for some Contrast Brightness combinations. Analysis has shown the importance of a rapid assessment of display performance.
Data scientists have applied various analytic models and techniques to address the oft cited problems of large volume high velocity data rates and diversity in semantics . Such approaches have traditionally employed analytic techniques in a streaming or batch processing paradigm . This paper presents CRUCIBLE a first in class framework for the analysis of large scale datasets that exploits both streaming and batch paradigms in a unified manner . The CRUCIBLE framework includes a domain specific language for describing analyses as a set of communicating sequential processes a common runtime model for analytic execution in multiple streamed and batch environments and an approach to automating the management of cell level security labelling that is applied uniformly across runtimes . This paper shows the applicability of CRUCIBLE to a variety of state of the art analytic environments and compares a range of runtime models for their scalability and performance against a series of native implementations . The work demonstrates the significant impact of runtime model selection including improvements of between 2.3 and 480 between runtime models with an average performance gap of just 14 between CRUCIBLE and a suite of equivalent native implementations . 


Summary: A domain specific language and runtime models for on and off line data analytics. Detailed analysis of CRUCIBLE s runtime performance in state of the art environments. Development and detailed analysis of a set of runtime models for new environments. Performance comparison with native implementations demonstrating a 14 average performance gap. Formulation of a primitive in the DSL that permits an analytic to be run over multiple data sources.
The internal structure and petrophysical property distribution of fault zones are commonly exceedingly complex compared to the surrounding host rock from which they are derived . This in turn produces highly complex fluid flow patterns which affect petroleum migration and trapping as well as reservoir behavior during production and injection . Detailed rendering and forecasting of fluid flow inside fault zones require high resolution explicit models of fault zone structure and properties . A fundamental requirement for achieving this is the ability to create volumetric grids in which modeling of fault zone structures and properties can be performed . Answering this need a method for generating volumetric fault zone grids which can be seamlessly integrated into existing standard reservoir modeling tools is presented . The algorithm has been tested on a wide range of fault configurations of varying complexity providing flexible modeling grids which in turn can be populated with fault zone structures and properties . 


Summary: The generation of discrete grids for explicit fault zone modeling is presented. The method provides robust handling of grids with pillar faults. The grid accommodates handling of 3D properties and structures in fault zones. The method is compatible with existing reservoir modeling and simulation tools.
The RSR2015 database designed to evaluate text dependent speaker verification systems under different durations and lexical constraints has been collected and released by the Human Language Technology department at Institute for Infocomm Research in Singapore . English speakers were recorded with a balanced diversity of accents commonly found in Singapore . More than 151h of speech data were recorded using mobile devices . The pool of speakers consists of 300 participants between 17 and 42years old making the RSR2015 database one of the largest publicly available database targeted for text dependent speaker verification . We provide evaluation protocol for each of the three parts of the database together with the results of two speaker verification system the HiLAM system based on a three layer acoustic architecture and an i vector PLDA system . We thus provide a reference evaluation scheme and a reference performance on RSR2015 database to the research community . The HiLAM outperforms the state of the art i vector system in most of the scenarios . 


Summary: We give a survey of 24 speech databases for text dependent speaker verification. The RSR2015 corpus contains 151h of speech for text dependent speaker verification. 300 balanced gender speakers were recorded in English on mobile devices. Evaluation protocols for the 3 parts of the corpus with different text constraints. Survey of classifiers and results of 2 state of the art systems on the RSR2015.
We study a particular class of planar four bar mechanisms FBM which are based on a given quadrilateral . The self motion of FBM consists of two different parts one is the motion of an anti parallelogram whilst the other one is a pure translation with circular paths . We will refer to this translatoric part in this paper only and demonstrate that this translatoric self motion has the following property At any moment the positions of the corresponding four coupler points form quads homothetic to Q . This property can be used to define spatial one parametric motions of an extruded version of the four bar mechanism which again generate quads of coupler points homothetic to Q . As the next step we take an arbitrary saturated chain of quads in space and define the corresponding one parametric spatial motions . Then all can be parametrized by the same parameter t. We will show that these partial motions can be interlinked by spherical 2R joints without locking the one parametric self motion . This way the construction delivers a series of new mechanisms which generalize results on so called Fulleroid linkages . An example based on four quads in space is worked out in detail . 


Summary: Particular four bars have coupler quads homothetic throughout the motion. This property can be transferred to 3 space and defines a spatial mechanism. Any saturated chain of quads defines chains of interlinked spatial mechanisms. This construction delivers new overconstrained mechanisms. They generalize the well known Fulleroid linkages.
This paper presents a biarc based subdivision scheme for space curve interpolation . Given a sequence of space points or a sequence of space points and tangent vectors the scheme produces a smooth curve interpolating all input points by iteratively inserting new points and computing new tangent vectors . For each step of subdivision the newly inserted point corresponding to an existing edge is a specified joint point of a biarc curve which interpolates the two end points and the tangents . A provisional tangent is also assigned to the newly inserted point . Each of the tangents for the following subdivision step is further updated as a linear blending of the provisional tangent and the tangent at the respective point of a circle passing through the local point and its two adjacent points . If adjacent four initial points and their initial reference tangent vectors are sampled from a spherical surface the limit curve segment between the middle two initial points exactly lies on the same spherical surface . The biarc based subdivision scheme is proved to be continuous with a nice convexity preserving property . Numerical examples also show that the limit curves are continuous and fair . Several examples are given to demonstrate the excellent properties of the scheme . 


Summary: This article presents a biarc based interpolatory subdivision scheme. The scheme produces convexity preserving spatial limit curves in 3D. The limit curves are proved to be continuous while numerical examples show that they are also smooth and fair. The scheme reproduces circular arcs and spherical curves with control data sampled on a circle and a sphere respectively.
Mobile device localization in wireless sensor networks is a challenging task . It has already been addressed when the WiFi propagation maps of the access points are modeled deterministically or estimated using an offline human training calibration . However these techniques do not take into account the environmental dynamics . In this paper the maps are assumed to be made of an average indoor propagation model combined with a perturbation field which represents the influence of the environment . This perturbation field is embedded with a distribution describing the prior knowledge about the environmental influence . The device is localized with Sequential Monte Carlo methods and relies on the estimation of the propagation maps . This inference task is performed online using the observations sequentially with a new online Expectation Maximization based algorithm . The performance of the algorithm is illustrated with Monte Carlo experiments using both simulated data and a true data set . 


Summary: We propose an algorithm to solve the simultaneous localization and mapping problem in wireless sensor networks. We introduce a semiparametric statistical model to take random perturbations into account. The algorithm is based on a newly proposed online Expectation Maximization procedure and on sequential Monte Carlo methods. The performance of the algorithm is illustrated with both simulated data and a true data set.
A swept surface is generated from a profile curve and a sweep curve by employing the latter to define a continuous family of transformations of the former . By using polynomial or rational curves and specifying the homogeneous coordinates of the swept surface as bilinear forms in the profile and sweep curve homogeneous coordinates the outcome is guaranteed to be a rational surface compatible with the prevailing data types of CAD systems . However this approach does not accommodate many geometrically intuitive sweep operations based on differential or integral properties of the sweep curve such as the parametric speed tangent normal curvature arc length and offset curves since they do not ordinarily have a rational dependence on the curve parameter . The use of Pythagorean hodograph sweep curves surmounts this limitation and thus makes possible a much richer spectrum of rational swept surface types . A number of representative examples are used to illustrate the diversity of these novel swept surface forms including the oriented translation sweep offset translation sweep generalized conical sweep and oriented involute sweep . In many cases of practical interest these forms also have rational offset surfaces . Considerations related to the automated CNC machining of these surfaces using only their high level procedural definitions are also briefly discussed . 


Summary: A novel family of swept surfaces based on differential integral sweep curve properties is introduced. For Pythagorean hodograph PH sweep curves the swept surfaces admit exact rational representations. Several examples involving the sweep curve parametric speed arc length tangent normal curvature and offsets are presented. Preliminary requirements for automated machining of these surfaces using only their high level procedural definitions are addressed.
In this paper we develop a rank mapping algorithm for an icosahedral grid system on a massive parallel computer with the 3 D torus network topology specifically on the K computer . Our aim is to improve the weak scaling performance of the point to point communications for exchanging grid point values between adjacent grid regions on a sphere . We formulate a new rank mapping algorithm to reduce the maximum number of hops for the point to point communications . We evaluate both the new algorithm and the standard ones on the K computer using the communication kernel of the Nonhydrostatic Icosahedral Atmospheric Model a global atmospheric model with an icosahedral grid system . We confirm that unlike the standard algorithms the new one achieves almost perfect performance in the weak scaling on the K computer even for 10 240 nodes . Results of additional experiments imply that the high scalability of the new rank mapping algorithm on the K computer is achieved by reducing network congestion in the links between adjacent nodes . 


Summary: Rank mapping algorithm for an icosahedral grid system is developed. The new algorithm is applicable to the computer with a 3 D torus network topology. Using the new algorithm number of hops does not increase with the number of nodes. The new algorithm achieves almost perfect weak scaling on the K computer. The new algorithm seems to reduce the communication congestion on the K computer.
Some social networks such as LinkedIn and ResearchGate allow user endorsements for specific skills. In this way for each skill we get a directed graph where the nodes correspond to users profiles and the arcs represent endorsement relations. From the number and quality of the endorsements received an authority score can be assigned to each profile. In this paper we propose an authority score computation method that takes into account the relations existing among different skills. Our method is based on enriching the information contained in the digraph of endorsements corresponding to a specific skill and then applying a ranking method admitting weighted digraphs such as PageRank. We describe the method and test it on a synthetic network of 1493 nodes fitted with endorsements. 


Summary: For expertise retrieval purposes we can rely on the endorsements received by members of a social network with respect to some skill. Skills are correlated which may affect individual rankings. An endorsement deduction method is proposed which improves data consistency and completeness. Endorsement deduction makes use of the known correlation among skills. The method is validated in a synthetic network resembling LinkedIn.