Computer Vision, Graphics, and Image Processing最新文献_第8页

A comparative performance study of several global thresholding techniques for segmentation 几种全局阈值分割技术的性能比较研究

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90036-U

Sang Uk Lee, Seok Yoon Chung, Rae Hong Park

引用次数: 143

A color clustering technique for image segmentation 一种用于图像分割的颜色聚类技术

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90035-T

Mehmet Celenk

引用次数: 0

k × k thinning K × K细化

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90030-Y

Lawrence O'Gorman

{"title":"k × k thinning","authors":"Lawrence O'Gorman","doi":"10.1016/0734-189X(90)90030-Y","DOIUrl":"10.1016/0734-189X(90)90030-Y","url":null,"abstract":"<div>A commonly used method for thinning regions in binary images consists of examining windows of 3 × 3 pixels throughout an image, and erasing the center pixel if the thinning criteria are met. Thek × k thinning method is a generalization of the 3 × 3 method, wherek × k sized windows are examined and a center core of(k − 2) × (k − 2) pixels is erased if the criteria are met. The advantage ofk × k thinning is that, by peeling thicker layers from the boundaries of image regions, fewer iterations are required to reach the thinned result. For largerk, this is often at the cost of an increase in the coarseness of the result. Criteria are given by which thek × k method thins to minimally 8-connected lines while retaining connectivity and endpoints. Sequential and parallel algorithms are given. A procedure to obtain line widths in the course of thinning is described. Examples are shown illustrating the reduction in iterations with increase ofk, and the trade-off between size ofk and the coarseness of the result. Because of the highly repetitive, and local operations of the algorithm, it is straightforwardly mapped into VLSI hardware, and an example of this is given.</div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"51 2","pages":"Pages 195-215"},"PeriodicalIF":0.0,"publicationDate":"1990-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90030-Y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125827463","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}

引用次数: 49

Exploiting image-plane data in the interpretation of edge-based binocular disparity 利用图像平面数据解释基于边缘的双眼视差

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90034-S

Tony P. Pridmore, John E.W. Mayhew, John P. Frisby

引用次数: 0

Representation and recognition of surface shapes in range images: A differential geometry approach 距离图像中表面形状的表示和识别:微分几何方法

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90032-Q

Ping Liang, John S. Todhunter

引用次数: 0

3D symmetry-curvature duality theorems 三维对称曲率对偶定理

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90037-V

A. Yuille, M. Leyton

引用次数: 0

Dynamic strip algorithm in curve fitting 曲线拟合中的动态条带算法

Computer Vision, Graphics, and Image Processing Pub Date : 1990-08-01 DOI: 10.1016/0734-189X(90)90028-T

Maylor K. Leung, Yee-Hong Yang

引用次数: 24

Automatic fixing of ship position by simulation-and-matching 基于仿真匹配的船舶位置自动定位

Computer Vision, Graphics, and Image Processing Pub Date : 1990-07-01 DOI: 10.1016/S0734-189X(05)80061-1

Nobumichi Ishimura, Takeshi Hashimoto, Shuichi Tsujimoto, Suguru Arimoto

引用次数: 2

Direct construction of the perspective projection aspect graph of convex polyhedra 直接构造凸多面体的透视投影纵横图

Computer Vision, Graphics, and Image Processing Pub Date : 1990-07-01 DOI: 10.1016/S0734-189X(05)80060-X

John H. Stewman, Kevin W. Bowyer

{"title":"Direct construction of the perspective projection aspect graph of convex polyhedra","authors":"John H. Stewman, Kevin W. Bowyer","doi":"10.1016/S0734-189X(05)80060-X","DOIUrl":"10.1016/S0734-189X(05)80060-X","url":null,"abstract":"<div>The aspect graph concept was first described by Koenderink and van Doorn as a possible mechanism in human vision and has subsequently become an active research topic in computer vision. This paper describes an algorithm for constructing the perspective projection aspect graph of convex polyhedra. In the perspective projection aspect graph, viewpoint space is modeled as all of 3D space surrounding the object. This makes the perspective projection aspect graph a more realistic representation than the orthographic projection aspect graph, in which viewpoint space is modeled by the Gaussian sphere. The algorithm uses an intermediate data structure which represents a complete parcellation of 3D space derived from the geometric definition of the object. All information necessary for identifying object aspects and corresponding viewing cells is obtained as a result of this parcellation. The resulting aspect graph structure has a node for each distinct aspect/viewing cell. The upper bounds on the time complexity of the algorithm and the space complexity of the resulting data structure are Θ(N4), where N is the number of faces of the polyhedron. The algorithm has been implemented in C, runs on a SUN workstation, and can use PADL-2 files for its input description of objects.</div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"51 1","pages":"Pages 20-37"},"PeriodicalIF":0.0,"publicationDate":"1990-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0734-189X(05)80060-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114812802","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}

引用次数: 26

Texture descriptors based on co-occurrence matrices 基于共现矩阵的纹理描述符

Computer Vision, Graphics, and Image Processing Pub Date : 1990-07-01 DOI: 10.1016/S0734-189X(05)80063-5

Calvin C. Gotlieb, Herbert E. Kreyszig

引用次数: 299