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

Estimation of Noise in Images: An Evaluation 图像中噪声的估计:一种评价

CVGIP: Graphical Models and Image Processing Pub Date : 1993-07-01 DOI: 10.1006/cgip.1993.1022

Olsen S.I.

引用次数: 274

Identifying High Level Features of Texture Perception 识别纹理感知的高级特征

CVGIP: Graphical Models and Image Processing Pub Date : 1993-05-01 DOI: 10.1006/cgip.1993.1016

Rao A.R., Lohse G.L.

{"title":"Identifying High Level Features of Texture Perception","authors":"Rao A.R., Lohse G.L.","doi":"10.1006/cgip.1993.1016","DOIUrl":"https://doi.org/10.1006/cgip.1993.1016","url":null,"abstract":"<div><p>A fundamental issue in texture analysis is that of deciding what textural features are important in texture perception, and how they are used. Experiments on human preattentive vision have identified several low-level features (such as orientation of blobs and size of line segments), which are used in texture perception. However, the question of what higher level features of texture are used has not been adequately addressed. We designed an experiment to help identify the relevant higher order features of texture perceived by humans. We used 20 subjects, who were asked to perform an unsupervised classification of 30 pictures from Brodatz′s album on texture. Each subject was asked to group these pictures into as many classes as desired. Both hierarchical cluster analysis and nonparametric multidimensional scaling (MDS) were applied to the pooled similarity matrix generated from the subjects′ groupings. A surprising outcome is that the MDS solutions fit the data very well. The stress in the two-dimensional case is 0.10, and the stress in the three-dimensional case is 0.045. We rendered the original textures in these coordinate systems, and interpreted the (rotated) axes. It appears that the axes in the 2D case correspond to periodicity versus irregularity, and directionality versus nondirectionality. In the 3D case, the third dimension represents the structural complexity of the texture. Furthermore, the clusters identified by the hierarchical cluster analysis remain virtually intact in the MDS solution. The results of our experiment indicate that people use three high-level features for texture perception. Future studies are needed to determine the appropriateness of these high-level features for computational texture analysis and classification.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1993.1016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72281746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Parallel Algorithm for the Visibility of a Simple Polygon Using Scan Operations 利用扫描运算求简单多边形可见性的并行算法

CVGIP: Graphical Models and Image Processing Pub Date : 1993-05-01 DOI: 10.1006/cgip.1993.1014

Chen L.T., Davis L.S.

{"title":"A Parallel Algorithm for the Visibility of a Simple Polygon Using Scan Operations","authors":"Chen L.T., Davis L.S.","doi":"10.1006/cgip.1993.1014","DOIUrl":"https://doi.org/10.1006/cgip.1993.1014","url":null,"abstract":"<div><p>This paper describes a parallel algorithm for computing the visible portion of a simple planar polygon with <em>N</em> vertices from a given point on or inside the polygon. The algorithm accomplishes this in <em>O</em>(<em>k</em> log <em>N</em>) time using <em>O</em>(<em>N</em>/log <em>N</em>) processors, where <em>k</em> is the <em>link-diameter</em> of the polygon in consideration. The link-diameter of a polygon is the maximum number of straight line segments needed to connect any two points within the polygon, where all line segments lie completely within the polygon. The algorithm can also be used to compute the visible portion of the plane given a point outside of the polygon. Except in this case, the parameter <em>k</em> in the asymptotic bounds would be the link diameter of a different polygon. The algorithm is optimal for sets of polygons that have a constant link diameter. It is a rather simple algorithm, and has a very small run time constant, making it fast and practical to implement. The interprocessor communication needed involves only local neighbor communication and scan operations (i.e., parallel prefix operations). Thus the algorithm can be implemented not only on an EREW PRAM, but also on a variety of other more practical machine architectures, such as hypercubes, trees, butterflies, and shuffle exchange networks. The algorithm was implemented on the Connection Machine as well as the MasPar MP- 1, and various performance tests were conducted.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1993.1014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72281744","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

Line Detection in Noisy and Structured Backgrounds Using Græco-Latin Squares 使用Græco Latin Squares在噪声和结构化背景中进行直线检测

CVGIP: Graphical Models and Image Processing Pub Date : 1993-05-01 DOI: 10.1006/cgip.1993.1012

Haberstroh R., Kurz L.

引用次数: 23

Effective Detection of Digital Bar Segments with Hough Transform Hough变换在数字条形线段检测中的应用

CVGIP: Graphical Models and Image Processing Pub Date : 1993-05-01 DOI: 10.1006/cgip.1993.1013

Costa L.D., Sandler M.B.

引用次数: 17

Extraction of Binary Character/Graphics Images from Grayscale Document Images 从灰度文档图像中提取二进制字符/图形图像

CVGIP: Graphical Models and Image Processing Pub Date : 1993-05-01 DOI: 10.1006/cgip.1993.1015

Kamel M., Zhao A.

{"title":"Extraction of Binary Character/Graphics Images from Grayscale Document Images","authors":"Kamel M., Zhao A.","doi":"10.1006/cgip.1993.1015","DOIUrl":"https://doi.org/10.1006/cgip.1993.1015","url":null,"abstract":"<div><p>The extraction of binary character/graphics images from gray-scale document images with background pictures, shadows, highlight, smear, and smudge is a common critical image processing operation, particularly for document image analysis, optical character recognition, check image processing, image transmission, and videoconferencing. After a brief review of previous work with emphasis on five published extraction techniques, viz., a global thresholding technique, YDH technique, a nonlinear adaptive technique, an integrated function technique, and a local contrast technique, this paper presents two new extraction techniques: a logical level technique and a mask-based subtraction technique. With experiments on images of a typical check and a poor-quality text document, this paper systematically evaluates and analyses both new and published techniques with respect to six aspects, viz., speed, memory requirement, stroke width restriction, parameter number, parameter setting, and human subjective evaluation of result images. Experiments and evaluations have shown that one new technique is superior to the rest, suggesting its suitability for high-speed low-cost applications.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1993.1015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72281745","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}

引用次数: 231

Comment on "Generation of Noise in Binary Images" “二值图像中噪声的产生”刍议

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

Liu Y.K.

引用次数: 0

Approximate General Sweep Boundary of a 2D Curved Object 二维曲面物体的近似一般扫描边界

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

Ahn J.W., Kim M.S., Lim S.B.

{"title":"Approximate General Sweep Boundary of a 2D Curved Object","authors":"Ahn J.W., Kim M.S., Lim S.B.","doi":"10.1006/cgip.1993.1008","DOIUrl":"10.1006/cgip.1993.1008","url":null,"abstract":"<div><p>This paper presents an algorithm to compute an approximation to the general sweep boundary of a 2D curved moving object which changes its shape dynamically while traversing a trajectory. In effect, we make polygonal approximations to the trajectory and to the object shape at every appropriate instance along the trajectory so that the approximated polygonal sweep boundary is within a given error bound ϵ > 0 from the exact sweep boundary. The algorithm interpolates intermediate polygonal shapes between any two consecutive instances, and constructs polygons which approximate the sweep boundary of the object. Previous algorithms on sweep boundary computation have been mainly concerned about moving objects with fixed shapes; nevertheless, they have involved a fair amount of symbolic and/or numerical computations that have limited their practical uses in graphics modeling systems as well as in many other applications which require fast sweep boundary computation. Although the algorithm presented here does not generate the exact sweep boundaries of objects, it does yield quite reasonable polygonal approximations to them, and our experimental results show that its computation is reasonably fast to be of a practical use.</p></div>","PeriodicalId":100349,"journal":{"name":"CVGIP: Graphical Models and Image Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1993-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/cgip.1993.1008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124570660","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}

引用次数: 36

Detecting the Dominant Points by the Curvature-Based Polygonal Approximation 基于曲率的多边形逼近的优势点检测

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

Wu W.Y., Wang M.J.J.

引用次数: 83

Bayesian Block-Wise Segmentation of Interframe Differences in Video Sequences 视频序列帧间差异的贝叶斯分块分割

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

Sauer K., Jones C.

引用次数: 6