Graphical Models and Image Processing最新文献_第9页

A Scalable and Adaptive Temporal Segmentation Algorithm for Video Coding 视频编码的可扩展自适应时间分割算法

Graphical Models and Image Processing Pub Date : 1997-05-01 DOI: 10.1006/gmip.1997.0423

S.H. Kwok , W.C. Siu , A.G. Constantinides

{"title":"A Scalable and Adaptive Temporal Segmentation Algorithm for Video Coding","authors":"S.H. Kwok , W.C. Siu , A.G. Constantinides","doi":"10.1006/gmip.1997.0423","DOIUrl":"10.1006/gmip.1997.0423","url":null,"abstract":"<div><p>To achieve very low bit-rate transmission, many video coding papers suggest extraction of stationary objects and the background and coding only of moving objects. These techniques, which could seriously distort the output, are mostly applied to spatial domain. A novel scalable adaptive temporal segmentation algorithm for video coding is proposed in this paper. Our proposed algorithm is scalable in terms of compression, quality, and some specific features. A multifunction control of the output is formulated as a cost function, which is flexible enough to implement any desirable criteria, such as channel capacity or reconstruction quality. Our algorithm uses a simple but efficient quantization process instead of using a computationally expensive discontinuity detection. The approach can also be regarded as a combination of adaptive temporal decimation and segmented video coding. The overall bit rate can be regulated according to the user's specifications. Experimental results show that the overall bit rate of video coding can be controlled easily using our scheme. The output quality is good for both subjective and objective tests. We have also found that the size of the time window (<em>N</em>) has significant effects on the quality of the reconstruction, while our proposed algorithm outperforms the adaptive temporal decimation algorithm.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"59 3","pages":"Pages 128-138"},"PeriodicalIF":0.0,"publicationDate":"1997-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1997.0423","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131670155","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}

引用次数: 4

An Approximate Maximum Likelihood Linear Estimator of Circle Parameters 圆参数的近似极大似然线性估计

Graphical Models and Image Processing Pub Date : 1997-05-01 DOI: 10.1006/gmip.1997.0424

Y.T. Chan , S.M. Thomas

引用次数: 7

3D Well-Composed Pictures 3D构图精美的图片

Graphical Models and Image Processing Pub Date : 1997-05-01 DOI: 10.1006/gmip.1997.0422

Longin Jan Latecki

{"title":"3D Well-Composed Pictures","authors":"Longin Jan Latecki","doi":"10.1006/gmip.1997.0422","DOIUrl":"https://doi.org/10.1006/gmip.1997.0422","url":null,"abstract":"<div><p>By a<em>segmented</em>image, we mean a digital image in which each point is assigned a unique label that indicates the object to which it belongs. By the foreground (objects) of a segmented image, we mean the objects whose properties we want to analyze and by the background, all the other objects of a digital image. If one adjacency relation is used for the foreground of a 3D segmented image (e.g., 6-adjacency) and a different relation for the background (e.g., 26-adjacency), then interchanging the foreground and the background can change the connected components of the digital picture. Hence, the choice of foreground and background is critical for the results of the subsequent analysis (like object grouping), especially in cases where it is not clear at the beginning of the analysis what constitutes the foreground and what the background, since this choice immediately determines the connected components of the digital picture. A special class of segmented digital 3D pictures called “well-composed pictures” will be defined. Well-composed pictures have very nice topical and geometrical properties; in particular, the boundary of every connected component is a Jordan surface and there is only one type of connected component in a well-composed picture, since 6-, 14-, 18-, and 26-connected components are equal. This implies that for a well-composed digital picture, the choice of the foreground and the background is not critical for the results of the subsequent analysis. Moreover, a very natural definition of a continuous analog for well-composed digital pictures leads to regular properties of surfaces. This allows us to give a simple proof of a digital version of the 3D Jordan–Brouwer separation theorem.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"59 3","pages":"Pages 164-172"},"PeriodicalIF":0.0,"publicationDate":"1997-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1997.0422","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137004606","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

Detection of Small Local Intensity Changes in CCD Images with Nonuniform Illumination and Large Signal Dependent Noise 光照不均匀、噪声大的CCD图像局部小强度变化的检测

Graphical Models and Image Processing Pub Date : 1997-05-01 DOI: 10.1006/gmip.1997.0426

Yasmina Chitti

引用次数: 4

Three-Dimensional Rotations by Three Shears 三剪三维旋转

Graphical Models and Image Processing Pub Date : 1997-03-01 DOI: 10.1006/gmip.1997.0420

Tommaso Toffoli , Jason Quick

引用次数: 43

Space-Efficient Outlines from Image Data via Vertex Minimization and Grid Constraints 通过顶点最小化和网格约束从图像数据中获得空间高效轮廓

Graphical Models and Image Processing Pub Date : 1997-03-01 DOI: 10.1006/gmip.1997.0419

John D. Hobby

引用次数: 7

An Efficient Class of Alternating Sequential Filters in Morphology 形态学中一类有效的交替顺序滤波器

Graphical Models and Image Processing Pub Date : 1997-03-01 DOI: 10.1006/gmip.1996.0416

Soo-Chang Pei , Chin-Lun Lai , Frank Y. Shih

引用次数: 24

Use of Neural Networks to Estimate the Number of Nodes of an Edge Quadtree 利用神经网络估计边缘四叉树的节点数

Graphical Models and Image Processing Pub Date : 1997-03-01 DOI: 10.1006/gmip.1996.0417

F.A Schreiber, R.Calvo Wolfler

引用次数: 4

Fast Computation of Three-Dimensional Geometric Moments Using a Discrete Divergence Theorem and a Generalization to Higher Dimensions 基于离散散度定理的三维几何矩快速计算及高维推广

Graphical Models and Image Processing Pub Date : 1997-03-01 DOI: 10.1006/gmip.1997.0418

Luren Yang , Fritz Albregtsen , Torfinn Taxt

{"title":"Fast Computation of Three-Dimensional Geometric Moments Using a Discrete Divergence Theorem and a Generalization to Higher Dimensions","authors":"Luren Yang , Fritz Albregtsen , Torfinn Taxt","doi":"10.1006/gmip.1997.0418","DOIUrl":"10.1006/gmip.1997.0418","url":null,"abstract":"<div><p>The three-dimensional Cartesian geometric moments (for short 3-D moments) are important features for 3-D object recognition and shape description. To calculate the moments of objects in a 3-D image by a straightforward method requires a large number of computing operations. Some authors have proposed fast algorithms to compute the 3-D moments. However, the problem of computation has not been well solved since all known methods require computations of order<em>N</em><sup>3</sup>, assuming that the object is represented by an<em>N</em>×<em>N</em>×<em>N</em>voxel image. In this paper, we present a discrete divergence theorem which can be used to compute the sum of a function over an<em>n</em>-dimensional discrete region by a summation over the discrete surface enclosing the region. As its corollaries, we give a discrete Gauss's theorem for 3-D discrete objects and a discrete Green's theorem for 2-D discrete objects. Using a fast surface tracking algorithm and the discrete Gauss's theorem, we design a new method to compute the geometric moments of 3-D binary objects as observed in 3-D discrete images. This method reduces the computational complexity significantly, requiring computation of<em>O</em>(<em>N</em><sup>2</sup>). This reduction is demonstrated experimentally on two 3-D objects. We also generalize the method to deal with high-dimensional images. Some 3-D moment invariants and shape features are also discussed.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"59 2","pages":"Pages 97-108"},"PeriodicalIF":0.0,"publicationDate":"1997-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1997.0418","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114009546","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}

引用次数: 51

Adaptive Ordered Dither 自适应有序抖动

Graphical Models and Image Processing Pub Date : 1997-01-01 DOI: 10.1006/gmip.1996.0414

Yuefeng Zhang

引用次数: 12