CVGIP: Graphical Models and Image Processing最新文献_第4页

Image Warping by Radial Basis Functions: Application to Facial Expressions 基于径向基函数的图像扭曲:在面部表情中的应用

CVGIP: Graphical Models and Image Processing Pub Date : 1994-03-01 DOI: 10.1006/cgip.1994.1015

Arad N., Dyn N., Reisfeld D., Yeshurun Y.

引用次数: 294

Nonorthogonal Image Expansion Related to Optimal Template Matching in Complex Images 复杂图像中与最优模板匹配相关的非正交图像展开

CVGIP: Graphical Models and Image Processing Pub Date : 1994-03-01 DOI: 10.1006/cgip.1994.1014

Rao K.R., Benarie J.

{"title":"Nonorthogonal Image Expansion Related to Optimal Template Matching in Complex Images","authors":"Rao K.R., Benarie J.","doi":"10.1006/cgip.1994.1014","DOIUrl":"https://doi.org/10.1006/cgip.1994.1014","url":null,"abstract":"<div><p>Expansion matching (EXM) is a novel method for template matching that optimizes a new similarity measure called discriminative signal-to-noise ratio (DSNR). Since EXM is designed to minimize off-center response, it yields results with very sharp matching peaks. EXM yields superior performance to the widely used correlation matching (also known as matched filtering), especially in conditions of noise, superposition, and severe occlusion. This paper presents an extended EXM formulation that matches multiple templates in the <em>complex</em> image domain. Complex template matching is useful in matching frequency domain templates and edge gradient images, and can be extended to multispectral images as well. Here, a single filter is designed to simultaneously match a set of given complex templates with optimal DSNR, while eliciting user-defined center responses for each template. It is shown that when the complex case is simplified to the case of matching a single real template, the result reduces exactly to the minimum squared error (MSE) restoration filter assuming the template as the blurring function. Here, we introduce a new generalized MSE restoration paradigm based on the analogy to multiple-template EXM. Furthermore, the output of the single-template EXM filter is also shown to be equivalent to a nonorthogonal expansion of the image with basis functions that are all shifted versions of the template. Experimental results prove that EXM is robust to minor rotation and scale distortions.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1994.1014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92003495","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}

引用次数: 7

A Deterministic Algorithm for Reconstructing Images with Interacting Discontinuities 具有相互作用不连续点的图像重建的确定性算法

CVGIP: Graphical Models and Image Processing Pub Date : 1994-03-01 DOI: 10.1006/cgip.1994.1011

Bedini L., Gerace I., Tonazzini A.

{"title":"A Deterministic Algorithm for Reconstructing Images with Interacting Discontinuities","authors":"Bedini L., Gerace I., Tonazzini A.","doi":"10.1006/cgip.1994.1011","DOIUrl":"https://doi.org/10.1006/cgip.1994.1011","url":null,"abstract":"<div><p>The most common approach for incorporating discontinuities in visual reconstruction problems makes use of Bayesian techniques, based on Markov random field models, coupled with stochastic relaxation and simulated annealing. Despite their convergence properties and flexibility in exploiting a priori knowledge on physical and geometric features of discontinuities, stochastic relaxation algorithms often present insurmountable computational complexity. Recently, considerable attention has been given to suboptimal deterministic algorithms, which can provide solutions with much lower computational costs. These algorithms consider the discontinuities implicitly rather than explicitly and have been mostly derived when there are no interactions between two or more discontinuities in the image model. In this paper we propose an algorithm that allows for interacting discontinuities, in order to exploit the constraint that discontinuities must be connected and thin. The algorithm, called E-GNC, can be considered an extension of the graduated nonconvexity (GNC), first proposed by Blake and Zisserman for noninteracting discontinuities. When applied to the problem of image reconstruction from sparse and noisy data, the method is shown to give satisfactory results with a low number of iterations.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1994.1011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91982782","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}

引用次数: 47

A Catalog of 1-D Features in Natural Images 自然图像的一维特征目录

CVGIP: Graphical Models and Image Processing Pub Date : 1994-03-01 DOI: 10.1006/cgip.1994.1016

Aw Y.K., Owens R., Ross J.

引用次数: 13

Reconstructing Ellipsoids from Projections 从投影重建椭球体

CVGIP: Graphical Models and Image Processing Pub Date : 1994-03-01 DOI: 10.1006/cgip.1994.1012

Karl W.C., Verghese G.C., Willsky A.S.

{"title":"Reconstructing Ellipsoids from Projections","authors":"Karl W.C., Verghese G.C., Willsky A.S.","doi":"10.1006/cgip.1994.1012","DOIUrl":"https://doi.org/10.1006/cgip.1994.1012","url":null,"abstract":"<div><p>In this paper we examine the problem of reconstructing a (possibly dynamic) ellipsoid from its (possibly inconsistent) orthogonal silhouette projections. We present a particularly convenient representation of ellipsoids as elements of the vector space of symmetric matrices. The relationship between an ellipsoid and its orthogonal projections in this representation is linear, unlike the standard parameterization based on semiaxis length and orientation. This representation is used to completely and simply characterize the solutions to the reconstruction problem. The representation also allows the straightforward inclusion of geometric constraints on the reconstructed ellipsoid in the form of inner and outer bounds on recovered ellipsoid shape. The inclusion of a dynamic model with natural behavior, such as stretching, shrinking, and rotation, is similarly straightforward in this framework and results in the possibility of dynamic ellipsoid estimation. For example, the linear reconstruction of a dynamic ellipsoid from a single lower-dimensional projection observed over time is possible. Numerical examples are provided to illustrate these points.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1994.1012","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92003494","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}

引用次数: 53

Using Marching Cubes on Small Machines 在小型机器上使用行进立方体

CVGIP: Graphical Models and Image Processing Pub Date : 1994-03-01 DOI: 10.1006/cgip.1994.1017

Montani C., Scopigno R.

引用次数: 15

Image-Models for 2-D Flow Visualization and Compression 二维流动可视化和压缩的图像模型

CVGIP: Graphical Models and Image Processing Pub Date : 1994-01-01 DOI: 10.1006/cgip.1994.1007

Ford R.M., Strickland R.N., Thomas B.A.

{"title":"Image-Models for 2-D Flow Visualization and Compression","authors":"Ford R.M., Strickland R.N., Thomas B.A.","doi":"10.1006/cgip.1994.1007","DOIUrl":"10.1006/cgip.1994.1007","url":null,"abstract":"<div><p>Pattern models for the analysis, visualization, and compression of experimental 2-D flow imagery are developed. These models are based on the 2-D linear phase portrait, and consist of a superposition of flow primitives that are equivalent to the canonical form of phase portraits. The phase portrait is a compact flow descriptor specified by a 2 × 2 A matrix, and it provides for classification into one of six possible patterns based on the matrix eigenvalues. The modeling requires computation of the orientation field, critical point detection, and estimation of the associated phase portraits as preliminary analysis steps. Existing methods to compute the orientation field that are appropriate for highly textured images are employed, but a technique for its computation in weakly textured imagery is included. Critical points are located with a detector that is based on the index (or winding number) of a vector field. A performance analysis of the detector is included. A linear least-squares method of estimating the phase portrait A matrix from the orientation field is presented. Flows are then modeled as a superposition of primitives, where their associated strengths are determined from the orientation field. This modeling works well for flows that exhibit nearly ideal behavior. Finally, the derived models are employed to compress scalar images that exhibit little or gradual variation along the flow streamlines. Compression ratios on the order of 100: 1 are achieved.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1994.1007","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128351589","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}

引用次数: 46

Efficient Algorithms for the Implementation of General B-Splines 实现一般b样条的有效算法

CVGIP: Graphical Models and Image Processing Pub Date : 1994-01-01 DOI: 10.1006/cgip.1994.1009

Ferrari L.A., Silbermann M.J., Sankar P.V.

引用次数: 5

On the Existence and the Coefficients of the Implicit Equation of Rational Surfaces 有理曲面隐式方程的存在性及其系数

CVGIP: Graphical Models and Image Processing Pub Date : 1994-01-01 DOI: 10.1006/cgip.1994.1003

Chionh E.W., Goldman R.N.

{"title":"On the Existence and the Coefficients of the Implicit Equation of Rational Surfaces","authors":"Chionh E.W., Goldman R.N.","doi":"10.1006/cgip.1994.1003","DOIUrl":"10.1006/cgip.1994.1003","url":null,"abstract":"<div><p>The existence of the implicit equation of rational surfaces can be proved by three techniques: elimination theory, undetermined coefficients, and the theory of field extensions. The methods of elimination theory and undetermined coefficients also reveal that the implicit equation can be written with coefficients from the coefficient field of the parametric polynomials. All three techniques can be implemented as implicitization algorithms. For each method, the theoretical limitations of the proof and the practical advantages and disadvantages of the algorithm are discussed. Our results are important for two reasons. First, we caution that elimination theory cannot be generalized in a straightforward manner from rational plane curves to rational surfaces to show the existence of the implicit equation; thus other rigorous methods are necessary to bypass the vanishing of the resultant in the presence of base points. Second, as an immediate consequence of the coefficient relationship, we see that the implicit representation involves only rational (or real) coefficients if a parametric representation involves only rational (or real) coefficients. The existence of the implicit equation means every rational surface is a subset of an irreducible algebraic surface. The subset relation can be proper and this may cause problems in certain applications in computer aided geometric design. This anomaly is illustrated by an example.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1994.1003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122691937","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

Algebraic Specification of a 3D-Modeler Based on Hypermaps 基于Hypermaps的3d建模器的代数规范

CVGIP: Graphical Models and Image Processing Pub Date : 1994-01-01 DOI: 10.1006/cgip.1994.1005

Bertrand Y., Dufourd J.F.

引用次数: 61