Serveur d'exploration sur les relations entre la France et l'Australie

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Fast and accurate PIV computation using highly parallel iterative correlation maximization

Identifieur interne : 001B41 ( PascalFrancis/Corpus ); précédent : 001B40; suivant : 001B42

Fast and accurate PIV computation using highly parallel iterative correlation maximization

Auteurs : F. Champagnat ; A. Plyer ; G. Le Besnerais ; B. Leclaire ; S. Davoust ; Y. Le Sant

Source :

RBID : Pascal:11-0305222

Descripteurs français

English descriptors

Abstract

Our contribution deals with fast computation of dense two-component (2C) PIV vector fields using Graphics Processing Units (GPUs). We show that iterative gradient-based cross-correlation optimization is an accurate and efficient alternative to multi-pass processing with FFT-based cross-correlation. Density is meant here from the sampling point of view (we obtain one vector per pixel), since the presented algorithm, FOLKI, naturally performs fast correlation optimization over interrogation windows with maximal overlap. The processing of 5 image pairs (1,376 x 1,040 each) is achieved in less than a second on a NVIDIA Tesla C1060 GPU. Various tests on synthetic and experimental images, including a dataset of the 2nd PIV challenge, show that the accuracy of FOLKI is found comparable to that of state-of-the-art FFT-based commercial softwares, while being 50 times faster.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

pA  
A01 01  1    @0 0723-4864
A02 01      @0 EXFLDU
A03   1    @0 Exp. fluids
A05       @2 50
A06       @2 4
A08 01  1  ENG  @1 Fast and accurate PIV computation using highly parallel iterative correlation maximization
A09 01  1  ENG  @1 Eighth International Symposium on Particle Image Velocimetry (PIV'09)
A11 01  1    @1 CHAMPAGNAT (F.)
A11 02  1    @1 PLYER (A.)
A11 03  1    @1 LE BESNERAIS (G.)
A11 04  1    @1 LECLAIRE (B.)
A11 05  1    @1 DAVOUST (S.)
A11 06  1    @1 LE SANT (Y.)
A12 01  1    @1 SORIA (Julio) @9 ed.
A12 02  1    @1 CLEMENS (Noel T.) @9 ed.
A14 01      @1 Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière @2 91761 Palaiseau @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut.
A14 02      @1 Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins @2 92190 Meudon @3 FRA @Z 4 aut. @Z 5 aut. @Z 6 aut.
A15 01      @1 Laboratory for Turbulence Research in Aerospace and Combustion, Department of Mechanical and Aerospace Engineering, Monash University, Clayton Campus @2 Melbourne, VIC 3800 @3 AUS @Z 1 aut.
A15 02      @1 Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, 1 University Station C0600 @2 Austin, TX 78712 @3 USA @Z 2 aut.
A18 01  1    @1 Monash University @2 Victoria @3 AUS @9 org-cong.
A20       @1 1169-1182
A21       @1 2011
A23 01      @0 ENG
A43 01      @1 INIST @2 19904 @5 354000192957660280
A44       @0 0000 @1 © 2011 INIST-CNRS. All rights reserved.
A45       @0 3/4 p.
A47 01  1    @0 11-0305222
A60       @1 P @2 C
A61       @0 A
A64 01  1    @0 Experiments in fluids
A66 01      @0 DEU
C01 01    ENG  @0 Our contribution deals with fast computation of dense two-component (2C) PIV vector fields using Graphics Processing Units (GPUs). We show that iterative gradient-based cross-correlation optimization is an accurate and efficient alternative to multi-pass processing with FFT-based cross-correlation. Density is meant here from the sampling point of view (we obtain one vector per pixel), since the presented algorithm, FOLKI, naturally performs fast correlation optimization over interrogation windows with maximal overlap. The processing of 5 image pairs (1,376 x 1,040 each) is achieved in less than a second on a NVIDIA Tesla C1060 GPU. Various tests on synthetic and experimental images, including a dataset of the 2nd PIV challenge, show that the accuracy of FOLKI is found comparable to that of state-of-the-art FFT-based commercial softwares, while being 50 times faster.
C02 01  3    @0 001B40G80
C03 01  3  FRE  @0 Performance @5 08
C03 01  3  ENG  @0 Performance @5 08
C03 02  3  FRE  @0 Champ vectoriel @5 09
C03 02  3  ENG  @0 Vector fields @5 09
C03 03  3  FRE  @0 Algorithme @5 12
C03 03  3  ENG  @0 Algorithms @5 12
C03 04  3  FRE  @0 Méthode itérative @5 13
C03 04  3  ENG  @0 Iterative methods @5 13
C03 05  3  FRE  @0 Vélocimétrie image particule @5 17
C03 05  3  ENG  @0 Particle image velocimetry @5 17
C03 06  3  FRE  @0 Mesure vitesse @5 18
C03 06  3  ENG  @0 Velocity measurement @5 18
C03 07  3  FRE  @0 Réponse fréquence @5 29
C03 07  3  ENG  @0 Frequency response @5 29
C03 08  3  FRE  @0 Traitement image @5 30
C03 08  3  ENG  @0 Image processing @5 30
C03 09  3  FRE  @0 4780 @4 INC @5 56
N21       @1 206
pR  
A30 01  1  ENG  @1 International Symposium on Particle Image Velocimetry (PIV'09) @3 Melbourne AUS @4 2009-08-25

Format Inist (serveur)

NO : PASCAL 11-0305222 INIST
ET : Fast and accurate PIV computation using highly parallel iterative correlation maximization
AU : CHAMPAGNAT (F.); PLYER (A.); LE BESNERAIS (G.); LECLAIRE (B.); DAVOUST (S.); LE SANT (Y.); SORIA (Julio); CLEMENS (Noel T.)
AF : Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière/91761 Palaiseau/France (1 aut., 2 aut., 3 aut.); Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins/92190 Meudon/France (4 aut., 5 aut., 6 aut.); Laboratory for Turbulence Research in Aerospace and Combustion, Department of Mechanical and Aerospace Engineering, Monash University, Clayton Campus/Melbourne, VIC 3800/Australie (1 aut.); Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, 1 University Station C0600/Austin, TX 78712/Etats-Unis (2 aut.)
DT : Publication en série; Congrès; Niveau analytique
SO : Experiments in fluids; ISSN 0723-4864; Coden EXFLDU; Allemagne; Da. 2011; Vol. 50; No. 4; Pp. 1169-1182; Bibl. 3/4 p.
LA : Anglais
EA : Our contribution deals with fast computation of dense two-component (2C) PIV vector fields using Graphics Processing Units (GPUs). We show that iterative gradient-based cross-correlation optimization is an accurate and efficient alternative to multi-pass processing with FFT-based cross-correlation. Density is meant here from the sampling point of view (we obtain one vector per pixel), since the presented algorithm, FOLKI, naturally performs fast correlation optimization over interrogation windows with maximal overlap. The processing of 5 image pairs (1,376 x 1,040 each) is achieved in less than a second on a NVIDIA Tesla C1060 GPU. Various tests on synthetic and experimental images, including a dataset of the 2nd PIV challenge, show that the accuracy of FOLKI is found comparable to that of state-of-the-art FFT-based commercial softwares, while being 50 times faster.
CC : 001B40G80
FD : Performance; Champ vectoriel; Algorithme; Méthode itérative; Vélocimétrie image particule; Mesure vitesse; Réponse fréquence; Traitement image; 4780
ED : Performance; Vector fields; Algorithms; Iterative methods; Particle image velocimetry; Velocity measurement; Frequency response; Image processing
LO : INIST-19904.354000192957660280
ID : 11-0305222

Links to Exploration step

Pascal:11-0305222

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Fast and accurate PIV computation using highly parallel iterative correlation maximization</title>
<author>
<name sortKey="Champagnat, F" sort="Champagnat, F" uniqKey="Champagnat F" first="F." last="Champagnat">F. Champagnat</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Plyer, A" sort="Plyer, A" uniqKey="Plyer A" first="A." last="Plyer">A. Plyer</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Le Besnerais, G" sort="Le Besnerais, G" uniqKey="Le Besnerais G" first="G." last="Le Besnerais">G. Le Besnerais</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Leclaire, B" sort="Leclaire, B" uniqKey="Leclaire B" first="B." last="Leclaire">B. Leclaire</name>
<affiliation>
<inist:fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Davoust, S" sort="Davoust, S" uniqKey="Davoust S" first="S." last="Davoust">S. Davoust</name>
<affiliation>
<inist:fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Le Sant, Y" sort="Le Sant, Y" uniqKey="Le Sant Y" first="Y." last="Le Sant">Y. Le Sant</name>
<affiliation>
<inist:fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">11-0305222</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0305222 INIST</idno>
<idno type="RBID">Pascal:11-0305222</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001B41</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Fast and accurate PIV computation using highly parallel iterative correlation maximization</title>
<author>
<name sortKey="Champagnat, F" sort="Champagnat, F" uniqKey="Champagnat F" first="F." last="Champagnat">F. Champagnat</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Plyer, A" sort="Plyer, A" uniqKey="Plyer A" first="A." last="Plyer">A. Plyer</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Le Besnerais, G" sort="Le Besnerais, G" uniqKey="Le Besnerais G" first="G." last="Le Besnerais">G. Le Besnerais</name>
<affiliation>
<inist:fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Leclaire, B" sort="Leclaire, B" uniqKey="Leclaire B" first="B." last="Leclaire">B. Leclaire</name>
<affiliation>
<inist:fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Davoust, S" sort="Davoust, S" uniqKey="Davoust S" first="S." last="Davoust">S. Davoust</name>
<affiliation>
<inist:fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author>
<name sortKey="Le Sant, Y" sort="Le Sant, Y" uniqKey="Le Sant Y" first="Y." last="Le Sant">Y. Le Sant</name>
<affiliation>
<inist:fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series>
<title level="j" type="main">Experiments in fluids</title>
<title level="j" type="abbreviated">Exp. fluids</title>
<idno type="ISSN">0723-4864</idno>
<imprint>
<date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Experiments in fluids</title>
<title level="j" type="abbreviated">Exp. fluids</title>
<idno type="ISSN">0723-4864</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Algorithms</term>
<term>Frequency response</term>
<term>Image processing</term>
<term>Iterative methods</term>
<term>Particle image velocimetry</term>
<term>Performance</term>
<term>Vector fields</term>
<term>Velocity measurement</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Performance</term>
<term>Champ vectoriel</term>
<term>Algorithme</term>
<term>Méthode itérative</term>
<term>Vélocimétrie image particule</term>
<term>Mesure vitesse</term>
<term>Réponse fréquence</term>
<term>Traitement image</term>
<term>4780</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">Our contribution deals with fast computation of dense two-component (2C) PIV vector fields using Graphics Processing Units (GPUs). We show that iterative gradient-based cross-correlation optimization is an accurate and efficient alternative to multi-pass processing with FFT-based cross-correlation. Density is meant here from the sampling point of view (we obtain one vector per pixel), since the presented algorithm, FOLKI, naturally performs fast correlation optimization over interrogation windows with maximal overlap. The processing of 5 image pairs (1,376 x 1,040 each) is achieved in less than a second on a NVIDIA Tesla C1060 GPU. Various tests on synthetic and experimental images, including a dataset of the 2nd PIV challenge, show that the accuracy of FOLKI is found comparable to that of state-of-the-art FFT-based commercial softwares, while being 50 times faster.</div>
</front>
</TEI>
<inist>
<standard h6="B">
<pA>
<fA01 i1="01" i2="1">
<s0>0723-4864</s0>
</fA01>
<fA02 i1="01">
<s0>EXFLDU</s0>
</fA02>
<fA03 i2="1">
<s0>Exp. fluids</s0>
</fA03>
<fA05>
<s2>50</s2>
</fA05>
<fA06>
<s2>4</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG">
<s1>Fast and accurate PIV computation using highly parallel iterative correlation maximization</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG">
<s1>Eighth International Symposium on Particle Image Velocimetry (PIV'09)</s1>
</fA09>
<fA11 i1="01" i2="1">
<s1>CHAMPAGNAT (F.)</s1>
</fA11>
<fA11 i1="02" i2="1">
<s1>PLYER (A.)</s1>
</fA11>
<fA11 i1="03" i2="1">
<s1>LE BESNERAIS (G.)</s1>
</fA11>
<fA11 i1="04" i2="1">
<s1>LECLAIRE (B.)</s1>
</fA11>
<fA11 i1="05" i2="1">
<s1>DAVOUST (S.)</s1>
</fA11>
<fA11 i1="06" i2="1">
<s1>LE SANT (Y.)</s1>
</fA11>
<fA12 i1="01" i2="1">
<s1>SORIA (Julio)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1">
<s1>CLEMENS (Noel T.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01">
<s1>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière</s1>
<s2>91761 Palaiseau</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02">
<s1>Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins</s1>
<s2>92190 Meudon</s2>
<s3>FRA</s3>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
<sZ>6 aut.</sZ>
</fA14>
<fA15 i1="01">
<s1>Laboratory for Turbulence Research in Aerospace and Combustion, Department of Mechanical and Aerospace Engineering, Monash University, Clayton Campus</s1>
<s2>Melbourne, VIC 3800</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
</fA15>
<fA15 i1="02">
<s1>Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, 1 University Station C0600</s1>
<s2>Austin, TX 78712</s2>
<s3>USA</s3>
<sZ>2 aut.</sZ>
</fA15>
<fA18 i1="01" i2="1">
<s1>Monash University</s1>
<s2>Victoria</s2>
<s3>AUS</s3>
<s9>org-cong.</s9>
</fA18>
<fA20>
<s1>1169-1182</s1>
</fA20>
<fA21>
<s1>2011</s1>
</fA21>
<fA23 i1="01">
<s0>ENG</s0>
</fA23>
<fA43 i1="01">
<s1>INIST</s1>
<s2>19904</s2>
<s5>354000192957660280</s5>
</fA43>
<fA44>
<s0>0000</s0>
<s1>© 2011 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45>
<s0>3/4 p.</s0>
</fA45>
<fA47 i1="01" i2="1">
<s0>11-0305222</s0>
</fA47>
<fA60>
<s1>P</s1>
<s2>C</s2>
</fA60>
<fA61>
<s0>A</s0>
</fA61>
<fA64 i1="01" i2="1">
<s0>Experiments in fluids</s0>
</fA64>
<fA66 i1="01">
<s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG">
<s0>Our contribution deals with fast computation of dense two-component (2C) PIV vector fields using Graphics Processing Units (GPUs). We show that iterative gradient-based cross-correlation optimization is an accurate and efficient alternative to multi-pass processing with FFT-based cross-correlation. Density is meant here from the sampling point of view (we obtain one vector per pixel), since the presented algorithm, FOLKI, naturally performs fast correlation optimization over interrogation windows with maximal overlap. The processing of 5 image pairs (1,376 x 1,040 each) is achieved in less than a second on a NVIDIA Tesla C1060 GPU. Various tests on synthetic and experimental images, including a dataset of the 2nd PIV challenge, show that the accuracy of FOLKI is found comparable to that of state-of-the-art FFT-based commercial softwares, while being 50 times faster.</s0>
</fC01>
<fC02 i1="01" i2="3">
<s0>001B40G80</s0>
</fC02>
<fC03 i1="01" i2="3" l="FRE">
<s0>Performance</s0>
<s5>08</s5>
</fC03>
<fC03 i1="01" i2="3" l="ENG">
<s0>Performance</s0>
<s5>08</s5>
</fC03>
<fC03 i1="02" i2="3" l="FRE">
<s0>Champ vectoriel</s0>
<s5>09</s5>
</fC03>
<fC03 i1="02" i2="3" l="ENG">
<s0>Vector fields</s0>
<s5>09</s5>
</fC03>
<fC03 i1="03" i2="3" l="FRE">
<s0>Algorithme</s0>
<s5>12</s5>
</fC03>
<fC03 i1="03" i2="3" l="ENG">
<s0>Algorithms</s0>
<s5>12</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE">
<s0>Méthode itérative</s0>
<s5>13</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG">
<s0>Iterative methods</s0>
<s5>13</s5>
</fC03>
<fC03 i1="05" i2="3" l="FRE">
<s0>Vélocimétrie image particule</s0>
<s5>17</s5>
</fC03>
<fC03 i1="05" i2="3" l="ENG">
<s0>Particle image velocimetry</s0>
<s5>17</s5>
</fC03>
<fC03 i1="06" i2="3" l="FRE">
<s0>Mesure vitesse</s0>
<s5>18</s5>
</fC03>
<fC03 i1="06" i2="3" l="ENG">
<s0>Velocity measurement</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="3" l="FRE">
<s0>Réponse fréquence</s0>
<s5>29</s5>
</fC03>
<fC03 i1="07" i2="3" l="ENG">
<s0>Frequency response</s0>
<s5>29</s5>
</fC03>
<fC03 i1="08" i2="3" l="FRE">
<s0>Traitement image</s0>
<s5>30</s5>
</fC03>
<fC03 i1="08" i2="3" l="ENG">
<s0>Image processing</s0>
<s5>30</s5>
</fC03>
<fC03 i1="09" i2="3" l="FRE">
<s0>4780</s0>
<s4>INC</s4>
<s5>56</s5>
</fC03>
<fN21>
<s1>206</s1>
</fN21>
</pA>
<pR>
<fA30 i1="01" i2="1" l="ENG">
<s1>International Symposium on Particle Image Velocimetry (PIV'09)</s1>
<s3>Melbourne AUS</s3>
<s4>2009-08-25</s4>
</fA30>
</pR>
</standard>
<server>
<NO>PASCAL 11-0305222 INIST</NO>
<ET>Fast and accurate PIV computation using highly parallel iterative correlation maximization</ET>
<AU>CHAMPAGNAT (F.); PLYER (A.); LE BESNERAIS (G.); LECLAIRE (B.); DAVOUST (S.); LE SANT (Y.); SORIA (Julio); CLEMENS (Noel T.)</AU>
<AF>Modeling and Information Processing Department, French Aerospace Lab (ONERA), Chemin de la Hunière/91761 Palaiseau/France (1 aut., 2 aut., 3 aut.); Fundamental and Experimental Aerodynamics Department, French Aerospace Lab (ONERA), 8 rue des Vertugadins/92190 Meudon/France (4 aut., 5 aut., 6 aut.); Laboratory for Turbulence Research in Aerospace and Combustion, Department of Mechanical and Aerospace Engineering, Monash University, Clayton Campus/Melbourne, VIC 3800/Australie (1 aut.); Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, 1 University Station C0600/Austin, TX 78712/Etats-Unis (2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Experiments in fluids; ISSN 0723-4864; Coden EXFLDU; Allemagne; Da. 2011; Vol. 50; No. 4; Pp. 1169-1182; Bibl. 3/4 p.</SO>
<LA>Anglais</LA>
<EA>Our contribution deals with fast computation of dense two-component (2C) PIV vector fields using Graphics Processing Units (GPUs). We show that iterative gradient-based cross-correlation optimization is an accurate and efficient alternative to multi-pass processing with FFT-based cross-correlation. Density is meant here from the sampling point of view (we obtain one vector per pixel), since the presented algorithm, FOLKI, naturally performs fast correlation optimization over interrogation windows with maximal overlap. The processing of 5 image pairs (1,376 x 1,040 each) is achieved in less than a second on a NVIDIA Tesla C1060 GPU. Various tests on synthetic and experimental images, including a dataset of the 2nd PIV challenge, show that the accuracy of FOLKI is found comparable to that of state-of-the-art FFT-based commercial softwares, while being 50 times faster.</EA>
<CC>001B40G80</CC>
<FD>Performance; Champ vectoriel; Algorithme; Méthode itérative; Vélocimétrie image particule; Mesure vitesse; Réponse fréquence; Traitement image; 4780</FD>
<ED>Performance; Vector fields; Algorithms; Iterative methods; Particle image velocimetry; Velocity measurement; Frequency response; Image processing</ED>
<LO>INIST-19904.354000192957660280</LO>
<ID>11-0305222</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001B41 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 001B41 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Asie
   |area=    AustralieFrV1
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:11-0305222
   |texte=   Fast and accurate PIV computation using highly parallel iterative correlation maximization
}}

Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Tue Dec 5 10:43:12 2017. Site generation: Tue Mar 5 14:07:20 2024