bluuebunny/crossref_metadata_2025_split huggingface dataset:
Astrocytic responses in the lateral geniculate nucleus of monkeys with experimental glaucoma
Authors: Dai Yi , Sun Xinghuai , Yu Xiaobo , Guo Wenyi , Yu Daoyi 
Published: April 2011

AbstractObjective  To investigate the responses of lateral geniculate nucleus (LGN) astrocytes to experimental glaucoma in monkeys.Animal studied  Rhesus monkeys (Macaca mulatta).Procedures  Unilateral chronic elevation of intraocular pressure (IOP) was induced in six rhesus monkeys by laser photocoagulation of the trabecular meshwork. Four normal monkeys were used as controls. Immunohistochemistry with antibodies to glial fibrillary acidic protein (GFAP), S100β and parvalbumin was used to specifically label astrocytes and neurons in the LGN. The relative immunointensity (RI) of GFAP was defined as the ratio of intensity between each region of interest to a reference field and compared between the experimental and control groups as a function of percentage optic nerve fiber loss. Ultrastructural changes of LGN astrocytes were examined by transmission electron microscopy.Results  An increase in GFAP and S100β immunoreactivity was observed in the LGN layers receiving projections from the experimental glaucoma eyes. Quantitative analysis revealed that the RI of GFAP in both the magnocellular and parvocellular layers connected to the glaucomatous eyes increased in a linear fashion with increasing optic nerve fiber loss. Compared to controls, the RI of GFAP was also moderately elevated in LGN layers connected to the fellow nonglaucomatous eyes. Ultrastructurally, accumulation of glial filaments that occurred throughout the perikaryon and extended into the process in reactive astrocytes was observed in LGN layers of glaucomatous monkeys.Conclusions  Reactive astrogliosis occurs in the magnocellular and parvocellular LGN layers of monkeys with unilateral glaucoma. Astrocytes may play an important role in the regulation of LGN microenvironment in glaucoma.
A synthetic gene increases TGFβ3 accumulation by 75‐fold in tobacco chloroplasts enabling rapid purification and folding into a biologically active molecule
Authors: Gisby Martin F. , Mellors Philip , Madesis Panagiotis , Ellin Marianne , Laverty Hugh , O’Kane Sharon , Ferguson Mark W. J. , Day Anil 
Published: April 2011

SummaryHuman transforming growth factor‐β3 (TGFβ3) is a new therapeutic protein used to reduce scarring during wound healing. The active molecule is a nonglycosylated, homodimer comprised of 13‐kDa polypeptide chains linked by disulphide bonds. Expression of recombinant human TGFβ3 in chloroplasts and its subsequent purification would provide a sustainable source of TGFβ3 free of animal pathogens. A synthetic sequence (33% GC) containing frequent chloroplast codons raised accumulation of the 13‐kDa TGFβ3 polypeptide by 75‐fold compared to the native coding region (56% GC) when expressed in tobacco chloroplasts. The 13‐kDa TGFβ3 monomer band was more intense than the RuBisCO 15‐kDa small subunit on Coomassie blue–stained SDS‐PAGE gels. TGFβ3 accumulated in insoluble aggregates and was stable in leaves of different ages but was not detected in seeds. TGFβ3 represented 12% of leaf protein and appeared as monomer, dimer and trimer bands on Western blots of SDS‐PAGE gels. High yield and insolubility facilitated initial purification and refolding of the 13‐kDa polypeptide into the TGFβ3 homodimer recognized by a conformation‐dependent monoclonal antibody. The TGFβ3 homodimer and trace amounts of monomer were the only bands visible on silver‐stained gels following purification by hydrophobic interaction chromatography and cation exchange chromatography. N‐terminal sequencing and electronspray ionization mass spectrometry showed the removal of the initiator methionine and physical equivalence of the chloroplast‐produced homodimer to standard TGFβ3. Functional equivalence was demonstrated by near‐identical dose–response curves showing the inhibition of mink lung epithelial cell proliferation. We conclude that chloroplasts are an attractive production platform for synthesizing recombinant human TGFβ3.
Engineering plastid fatty acid biosynthesis to improve food quality and biofuel production in higher plants
Authors: Rogalski Marcelo , Carrer Helaine 
Published: April 2011

SummaryThe ability to manipulate plant fatty acid biosynthesis by using new biotechnological approaches has allowed the production of transgenic plants with unusual fatty acid profile and increased oil content. This review focuses on the production of very long chain polyunsaturated fatty acids (VLCPUFAs) and the increase in oil content in plants using molecular biology tools. Evidences suggest that regular consumption of food rich in VLCPUFAs has multiple positive health benefits. Alternative sources of these nutritional fatty acids are found in cold‐water fishes. However, fish stocks are in severe decline because of decades of overfishing, and also fish oils can be contaminated by the accumulation of toxic compounds. Recently, there is also an increase in oilseed use for the production of biofuels. This tendency is partly associated with the rapidly rising costs of petroleum, increased concern about the environmental impact of fossil oil and the attractive need to develop renewable sources of fuel. In contrast to this scenario, oil derived from crop plants is normally contaminant free and less environmentally aggressive. Genetic engineering of the plastid genome (plastome) offers a number of attractive advantages, including high‐level foreign protein expression, marker‐gene excision and transgene containment because of maternal inheritance of plastid genome in most crops. Here, we describe the possibility to improve fatty acid biosynthesis in plastids, production of new fatty acids and increase their content in plants by genetic engineering of plastid fatty acid biosynthesis via plastid transformation.
The Natural 3D Spiral
Authors: Harary Gur , Tal Ayellet 
Published: April 2011

AbstractLogarithmic spirals are ubiquitous in nature. This paper presents a novel mathematical definition of a 3D logarithmic spiral, which provides a proper description of objects found in nature. To motivate our work, we scanned spiral‐shaped objects and studied their geometric properties. We consider the extent to which the existing 3D definitions capture these properties. We identify a property that is shared by the objects we investigated and is not satisfied by the existing 3D definitions. This leads us to present our definition in which both the radius of curvature and the radius of torsion change linearly along the curve. We prove that our spiral satisfies several desirable properties, including invariance to similarity transformations, smoothness, symmetry, extensibility, and roundness. Finally, we demonstrate the utility of our curves in the modeling of several animal structures.
Fruit Senescence and Decay Simulation
Authors: Kider Joseph T. , Raja Samantha , Badler Norman I. 
Published: April 2011

AbstractAging and imperfections provide important visual cues for realism. We present a novel physically‐based approach for simulating the biological aging and decay process in fruits. This method simulates interactions between multiple processes. Our biologically‐derived, reaction‐diffusion model generates growth patterns for areas of fungal and bacterial infection. Fungal colony spread and propagation is affected by both bacterial growth and nutrient depletion. This process changes the physical properties of the surface of the fruit as well as its internal volume substrate. The fruit is physically simulated with parameters such as skin thickness and porosity, water content, flesh rigidity, ambient temperature, humidity, and proximity to other surfaces. Our model produces a simulation that closely mirrors the progression of decay in real fruits under similar parameterized conditions. Additionally, we provide a tool that allows artists to customize the input of the program to produce generalized fruit simulations.
Learning Line Features in 3D Geometry
Authors: Sunkel M. , Jansen S. , Wand M. , Eisemann E. , Seidel H.‐P. 
Published: April 2011

AbstractFeature detection in geometric datasets is a fundamental tool for solving shape matching problems such as partial symmetry detection. Traditional techniques usually employ a priori models such as crease lines that are unspecific to the actual application. Our paper examines the idea of learning geometric features. We introduce a formal model for a class of linear feature constellations based on a Markov chain model and propose a novel, efficient algorithm for detecting a large number of features simultaneously. After a short user‐guided training stage, in which one or a few example lines are sketched directly onto the input data, our algorithm automatically finds all pieces of geometry similar to the marked areas. In particular, the algorithm is able recognize larger classes of semantically similar but geometrically varying features, which is very difficult using unsupervised techniques. In a number of experiments, we apply our technique to point cloud data from 3D scanners. The algorithm is able to detect features with very low rates of false positives and negatives and to recognize broader classes of similar geometry (such as “windows” in a building scan) even from few training examples, thereby significantly improving over previous unsupervised techniques.
Shape Analysis with Subspace Symmetries
Authors: Berner Alexander , Wand Michael , Mitra Niloy J. , Mewes Daniel , Seidel Hans‐Peter 
Published: April 2011

AbstractWe address the problem of partial symmetry detection, i.e., the identification of building blocks a complex shape is composed of. Previous techniques identify parts that relate to each other by simple rigid mappings, similarity transforms, or, more recently, intrinsic isometries. Our approach generalizes the notion of partial symmetries to more general deformations. We introduce subspace symmetries whereby we characterize similarity by requiring the set of symmetric parts to form a low dimensional shape space. We present an algorithm to discover subspace symmetries based on detecting linearly correlated correspondences among graphs of invariant features. We evaluate our technique on various data sets. We show that for models with pronounced surface features, subspace symmetries can be found fully automatically. For complicated cases, a small amount of user input is used to resolve ambiguities. Our technique computes dense correspondences that can subsequently be used in various applications, such as model repair and denoising.
RTSAH Traversal Order for Occlusion Rays
Authors: Ize Thiago , Hansen Charles 
Published: April 2011

AbstractWe accelerate the finding of occluders in tree based acceleration structures, such as a packetized BVH and a single ray kd‐tree, by deriving the ray termination surface area heuristic (RTSAH) cost model for traversing an occlusion ray through a tree and then using the RTSAH to determine which child node a ray should traverse first instead of the traditional choice of traversing the near node before the far node. We further extend RTSAH to handle materials that attenuate light instead of fully occluding it, so that we can avoid superfluous intersections with partially transparent objects. For scenes with high occlusion, we substantially lower the number of traversal steps and intersection tests and achieve up to 2 × speedups.
Two‐Level Grids for Ray Tracing on GPUs
Authors: Kalojanov Javor , Billeter Markus , Slusallek Philipp 
Published: April 2011

AbstractWe investigate the use of two‐level nested grids as acceleration structure for ray tracing of dynamic scenes. We propose a massively parallel, sort‐based construction algorithm and show that the two‐level grid is one of the structures that is fastest to construct on modern graphics processors. The structure handles non‐uniform primitive distributions more robustly than the uniform grid and its traversal performance is comparable to those of other high quality acceleration structures used for dynamic scenes. We propose a cost model to determine the grid resolution and improve SIMD utilization during ray‐triangle intersection by employing a hybrid packetization strategy. The build times and ray traversal acceleration provide overall rendering performance superior to previous approaches for real time rendering of animated scenes on GPUs.
Interactive Modeling of City Layouts using Layers of Procedural Content
Authors: Lipp M. , Scherzer D. , Wonka P. , Wimmer M. 
Published: April 2011

AbstractIn this paper, we present new solutions for the interactive modeling of city layouts that combine the power of procedural modeling with the flexibility of manual modeling. Procedural modeling enables us to quickly generate large city layouts, while manual modeling allows us to hand‐craft every aspect of a city. We introduce transformation and merging operators for both topology preserving and topology changing transformations based on graph cuts. In combination with a layering system, this allows intuitive manipulation of urban layouts using operations such as drag and drop, translation, rotation etc. In contrast to previous work, these operations always generate valid, i.e., intersection‐free layouts. Furthermore, we introduce anchored assignments to make sure that modifications are persistent even if the whole urban layout is regenerated.
SQuad: Compact Representation for Triangle Meshes
Authors: Gurung Topraj , Laney Daniel , Lindstrom Peter , Rossignac Jarek 
Published: April 2011

AbstractThe SQuad data structure represents the connectivity of a triangle mesh by its “S table” of about 2 rpt (integer references per triangle). Yet it allows for a simple implementation of expected constant‐time, random‐access operators for traversing the mesh, including in‐order traversal of the triangles incident upon a vertex. SQuad is more compact than the Corner Table (CT), which stores 6 rpt, and than the recently proposed SOT, which stores 3 rpt. However, in‐core access is generally faster in CT than in SQuad, and SQuad requires rebuilding the S table if the connectivity is altered. The storage reduction and memory coherence opportunities it offers may help to reduce the frequency of page faults and cache misses when accessing elements of a mesh that does not fit in memory. We provide the details of a simple algorithm that builds the S table and of an optimized implementation of the SQuad operators.
Contouring Discrete Indicator Functions
Authors: Manson J. , Smith J. , Schaefer S. 
Published: April 2011

AbstractWe present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2‐material volume fractions with a high degree of accuracy. Although Marching Cubes and its derivatives are effective methods for calculating contours of functions sampled over discrete grids, these methods perform poorly when contouring non‐smooth functions such as Discrete Indicator Functions. In particular, Marching Cubes will generate surfaces that exhibit aliasing and oscillations around the exact surface. We derive a simple solution to remove these problems by using a new function to calculate the positions of vertices along cell edges that is efficient, easy to implement, and does not require any optimization or iteration. Finally, we provide empirical evidence that the error introduced by our contouring method is significantly less than is introduced by Marching Cubes.
Freehand HDR Imaging of Moving Scenes with Simultaneous Resolution Enhancement
Authors: Zimmer Henning , Bruhn Andrés , Weickert Joachim 
Published: April 2011

AbstractDespite their high popularity, common high dynamic range (HDR) methods are still limited in their practical applicability: They assume that the input images are perfectly aligned, which is often violated in practise. Our paper does not only free the user from this unrealistic limitation, but even turns the missing alignment into an advantage: By exploiting the multiple exposures, we can create a super‐resolution image. The alignment step is performed by a modern energy‐based optic flow approach that takes into account the varying exposure conditions. Moreover, it produces dense displacement fields with subpixel precision. As a consequence, our approach can handle arbitrary complex motion patterns, caused by severe camera shake and moving objects. Additionally, it benefits from several advantages over existing strategies: (i) It is robust under outliers (noise, occlusions, saturation problems) and allows for sharp discontinuities in the displacement field. (ii) The alignment step neither requires camera calibration nor knowledge of the exposure times. (iii) It can be efficiently implemented on CPU and GPU architectures. After the alignment is performed, we use the obtained subpixel accurate displacement fields as input for an energy‐based, joint super‐resolution and HDR (SR‐HDR) approach. It introduces robust data terms and anisotropic smoothness terms in the SR‐HDR literature. Our experiments with challenging real world data demonstrate that these novelties are pivotal for the favourable performance of our approach.
BSSRDF Estimation from Single Images
Authors: Munoz Adolfo , Echevarria Jose I. , Seron Francisco J. , Lopez‐Moreno Jorge , Glencross Mashhuda , Gutierrez Diego 
Published: April 2011

AbstractWe present a novel method to estimate an approximation of the reflectance characteristics of optically thick, homogeneous translucent materials using only a single photograph as input. First, we approximate the diffusion profile as a linear combination of piecewise constant functions, an approach that enables a linear system minimization and maximizes robustness in the presence of suboptimal input data inferred from the image. We then fit to a smoother monotonically decreasing model, ensuring continuity on its first derivative. We show the feasibility of our approach and validate it in controlled environments, comparing well against physical measurements from previous works. Next, we explore the performance of our method in uncontrolled scenarios, where neither lighting nor geometry are known. We show that these can be roughly approximated from the corresponding image by making two simple assumptions: that the object is lit by a distant light source and that it is globally convex, allowing us to capture the visual appearance of the photographed material. Compared with previous works, our technique offers an attractive balance between visual accuracy and ease of use, allowing its use in a wide range of scenarios including off‐the‐shelf, single images, thus extending the current repertoire of real‐world data acquisition techniques.
Intrinsic Shape Matching by Planned Landmark Sampling
Authors: Tevs A. , Berner A. , Wand M. , Ihrke I. , Seidel H.‐P. 
Published: April 2011

AbstractRecently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random‐sampling‐based techniques have been particularly successful due to their generality and efficiency. We introduce a new sampling‐based shape matching algorithm that uses a planning step to find optimized “landmark” points. These points are matched first in order to maximize the information gained and thus minimize the sampling costs. Our approach makes three main contributions: First, the new technique leads to a significant improvement in performance, which we demonstrate on a number of benchmark scenarios. Second, our technique does not require any keypoint detection. This is often a significant limitation for models that do not show sufficient surface features. Third, we examine the actual numerical degrees of freedom of the matching problem for a given piece of geometry. In contrast to previous results, our estimates take into account unprecise geodesics and potentially numerically unfavorable geometry of general topology, giving a more realistic complexity estimate.
Component‐wise Controllers for Structure‐Preserving Shape Manipulation
Authors: Zheng Youyi , Fu Hongbo , Cohen‐Or Daniel , Au Oscar Kin‐Chung , Tai Chiew‐Lan 
Published: April 2011

AbstractRecent shape editing techniques, especially for man‐made models, have gradually shifted focus from maintaining local, low‐level geometric features to preserving structural, high‐level characteristics like symmetry and parallelism. Such new editing goals typically require a pre‐processing shape analysis step to enable subsequent shape editing. Observing that most editing of shapes involves manipulating their constituent components, we introduce component‐wise controllers that are adapted to the component characteristics inferred from shape analysis. The controllers capture the natural degrees of freedom of individual components and thus provide an intuitive user interface for editing. A typical model usually results in a moderate number of controllers, allowing easy establishment of semantic relations among them by automatic shape analysis supplemented with user interaction. We propose a component‐wise propagation algorithm to automatically preserve the established inter‐relations while maintaining the defining characteristics of individual controllers and respecting the user‐specified modeling constraints. We extend these ideas to a hierarchical setup, allowing the user to adjust the tool complexity with respect to the desired modeling complexity. We demonstrate the effectiveness of our technique on a wide range of man‐made models with structural features, often containing multiple connected pieces.
Image Retargeting Quality Assessment
Authors: Liu Yong‐Jin , Luo Xi , Xuan Yu‐Ming , Chen Wen‐Feng , Fu Xiao‐Lan 
Published: April 2011

AbstractContent‐aware image retargeting is a technique that can flexibly display images with different aspect ratios and simultaneously preserve salient regions in images. Recently many image retargeting techniques have been proposed. To compare image quality by different retargeting methods fast and reliably, an objective metric simulating the human vision system (HVS) is presented in this paper. Different from traditional objective assessment methods that work in bottom‐up manner (i.e., assembling pixel‐level features in a local‐to‐global way), in this paper we propose to use a reverse order (top‐down manner) that organizes image features from global to local viewpoints, leading to a new objective assessment metric for retargeted images. A scale‐space matching method is designed to facilitate extraction of global geometric structures from retargeted images. By traversing the scale space from coarse to fine levels, local pixel correspondence is also established. The objective assessment metric is then based on both global geometric structures and local pixel correspondence. To evaluate color images, CIE L*a*b* color space is utilized. Experimental results are obtained to measure the performance of objective assessments with the proposed metric. The results show good consistency between the proposed objective metric and subjective assessment by human observers.
Image and Video Abstraction by Coherence‐Enhancing Filtering
Authors: Kyprianidis Jan Eric , Kang Henry 
Published: April 2011

AbstractIn this work, we present a non‐photorealistic rendering technique to create stylized abstractions from color images and videos. Our approach is based on adaptive line integral convolution in combination with directional shock filtering. The smoothing process regularizes directional image features while the shock filter provides a sharpening effect. Both operations are guided by a flow field derived from the structure tensor. To obtain a high‐quality flow field, we present a novel smoothing scheme for the structure tensor based on Poisson's equation. Our approach effectively regularizes anisotropic image regions while preserving the overall image structure and achieving a consistent level of abstraction. Moreover, it is suitable for per‐frame filtering of video and can be efficiently implemented to process content in real‐time.