检索结果-内蒙古大学图书馆

chain coding representation of voxel-based objects with enclosing, edging and intersecting trees

PATTERN ANALYSIS AND APPLICATIONS 2017年第3期20卷 825-844页

作者： Martinez, Luis A. Bribiesca, Ernesto Guzman, Adolfo Univ Nacl Autonoma Mexico Inst Astron Apartado Postal 70-264 Mexico City 04510 DF Mexico Univ Nacl Autonoma Mexico Inst Invest Matemat Aplicadas & Sistemas Dept Ciencias Comp Mexico City 04510 DF Mexico Inst Politecn Nacl Ctr Invest Comp Mexico City 07738 DF Mexico

Thrifty methods to represent and store three dimensional objects are important. Two different methods for describing voxel-based objects (VBOs) by means of edging (ETs) and intersecting (ITs) trees are demonstrated. Each tree comes from a different kind of border of the underlying VBO, and both trees are one dimensional alternative descriptors to skeletons for VBOs representation. Vertices in the trees correspond to the vertices of the VBO enclosing surface where some surface vertices have been conveniently suppressed. These descriptors are computed using a base-five digit chain code (combined with parentheses) and has been used to illustrate three dimensional curves and enclosing trees. The descriptors are invariant under rotation and translation, and preserve the VBO shape. Using either descriptor, the description of the mirror image of a VBO is easily obtained. The proposed descriptor notation is a good tool for storing VBOs, and intersecting trees providing further storage savings. Enclosing trees (EcTs) are briefly reviewed as a preamble to introduce ETs and ITs.

关键词： Voxel-based objects Edging trees chain coding Three dimensional tree representation

来源：评论

学校读者我要写书评

暂无评论

A method for representing 3D tree objects using chain coding

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2008年第3期19卷 184-198页

作者： Bribiesca, Ernesto Univ Nacl Autonoma Mexico Inst Invest Matemat Aplicadas & Sistemas Mexico City 01000 DF Mexico

We describe a method for representing 3D (three-dimensional) tree objects by means of a chain code. These 3D tree objects correspond to natural existing 3D tree structures, such as: blood vessels, plants, live trees, and so on. Thus, trees are digitalized and represented by a notation called the unique tree descriptor. The unique tree descriptor is invariant under translation and rotation. Furthermore, this descriptor is starting vertex normalized via the unique path in the tree. Also, it is possible to obtain the mirror image of any tree with ease. This unique tree descriptor preserves the shape of trees (and the shape of their branches), allows us to know their geometrical and topological properties. To determine if two 3D tree objects have the same shape, it is only necessary to see if their descriptors are equal. In this manner, graph comparisons and tree searches are eliminated. Also, the proposed tree descriptor is a good tool for storing of 3D tree objects. Finally, in order to prove our method for representing 3D tree objects, we obtain some tree descriptors of objects on real images. (c) 2008 Published by Elsevier Inc.

关键词： 3D tree objects 3D tree structures unique tree descriptor 3D discrete branches chain coding 3D tree representation

来源：评论

学校读者我要写书评

暂无评论

coding EFFICIENCY OF MULTIRING DIFFERENTIAL chain coding

引用

IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION 1992年第2期139卷 224-232页

作者： JOHANNESSEN, AB PRASAD, R WEYLAND, NBJ BONS, JH DELFT UNIV TECHNOL DEPT ELECT ENGNTELECOMM & TRAFF CONTROL SYST GRP2600 GA DELFTNETHERLANDS

A new coding scheme for line drawings, multiring differential chain coding (MRDCC) is introduced, based on relative vectors drawn from multiple coding rings. The performance of MRDCC depends on the probability distribution of the different rings included in the code. A model is presented for the evaluation of ring probabilities;these have been used, together with the corresponding relative vector probabilities, to obtain the coding rate. Compared to the standard chain code (SCC), generalised chain code (GCC) and differential chain code (DCC), MRDCC is expected to reduce the coding rate by 40%, 53% and 13%, respectively. Experiments performed show an average reduction in coding rate by 50%, 23% and 5% compared to SCC, GCC and DCC, respectively.

关键词： chain coding EFFICIENCY PICTURE TRANSMISSION

来源：评论

学校读者我要写书评

暂无评论

Fast chain coding of region boundaries

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1998年第4期20卷 407-415页

作者： Zingaretti, P Gasparroni, M Vecci, L Univ Ancona Ist Informat I-60131 Ancona Italy

A fast single-pass algorithm to convert a multivalued image from a raster-based representation into chain codes is presented. Ail chain codes are obtained in linear time with respect to the number of chain segments that are generated at each raster according to a set of templates. A formal statement and the complexity and performance analysis of the algorithm are given.

关键词： boundary representations chain coding run-length coding multivalued images image coding image processing shape analysis

来源：评论

学校读者我要写书评

暂无评论

An innovative design of a hybrid chain coding algorithm for bi-level image compression using an agent-based modeling approach

引用

APPLIED SOFT COMPUTING 2019年 79卷 94-110页

作者： Dhou, Khaldoon Drury Univ Springfield MO 65802 USA

In this article, the researcher introduces a hybrid chain code for shape encoding, as well as lossless and lossy bi-level image compression. The lossless and lossy mechanisms primarily depend on agent movements in a virtual world and are inspired by many agent-based models, including the Paths model, the Bacteria Food Hunt model, the Kermack-McKendrick model, and the Ant Colony model. These models influence the present technique in three main ways: the movements of agents in a virtual world, the directions of movements, and the paths where agents walk. The agent movements are designed, tracked, and analyzed to take advantage of the arithmetic coding algorithm used to compress the series of movements encountered by the agents in the system. For the lossless mechanism, seven movements are designed to capture all the possible directions of an agent and to provide more space savings after being encoded using the arithmetic coding method. The lossy mechanism incorporates the seven movements in the lossless algorithm along with extra modes, which allow certain agent movements to provide further reduction. Additionally, two extra movements that lead to more substitutions are employed in the lossless and lossy mechanisms. The empirical outcomes show that the present approach for bi-level image compression is robust and that compression ratios are much higher than those obtained by other methods, including JBIG1 and JBIG2, which are international standards in bi-level image compression. Additionally, a series of paired-samples t-tests reveals that the differences between the current algorithms' results and the outcomes from all the other approaches are statistically significant. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Agent-based modeling Lossless compression Lossy compression chain coding Bi-level image

来源：评论

学校读者我要写书评

暂无评论

A measure of tortuosity based on chain coding

引用

PATTERN RECOGNITION 2013年第3期46卷 716-724页

作者： Bribiesca, Ernesto Univ Nacl Autonoma Mexico Dept Comp Sci Inst Invest Matemat Aplicadas & Sistemas Mexico City 01000 DF Mexico

A measure of tortuosity for 20 curves is presented. Tortuosity is a very important property of curves and has many applications, such as: how to measure the tortuosity of retinal blood vessels, intracerebral vasculature, aluminum foams, etc. The measure of tortuosity proposed here is based on a chain code called Slope chain Code (SCC). The SCC uses some ideas which were described in [A geometric structure for 2D shapes and 3D surfaces, Pattern Recognition 25 (1992)483-496]. The SCC of a curve is obtained by placing straight-line segments of constant length around the curve (the endpoints of the straight-line segments always touching the curve), and calculating the slope changes between contiguous straight-line segments scaled to a continuous range from -1 to 1. The SCC of a curve is independent of translation, rotation, and optionally, of scaling, which is an important advantage for computing tortuosity. Also, the minimum and maximum values of tortuosity for curves and a measure of normalized tortuosity are described. Finally, an application of the proposed measure of tortuosity is presented which corresponds to the computation of retinal blood vessel tortuosity. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Measure of tortuosity Slope chain code chain coding Curves Retinal blood vessels

来源：评论

学校读者我要写书评

暂无评论

Scanning-curves representation for the coverage of surfaces using chain coding

引用

COMPUTERS & GRAPHICS-UK 2003年第1期27卷 123-132页

作者： Bribiesca, E Univ Nacl Autonoma Mexico Inst Invest Matemat Aplicadas & Sistemas Dept Comp Sci Mexico City 01000 DF Mexico

We present a novel and interesting method for representing scanning curves for the coverage of surfaces by means of chain coding. We describe scanning curves for the coverage of surfaces using a chain code. Thus, scanning curves are composed of constant straight-line segments using only orthogonal directions and are represented by means of the orthogonal direction change chain code, which can describe three-dimensional curves. Surfaces which are represented using the orthogonal direction change chain code are called discrete surfaces. The chain elements represent the orthogonal direction changes of the constant straight-line segments of the scanning curve for the coverage of a surface. There are only five possible orthogonal direction changes for representing any scanning curve. This chain code only considers relative direction changes, which allows us to have a unique surface descriptor invariant under translation and rotation. Also, this surface descriptor may be invariant under starting point and mirroring transformations. Finally, in order to demonstrate the use of our proposed method, we present some results using surfaces from digital elevation model data and digital images. (C) 2002 Elsevier Science Ltd. All rights reserved.

关键词： scanning curves chain coding surface representation discrete surfaces

来源：评论

学校读者我要写书评

暂无评论

Scanning-curves representation for the coverage of surfaces using chain coding

Scanning-curves representation for the coverage of surfaces ...

引用

1st Ibero-American Symposium in Computer Graphics (SIACG 2002)

作者： Bribiesca, E Univ Nacl Autonoma Mexico Inst Invest Matemat Aplicadas & Sistemas Dept Comp Sci Mexico City 01000 DF Mexico

关键词： scanning curves chain coding surface representation discrete surfaces

来源：评论

学校读者我要写书评

暂无评论

Motion compensated two-link chain coding for binary shape sequence

Motion compensated two-link chain coding for binary shape se...

引用

Conference on Visual Communications and Image Processing 2002

作者： Lu, ZT Pearlman, WA Rensselaer Polytech Inst Dept Elect Comp & Syst Engn Troy NY 12180 USA

ISBN: (纸本)0819444111

In this paper, we present a motion compensated two-link chain coding technique to effectively encode 2-D binary shape sequences for, object-based video coding. This technique consists of a contour motion estimation and compensation algorithm and a two-link chain coding algorithm. The object contour is defined on a 6-connected contour lattice for a smoother contour representation. The contour in the current frame is first predicted by global motion and local motion based on the decoded contour in the previous frame;then, it is segmented into motion success segments, which can be predicted by the global motion or the local motion, and motion failure segments, which can not be predicted by the global and local motion. For each motion failure segment, a two-link chain code, which uses one chain code to represent two consecutive contour links, followed by an arithmetic coder is proposed for efficient coding. Each motion success segment can be represented by the motion vector and its length. For contour motion estimation and compensation, besides the translational motion model, an affine global motion model is proposed, and investigated for complex global motion. We test the performance of the proposed technique by several MPEG-4 shape test sequences. The experimental results show that our proposed scheme is better than the CAE technique which is applied in the MPEG-4 verification model.

关键词： shape coding video coding chain coding MPEG-4 motion estimation motion compensation

来源：评论

学校读者我要写书评

暂无评论

Fast and accurate automatic SAR image registration using seven invariant moments and improved chain coding of region boundaries - art. no. 67871I

Fast and accurate automatic SAR image registration using sev...

引用

5th International Symposium on Multispectral Image Processing and Pattern Recognition

作者： Wang, Shuang Xiao, Jing Jiao, Licheng Zeng, Liang Xidian Univ Inst Intelligent Informat Proc Xian 710071 Peoples R China

ISBN: (纸本)9780819469519

This paper deals with subpixel accuracy Synthetic Aperture Radar (SAR) image registration which also satisfies real-time demand of SAR image processing. Because of the presence of speckle noise in SAR image, improved region detection method are carried on in reference image and sensed image respectively firstly. Then each region is represented by a set of invariant moments and chain coding of the region boundary. Correspondence between the regions in the reference image and sensed image is established by the improved regions matching criterion which proposed by us. The centers of gravity and the corners on the region boundary are the potential control points. Correspondence between the control points is established in the feature space, using the principle of minimum distance classifier. After finding enough and right matched control points, interpolation and estimation of transformation parameters using least squares method are executed finally.

关键词： Synthetic Aperture Radar image registration moment invariants chain coding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：