检索结果-内蒙古大学图书馆

An energy-aware task consolidation algorithm for cloud computing data centre

学校读者我要写书评

暂无评论

International Journal of High Performance Computing and Networking 2017年第4-5期10卷 352-358页

作者： Xiong, Yonghua Chen, Ya Jiang, Keyuan Tang, Yongbing School of Automation China University of Geosciences Wuhan China School of Information Science and Engineering Central South University Changsha China Department of Computer Information Technology and Graphics Purdue University Calumet Hammond United States

Energy efficiency has become an increasingly prominent issue in cloud computing. Task consolidation is an effective way to maximise utilisation of cloud computing resources and reduce energy consumption. Presented in this paper is an improved energy-aware task consolidation algorithm to optimise the scheduling of tasks in cloud computing data centres. Our algorithm was developed based on the linear relationship between energy consumption and the CPU utilisation. Instead of consolidating tasks to a service node until its CPU utilisation reaches 100%, our algorithm uses an optimal point, where the CPU utilisation of a service node reaches 70%, and ensures that every task is preferentially assigned to service nodes that satisfy the 70% CPU utilisation. Our experiments demonstrate that our algorithm can significantly reduce the energy consumption of cloud computing data centres without performance degradation while maintaining good performance compared to the energy-conscious task consolidation (ECTC) approach. Copyright © 2017 Inderscience Enterprises Ltd.

关键词： Cloud computing

Learning a Variational Network for Reconstruction of Accelerated MRI Data

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Hammernik, Kerstin Klatzer, Teresa Kobler, Erich Recht, Michael P Sodickson, Daniel K Pock, Thomas Knol, Florian Institute of Computer Graphics and Vision Graz University of Technology Graz Austria Department of Radiology United States Nyu School of Medicine New YorkNY United States United States Nyu School of Medicine New YorkNY United States Center for Vision Ait Austrian Institute of Technology GmbH Automation & Control Vienna Austria Institute of Computer Graphics and Vision Graz University of Technology Ineldgasse 16/II Graz8010 Austria

Purpose: To allow fast and high-quality reconstruction of clinical accelerated multi-coil MR data by learning a variational network that combines the mathematical structure of variational models with deep *** and Methods: Generalized compressed sensing reconstruction formulated as a variational model is embedded in an unrolled gradient descent scheme. All parameters of this formulation, including the prior model defined by filter kernels and activation functions as well as the data term weights, are learned during an offline training procedure. The learned model can then be applied online to previously unseen ***: The variational network approach is evaluated on a clinical knee imaging protocol. The variational network reconstructions outperform standard reconstruction algorithms in terms of image quality and residual artifacts for all tested acceleration factors and sampling ***: Variational network reconstructions preserve the natural appearance of MR images as well as pathologies that were not included in the training data set. Due to its high computational performance, i.e., reconstruction time of 193 ms on a single graphics card, and the omission of parameter tuning once the network is trained, this new approach to image reconstruction can easily be integrated into clinical workflow. Copyright © 2017, The Authors. All rights reserved.

关键词： Image reconstruction

A Virtual Steel Sculpture for Structural Engineering Education: Development and Initial Findings

学校读者我要写书评

暂无评论

Journal of Educational technology Systems 2016年第4期44卷 430 - 449页

作者： Hazar Nicholas Dib Nicoletta Adamo-Villani School of Construction Management Technology and Computer Graphics Technology Purdue University West Lafayette IN USA Computer Graphics Technology Purdue University West Lafayette IN USA

We describe the development and evaluation of a virtual steel sculpture for engineering education. A good connection design requires the engineer to have a solid understanding of the mechanics and steel behavior. To help students better understand various connection types, many schools have acquired steel sculptures. A steel sculpture is a physical system that shows 48 types of connection found in standard construction practices. Unfortunately, because of its size and location, students do not always have easy access to it. The virtual sculpture described in the article can provide an effective learning alternative. It allows the students to see the sculpture from multiple points of view anywhere, anytime and shows the close-up view of each connection with description of how it may be used, potential failure modes, sample calculations, and field examples. Findings from a formative study with engineering students support the pedagogical efficacy of the interactive sculpture.

关键词： virtual learning environments steel sculptures engineering education steel design user studies

In-depth assessment of an interactive graph-based approach for the segmentation for pancreatic metastasis in ultrasound acquisitions of the liver with two specialists in Internal Medicine 10

学校读者我要写书评

暂无评论

In-depth assessment of an interactive graph-based approach f...

10th Biomedical Engineering International Conference, BMEiCON 2017

作者： Schmalstieg, Dieter Bettac, Lucas Hanle, Mark Hann, Alexander Chen, Xiaojun Grater, Tilmann Egger, Jan Zoller, Wolfram G. Institute for Computer Graphics and Vision Graz University of Technology Graz Austria Department of Internal Medicine i Ulm University Ulm Germany School of Mechanical Engineering Shanghai Jiao Tong University Shanghai China Department of Diagnostic and Interventional Radiology Ulm University Ulm Germany BioTechMed-Graz Graz Austria Department of Internal Medicine and Gastroenterology Katharinenhospital Stuttgart Germany

ISBN: (纸本)9781538608821

The manual outlining of hepatic metastasis in (US) ultrasound acquisitions from patients suffering from pancreatic cancer is common practice. However, such pure manual measurements are often very time consuming, and the results repeatedly differ between the raters. In this contribution, we study the in-depth assessment of an interactive graph-based approach for the segmentation for pancreatic metastasis in US images of the liver with two specialists in Internal Medicine. Thereby, evaluating the approach with over one hundred different acquisitions of metastases. The two physicians or the algorithm had never assessed the acquisitions before the evaluation. In summary, the physicians first performed a pure manual outlining followed by an algorithmic segmentation over one month later. As a result, the experts satisfied in up to ninety percent of algorithmic segmentation results. Furthermore, the algorithmic segmentation was much faster than manual outlining and achieved a median Dice Similarity Coefficient (DSC) of over eighty percent. Ultimately, the algorithm enables a fast and accurate segmentation of liver metastasis in clinical US images, which can support the manual outlining in daily practice. © 2017 IEEE.

关键词： Ultrasonics

Visual exploration of hierarchical data using degree-of-interest controlled by eye-tracking 9

学校读者我要写书评

暂无评论

Visual exploration of hierarchical data using degree-of-inte...

9th Forum Media technology, FMT 2016 and 2nd All Around Audio Symposium 2016

作者： Silva, Nelson Shao, Lin Schreck, T. Eggeling, Eva Fellner, Dieter W. Institute for Computer Graphics and Knowledge Visualization Graz University of Technology Austria Fraunhofer Austria Research GmbH Austria Interactive Graphics Systems Group Technische Universitaet Darmstadt Fraunhofer IGD Germany

Effective visual exploration of large data sets is an important problem. A standard technique for mapping large data sets is to use hierarchical data representations (trees, or dendrograms) that users may navigate. If the data sets get large, so do the hierarchies, and e?ective methods for the navigation are required. Traditionally, users navigate visual representations using desktop interaction modalities, including mouse interaction. Motivated by recent availability of lowcost eye-tracker systems, we investigate application possibilities to use eye-tracking for controlling the visual-interactive data exploration process. We implemented a proof-ofconcept system for visual exploration of hierarchic data, exemplified by scatter plot diagrams which are to be explored for grouping and similarity relationships. The exploration includes usage of degree-of-interest based distortion controlled by user attention read from eye-movement behavior. We present the basic elements of our system, and give an illustrative use case discussion, outlining the application possibilities. We also identify interesting future developments based on the given data views and captured eye-tracking information. Copyright © 2016 by the paper's authors.

关键词： Eye tracking

Total roto-translational variation

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Chambolle, Antonin Pock, Thomas CMAP Ecole Polytechnique CNRS Palaiseau91128 France Institute for Computer Graphics and Vision Graz University of Technology Graz8010 Austria Center for Vision Automation & Control AIT Austrian Institute of Technology GmbH Vienna1220 Austria

We consider curvature depending variational models for image regularization, such as Euler’s elastica. These models are known to provide strong priors for the continuity of edges and hence have important applications in shape- and image processing. We consider a lifted convex representation of these models in the roto-translation space: In this space, curvature depending variational energies are represented by means of a convex functional defined on divergence free vector fields. The line energies are then easily extended to any scalar function. It yields a natural generalization of the total variation to the roto-translation space. As our main result, we show that the proposed convex representation is tight for characteristic functions of smooth shapes. We also discuss cases where this representation fails. For numerical solution, we propose a staggered grid discretization based on an averaged Raviart-Thomas finite elements approximation. This discretization is consistent, up to minor details, with the underlying continuous model. The resulting non-smooth convex optimization problem is solved using a first-order primal-dual algorithm. We illustrate the results of our numerical algorithm on various problems from shape- and image processing.53A04 49Q20 26A45 35J35 53A40 65K10MSC Codes 53A04 49Q20 26A45 35J35 53A40 65K10 Copyright © 2017, The Authors. All rights reserved.

关键词： Relaxation processes

Clinical evaluation of semi-automatic opensource algorithmic software segmentation of the mandibular bone: Practical feasibility and assessment of a new course of action

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Wallner, Jürgen Hochegger, Kerstin Chen, Xiaojun Mischak, Irene Reinbacher, Knut Pau, Mauro Zrnc, Tomislav Schwenzer-Zimmerer, Katja Zemann, Wolfgang Schmalstieg, Dieter Egger, Jan Department of Oral & Maxillofacial Surgery Medical University of Graz Auenbruggerplatz 5/1 Graz Austria Laboratory Graz Austria Institute for Computer Graphics and Vision Graz University of Technology Inffeldgasse 16c/II Graz Austria School of Mechanical Engineering Shanghai Jiao Tong University Shanghai China Department of Dental Medicine and Oral Health Medical University of Graz Billrothgasse 4 Graz Austria BioTechMed-Graz Krenngasse 37/1 Graz Austria

Introduction: computer assisted technologies based on algorithmic software segmentation are an increasing topic of interest in complex surgical cases. However-due to functional instability, time consuming software processes, personnel resources or licensed-based financial costs many segmentation processes are often outsourced from clinical centers to third parties and the industry. Therefore, the aim of this trial was to assess the practical feasibility of an easy available, functional stable and licensed-free segmentation approach to be used in the clinical practice. Material and methods: In this retrospective, randomized, controlled trail the accuracy and accordance of the opensource based segmentation algorithm GrowCut was assessed through the comparison to the manually generated ground truth of the same anatomy using 10 CT lower jaw data-sets from the clinical routine. Assessment parameters were the segmentation time, the volume, the voxel number, the Dice Score and the Hausdorff distance. Results: Overall semi-automatic GrowCut segmentation times were about one minute. Mean Dice Score values of over 85% and Hausdorff Distances below 33.5 voxel could be achieved between the algorithmic GrowCut-based segmentations and the manual generated ground truth schemes. Statistical differences between the assessment parameters were not significant (p0.94) for any of the comparison made between the two groups. Discussion: Complete functional stable and time saving segmentations with high accuracy and high positive correlation could be performed by the presented interactive open-source based approach. In the cranio-maxillofacial complex the used method could represent an algorithmic alternative for image-based segmentation in the clinical practice for e.g. surgical treatment planning or visualization of postoperative results and offers several advantages. Due to an open-source basis the used method could be further developed by other groups or specialists. Systematic compari

关键词： Geometry

A soft union based method for virtual restoration and 3D printing of cultural heritage objects

学校读者我要写书评

暂无评论

A soft union based method for virtual restoration and 3D pri...

2016 Eurographics Workshop on graphics and Cultural Heritage, GCH 2016

作者： Gregor, R. Mavridis, P. Wiltsche, A. Schreck, T. Graz University of Technology Institute of Computer Graphics and Knowledge Visualization Austria Graz University of Technology Institut für Architektur und Medien Austria

ISBN: (纸本)9783038680116

Recent improvements in 3D acquisition and shape processing methods lead to increased digitization of 3D Cultural Heritage (CH) objects. Beyond the mere digital archival of CH artifacts, there is an emerging research area dedicated to digital restoration of 3D Cultural Heritage artifacts. In particular several methods have been published recently that, from a digitized set of fragments, enable their reassembly or even the synthesis of missing or eroded parts. Usually the result of such methods is a set of aligned but disconnected parts. However, it is often desirable to produce a single, watertight mesh that can be easily 3D printed. We propose a method based on a volumetric soft union operation that can be used to combine such sets of aligned fragments to a single manifold mesh while producing smooth and plausible geometry at the seams. We assess its visual quality and efficiency in comparison to an adaption of the well-known Poisson Reconstruction method. Finally, we provide practical insights on printing the results produced by our method on digitized fragments of real CH objects. © 2016 The Author(s) Eurographics Proceedings © 2016 The Eurographics Association.

关键词： 3D printers

Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Pock, Thomas Sabach, Shoham Institute of Computer Graphics and Vision Graz University of Technology Graz8010 Austria Digital Safety and Security Department Ait Austrian Institute of Technology GmbH Vienna1220 Austria Department of Industrial Engineering and Management Technion-Israel Institute of Technology Haifa3200003 Israel

In this paper we study nonconvex and nonsmooth optimization problems with semi-algebraic data, where the variables vector is split into several blocks of variables. The problem consists of one smooth function of the entire variables vector and the sum of nonsmooth functions for each block separately. We analyze an inertial version of the Proximal Alternating Linearized Minimization (PALM) algorithm and prove its global convergence to a critical point of the objective function at hand. We illustrate our theoretical findings by presenting numerical experiments on blind image deconvolution, on sparse non-negative matrix factorization and on dictionary learning, which demonstrate the viability and effectiveness of the proposed method. Copyright © 2017, The Authors. All rights reserved.

关键词： Linearization