liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Museth, Ken
Publications (10 of 43) Show all publications
Nilsson, O., Reimers, M., Museth, K. & Brun, A. (2013). A NEW ALGORITHM FOR COMPUTING RIEMANNIAN GEODESIC DISTANCE IN RECTANGULAR 2-D AND 3-D GRIDS. International journal on artificial intelligence tools, 22(6)
Open this publication in new window or tab >>A NEW ALGORITHM FOR COMPUTING RIEMANNIAN GEODESIC DISTANCE IN RECTANGULAR 2-D AND 3-D GRIDS
2013 (English)In: International journal on artificial intelligence tools, ISSN 0218-2130, Vol. 22, no 6Article in journal (Refereed) Published
Abstract [en]

We present a novel way to efficiently compute Riemannian geodesic distance over a two- or three-dimensional domain. It is based on a previously presented method for computation of geodesic distances on surface meshes. Our method is adapted for rectangular grids, equipped with a variable anisotropic metric tensor. Processing and visualization of such tensor fields is common in certain applications, for instance structure tensor fields in image analysis and diffusion tensor fields in medical imaging. The included benchmark study shows that our method provides significantly better results in anisotropic regions in 2-D and 3-D and is faster than current stat-of-the-art solvers in 2-D grids. Additionally, our method is straightforward to code; the test implementation is less than 150 lines of C++ code. The paper is an extension of a previously presented conference paper and includes new sections on 3-D grids in particular.

Place, publisher, year, edition, pages
World Scientific Publishing, 2013
Keywords
Geodesic distance; the eikonal equation; manifold
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-103725 (URN)10.1142/S0218213013600208 (DOI)000329050600009 ()
Available from: 2014-01-24 Created: 2014-01-24 Last updated: 2018-02-13
Söderström, A., Karlsson, M. & Museth, K. (2010). A PML Based Non-Reflective Boundary for Free Surface Fluid Animation. ACM Transactions on Graphics, 29(5), 136
Open this publication in new window or tab >>A PML Based Non-Reflective Boundary for Free Surface Fluid Animation
2010 (English)In: ACM Transactions on Graphics, ISSN 0730-0301, E-ISSN 1557-7368, Vol. 29, no 5, p. 136-Article in journal (Refereed) Published
Abstract [en]

This article presents a novel non-reflective boundary condition for the free surface incompressible Euler and Navier-Stokes equations. Boundaries of this type are very useful when, for example, simulating water flow around a ship moving over a wide ocean. Normally waves generated by the ship will reflect off of the boundaries of the simulation domain and as these reflected waves returns towards the ship they will cause undesired interference patterns.By employing a Perfectly Matched Layer (PML) approach we have derived a boundary condition that absorbs incoming waves and thus efficiently prevents these undesired wave reflections. To solve the resulting boundary equations we present a fast and stable algorithm based on the Stable Fluids approach. Through numerical experiments we then show that our boundaries are significantly more effective than simpler reflection preventing techniques. We also provide a thorough analysis of the parameters involved in our boundary formulation and show how they effect wave absorption efficiency.

Place, publisher, year, edition, pages
New York, NY, USA: ACM, 2010
Keywords
Computational fluid dynamics, Free surface, Stable Fluids, Euler equations, Navier-Stokes equations, Non-reflecting boundary condition, Perfectly matched layer
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-60850 (URN)10.1145/1857907.1857912 (DOI)000284285600005 ()
Available from: 2010-10-28 Created: 2010-10-28 Last updated: 2017-12-12
Söderström, A. & Museth, K. (2010). A Spatially Adaptive Morphological Filter For Dual-Resolution Interface Tracking Of Fluids. Paper presented at 31st Annual Confererence of the European Association for Computer Graphics, 3-7 May, Norrköping, Sweden. Norrköping, Sweden: Eurographics Association
Open this publication in new window or tab >>A Spatially Adaptive Morphological Filter For Dual-Resolution Interface Tracking Of Fluids
2010 (English)Conference paper, Published paper (Refereed)
Abstract [en]

We present a novel surface-tracking technique for free-surface fluid animations. Unlike the semi-implicit Particle Level Set method (PLS) our interface-tracking approach is purely implicit and hence avoids some of the well-known issues like surface noise and inflated memory footprints. Where PLS augments the interface with Lagrangian tracker-particles, we instead employ a higher resolution level set represented as a DT-Grid. The synchronization of our dual-resolution level sets is facilitated by a novel Spatially Adaptive Morphological (SAM) filter that attempts to preserve fine details while still avoiding spurious topology changes and boundary violations. We demonstrate that our approach can achieve comparative results to the PLS, but with a fraction of the memory footprint. We also show how our technique can be used to effectively enhance thin interface sheets at the cost of volume gain.

Place, publisher, year, edition, pages
Norrköping, Sweden: Eurographics Association, 2010
Series
EG 2010 - Short papers, ISSN 1017-4656
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-60851 (URN)
Conference
31st Annual Confererence of the European Association for Computer Graphics, 3-7 May, Norrköping, Sweden
Available from: 2010-10-28 Created: 2010-10-28 Last updated: 2010-11-16
Söderström, A. & Museth, K. (2009). Non-reflective boundary conditions for incompressible free surface fluids in SIGGRAPH 2009: Talks, SIGGRAPH 09, vol , issue , pp. In: SIGGRAPH 2009: Talks, SIGGRAPH 09: . Paper presented at SIGGRAPH 2009: Talks, SIGGRAPH '09; New Orleans, LA; United States. New York: ACM
Open this publication in new window or tab >>Non-reflective boundary conditions for incompressible free surface fluids in SIGGRAPH 2009: Talks, SIGGRAPH 09, vol , issue , pp
2009 (English)In: SIGGRAPH 2009: Talks, SIGGRAPH 09, New York: ACM , 2009Conference paper, Published paper (Refereed)
Abstract [en]

We have developed a novel approach to open-boundaries for fluid animations. More specifically we present a highly efficient energy absorbing boundary condition for the incompressible Navier-Stokes equations in the prescence of a free surface. Our work extends and adapts a Perfectly Matched Layer (PML) approach [Berenger 1994; Johnson 2007], recently developed for the Navier-Stokes equations, to free surfaces in the context fluid animations. We show how our PML boundary condition is able to effectively eliminate reflections generated by the presence of solid boundaries in the simulation domain, and that our method is far superior to simpler approaches for reducing wave reflection. Furthermore, we have adapted our theoretical PML model to work with the Stable-Fluids Eulerian Navier-Stokes solver commonly used in computer graphics. Finally, we show that the cost of deploying our method in terms of memory and additional computations is small, and for a given quality significantly less than other known methods.

Place, publisher, year, edition, pages
New York: ACM, 2009
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-52964 (URN)10.1145/1597990.1597994 (DOI)978-1-60558-834-6 (ISBN)
Conference
SIGGRAPH 2009: Talks, SIGGRAPH '09; New Orleans, LA; United States
Available from: 2010-01-14 Created: 2010-01-14 Last updated: 2014-09-01
Brodersen, A., Museth, K., Porumbescu, S. & Budge, B. (2008). Geometric Texturing Using Level Sets. IEEE Transactions on Visualization and Computer Graphics, 14(2), 277-288
Open this publication in new window or tab >>Geometric Texturing Using Level Sets
2008 (English)In: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, E-ISSN 1941-0506, Vol. 14, no 2, p. 277-288Article in journal (Refereed) Published
Abstract [en]

We present techniques for warping and blending (or subtracting) geometric textures onto surfaces represented by high resolution level sets. The geometric texture itself can be represented either explicitly as a polygonal mesh or implicitly as a level set. Unlike previous approaches, we can produce topologically connected surfaces with smooth blending and low distortion. Specifically, we offer two different solutions to the problem of adding fine-scale geometric detail to surfaces. Both solutions assume a level set representation of the base surface which is easily achieved by means of a mesh-to-level-set scan conversion. To facilitate our mapping, we parameterize the embedding space of the base level set surface using fast particle advection. We can then warp explicit texture meshes onto this surface at nearly interactive speeds or blend level set representations of the texture to produce high-quality surfaces with smooth transitions.

Keywords
Geometric texture mapping, parameterization, implicit surfaces, volume texturing, geometric modeling
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-36946 (URN)10.1109/TVCG.2007.70408 (DOI)33132 (Local ID)33132 (Archive number)33132 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2017-12-13
Braude, I., Marker, J., Museth, K., Nissanov, J. & Breen, D. (2007). Contour-based surface reconstruction using MPU implicit models. Graphical Models, 69(2), 139-157
Open this publication in new window or tab >>Contour-based surface reconstruction using MPU implicit models
Show others...
2007 (English)In: Graphical Models, ISSN 1524-0703, E-ISSN 1524-0711, Vol. 69, no 2, p. 139-157Article in journal (Refereed) Published
Abstract [en]

This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that make up the contours as points in R3 and employs multi-level partition of unity (MPU) implicit models to create a surface that approximately fits to the 3D points. Since MPU implicit models additionally require surface normal information at each point, an algorithm that estimates normals from the contour data is also described. Contour data frequently contains noise from the scanning and delineation process. MPU implicit models provide a superior approach to the problem of contour-based surface reconstruction, especially in the presence of noise, because they are based on adaptive implicit functions that locally approximate the points within a controllable error bound. We demonstrate the effectiveness of our technique with a number of example datasets, providing images and error statistics generated from our results. © 2006 Elsevier Inc. All rights reserved.

Keywords
Contours, Implicit models, Multi-level partition of unity, Normal estimation, Surface reconstruction
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-49980 (URN)10.1016/j.gmod.2006.09.007 (DOI)
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-12-12
Johansson Läthén, G., Museth, K. & Carr, H. (2007). Flexible and Topologically Localized Segmentation. In: Ken Museth, Torsten Möller, and Anders Ynnerman (Ed.), EuroVis07 Joint Eurographics: IEEE VGTC Symposium on Visualization. Paper presented at Eurographics/ IEEE-VGTC Symposium on Visualization, 23-25 May, Norrköping, Sweden (pp. 179-186). Aire-la-Ville, Switzerland: Eurographics Association
Open this publication in new window or tab >>Flexible and Topologically Localized Segmentation
2007 (English)In: EuroVis07 Joint Eurographics: IEEE VGTC Symposium on Visualization / [ed] Ken Museth, Torsten Möller, and Anders Ynnerman, Aire-la-Ville, Switzerland: Eurographics Association , 2007, , p. 179-186p. 179-186Conference paper, Published paper (Refereed)
Abstract [en]

One of the most common visualization tasks is the extraction of significant boundaries, often performed with iso- surfaces or level set segmentation. Isosurface extraction is simple and can be guided by geometric and topological analysis, yet frequently does not extract the desired boundary. Level set segmentation is better at boundary extrac- tion, but either leads to global segmentation without edges, [CV01], that scales unfavorably in 3D or requires an initial estimate of the boundary from which to locally solve segmentation with edges. We propose a hybrid system in which topological analysis is used for semi-automatic initialization of a level set segmentation, and geometric information bounded topologically is used to guide and accelerate an iterative segmentation algorithm that com- bines several state-of-the-art level set terms. We thus combine and improve both the flexible isosurface interface and level set segmentation without edges.

Place, publisher, year, edition, pages
Aire-la-Ville, Switzerland: Eurographics Association, 2007. p. 179-186
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-40841 (URN)54293 (Local ID)978-3-905673-45-6 (ISBN)54293 (Archive number)54293 (OAI)
Conference
Eurographics/ IEEE-VGTC Symposium on Visualization, 23-25 May, Norrköping, Sweden
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2013-09-19
Nielsen, M. B., Nilsson, O., Söderström, A. & Museth, K. (2007). Out-of-core and compressed level set methods. ACM Transactions on Graphics, 26(4), 16
Open this publication in new window or tab >>Out-of-core and compressed level set methods
2007 (English)In: ACM Transactions on Graphics, ISSN 0730-0301, E-ISSN 1557-7368, Vol. 26, no 4, p. 16-Article in journal (Refereed) Published
Abstract [en]

This article presents a generic framework for the representation and deformation of level set surfaces at extreme resolutions. The framework is composed of two modules that each utilize optimized and application specific algorithms: 1) A fast out-of-core data management scheme that allows for resolutions of the deforming geometry limited only by the available disk space as opposed to memory, and 2) compact and fast compression strategies that reduce both offline storage requirements and online memory footprints during simulation. Out-of-core and compression techniques have been applied to a wide range of computer graphics problems in recent years, but this article is the first to apply it in the context of level set and fluid simulations. Our framework is generic and flexible in the sense that the two modules can transparently be integrated, separately or in any combination, into existing level set and fluid simulation software based on recently proposed narrow band data structures like the DT-Grid of Nielsen and Museth [2006] and the H-RLE of Houston et al. [2006]. The framework can be applied to narrow band signed distances, fluid velocities, scalar fields, particle properties as well as standard graphics attributes like colors, texture coordinates, normals, displacements etc. In fact, our framework is applicable to a large body of computer graphics problems that involve sequential or random access to very large co-dimension one (level set) and zero (e.g. fluid) data sets. We demonstrate this with several applications, including fluid simulations interacting with large boundaries (? 15003), surface deformations (? 20483), the solution of partial differential equations on large surfaces (˜40963) and mesh-to-level set scan conversions of resolutions up to ? 350003 (7 billion voxels in the narrow band). Our out-of-core framework is shown to be several times faster than current state-of-the-art level set data structures relying on OS paging. In particular we show sustained throughput (grid points/sec) for gigabyte sized level sets as high as 65% of state-of-the-art throughput for in-core simulations. We also demonstrate that our compression techniques out-perform state-of-the-art compression algorithms for narrow bands. © 2007 ACM.

Place, publisher, year, edition, pages
ACM, 2007
Keywords
Adaptive distance fields, Compression, Computational fluid dynamics, Deformable surfaces, Geometric modeling, Implicit surfaces, Level set methods, Mesh scan conversion, Morphology, Out-of-core, Shape, Streaming
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-48333 (URN)10.1145/1289603.1289607 (DOI)
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-12-12Bibliographically approved
Läthén, G., Museth, K. & Carr, H. (2007). Topologically Localized Level Set Segmentation. In: Symposium on Image Analysis,2007 (pp. 89-92).
Open this publication in new window or tab >>Topologically Localized Level Set Segmentation
2007 (English)In: Symposium on Image Analysis,2007, 2007, p. 89-92Conference paper, Published paper (Other academic)
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-42825 (URN)69100 (Local ID)69100 (Archive number)69100 (OAI)
Projects
computer-graphics-image-processing/blood-vessel-segmentation
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2013-09-19
Marker, J., Braude, I., Museth, K. & Breen, D. (2006). Contour-Based Surface Reconstruction using Implicit Curve Fitting, and Distance Field Filtering. In: IEEE Volume Graphics,2006 (pp. 95).
Open this publication in new window or tab >>Contour-Based Surface Reconstruction using Implicit Curve Fitting, and Distance Field Filtering
2006 (English)In: IEEE Volume Graphics,2006, 2006, p. 95-Conference paper, Published paper (Refereed)
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-36943 (URN)33129 (Local ID)33129 (Archive number)33129 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2010-10-19
Organisations

Search in DiVA

Show all publications