No Cover Image

Journal article 23928 views 524 downloads

Similarity Measures for Enhancing Interactive Streamline Seeding

T McLoughlin, M. W Jones, R. S Laramee, R Malki, I Masters, C. D Hansen, Mark Jones Orcid Logo, Ian Masters Orcid Logo, Bob Laramee Orcid Logo

IEEE Transactions on Visualization and Computer Graphics, Volume: 19, Issue: 8, Pages: 1342 - 1353

Swansea University Authors: Mark Jones Orcid Logo, Ian Masters Orcid Logo, Bob Laramee Orcid Logo

Check full text

DOI (Published version): 10.1109/TVCG.2012.150

Abstract

Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relati...

Full description

Published in: IEEE Transactions on Visualization and Computer Graphics
ISSN: 1077-2626
Published: 2012
Online Access: Check full text

URI: https://cronfa.swan.ac.uk/Record/cronfa15062
Tags: Add Tag
No Tags, Be the first to tag this record!
first_indexed 2013-07-23T12:13:46Z
last_indexed 2019-06-14T19:18:43Z
id cronfa15062
recordtype SURis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2019-06-14T16:57:24.7470790</datestamp><bib-version>v2</bib-version><id>15062</id><entry>2013-06-13</entry><title>Similarity Measures for Enhancing Interactive Streamline Seeding</title><swanseaauthors><author><sid>2e1030b6e14fc9debd5d5ae7cc335562</sid><ORCID>0000-0001-8991-1190</ORCID><firstname>Mark</firstname><surname>Jones</surname><name>Mark Jones</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>6fa19551092853928cde0e6d5fac48a1</sid><ORCID>0000-0001-7667-6670</ORCID><firstname>Ian</firstname><surname>Masters</surname><name>Ian Masters</name><active>true</active><ethesisStudent>false</ethesisStudent></author><author><sid>7737f06e2186278a925f6119c48db8b1</sid><ORCID>0000-0002-3874-6145</ORCID><firstname>Bob</firstname><surname>Laramee</surname><name>Bob Laramee</name><active>true</active><ethesisStudent>false</ethesisStudent></author></swanseaauthors><date>2013-06-13</date><deptcode>SCS</deptcode><abstract>Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used.</abstract><type>Journal Article</type><journal>IEEE Transactions on Visualization and Computer Graphics</journal><volume>19</volume><journalNumber>8</journalNumber><paginationStart>1342</paginationStart><paginationEnd>1353</paginationEnd><publisher/><issnPrint>1077-2626</issnPrint><keywords/><publishedDay>3</publishedDay><publishedMonth>7</publishedMonth><publishedYear>2012</publishedYear><publishedDate>2012-07-03</publishedDate><doi>10.1109/TVCG.2012.150</doi><url>http://cs.swan.ac.uk/%7Ecsmark/PDFS/similaritymeasures.pdf</url><notes></notes><college>COLLEGE NANME</college><department>Computer Science</department><CollegeCode>COLLEGE CODE</CollegeCode><DepartmentCode>SCS</DepartmentCode><institution>Swansea University</institution><apcterm/><lastEdited>2019-06-14T16:57:24.7470790</lastEdited><Created>2013-06-13T13:57:06.0266081</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Mathematics and Computer Science - Computer Science</level></path><authors><author><firstname>T</firstname><surname>McLoughlin</surname><order>1</order></author><author><firstname>M. W</firstname><surname>Jones</surname><order>2</order></author><author><firstname>R. S</firstname><surname>Laramee</surname><order>3</order></author><author><firstname>R</firstname><surname>Malki</surname><order>4</order></author><author><firstname>I</firstname><surname>Masters</surname><order>5</order></author><author><firstname>C. D</firstname><surname>Hansen</surname><order>6</order></author><author><firstname>Mark</firstname><surname>Jones</surname><orcid>0000-0001-8991-1190</orcid><order>7</order></author><author><firstname>Ian</firstname><surname>Masters</surname><orcid>0000-0001-7667-6670</orcid><order>8</order></author><author><firstname>Bob</firstname><surname>Laramee</surname><orcid>0000-0002-3874-6145</orcid><order>9</order></author></authors><documents><document><filename>0015062-15042015114606.pdf</filename><originalFilename>similaritymeasures.pdf</originalFilename><uploaded>2015-04-15T11:46:06.6670000</uploaded><type>Output</type><contentLength>664801</contentLength><contentType>application/pdf</contentType><version>Accepted Manuscript</version><cronfaStatus>true</cronfaStatus><embargoDate>2015-04-14T00:00:00.0000000</embargoDate><documentNotes/><copyrightCorrect>true</copyrightCorrect></document></documents><OutputDurs/></rfc1807>
spelling 2019-06-14T16:57:24.7470790 v2 15062 2013-06-13 Similarity Measures for Enhancing Interactive Streamline Seeding 2e1030b6e14fc9debd5d5ae7cc335562 0000-0001-8991-1190 Mark Jones Mark Jones true false 6fa19551092853928cde0e6d5fac48a1 0000-0001-7667-6670 Ian Masters Ian Masters true false 7737f06e2186278a925f6119c48db8b1 0000-0002-3874-6145 Bob Laramee Bob Laramee true false 2013-06-13 SCS Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used. Journal Article IEEE Transactions on Visualization and Computer Graphics 19 8 1342 1353 1077-2626 3 7 2012 2012-07-03 10.1109/TVCG.2012.150 http://cs.swan.ac.uk/%7Ecsmark/PDFS/similaritymeasures.pdf COLLEGE NANME Computer Science COLLEGE CODE SCS Swansea University 2019-06-14T16:57:24.7470790 2013-06-13T13:57:06.0266081 Faculty of Science and Engineering School of Mathematics and Computer Science - Computer Science T McLoughlin 1 M. W Jones 2 R. S Laramee 3 R Malki 4 I Masters 5 C. D Hansen 6 Mark Jones 0000-0001-8991-1190 7 Ian Masters 0000-0001-7667-6670 8 Bob Laramee 0000-0002-3874-6145 9 0015062-15042015114606.pdf similaritymeasures.pdf 2015-04-15T11:46:06.6670000 Output 664801 application/pdf Accepted Manuscript true 2015-04-14T00:00:00.0000000 true
title Similarity Measures for Enhancing Interactive Streamline Seeding
spellingShingle Similarity Measures for Enhancing Interactive Streamline Seeding
Mark Jones
Ian Masters
Bob Laramee
title_short Similarity Measures for Enhancing Interactive Streamline Seeding
title_full Similarity Measures for Enhancing Interactive Streamline Seeding
title_fullStr Similarity Measures for Enhancing Interactive Streamline Seeding
title_full_unstemmed Similarity Measures for Enhancing Interactive Streamline Seeding
title_sort Similarity Measures for Enhancing Interactive Streamline Seeding
author_id_str_mv 2e1030b6e14fc9debd5d5ae7cc335562
6fa19551092853928cde0e6d5fac48a1
7737f06e2186278a925f6119c48db8b1
author_id_fullname_str_mv 2e1030b6e14fc9debd5d5ae7cc335562_***_Mark Jones
6fa19551092853928cde0e6d5fac48a1_***_Ian Masters
7737f06e2186278a925f6119c48db8b1_***_Bob Laramee
author Mark Jones
Ian Masters
Bob Laramee
author2 T McLoughlin
M. W Jones
R. S Laramee
R Malki
I Masters
C. D Hansen
Mark Jones
Ian Masters
Bob Laramee
format Journal article
container_title IEEE Transactions on Visualization and Computer Graphics
container_volume 19
container_issue 8
container_start_page 1342
publishDate 2012
institution Swansea University
issn 1077-2626
doi_str_mv 10.1109/TVCG.2012.150
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Mathematics and Computer Science - Computer Science{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Mathematics and Computer Science - Computer Science
url http://cs.swan.ac.uk/%7Ecsmark/PDFS/similaritymeasures.pdf
document_store_str 1
active_str 0
description Streamline seeding rakes are widely used in vector field visualization. We present new approaches for calculating similarity between integral curves (streamlines and pathlines). While others have used similarity distance measures, the computational expense involved with existing techniques is relatively high due to the vast number of euclidean distance tests, restricting interactivity and their use for streamline seeding rakes. We introduce the novel idea of computing streamline signatures based on a set of curve-based attributes. A signature produces a compact representation for describing a streamline. Similarity comparisons are performed by using a popular statistical measure on the derived signatures. We demonstrate that this novel scheme, including a hierarchical variant, produces good clustering results and is computed over two orders of magnitude faster than previous methods. Similarity-based clustering enables filtering of the streamlines to provide a nonuniform seeding distribution along the seeding object. We show that this method preserves the overall flow behavior while using only a small subset of the original streamline set. We apply focus + context rendering using the clusters which allows for faster and easier analysis in cases of high visual complexity and occlusion. The method provides a high level of interactivity and allows the user to easily fine tune the clustering results at runtime while avoiding any time-consuming recomputation. Our method maintains interactive rates even when hundreds of streamlines are used.
published_date 2012-07-03T03:17:12Z
_version_ 1763750373987713024
score 11.013731