首页 > 最新文献

Proceedings 11th International Conference on Image Analysis and Processing最新文献

英文 中文
An information-theoretic approach to active vision 主动视觉的信息论方法
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957032
Giuseppe Boccignone, M. Ferraro, T. Caelli
An approach to active vision based on information theory and statistical mechanics is presented. Density of entropy production measured along a spatio-chromatic diffusion of a colour image is used to build a conspicuity map of the image. The map is successively given as input to a dynamic neural network in order to drive a focus-of-attention scanpath.
提出了一种基于信息论和统计力学的主动视觉方法。沿着彩色图像的空间-色彩扩散测量的熵产生密度用于构建图像的显著性图。该地图依次作为动态神经网络的输入,以驱动焦点扫描路径。
{"title":"An information-theoretic approach to active vision","authors":"Giuseppe Boccignone, M. Ferraro, T. Caelli","doi":"10.1109/ICIAP.2001.957032","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957032","url":null,"abstract":"An approach to active vision based on information theory and statistical mechanics is presented. Density of entropy production measured along a spatio-chromatic diffusion of a colour image is used to build a conspicuity map of the image. The map is successively given as input to a dynamic neural network in order to drive a focus-of-attention scanpath.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116786220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
A robust eigendecomposition framework for inexact graph-matching 非精确图匹配的鲁棒特征分解框架
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957053
Bin Luo, E. Hancock
Graph-matching is a task of pivotal importance in high-level vision since it provides a means by which abstract pictorial descriptions can be matched to one another. This paper describes an efficient algorithm for inexact graph-matching. The method is purely structural, that is to say it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions. Commencing from a probability distribution for matching errors, we show how the problem of graph-matching can be posed as maximum likelihood estimation using the apparatus of the EM algorithm. Our second contribution is to cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows us to efficiently recover correspondence matches using singular value decomposition. We experiment with the method on both real-world and synthetic data. Here we demonstrate that the method offers comparable performance to more computationally demanding methods.
图匹配在高级视觉中是一项至关重要的任务,因为它提供了一种方法,通过这种方法可以将抽象的图像描述相互匹配。本文描述了一种有效的非精确图匹配算法。该方法是纯结构化的,也就是说,它只使用图的边或连通性结构,不绘制节点或边属性。我们有两个贡献。从匹配误差的概率分布开始,我们展示了如何使用EM算法的设备将图匹配问题作为最大似然估计。我们的第二个贡献是在矩阵框架中实现图节点之间对应匹配的恢复。这允许我们使用奇异值分解有效地恢复对应匹配。我们在真实世界和合成数据上对该方法进行了实验。在这里,我们证明了该方法提供了相当的性能,更多的计算要求的方法。
{"title":"A robust eigendecomposition framework for inexact graph-matching","authors":"Bin Luo, E. Hancock","doi":"10.1109/ICIAP.2001.957053","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957053","url":null,"abstract":"Graph-matching is a task of pivotal importance in high-level vision since it provides a means by which abstract pictorial descriptions can be matched to one another. This paper describes an efficient algorithm for inexact graph-matching. The method is purely structural, that is to say it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions. Commencing from a probability distribution for matching errors, we show how the problem of graph-matching can be posed as maximum likelihood estimation using the apparatus of the EM algorithm. Our second contribution is to cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows us to efficiently recover correspondence matches using singular value decomposition. We experiment with the method on both real-world and synthetic data. Here we demonstrate that the method offers comparable performance to more computationally demanding methods.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115569708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A vision agent for mobile robot navigation in time-variable environments 时变环境下移动机器人导航的视觉代理
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957069
A. Chella, Salvatore Vitabile, R. Sorbello
We present an architecture for mobile robot navigation based on Bayesian networks. The architecture allows a robot to plan the correct path inside an environment with dynamic obstacles. Interactions between the robot and the environment are based on a powerful vision agent. The results of simulations, showing the effectiveness of the approach, are described.
提出了一种基于贝叶斯网络的移动机器人导航体系结构。该架构允许机器人在有动态障碍物的环境中规划正确的路径。机器人和环境之间的交互是基于一个强大的视觉代理。仿真结果表明了该方法的有效性。
{"title":"A vision agent for mobile robot navigation in time-variable environments","authors":"A. Chella, Salvatore Vitabile, R. Sorbello","doi":"10.1109/ICIAP.2001.957069","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957069","url":null,"abstract":"We present an architecture for mobile robot navigation based on Bayesian networks. The architecture allows a robot to plan the correct path inside an environment with dynamic obstacles. Interactions between the robot and the environment are based on a powerful vision agent. The results of simulations, showing the effectiveness of the approach, are described.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"25 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116573837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Global optimization of deformable surface meshes based on genetic algorithms 基于遗传算法的可变形曲面网格全局优化
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957052
Jussi Tohka
Deformable models are by their formulation able to solve the surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ability is shadowed by the fact that the minimization problem formulated is difficult to solve globally. Constrained global solutions are needed, if the amount of noise is substantial. This paper presents a new optimization strategy for deformable surface meshes based on real coded genetic algorithms. Real coded genetic algorithms are favored over binary coded ones because they can more efficiently be adapted to the particular problem domain. Experiments with synthetic images are performed. These demonstrate that the applied deformable model is able extract a surface from noisy volumetric image. Also the superiority of the proposed approach compared to a greedy minimization with multiple initializations is demonstrated.
可变形模型通过其公式可以解决医学图像分析中常见的从有噪声的体图像数据中提取表面的问题。然而,这种能力被这样一个事实所掩盖,即所制定的最小化问题很难在全局范围内解决。如果噪音很大,就需要有约束的全球解决方案。提出了一种基于实数编码遗传算法的可变形曲面网格优化策略。实编码遗传算法比二进制编码遗传算法更受青睐,因为它们可以更有效地适应特定的问题领域。用合成图像进行了实验。结果表明,所采用的可变形模型能够从有噪声的体积图像中提取出表面。并证明了该方法相对于具有多个初始化的贪心最小化方法的优越性。
{"title":"Global optimization of deformable surface meshes based on genetic algorithms","authors":"Jussi Tohka","doi":"10.1109/ICIAP.2001.957052","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957052","url":null,"abstract":"Deformable models are by their formulation able to solve the surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ability is shadowed by the fact that the minimization problem formulated is difficult to solve globally. Constrained global solutions are needed, if the amount of noise is substantial. This paper presents a new optimization strategy for deformable surface meshes based on real coded genetic algorithms. Real coded genetic algorithms are favored over binary coded ones because they can more efficiently be adapted to the particular problem domain. Experiments with synthetic images are performed. These demonstrate that the applied deformable model is able extract a surface from noisy volumetric image. Also the superiority of the proposed approach compared to a greedy minimization with multiple initializations is demonstrated.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128685766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
IMAGENCIES: network image services for telemedicine applications 图像:远程医疗应用的网络图像服务
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957059
V. Roberto, V. D. Mea
A network of distributed image-based medical services (Imagencies) is proposed. Each one is a community of specialised, co-operating programs (Imagents), providing acquisition, processing, archiving and management facilities. Both synchronous and asynchronous communication are proposed, based on the standard protocols available on the Internet. We describe a prototype implementation in the field of telepathology. At present, the Imagency includes a secretary and an image processing specialist; asynchronous communication is realised by the standard MIME protocol for multimedia electronic mail. Practical results and future perspectives are presented and discussed.
提出了一种基于图像的分布式医疗服务网络。每一个都是一个专业的、合作的程序(Imagents)社区,提供采集、处理、存档和管理设施。基于Internet上可用的标准协议,提出了同步和异步通信。我们描述了一个在心灵病理学领域的原型实现。目前,影像部包括一名秘书和一名图像处理专家;采用多媒体电子邮件的标准MIME协议实现异步通信。提出并讨论了实际结果和未来的展望。
{"title":"IMAGENCIES: network image services for telemedicine applications","authors":"V. Roberto, V. D. Mea","doi":"10.1109/ICIAP.2001.957059","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957059","url":null,"abstract":"A network of distributed image-based medical services (Imagencies) is proposed. Each one is a community of specialised, co-operating programs (Imagents), providing acquisition, processing, archiving and management facilities. Both synchronous and asynchronous communication are proposed, based on the standard protocols available on the Internet. We describe a prototype implementation in the field of telepathology. At present, the Imagency includes a secretary and an image processing specialist; asynchronous communication is realised by the standard MIME protocol for multimedia electronic mail. Practical results and future perspectives are presented and discussed.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130335880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling dense range images through fast polygonal approximations 通过快速多边形近似建模密集范围图像
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957050
H. Pedrini
A method for approximating range images by integrating triangular meshes and curvature information is presented. First, an adaptive filtering technique is applied to the original range image based on estimations of the surface curvature. This produces a collection of 3D points, which are triangulated in order to produce an initial mesh. The mesh is then refined through an efficient Delaunay triangulation algorithm. A new local error measure is used to select points to be inserted into the triangulation. Points tend to scatter in planar areas and to concentrate in high variation areas. The method allows representations to be retrieved at variables levels of accuracy, providing a natural way of multiresolution modeling. Some experimental results are presented to show that the proposed technique is effective to represent range images.
提出了一种结合三角形网格和曲率信息的距离图像逼近方法。首先,基于表面曲率估计对原始距离图像进行自适应滤波;这将生成一个3D点的集合,这些点将被三角化以生成初始网格。然后通过有效的Delaunay三角剖分算法对网格进行细化。采用一种新的局部误差度量来选择插入三角测量的点。点在平面区域趋向分散,在高变化区域趋向集中。该方法允许在变量精度级别上检索表示,从而提供了一种自然的多分辨率建模方法。实验结果表明,该方法可以有效地表示距离图像。
{"title":"Modeling dense range images through fast polygonal approximations","authors":"H. Pedrini","doi":"10.1109/ICIAP.2001.957050","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957050","url":null,"abstract":"A method for approximating range images by integrating triangular meshes and curvature information is presented. First, an adaptive filtering technique is applied to the original range image based on estimations of the surface curvature. This produces a collection of 3D points, which are triangulated in order to produce an initial mesh. The mesh is then refined through an efficient Delaunay triangulation algorithm. A new local error measure is used to select points to be inserted into the triangulation. Points tend to scatter in planar areas and to concentrate in high variation areas. The method allows representations to be retrieved at variables levels of accuracy, providing a natural way of multiresolution modeling. Some experimental results are presented to show that the proposed technique is effective to represent range images.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129173192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A fast recursive algorithm for the computation of axial moments 轴向矩计算的快速递归算法
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.956991
R. Palenichka, M. Zaremba, C. Valenti
This paper describes a fast algorithm to compute local axial moments used for the detection of objects of interest in images. The basic idea is grounded on the elimination of redundant operations while computing axial moments for two neighboring angles of orientation. The main result is that the complexity of recursive computation of axial moments becomes independent of the total number of computed moments in a given point, i.e. it is of the order O(N) where N is the data size. This result is of great importance in computer vision since many feature extraction methods are based on the computation of axial moments. The experimental results confirm the time complexity and accuracy predicted by the theoretical analysis.
本文描述了一种快速计算局部轴矩的算法,用于图像中感兴趣目标的检测。其基本思想是基于在计算两个相邻的取向角的轴向矩时消除冗余操作。主要结果是轴向弯矩递归计算的复杂性与给定点上计算的弯矩总数无关,即它的阶为O(N),其中N为数据大小。这一结果在计算机视觉中具有重要意义,因为许多特征提取方法都是基于轴向矩的计算。实验结果证实了理论分析预测的时间复杂度和精度。
{"title":"A fast recursive algorithm for the computation of axial moments","authors":"R. Palenichka, M. Zaremba, C. Valenti","doi":"10.1109/ICIAP.2001.956991","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.956991","url":null,"abstract":"This paper describes a fast algorithm to compute local axial moments used for the detection of objects of interest in images. The basic idea is grounded on the elimination of redundant operations while computing axial moments for two neighboring angles of orientation. The main result is that the complexity of recursive computation of axial moments becomes independent of the total number of computed moments in a given point, i.e. it is of the order O(N) where N is the data size. This result is of great importance in computer vision since many feature extraction methods are based on the computation of axial moments. The experimental results confirm the time complexity and accuracy predicted by the theoretical analysis.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123883230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Remote sensed images segmentation through shape refinement 基于形状细化的遥感图像分割
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.956998
G. Gallo, Giorgio Grasso, Salvatore Nicotra, A. Pulvirenti
A novel approach to the automatic classification of remotely sensed images is proposed. This approach is based on a three-phase procedure: first pixels which belong to the areas of interest with large likelihood are selected as seeds; second the seeds are refined into connected shapes using two well-known image processing techniques; third the results of the shape refinement algorithms are merged together. The initial seed extraction is performed using a simple thresholding strategy applied to NDVI/sub 4-3/ index. Subsequently shape refinement through seeded region growing and watershed decomposition is applied; finally a merging procedure is applied to build likelihood maps. Experimental results are presented to analyze the correctness and robustness of the method in recognizing vegetation areas around Mount Etna.
提出了一种新的遥感图像自动分类方法。该方法基于一个三个阶段的过程:首先,选择可能性较大的感兴趣区域的像素作为种子;其次,使用两种著名的图像处理技术将种子精炼成连接的形状;第三,对形状优化算法的结果进行合并。初始种子提取使用应用于NDVI/sub 4-3/ index的简单阈值策略进行。然后通过种子区生长和分水岭分解进行形状细化;最后,采用合并方法构建似然图。实验结果验证了该方法识别埃特纳火山周围植被区域的正确性和鲁棒性。
{"title":"Remote sensed images segmentation through shape refinement","authors":"G. Gallo, Giorgio Grasso, Salvatore Nicotra, A. Pulvirenti","doi":"10.1109/ICIAP.2001.956998","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.956998","url":null,"abstract":"A novel approach to the automatic classification of remotely sensed images is proposed. This approach is based on a three-phase procedure: first pixels which belong to the areas of interest with large likelihood are selected as seeds; second the seeds are refined into connected shapes using two well-known image processing techniques; third the results of the shape refinement algorithms are merged together. The initial seed extraction is performed using a simple thresholding strategy applied to NDVI/sub 4-3/ index. Subsequently shape refinement through seeded region growing and watershed decomposition is applied; finally a merging procedure is applied to build likelihood maps. Experimental results are presented to analyze the correctness and robustness of the method in recognizing vegetation areas around Mount Etna.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"560 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134194505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Bayesian face recognition with deformable image models 具有变形图像模型的贝叶斯人脸识别
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.956981
B. Moghaddam, C. Nastar, A. Pentland
We propose a novel representation for characterizing image differences using a deformable technique for obtaining pixel-wise correspondences. This representation, which is based on a deformable 3D mesh in XYI-space, is then experimentally compared with two related correspondence methods: optical flow and intensity differences. Furthermore, we make use of a probabilistic similarity measure for direct image matching based on a Bayesian analysis of image variations. We model two classes of variation in facial appearance: intra-personal and extra-personal. The probability density function for each class is estimated from training data and used to compute a similarity measure based on the a posteriori probabilities. The performance advantage of our deformable probabilistic matching technique is demonstrated using 1700 faces from the USA Army's "FERET" face database.
我们提出了一种新的表示,用于使用可变形技术来获得像素级对应来表征图像差异。该表示基于xyi空间中的可变形3D网格,然后与两种相关的对应方法:光流和强度差进行了实验比较。此外,我们利用基于贝叶斯图像变化分析的概率相似性度量来进行直接图像匹配。我们对面部外观的两类变异进行了建模:个人内变异和个人外变异。从训练数据中估计每个类的概率密度函数,并用于计算基于后验概率的相似性度量。使用来自美国陆军“FERET”人脸数据库的1700张人脸,证明了我们的可变形概率匹配技术的性能优势。
{"title":"Bayesian face recognition with deformable image models","authors":"B. Moghaddam, C. Nastar, A. Pentland","doi":"10.1109/ICIAP.2001.956981","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.956981","url":null,"abstract":"We propose a novel representation for characterizing image differences using a deformable technique for obtaining pixel-wise correspondences. This representation, which is based on a deformable 3D mesh in XYI-space, is then experimentally compared with two related correspondence methods: optical flow and intensity differences. Furthermore, we make use of a probabilistic similarity measure for direct image matching based on a Bayesian analysis of image variations. We model two classes of variation in facial appearance: intra-personal and extra-personal. The probability density function for each class is estimated from training data and used to compute a similarity measure based on the a posteriori probabilities. The performance advantage of our deformable probabilistic matching technique is demonstrated using 1700 faces from the USA Army's \"FERET\" face database.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115323848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Texture synthesis using image pyramids and self-organizing maps 使用图像金字塔和自组织地图的纹理合成
Pub Date : 2001-09-26 DOI: 10.1109/ICIAP.2001.957016
P. Parada, Javier Ruiz-del-Solar
Markov random field (MRF) is a well known model for the generation of textures in the field of computer graphics. However, the estimation of its parameter is quite difficult in many cases. A new algorithm for the synthesis of textures is proposed, based on image pyramids and self-organizing maps. This procedure avoids the explicit computation of the MRF parameters. Preliminary results support the appropriateness of this new approach.
马尔可夫随机场(MRF)是计算机图形学领域中一个著名的纹理生成模型。然而,在许多情况下,其参数的估计是相当困难的。提出了一种基于图像金字塔和自组织映射的纹理合成算法。这个程序避免了MRF参数的显式计算。初步结果支持这种新方法的适宜性。
{"title":"Texture synthesis using image pyramids and self-organizing maps","authors":"P. Parada, Javier Ruiz-del-Solar","doi":"10.1109/ICIAP.2001.957016","DOIUrl":"https://doi.org/10.1109/ICIAP.2001.957016","url":null,"abstract":"Markov random field (MRF) is a well known model for the generation of textures in the field of computer graphics. However, the estimation of its parameter is quite difficult in many cases. A new algorithm for the synthesis of textures is proposed, based on image pyramids and self-organizing maps. This procedure avoids the explicit computation of the MRF parameters. Preliminary results support the appropriateness of this new approach.","PeriodicalId":365627,"journal":{"name":"Proceedings 11th International Conference on Image Analysis and Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124724201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
期刊
Proceedings 11th International Conference on Image Analysis and Processing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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