BRDF数据库的预处理与聚类方法

IF 2.5 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING Graphical Models Pub Date : 2022-01-01 DOI:10.1016/j.gmod.2021.101123
Mislene da Silva Nunes , Methanias Colaço Júnior , Gastão Florêncio Miranda Jr. , Beatriz Trinchão Andrade
{"title":"BRDF数据库的预处理与聚类方法","authors":"Mislene da Silva Nunes ,&nbsp;Methanias Colaço Júnior ,&nbsp;Gastão Florêncio Miranda Jr. ,&nbsp;Beatriz Trinchão Andrade","doi":"10.1016/j.gmod.2021.101123","DOIUrl":null,"url":null,"abstract":"<div><h3>Context</h3><p>The Bidirectional Reflectance Distribution Function (BRDF) represents a material through the incoming light on its surface. In this context, material clustering contributes to selecting a basis of representative BRDFs, the reconstruction of BRDFs, the personalization of the appearance of materials, and image-based estimation of material properties.</p></div><div><h3>Objective</h3><p>This work presents an approach to cluster a BRDF database according to its reflectance features.</p></div><div><h3>Method</h3><p>We first preprocess a BRDF database by mapping it to an image slice database and then find the best parameters for the LLE method through an empirical analysis, retrieving lower-dimensional databases. We performed a controlled experiment using the k-means, k-medoids, and spectral clustering algorithms applied to the low-dimensional databases.</p></div><div><h3>Conclusion</h3><p>K-means presented the best overall result compared to the other clustering algorithms. For applications that require cluster representatives from the database, we suggest using k-medoids, which presented results close to those of the k-means.</p></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"119 ","pages":"Article 101123"},"PeriodicalIF":2.5000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Approach to Preprocess and Cluster a BRDF Database\",\"authors\":\"Mislene da Silva Nunes ,&nbsp;Methanias Colaço Júnior ,&nbsp;Gastão Florêncio Miranda Jr. ,&nbsp;Beatriz Trinchão Andrade\",\"doi\":\"10.1016/j.gmod.2021.101123\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><h3>Context</h3><p>The Bidirectional Reflectance Distribution Function (BRDF) represents a material through the incoming light on its surface. In this context, material clustering contributes to selecting a basis of representative BRDFs, the reconstruction of BRDFs, the personalization of the appearance of materials, and image-based estimation of material properties.</p></div><div><h3>Objective</h3><p>This work presents an approach to cluster a BRDF database according to its reflectance features.</p></div><div><h3>Method</h3><p>We first preprocess a BRDF database by mapping it to an image slice database and then find the best parameters for the LLE method through an empirical analysis, retrieving lower-dimensional databases. We performed a controlled experiment using the k-means, k-medoids, and spectral clustering algorithms applied to the low-dimensional databases.</p></div><div><h3>Conclusion</h3><p>K-means presented the best overall result compared to the other clustering algorithms. For applications that require cluster representatives from the database, we suggest using k-medoids, which presented results close to those of the k-means.</p></div>\",\"PeriodicalId\":55083,\"journal\":{\"name\":\"Graphical Models\",\"volume\":\"119 \",\"pages\":\"Article 101123\"},\"PeriodicalIF\":2.5000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graphical Models\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S152407032100028X\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphical Models","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S152407032100028X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 1

摘要

双向反射分布函数(BRDF)表示材料通过其表面的入射光。在这种情况下,材料聚类有助于选择具有代表性的brdf的基础、brdf的重建、材料外观的个性化以及基于图像的材料属性估计。目的提出了一种根据反射特征对BRDF数据库进行聚类的方法。方法首先将BRDF数据库映射到图像切片数据库进行预处理,然后通过检索低维数据库,通过实证分析找到LLE方法的最佳参数。我们使用k-means、k- medidoids和光谱聚类算法对低维数据库进行了对照实验。结论与其他聚类算法相比,k -means的总体效果最好。对于需要数据库中集群代表的应用程序,我们建议使用k-medoids,其结果接近k-means的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Approach to Preprocess and Cluster a BRDF Database

Context

The Bidirectional Reflectance Distribution Function (BRDF) represents a material through the incoming light on its surface. In this context, material clustering contributes to selecting a basis of representative BRDFs, the reconstruction of BRDFs, the personalization of the appearance of materials, and image-based estimation of material properties.

Objective

This work presents an approach to cluster a BRDF database according to its reflectance features.

Method

We first preprocess a BRDF database by mapping it to an image slice database and then find the best parameters for the LLE method through an empirical analysis, retrieving lower-dimensional databases. We performed a controlled experiment using the k-means, k-medoids, and spectral clustering algorithms applied to the low-dimensional databases.

Conclusion

K-means presented the best overall result compared to the other clustering algorithms. For applications that require cluster representatives from the database, we suggest using k-medoids, which presented results close to those of the k-means.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Graphical Models
Graphical Models 工程技术-计算机:软件工程
CiteScore
3.60
自引率
5.90%
发文量
15
审稿时长
47 days
期刊介绍: Graphical Models is recognized internationally as a highly rated, top tier journal and is focused on the creation, geometric processing, animation, and visualization of graphical models and on their applications in engineering, science, culture, and entertainment. GMOD provides its readers with thoroughly reviewed and carefully selected papers that disseminate exciting innovations, that teach rigorous theoretical foundations, that propose robust and efficient solutions, or that describe ambitious systems or applications in a variety of topics. We invite papers in five categories: research (contributions of novel theoretical or practical approaches or solutions), survey (opinionated views of the state-of-the-art and challenges in a specific topic), system (the architecture and implementation details of an innovative architecture for a complete system that supports model/animation design, acquisition, analysis, visualization?), application (description of a novel application of know techniques and evaluation of its impact), or lecture (an elegant and inspiring perspective on previously published results that clarifies them and teaches them in a new way). GMOD offers its authors an accelerated review, feedback from experts in the field, immediate online publication of accepted papers, no restriction on color and length (when justified by the content) in the online version, and a broad promotion of published papers. A prestigious group of editors selected from among the premier international researchers in their fields oversees the review process.
期刊最新文献
HammingVis: A visual analytics approach for understanding erroneous outcomes of quantum computing in hamming space A detail-preserving method for medial mesh computation in triangular meshes Exploring the neural landscape: Visual analytics of neuron activation in large language models with NeuronautLLM GarTemFormer: Temporal transformer-based for optimizing virtual garment animation Building semantic segmentation from large-scale point clouds via primitive recognition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1