Guided Mesh Normal Filtering

The joint bilateral filter is a variant of the standard bilateral filter, where the range kernel is evaluated using a guidance signal instead of the original signal. It has been successfully applied to various image processing problems, where it provides more flexibility than the standard bilateral...

Full description

Saved in:

Bibliographic Details
Published in:	Computer graphics forum Vol. 34; no. 7; pp. 23 - 34
Main Authors:	Zhang, Wangyu, Deng, Bailin, Zhang, Juyong, Bouaziz, Sofien, Liu, Ligang
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.10.2015
Subjects:	and systems Categories and Subject Descriptors (according to ACM CCS) Computer science Construction Filtering Filters Filtration Flexibility I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems Image processing Image processing systems Kernels languages Orientation Studies United States > US
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	The joint bilateral filter is a variant of the standard bilateral filter, where the range kernel is evaluated using a guidance signal instead of the original signal. It has been successfully applied to various image processing problems, where it provides more flexibility than the standard bilateral filter to achieve high quality results. On the other hand, its success is heavily dependent on the guidance signal, which should ideally provide a robust estimation about the features of the output signal. Such a guidance signal is not always easy to construct. In this paper, we propose a novel mesh normal filtering framework based on the joint bilateral filter, with applications in mesh denoising. Our framework is designed as a two‐stage process: first, we apply joint bilateral filtering to the face normals, using a properly constructed normal field as the guidance; afterwards, the vertex positions are updated according to the filtered face normals. We compute the guidance normal on a face using a neighboring patch with the most consistent normal orientations, which provides a reliable estimation of the true normal even with a high‐level of noise. The effectiveness of our approach is validated by extensive experimental results.
AbstractList	The joint bilateral filter is a variant of the standard bilateral filter, where the range kernel is evaluated using a guidance signal instead of the original signal. It has been successfully applied to various image processing problems, where it provides more flexibility than the standard bilateral filter to achieve high quality results. On the other hand, its success is heavily dependent on the guidance signal, which should ideally provide a robust estimation about the features of the output signal. Such a guidance signal is not always easy to construct. In this paper, we propose a novel mesh normal filtering framework based on the joint bilateral filter, with applications in mesh denoising. Our framework is designed as a two‐stage process: first, we apply joint bilateral filtering to the face normals, using a properly constructed normal field as the guidance; afterwards, the vertex positions are updated according to the filtered face normals. We compute the guidance normal on a face using a neighboring patch with the most consistent normal orientations, which provides a reliable estimation of the true normal even with a high‐level of noise. The effectiveness of our approach is validated by extensive experimental results.
Author	Deng, Bailin Liu, Ligang Zhang, Wangyu Bouaziz, Sofien Zhang, Juyong
Author_xml	– sequence: 1 givenname: Wangyu surname: Zhang fullname: Zhang, Wangyu organization: University of Science and Technology of China – sequence: 2 givenname: Bailin surname: Deng fullname: Deng, Bailin organization: École polytechnique fédérale de Lausanne – sequence: 3 givenname: Juyong surname: Zhang fullname: Zhang, Juyong email: juyong@ustc.edu.cn organization: University of Science and Technology of China – sequence: 4 givenname: Sofien surname: Bouaziz fullname: Bouaziz, Sofien organization: École polytechnique fédérale de Lausanne – sequence: 5 givenname: Ligang surname: Liu fullname: Liu, Ligang organization: University of Science and Technology of China
BookMark	eNp9kL1PwzAQxS1UJNrAwM5QiQWGtLZjx8mIWhoQpSx8jJYbX4pLmhQ7EfS_x1BgqAS33On0e-9Or4c6VV0BQscED4ivYb4oBoQKRvdQl7BYhEnM0w7qYuJngTk_QD3nlhhjJmLeRSdZazTo_i245_6stitV9iembMCaanGI9gtVOjj67gF6mFzej67C6V12PbqYhjnDEQ01oSpOIuB5XKQRLwTTlGqYs5wT4hdcKaCKsbTAlGisOMyVYlp4XGNIdBSgs63v2tavLbhGrozLoSxVBXXrJBExJZQSfyRApzvosm5t5b_zlEdSIjDz1PmWym3tnIVCrq1ZKbuRBMvPnKTPSX7l5NnhDpubRjWmrhqrTPmf4s2UsPnbWo6yyY8i3CqMa-D9V6Hsi4xFJLh8mmWSTh9vxjRJ5Tj6ACgth0k
CitedBy_id	crossref_primary_10_1109_TVCG_2018_2802926 crossref_primary_10_1109_TVCG_2021_3055242 crossref_primary_10_1109_ACCESS_2020_3022628 crossref_primary_10_1137_24M1646121 crossref_primary_10_1109_TVCG_2019_2944357 crossref_primary_10_1109_ACCESS_2019_2894533 crossref_primary_10_3390_s21020412 crossref_primary_10_1145_3550454_3555443 crossref_primary_10_1007_s00371_025_04025_1 crossref_primary_10_1007_s10851_020_00965_6 crossref_primary_10_1109_TVCG_2020_3045490 crossref_primary_10_1007_s00371_017_1431_4 crossref_primary_10_1016_j_powtec_2018_06_020 crossref_primary_10_1016_j_cviu_2025_104278 crossref_primary_10_1117_1_JEI_31_4_043022 crossref_primary_10_1088_1361_6501_ad317e crossref_primary_10_1109_ACCESS_2020_2981161 crossref_primary_10_1016_j_cagd_2025_102477 crossref_primary_10_1137_17M115743X crossref_primary_10_1109_ACCESS_2020_3025227 crossref_primary_10_3390_rs13112145 crossref_primary_10_1137_21M1397945 crossref_primary_10_1109_TVCG_2020_3001681 crossref_primary_10_1109_TNNLS_2024_3367327 crossref_primary_10_1007_s11042_024_18390_x crossref_primary_10_1145_3414685_3417849 crossref_primary_10_1016_j_gmod_2018_12_002 crossref_primary_10_1016_j_cag_2020_09_016 crossref_primary_10_1016_j_cad_2018_01_003 crossref_primary_10_1109_TVCG_2018_2828818 crossref_primary_10_1016_j_cmpb_2024_108061 crossref_primary_10_1109_TVCG_2018_2865363 crossref_primary_10_1016_j_cagd_2017_02_011 crossref_primary_10_1111_cgf_13863 crossref_primary_10_1016_j_cag_2017_07_028 crossref_primary_10_1007_s00371_017_1434_1 crossref_primary_10_1016_j_cagd_2023_102204 crossref_primary_10_3390_e26040319 crossref_primary_10_1007_s11042_017_5258_9 crossref_primary_10_1109_TVCG_2021_3088118 crossref_primary_10_1016_j_cad_2019_102804 crossref_primary_10_1016_j_cad_2019_102807 crossref_primary_10_1109_ACCESS_2019_2939362 crossref_primary_10_1109_TASE_2016_2553449 crossref_primary_10_1111_cgf_13597 crossref_primary_10_1111_cgf_13874 crossref_primary_10_1109_TVCG_2020_3026785 crossref_primary_10_1109_TCSVT_2021_3099939 crossref_primary_10_1109_LGRS_2019_2910575 crossref_primary_10_1007_s10851_022_01107_w crossref_primary_10_1016_j_cagd_2018_03_004 crossref_primary_10_1049_ipr2_12117 crossref_primary_10_1145_2980179_2980232 crossref_primary_10_3390_s18072379 crossref_primary_10_1016_j_cad_2022_103422 crossref_primary_10_1109_TIM_2021_3061247 crossref_primary_10_1109_ACCESS_2022_3164714 crossref_primary_10_1111_cgf_13322 crossref_primary_10_1007_s00530_023_01210_x crossref_primary_10_1109_TIP_2020_2969052 crossref_primary_10_1016_j_cad_2020_102858 crossref_primary_10_3390_s19051001 crossref_primary_10_1016_j_cag_2019_12_003 crossref_primary_10_1016_j_gmod_2024_101216 crossref_primary_10_1016_j_cad_2018_04_001 crossref_primary_10_1002_cav_1827 crossref_primary_10_1016_j_cad_2019_05_036 crossref_primary_10_1371_journal_pone_0310242 crossref_primary_10_3390_sym14061233 crossref_primary_10_1109_TII_2020_3003455 crossref_primary_10_1109_TVCG_2017_2731771 crossref_primary_10_1145_3480168 crossref_primary_10_1007_s00371_022_02698_6 crossref_primary_10_1007_s00371_017_1391_8 crossref_primary_10_1016_j_cad_2020_102861 crossref_primary_10_1016_j_cad_2021_103088 crossref_primary_10_1007_s00371_023_03161_w crossref_primary_10_1088_1361_6501_ab4e50 crossref_primary_10_1109_TII_2020_3000491 crossref_primary_10_1109_TVCG_2024_3378309 crossref_primary_10_1111_cgf_14993 crossref_primary_10_1111_cgf_14356 crossref_primary_10_1111_cgf_14752 crossref_primary_10_1016_j_cam_2017_04_027 crossref_primary_10_1016_j_optlaseng_2016_09_003 crossref_primary_10_1109_ACCESS_2022_3176961 crossref_primary_10_1111_cgf_13821 crossref_primary_10_1007_s11263_019_01268_z crossref_primary_10_1364_AO_446913 crossref_primary_10_1109_JAS_2024_124923 crossref_primary_10_1007_s11042_018_5735_9 crossref_primary_10_1016_j_cag_2019_05_017 crossref_primary_10_1631_FITEE_1601229 crossref_primary_10_1109_TVCG_2021_3113463 crossref_primary_10_1111_cgf_14124 crossref_primary_10_1016_j_cagd_2019_04_013 crossref_primary_10_1109_ACCESS_2020_2987046 crossref_primary_10_1111_cgf_13556 crossref_primary_10_1109_TVCG_2019_2920817 crossref_primary_10_1109_TVCG_2018_2816926 crossref_primary_10_1016_j_cad_2019_05_027 crossref_primary_10_1109_TVCG_2020_3005424 crossref_primary_10_1145_3272127_3275047 crossref_primary_10_1109_TVCG_2017_2740384 crossref_primary_10_1145_3625098 crossref_primary_10_1016_j_cag_2018_05_003
Cites_doi	10.1145/1281500.1281602 10.1145/2461912.2461965 10.1111/cgf.12187 10.1007/11744023_17 10.1145/1015706.1015778 10.1016/j.cagd.2015.03.011 10.1016/j.cagd.2010.10.001 10.1109/TVCG.2007.1065 10.1145/2601097.2601188 10.1109/TVCG.2009.70 10.1016/j.cagd.2007.12.008 10.1145/882262.882367 10.1016/j.cagd.2005.04.003 10.1145/882262.882368 10.1145/1276377.1276497 10.1109/TVCG.2010.264 10.1109/TVCG.2014.2326872 10.1145/1015706.1015777 10.1145/566654.566574 10.1145/2421636.2421645 10.1109/TVCG.2006.60 10.1145/1073204.1073272 10.1145/1281500.1281640 10.1145/1141911.1142018 10.1109/MCG.2004.14 10.1561/2200000015 10.1016/j.cad.2012.03.001
ContentType	Journal Article
Copyright	2015 The Author(s) Computer Graphics Forum © 2015 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. 2015 The Eurographics Association and John Wiley & Sons Ltd.
Copyright_xml	– notice: 2015 The Author(s) Computer Graphics Forum © 2015 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley & Sons Ltd. – notice: 2015 The Eurographics Association and John Wiley & Sons Ltd.
DBID	BSCLL AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1111/cgf.12742
DatabaseName	Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Computer and Information Systems Abstracts Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1467-8659
EndPage	34
ExternalDocumentID	3836611011 10_1111_cgf_12742 CGF12742 ark_67375_WNG_2LVKD289_D
Genre	article Feature
GeographicLocations	United States--US
GeographicLocations_xml	– name: United States--US
GroupedDBID	.3N .4S .DC .GA .Y3 05W 0R~ 10A 15B 1OB 1OC 29F 31~ 33P 3SF 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5HH 5LA 5VS 66C 6J9 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDBF ABDPE ABEML ABPVW ACAHQ ACBWZ ACCZN ACFBH ACGFS ACPOU ACRPL ACSCC ACUHS ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEGXH AEIGN AEIMD AEMOZ AENEX AEUYR AEYWJ AFBPY AFEBI AFFNX AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AHEFC AHQJS AIDQK AIDYY AIQQE AITYG AIURR AJXKR AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALVPJ AMBMR AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL BY8 CAG COF CS3 CWDTD D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EAD EAP EBA EBO EBR EBS EBU EDO EJD EMK EST ESX F00 F01 F04 F5P FEDTE FZ0 G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A NF~ O66 O9- OIG P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QWB R.K RDJ RIWAO RJQFR ROL RX1 SAMSI SUPJJ TH9 TN5 TUS UB1 V8K W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 ZL0 ZZTAW ~IA ~IF ~WT AAHHS ACCFJ ADZOD AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE ALUQN WRC AAYXX CITATION O8X 7SC 8FD JQ2 L7M L~C L~D F28 FR3
ID	FETCH-LOGICAL-c4032-d12a683e5c6f935f74d22deb4c5119355aae2a449f021d0a5ebaa4d7c6fd0e8d3
IEDL.DBID	DRFUL
ISICitedReferencesCount	147
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000363216500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0167-7055
IngestDate	Thu Sep 04 17:05:15 EDT 2025 Fri Jul 25 02:23:16 EDT 2025 Sat Nov 29 03:41:12 EST 2025 Tue Nov 18 21:56:39 EST 2025 Wed Jan 22 16:28:20 EST 2025 Tue Nov 11 03:33:44 EST 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	7
Language	English
License	http://doi.wiley.com/10.1002/tdm_license_1.1
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c4032-d12a683e5c6f935f74d22deb4c5119355aae2a449f021d0a5ebaa4d7c6fd0e8d3
Notes	Supporting InformationSupporting Information ArticleID:CGF12742 istex:B26749777A1B5E16A428080F36D4EB16B2104156 ark:/67375/WNG-2LVKD289-D SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
OpenAccessLink	https://infoscience.epfl.ch/handle/20.500.14299/121165
PQID	1722191704
PQPubID	30877
PageCount	12
ParticipantIDs	proquest_miscellaneous_1762122168 proquest_journals_1722191704 crossref_primary_10_1111_cgf_12742 crossref_citationtrail_10_1111_cgf_12742 wiley_primary_10_1111_cgf_12742_CGF12742 istex_primary_ark_67375_WNG_2LVKD289_D
PublicationCentury	2000
PublicationDate	October 2015
PublicationDateYYYYMMDD	2015-10-01
PublicationDate_xml	– month: 10 year: 2015 text: October 2015
PublicationDecade	2010
PublicationPlace	Oxford
PublicationPlace_xml	– name: Oxford
PublicationTitle	Computer graphics forum
PublicationTitleAlternate	Computer Graphics Forum
PublicationYear	2015
Publisher	Blackwell Publishing Ltd
Publisher_xml	– name: Blackwell Publishing Ltd
References	Jones T., Durand F., Zwicker M.: Normal improvement for point rendering. IEEE Computer Graphics and Applications 24, 4 (2004), 53-56. 2 Eisemann E., Durand F.: Flash photography enhancement via intrinsic relighting. ACM Trans. Graph. 23, 3 (2004), 673-678. 1, 2, 4 Wei M., Yu J., Pang W.-M., Wang J., Qin J., Liu L., Heng P.-A.: Bi-normal filtering for mesh denoising. IEEE Trans. Vis. Comput. Graphics 21, 1 (2015), 43-55. 3, 9, 10, 11 Durand F., Dorsey J.: Fast bilateral filtering for the display of high-dynamic-range images. ACM Trans. Graph. 21, 3 (2002), 257-266. 2 He L., Schaefer S.: Mesh denoising via l0 minimization. ACM Trans. Graph. 32, 4 (2013), 64:1-64:8. 3, 8, 9, 10 Winnemöller H. Olsen S.C., Gooch B.: Realtime video abstraction. ACM Trans. Graph. 25, 3 (2006). 2 Chen C.-Y., Cheng K.-Y.: A sharpness dependent filter for mesh smoothing. Computer Aided Geometric Design 22, 5 (2005), 376-391. 3 Jones T.R., Durand F., Desbrun M.: Non-iterative, feature-preserving mesh smoothing. ACM Trans. Graph. 22, 3 (2003), 943-949. 1, 2, 3, 8, 9, 10 Petschnigg G., Szeliski R., Agrawala M., Cohen M., Hoppe H., Toyama K.: Digital photography with flash and no-flash image pairs. ACM Trans. Graph. 23, 3 (2004), 664-672. 1, 2, 4 Bian Z., Tong R.: Feature-preserving mesh denoising based on vertices classification. Computer Aided Geometric Design 28, 1 (2011), 50-64. 3 Cho H., Lee H., Kang H., Lee S.: Bilateral texture filtering. ACM Trans. Graph. 33, 4 (2014), 128:1-128:8. 2, 7 Sun X., Rosin P.L., Martin R.R., Langbein F.C.: Fast and effective feature-preserving mesh denoising. IEEE Trans. Vis. Comput. Graphics 13, 5 (2007), 925-938. 3, 5, 8, 9, 10 Wang J., Zhang X., Yu Z.: A cascaded approach for feature-preserving surface mesh denoising. Computer-Aided Design 44, 7 (2012), 597-610. 3 Bach F.R., Jenatton R., Mairal J., Obozinski G.: Optimization with sparsity-inducing penalties. Foundations and Trends in Machine Learning 4, 1 (2012), 1-106. 7 Fan H., Yu Y., Peng Q.: Robust feature-preserving mesh denoising based on consistent subneighborhoods. IEEE Trans. Vis. Comput. Graphics 16, 2 (2010), 312-324. 3 Huang H., Wu S., Gong M., Cohen-Or D., Ascher U., Zhang H.R.: Edge-aware point set resampling. ACM Trans. Graph. 32, 1 (2013), 9:1-9:12. 3 Zheng Y., Fu H., Au O.-C., Tai C.-L.: Bilateral normal filtering for mesh denoising. IEEE Trans. Vis. Comput. Graphics 17, 10 (2011), 1521-1530. 1, 2, 3, 4, 5, 7, 8, 9, 10, 11 Kopf J., Cohen M.F., Lischinski D., Uyttendaele M.: Joint bilateral upsampling. ACM Trans. Graph. 26, 3 (2007). 2 Wang C.C.: Bilateral recovering of sharp edges on feature-insensitive sampled meshes. IEEE Trans. Vis. Comput. Graphics 12, 4 (2006), 629-639. 2 Fleishman S., Drori I., Cohen-Or D.: Bilateral mesh denoising. ACM Trans. Graph. 22, 3 (2003). 1, 2, 3, 8, 9, 10 Wang J., Xu K., Liu L., Cao J., Liu S., Yu Z., Gu X.D.: Consolidation of low-quality point clouds from outdoor scenes. Computer Graphics Forum 32, 5 (2013), 207-216. 3 Bennett E.P., McMillan L.: Video enhancement using per-pixel virtual exposures. ACM Trans. Graph. 24, 3 (2005). 2 Sun X., Rosin P.L., Martin R.R., Langbein F.C.: Random walks for feature-preserving mesh denoising. Computer Aided Geometric Design 25, 7 (2008), 437-456. 3 Wang R., Yang Z., Liu L., Deng J., Chen F.: Decoupling noise and features via weighted l1-analysis compressed sensing. ACM Trans. Graph. 33, 2 (2014), 18:1-18:12. 3, 10, 11 2010; 16 2006; 12 2004; 23 2004; 24 2008 2007 2006 2004 2011; 17 2005; 22 2007; 13 2005; 24 2014; 2 2013; 32 2002; 21 2006; 25 2015; 21 2008; 25 2015 2014 2011; 28 2012; 4 2012; 44 2014; 33 2003; 22 2007; 26 Sun (10.1111/cgf.12742-BIB0022\|cgf-cit-0022) 2008; 25 Sun (10.1111/cgf.12742-BIB0021\|cgf-cit-0021) 2007; 13 10.1111/cgf.12742-BIB0003\|cgf-cit-0003 Wang (10.1111/cgf.12742-BIB0025\|cgf-cit-0025) 2006; 12 Wei (10.1111/cgf.12742-BIB0029\|cgf-cit-0029) 2015; 21 Wang (10.1111/cgf.12742-BIB0027\|cgf-cit-0027) 2013; 32 Bach (10.1111/cgf.12742-BIB0001\|cgf-cit-0001) 2012; 4 Huang (10.1111/cgf.12742-BIB0013\|cgf-cit-0013) 2013; 32 Chen (10.1111/cgf.12742-BIB0005\|cgf-cit-0005) 2005; 22 Jones (10.1111/cgf.12742-BIB0014\|cgf-cit-0014) 2003; 22 Bian (10.1111/cgf.12742-BIB0004\|cgf-cit-0004) 2011; 28 Fleishman (10.1111/cgf.12742-BIB0010\|cgf-cit-0010) 2003; 22 Fan (10.1111/cgf.12742-BIB0011\|cgf-cit-0011) 2010; 16 He (10.1111/cgf.12742-BIB0012\|cgf-cit-0012) 2013; 32 10.1111/cgf.12742-BIB0018\|cgf-cit-0018 10.1111/cgf.12742-BIB0017\|cgf-cit-0017 10.1111/cgf.12742-BIB0032\|cgf-cit-0032 10.1111/cgf.12742-BIB0008\|cgf-cit-0008 10.1111/cgf.12742-BIB0024\|cgf-cit-0024 Kopf (10.1111/cgf.12742-BIB0016\|cgf-cit-0016) 2007; 26 10.1111/cgf.12742-BIB0023\|cgf-cit-0023 10.1111/cgf.12742-BIB0031\|cgf-cit-0031 Jones (10.1111/cgf.12742-BIB0015\|cgf-cit-0015) 2004; 24 Winnemöller (10.1111/cgf.12742-BIB0026\|cgf-cit-0026) 2006; 25 Cho (10.1111/cgf.12742-BIB0006\|cgf-cit-0006) 2014; 33 10.1111/cgf.12742-BIB0020\|cgf-cit-0020 Wang (10.1111/cgf.12742-BIB0028\|cgf-cit-0028) 2014; 2 Petschnigg (10.1111/cgf.12742-BIB0019\|cgf-cit-0019) 2004; 23 Durand (10.1111/cgf.12742-BIB0007\|cgf-cit-0007) 2002; 21 Eisemann (10.1111/cgf.12742-BIB0009\|cgf-cit-0009) 2004; 23 Zheng (10.1111/cgf.12742-BIB0033\|cgf-cit-0033) 2011; 17 Wang (10.1111/cgf.12742-BIB0030\|cgf-cit-0030) 2012; 44 Bennett (10.1111/cgf.12742-BIB0002\|cgf-cit-0002) 2005; 24
References_xml	– reference: Huang H., Wu S., Gong M., Cohen-Or D., Ascher U., Zhang H.R.: Edge-aware point set resampling. ACM Trans. Graph. 32, 1 (2013), 9:1-9:12. 3 – reference: Bennett E.P., McMillan L.: Video enhancement using per-pixel virtual exposures. ACM Trans. Graph. 24, 3 (2005). 2 – reference: Chen C.-Y., Cheng K.-Y.: A sharpness dependent filter for mesh smoothing. Computer Aided Geometric Design 22, 5 (2005), 376-391. 3 – reference: He L., Schaefer S.: Mesh denoising via l0 minimization. ACM Trans. Graph. 32, 4 (2013), 64:1-64:8. 3, 8, 9, 10 – reference: Wang J., Xu K., Liu L., Cao J., Liu S., Yu Z., Gu X.D.: Consolidation of low-quality point clouds from outdoor scenes. Computer Graphics Forum 32, 5 (2013), 207-216. 3 – reference: Cho H., Lee H., Kang H., Lee S.: Bilateral texture filtering. ACM Trans. Graph. 33, 4 (2014), 128:1-128:8. 2, 7 – reference: Sun X., Rosin P.L., Martin R.R., Langbein F.C.: Fast and effective feature-preserving mesh denoising. IEEE Trans. Vis. Comput. Graphics 13, 5 (2007), 925-938. 3, 5, 8, 9, 10 – reference: Zheng Y., Fu H., Au O.-C., Tai C.-L.: Bilateral normal filtering for mesh denoising. IEEE Trans. Vis. Comput. Graphics 17, 10 (2011), 1521-1530. 1, 2, 3, 4, 5, 7, 8, 9, 10, 11 – reference: Wang R., Yang Z., Liu L., Deng J., Chen F.: Decoupling noise and features via weighted l1-analysis compressed sensing. ACM Trans. Graph. 33, 2 (2014), 18:1-18:12. 3, 10, 11 – reference: Wei M., Yu J., Pang W.-M., Wang J., Qin J., Liu L., Heng P.-A.: Bi-normal filtering for mesh denoising. IEEE Trans. Vis. Comput. Graphics 21, 1 (2015), 43-55. 3, 9, 10, 11 – reference: Jones T.R., Durand F., Desbrun M.: Non-iterative, feature-preserving mesh smoothing. ACM Trans. Graph. 22, 3 (2003), 943-949. 1, 2, 3, 8, 9, 10 – reference: Petschnigg G., Szeliski R., Agrawala M., Cohen M., Hoppe H., Toyama K.: Digital photography with flash and no-flash image pairs. ACM Trans. Graph. 23, 3 (2004), 664-672. 1, 2, 4 – reference: Wang C.C.: Bilateral recovering of sharp edges on feature-insensitive sampled meshes. IEEE Trans. Vis. Comput. Graphics 12, 4 (2006), 629-639. 2 – reference: Sun X., Rosin P.L., Martin R.R., Langbein F.C.: Random walks for feature-preserving mesh denoising. Computer Aided Geometric Design 25, 7 (2008), 437-456. 3 – reference: Bach F.R., Jenatton R., Mairal J., Obozinski G.: Optimization with sparsity-inducing penalties. Foundations and Trends in Machine Learning 4, 1 (2012), 1-106. 7 – reference: Durand F., Dorsey J.: Fast bilateral filtering for the display of high-dynamic-range images. ACM Trans. Graph. 21, 3 (2002), 257-266. 2 – reference: Fleishman S., Drori I., Cohen-Or D.: Bilateral mesh denoising. ACM Trans. Graph. 22, 3 (2003). 1, 2, 3, 8, 9, 10 – reference: Kopf J., Cohen M.F., Lischinski D., Uyttendaele M.: Joint bilateral upsampling. ACM Trans. Graph. 26, 3 (2007). 2 – reference: Jones T., Durand F., Zwicker M.: Normal improvement for point rendering. IEEE Computer Graphics and Applications 24, 4 (2004), 53-56. 2 – reference: Fan H., Yu Y., Peng Q.: Robust feature-preserving mesh denoising based on consistent subneighborhoods. IEEE Trans. Vis. Comput. Graphics 16, 2 (2010), 312-324. 3 – reference: Wang J., Zhang X., Yu Z.: A cascaded approach for feature-preserving surface mesh denoising. Computer-Aided Design 44, 7 (2012), 597-610. 3 – reference: Eisemann E., Durand F.: Flash photography enhancement via intrinsic relighting. ACM Trans. Graph. 23, 3 (2004), 673-678. 1, 2, 4 – reference: Bian Z., Tong R.: Feature-preserving mesh denoising based on vertices classification. Computer Aided Geometric Design 28, 1 (2011), 50-64. 3 – reference: Winnemöller H. Olsen S.C., Gooch B.: Realtime video abstraction. ACM Trans. Graph. 25, 3 (2006). 2 – volume: 23 start-page: 664 issue: 3 year: 2004 end-page: 672 article-title: Digital photography with flash and no‐flash image pairs publication-title: ACM Trans. Graph – volume: 16 start-page: 312 issue: 2 year: 2010 end-page: 324 article-title: Robust feature‐preserving mesh denoising based on consistent subneighborhoods publication-title: IEEE Trans. Vis. Comput. Graphics – volume: 32 start-page: 9:1 issue: 1 year: 2013 end-page: 9:12 article-title: Edge‐aware point set resampling publication-title: ACM Trans. Graph – year: 2007 – volume: 33 start-page: 128:1 issue: 4 year: 2014 end-page: 128:8 article-title: Bilateral texture filtering publication-title: ACM Trans. Graph – volume: 21 start-page: 257 issue: 3 year: 2002 end-page: 266 article-title: Fast bilateral filtering for the display of high‐dynamic‐range images publication-title: ACM Trans. Graph – volume: 44 start-page: 597 issue: 7 year: 2012 end-page: 610 article-title: A cascaded approach for feature‐preserving surface mesh denoising publication-title: Computer‐Aided Design – volume: 24 start-page: 53 issue: 4 year: 2004 end-page: 56 article-title: Normal improvement for point rendering publication-title: IEEE Computer Graphics and Applications – volume: 17 start-page: 1521 issue: 10 year: 2011 end-page: 1530 article-title: Bilateral normal filtering for mesh denoising publication-title: IEEE Trans. Vis. Comput. Graphics – volume: 22 start-page: 943 issue: 3 year: 2003 end-page: 949 article-title: Non‐iterative, feature‐preserving mesh smoothing publication-title: ACM Trans. Graph – volume: 2 start-page: 18:1 year: 2014 end-page: 18:12 article-title: Decoupling noise and features via weighted ‐analysis compressed sensing publication-title: ACM Trans. Graph. 33 – year: 2014 – volume: 13 start-page: 925 issue: 5 year: 2007 end-page: 938 article-title: Fast and effective feature‐preserving mesh denoising publication-title: IEEE Trans. Vis. Comput. Graphics – volume: 24 issue: 3 year: 2005 article-title: Video enhancement using per‐pixel virtual exposures publication-title: ACM Trans. Graph – volume: 32 start-page: 207 issue: 5 year: 2013 end-page: 216 article-title: Consolidation of low‐quality point clouds from outdoor scenes publication-title: Computer Graphics Forum – volume: 23 start-page: 673 issue: 3 year: 2004 end-page: 678 article-title: Flash photography enhancement via intrinsic relighting publication-title: ACM Trans. Graph – volume: 12 start-page: 629 issue: 4 year: 2006 end-page: 639 article-title: Bilateral recovering of sharp edges on feature‐insensitive sampled meshes publication-title: IEEE Trans. Vis. Comput. Graphics – volume: 22 start-page: 376 issue: 5 year: 2005 end-page: 391 article-title: A sharpness dependent filter for mesh smoothing publication-title: Computer Aided Geometric Design – start-page: 2 year: 2015 end-page: 15 – volume: 25 issue: 3 year: 2006 article-title: Realtime video abstraction publication-title: ACM Trans. Graph – year: 2008 – year: 2004 – volume: 28 start-page: 50 issue: 1 year: 2011 end-page: 64 article-title: Feature‐preserving mesh denoising based on vertices classification publication-title: Computer Aided Geometric Design – volume: 26 issue: 3 year: 2007 article-title: Joint bilateral upsampling publication-title: ACM Trans. Graph – volume: 25 start-page: 437 issue: 7 year: 2008 end-page: 456 article-title: Random walks for feature‐preserving mesh denoising publication-title: Computer Aided Geometric Design – volume: 22 issue: 3 year: 2003 article-title: Bilateral mesh denoising publication-title: ACM Trans. Graph – volume: 32 start-page: 64:1 issue: 4 year: 2013 end-page: 64:8 article-title: Mesh denoising via l0 minimization publication-title: ACM Trans. Graph – volume: 21 start-page: 43 issue: 1 year: 2015 end-page: 55 article-title: Bi‐normal filtering for mesh denoising publication-title: IEEE Trans. Vis. Comput. Graphics – volume: 4 start-page: 1 issue: 1 year: 2012 end-page: 106 article-title: Optimization with sparsity‐inducing penalties publication-title: Foundations and Trends in Machine Learning – start-page: 211 year: 2006 end-page: 224 – ident: 10.1111/cgf.12742-BIB0018\|cgf-cit-0018 doi: 10.1145/1281500.1281602 – volume: 32 start-page: 64:1 issue: 4 year: 2013 ident: 10.1111/cgf.12742-BIB0012\|cgf-cit-0012 article-title: Mesh denoising via l0 minimization publication-title: ACM Trans. Graph doi: 10.1145/2461912.2461965 – volume: 32 start-page: 207 issue: 5 year: 2013 ident: 10.1111/cgf.12742-BIB0027\|cgf-cit-0027 article-title: Consolidation of low-quality point clouds from outdoor scenes publication-title: Computer Graphics Forum doi: 10.1111/cgf.12187 – ident: 10.1111/cgf.12742-BIB0031\|cgf-cit-0031 doi: 10.1007/11744023_17 – volume: 23 start-page: 673 issue: 3 year: 2004 ident: 10.1111/cgf.12742-BIB0009\|cgf-cit-0009 article-title: Flash photography enhancement via intrinsic relighting publication-title: ACM Trans. Graph doi: 10.1145/1015706.1015778 – ident: 10.1111/cgf.12742-BIB0024\|cgf-cit-0024 – volume: 2 start-page: 18:1 year: 2014 ident: 10.1111/cgf.12742-BIB0028\|cgf-cit-0028 article-title: Decoupling noise and features via weighted l1-analysis compressed sensing publication-title: ACM Trans. Graph. 33 – ident: 10.1111/cgf.12742-BIB0023\|cgf-cit-0023 doi: 10.1016/j.cagd.2015.03.011 – volume: 28 start-page: 50 issue: 1 year: 2011 ident: 10.1111/cgf.12742-BIB0004\|cgf-cit-0004 article-title: Feature-preserving mesh denoising based on vertices classification publication-title: Computer Aided Geometric Design doi: 10.1016/j.cagd.2010.10.001 – volume: 13 start-page: 925 issue: 5 year: 2007 ident: 10.1111/cgf.12742-BIB0021\|cgf-cit-0021 article-title: Fast and effective feature-preserving mesh denoising publication-title: IEEE Trans. Vis. Comput. Graphics doi: 10.1109/TVCG.2007.1065 – volume: 33 start-page: 128:1 issue: 4 year: 2014 ident: 10.1111/cgf.12742-BIB0006\|cgf-cit-0006 article-title: Bilateral texture filtering publication-title: ACM Trans. Graph doi: 10.1145/2601097.2601188 – ident: 10.1111/cgf.12742-BIB0032\|cgf-cit-0032 – ident: 10.1111/cgf.12742-BIB0008\|cgf-cit-0008 – volume: 16 start-page: 312 issue: 2 year: 2010 ident: 10.1111/cgf.12742-BIB0011\|cgf-cit-0011 article-title: Robust feature-preserving mesh denoising based on consistent subneighborhoods publication-title: IEEE Trans. Vis. Comput. Graphics doi: 10.1109/TVCG.2009.70 – volume: 25 start-page: 437 issue: 7 year: 2008 ident: 10.1111/cgf.12742-BIB0022\|cgf-cit-0022 article-title: Random walks for feature-preserving mesh denoising publication-title: Computer Aided Geometric Design doi: 10.1016/j.cagd.2007.12.008 – volume: 22 start-page: 943 issue: 3 year: 2003 ident: 10.1111/cgf.12742-BIB0014\|cgf-cit-0014 article-title: Non-iterative, feature-preserving mesh smoothing publication-title: ACM Trans. Graph doi: 10.1145/882262.882367 – volume: 22 start-page: 376 issue: 5 year: 2005 ident: 10.1111/cgf.12742-BIB0005\|cgf-cit-0005 article-title: A sharpness dependent filter for mesh smoothing publication-title: Computer Aided Geometric Design doi: 10.1016/j.cagd.2005.04.003 – volume: 22 issue: 3 year: 2003 ident: 10.1111/cgf.12742-BIB0010\|cgf-cit-0010 article-title: Bilateral mesh denoising publication-title: ACM Trans. Graph doi: 10.1145/882262.882368 – volume: 26 issue: 3 year: 2007 ident: 10.1111/cgf.12742-BIB0016\|cgf-cit-0016 article-title: Joint bilateral upsampling publication-title: ACM Trans. Graph doi: 10.1145/1276377.1276497 – volume: 17 start-page: 1521 issue: 10 year: 2011 ident: 10.1111/cgf.12742-BIB0033\|cgf-cit-0033 article-title: Bilateral normal filtering for mesh denoising publication-title: IEEE Trans. Vis. Comput. Graphics doi: 10.1109/TVCG.2010.264 – ident: 10.1111/cgf.12742-BIB0017\|cgf-cit-0017 – volume: 21 start-page: 43 issue: 1 year: 2015 ident: 10.1111/cgf.12742-BIB0029\|cgf-cit-0029 article-title: Bi-normal filtering for mesh denoising publication-title: IEEE Trans. Vis. Comput. Graphics doi: 10.1109/TVCG.2014.2326872 – volume: 23 start-page: 664 issue: 3 year: 2004 ident: 10.1111/cgf.12742-BIB0019\|cgf-cit-0019 article-title: Digital photography with flash and no-flash image pairs publication-title: ACM Trans. Graph doi: 10.1145/1015706.1015777 – volume: 21 start-page: 257 issue: 3 year: 2002 ident: 10.1111/cgf.12742-BIB0007\|cgf-cit-0007 article-title: Fast bilateral filtering for the display of high-dynamic-range images publication-title: ACM Trans. Graph doi: 10.1145/566654.566574 – volume: 32 start-page: 9:1 issue: 1 year: 2013 ident: 10.1111/cgf.12742-BIB0013\|cgf-cit-0013 article-title: Edge-aware point set resampling publication-title: ACM Trans. Graph doi: 10.1145/2421636.2421645 – ident: 10.1111/cgf.12742-BIB0020\|cgf-cit-0020 – volume: 12 start-page: 629 issue: 4 year: 2006 ident: 10.1111/cgf.12742-BIB0025\|cgf-cit-0025 article-title: Bilateral recovering of sharp edges on feature-insensitive sampled meshes publication-title: IEEE Trans. Vis. Comput. Graphics doi: 10.1109/TVCG.2006.60 – volume: 24 issue: 3 year: 2005 ident: 10.1111/cgf.12742-BIB0002\|cgf-cit-0002 article-title: Video enhancement using per-pixel virtual exposures publication-title: ACM Trans. Graph doi: 10.1145/1073204.1073272 – ident: 10.1111/cgf.12742-BIB0003\|cgf-cit-0003 doi: 10.1145/1281500.1281640 – volume: 25 issue: 3 year: 2006 ident: 10.1111/cgf.12742-BIB0026\|cgf-cit-0026 article-title: Realtime video abstraction publication-title: ACM Trans. Graph doi: 10.1145/1141911.1142018 – volume: 24 start-page: 53 issue: 4 year: 2004 ident: 10.1111/cgf.12742-BIB0015\|cgf-cit-0015 article-title: Normal improvement for point rendering publication-title: IEEE Computer Graphics and Applications doi: 10.1109/MCG.2004.14 – volume: 4 start-page: 1 issue: 1 year: 2012 ident: 10.1111/cgf.12742-BIB0001\|cgf-cit-0001 article-title: Optimization with sparsity-inducing penalties publication-title: Foundations and Trends in Machine Learning doi: 10.1561/2200000015 – volume: 44 start-page: 597 issue: 7 year: 2012 ident: 10.1111/cgf.12742-BIB0030\|cgf-cit-0030 article-title: A cascaded approach for feature-preserving surface mesh denoising publication-title: Computer-Aided Design doi: 10.1016/j.cad.2012.03.001
SSID	ssj0004765
Score	2.5351226
Snippet	The joint bilateral filter is a variant of the standard bilateral filter, where the range kernel is evaluated using a guidance signal instead of the original...
SourceID	proquest crossref wiley istex
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	23
SubjectTerms	and systems Categories and Subject Descriptors (according to ACM CCS) Computer science Construction Filtering Filters Filtration Flexibility I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems Image processing Image processing systems Kernels languages Orientation Studies
Title	Guided Mesh Normal Filtering
URI	https://api.istex.fr/ark:/67375/WNG-2LVKD289-D/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fcgf.12742 https://www.proquest.com/docview/1722191704 https://www.proquest.com/docview/1762122168
Volume	34
WOSCitedRecordID	wos000363216500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1467-8659 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004765 issn: 0167-7055 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LaxsxEB5cu4fmkKQv4tQJ21BKL1u0Wmkf9BTsrgt1lhDqNjeh1aMxCU7wI-TnZ7SvONBCILcFzYI00ux8szPzCeCTTtFrKKJ8TZTx0RIjvyAGY544jBEeFNryslF4Eud5cn6ennbgW9MLU_FDtD_cnGWU32tn4LJYbhi5-mu_Bi7R-AJ6FM8t70JvdJZNJw9tkXHEG2pvRxpTEwu5Qp725UfuqOc0e_cIa24i1tLlZDvPmuwubNdI0zuujsZr6Jj5G9ja4B98C4PxeqaN9k7M8sLLHXq98rKZy5_j8DuYZt9_DX_49XUJvmIkpL4OqIyS0HAV2TTkNmaaUm0KplyuEHGFlIZKxlKLfl0TyU0hJdMximtiEh2-h-78em72wLOJpYHlNrKEsTg1SUE01RjpKGKDggV9-NJoTaiaS9xdaXElmpgCFyzKBffhqBW9qQg0_iX0uVR9KyEXl67iLObiTz4WdPL75wgjQzHqw6DZG1Eb21IgBqMu7CSsDx_bYTQTl_uQc3O9djIROmkaRAnOvdyp_89GDMdZ-bD_dNEP8AqhFK_K_AbQXS3W5gBeqtvVbLk4rE_mPYjL4s8
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3rS9xAEB-sJ7T90GofNPaqUUrpl8hms3lBv4hnTrlcENHWb8tmH-1RieXOK_75nc3LE1oo-C2ws7CPmcxvdmZ_C_BRpeg1JJGeIlJ7aImRVxKNMU8cxAgPSmXC-qJwHhdFcnWVnq3Bl-4uTMMP0R-4Wcuo_9fWwO2B9IqVy-_mwLeZxicwYKhGqN-D0Xl2md_fi4yjsOP2tqwxLbOQreTpOz_wRwO7tHcPwOYqZK19TvbycaPdhBct1nQPG-XYgjVdvYLnKwyEr2E4Xs6UVu5UL364hcWv1242sxl0bH4Dl9nxxdGJ1z6Y4ElGAuopn4ooCXQoI5MGoYmZolTpkkmbLURkIYSmgrHUoGdXRIS6FIKpGMUV0YkK3sJ6dVPpd-CaxFDfhCYyhLE41UlJFFUY60hi_JL5Dnzulo3Llk3cPmpxzbuoAifM6wk7sN-L_mooNP4m9Kle-15CzH_amrM45N-KMaf518kIY0M-cmDYbQ5vzW3BEYVRG3gS5sBe34yGYrMfotI3SysToZumfpTg2Out-vdo-NE4qz-2_190F56eXExznp8Wk_fwDIFV2BT9DWH9dr7UH2BD_r6dLeY7rZr-ASyn5r8
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3rS8MwED90E9EPvsXp1CoifqmkafoCv8hmpziLiK9vIc1Dh2PKHuKfb9K1dYKC4LdCrnC55Hq_6-V-ATgQkY4aHHFbIC5t7Ym-nSKpc57ADTQ8SIXyskbhdpAk4eNjdD0FJ0UvzJgfovzhZjwj-14bB5dvQk14OX9Sx46pNE5DlZhLZCpQbd7Ed-2vvsjA9wpub8MakzMLmZM85cvf4lHVmPbjG9ichKxZzIkX_6ftEizkWNM6HW-OZZiSvRWYn2AgXIV6a9QRUlhXcvBsJQa_dq24YyroengN7uKz28a5nV-YYHOCXGwLBzM_dKXHfRW5ngqIwFjIlHBTLdTIgjGJGSGR0pFdIObJlDEiAi0ukAyFuw6V3mtPboClQoUd5SlfIUKCSIYpEljoXIcj5aTEqcFRYTbKczZxc6lFlxZZhZ4wzSZcg_1S9G1MofGT0GFm-1KC9V_MmbPAow9Ji-L2_WVT54a0WYN6sTg0d7cB1SgMm8QTkRrslcPaUUz1g_Xk68jI-DpMY8cPte7ZUv2uDW204uxh8--iuzB73Yxp-yK53II5jau88Zm_OlSG_ZHchhn-PuwM-jv5Lv0E24HmOg
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Guided+Mesh+Normal+Filtering&rft.jtitle=Computer+graphics+forum&rft.au=Zhang%2C+Wangyu&rft.au=Deng%2C+Bailin&rft.au=Zhang%2C+Juyong&rft.au=Bouaziz%2C+Sofien&rft.date=2015-10-01&rft.pub=Blackwell+Publishing+Ltd&rft.issn=0167-7055&rft.eissn=1467-8659&rft.volume=34&rft.issue=7&rft.spage=23&rft.epage=34&rft_id=info:doi/10.1111%2Fcgf.12742&rft.externalDBID=n%2Fa&rft.externalDocID=ark_67375_WNG_2LVKD289_D
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-7055&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-7055&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-7055&client=summon