A robust image similarity measure is presented for patterned triangles. A novel feature of the new similarity measure is the reduction of the patterns to a simple set of affineinvariant bar-codes.
ISBN:
(纸本)9780889867192
A robust image similarity measure is presented for patterned triangles. A novel feature of the new similarity measure is the reduction of the patterns to a simple set of affineinvariant bar-codes.
Rotation minimizing frames (RMFs) have the property of minimum twist which makes them useful for computergraphics, swept surface or generalised cylinder constructions, motion design and control in computer animation ...
详细信息
Rotation minimizing frames (RMFs) have the property of minimum twist which makes them useful for computergraphics, swept surface or generalised cylinder constructions, motion design and control in computer animation and robotics, streamline visualization, and tool path planning in CAD/CAM. Recent advances in two main research topics, polynomial helices and rational rotation minimizing frame (RRMF) curves, in the theory of Pythagorean-hodograph (PH) curves let us study RRMFs on quintic helices. We first give a condition on a polynomial helix of any degree to have an RRMF, which leads a simplification of rational approximation to RMFs on monotone-helical PH quin tics. Then we prove the nonexistence of RRMFs on both general and monotone quintic helices.
Topology preservation is a crucial issue of digital topology. Various applications of binary image processing rest on topology preserving operators. Earlier studies in this topic mainly concerned with reductions (i.e....
详细信息
Topology preservation is a crucial issue of digital topology. Various applications of binary image processing rest on topology preserving operators. Earlier studies in this topic mainly concerned with reductions (i.e., operators that only delete some object points from binary images), as they form the basis for thinning algorithms. However, additions (i.e., operators that never change object points) also play important role for the purpose of generating discrete Voronoi diagrams or skeletons by influence zones (SKIZ). Furthermore, the use of general operators that may both add and delete some points to and from objects in pictures are suitable for contour smoothing. Therefore, in this paper we present some new sufficient conditions for topology preserving reductions, additions, and general operators. Two additions for 2D and 3D contour smoothing are also reported.
This paper analyzes the theoretical foundations of the invariant, robust, and stable methods in computer vision applications. Some studies had shown that many known invariants used in pattern recognition algorithms ar...
详细信息
ISBN:
(纸本)9780889867192
This paper analyzes the theoretical foundations of the invariant, robust, and stable methods in computer vision applications. Some studies had shown that many known invariants used in pattern recognition algorithms are not robust to small changes in images and robust parameters of these algorithms are not invariant. We provide a conceptual framework for new studies on invariance, robustness, and stability of computer vision algorithms critical for applications. Based on this theoretical analysis new invariant, robust and stable methods suited for the complexity of computer vision tasks, can be designed.
Graphs are used for many purposes in natural sciences, social sciences, computer science, engineering, business, and media. In some cases, graphs have been drawn by computers but digital data is lost and only the prin...
详细信息
Graphs are used for many purposes in natural sciences, social sciences, computer science, engineering, business, and media. In some cases, graphs have been drawn by computers but digital data is lost and only the printed drawing is left. Hence, the user wants to reconstruct the graph from the drawing, e.g. a UML diagram from a drawing of an older software system where the original design is only left as documentation on paper. We offer a approach based on image processing and optical character recognition (OCR) to solve a larger sub-task of this overall problem. We reconstruct the graph topology and node labels directly from the drawing and store the result in a digital graph format. Especially, we deal with crossing edges and node labels inside outside nodes.
A simple method is presented for approximating smooth surfaces to Quad/Triangle meshes using bi-quadratic patches. Unlike other methods, it does not need a preliminary refinement step and uses fewest patches. A patch ...
详细信息
ISBN:
(纸本)9780889868243
A simple method is presented for approximating smooth surfaces to Quad/Triangle meshes using bi-quadratic patches. Unlike other methods, it does not need a preliminary refinement step and uses fewest patches. A patch is constructed corresponding to each vertex of initial mesh. The patch will be a bi-quadratic Bezier patch if the valence of the vertex is four and otherwise the neighborhood of the extraordinary vertices is covered by a quadratic n-sided Zheng-Ball patch. Simple conditions are used to obtain smooth surfaces.
In this work, we propose a parallel algorithm for image segmentation. Our method is an unsupervised image segmentation procedure, which is a combination of a graph based image segmentation algorithm and parallel Fiedl...
详细信息
In this work, we propose a parallel algorithm for image segmentation. Our method is an unsupervised image segmentation procedure, which is a combination of a graph based image segmentation algorithm and parallel Fiedler vector computation algorithm. In this work, whole image is handled as a weighted graph, whose vertices are the pixels. As the segmentation method, we use Fiedler vector, which is the eigenvector which corresponds to the second smallest eigenvalue of the graph Laplacian matrix. Laplacian matrices belonging to big images can be undesirably large, thus the Laplacian matrix of an M × N sized image has the size of (M × N) × (M × N). Parallelization is needed since the calculation of Fiedler vector with a serial algorithm is time consuming and the Laplacian matrix is large. The visual results of segmentation process is satisfactory and also scale-up for parallelization is well for at least 64 processors.
In this paper, we propose an efficient architecture for the adaptive deblocking filter in H.264/AVC video coding standard. We use eight forwarding shift register arrays (of which each contains 4×4 8-bit shift reg...
详细信息
ISBN:
(纸本)0889865140
In this paper, we propose an efficient architecture for the adaptive deblocking filter in H.264/AVC video coding standard. We use eight forwarding shift register arrays (of which each contains 4×4 8-bit shift registers) with two transposing operations and two filter units to support simultaneous processing of the horizontal and vertical filtering. The proposed architecture is called "Pipeline Buffer Shift Register (PBSR)." As a result, the performance of PBSR is 22.5% faster than the advanced architecture of the previous proposal. Moreover, the number of total memory references is reduced to 37% and 75% respectively compared to the basic and advanced architectures of the previous proposals.
Automated visualization of circuits is an important research area in electronic design automation. In contrast to the numerous papers and work done on graph and hypergraph drawing on equal size nodes, this paper prese...
详细信息
ISBN:
(纸本)9780889867192
Automated visualization of circuits is an important research area in electronic design automation. In contrast to the numerous papers and work done on graph and hypergraph drawing on equal size nodes, this paper presents a framework to efficiently cope with nodes that are orders of magnitudes different in size. To improve the clarity of the drawing a crossing reduction step and a fast routing heuristic are applied which try to avoid unnecessary crossings and bends within the wiring. Experimental results are provided which show that the run time remains small enough to drive an interactive tool even on very large circuit benchmarks.
This paper presents a novel method to construct a surface by interpolating and/or approximating a set of unorganized sparse three-dimensional curves. No assumptions are made regarding topological relations among the c...
详细信息
ISBN:
(纸本)9780889867192
This paper presents a novel method to construct a surface by interpolating and/or approximating a set of unorganized sparse three-dimensional curves. No assumptions are made regarding topological relations among the curves, except that typically they do not touch each other. The proposed method first builds a topology among the given curves then uses it to construct the surface geometry. Applications include modeling, fast prototyping, and the definition of curves for the construction of surfaces.
暂无评论