In this work we model the problem of identifying how close structurally two proteins are as a problem of measuring the similarity between color images that represent their contact maps, where the chromatic information...
详细信息
ISBN:
(纸本)0769522270
In this work we model the problem of identifying how close structurally two proteins are as a problem of measuring the similarity between color images that represent their contact maps, where the chromatic information encodes the chemical nature of the contacts. We study two conceptually distinct methods to measure the similarity between such contact maps: a content-based image retrieval one and another based on image registration. In experiments with contact maps constructed from the PDB, the image registration approach was able to identify with 100% precision 8 instances of a protein class mixed with 28 proteins of other classes. The content-based image retrieval approach had an accuracy only a little worse than that.
In this paper we address the problem of lane detection and lane tracking. A linear model is used to approximate lane boundaries in the first frame of a video sequence, using a combination of the edge distribution func...
详细信息
ISBN:
(纸本)0769522270
In this paper we address the problem of lane detection and lane tracking. A linear model is used to approximate lane boundaries in the first frame of a video sequence, using a combination of the edge distribution function and the Hough Transform. A new linear-parabolic model is used in the subsequent frames: the linear part of the model is used to fit the near vision field, while the parabolic model fits the far field. The proposed technique demands low computational power and memory requirements, and showed to be robust in the presence of noise, shadows, lack of lane painting and change of illumination conditions.
Topologically adaptable snakes, or simply T-snakes, are a standard tool for automatically identifying multiple segments in an image. This work introduces a novel approach for controlling the topology of a T-snake. It ...
详细信息
ISBN:
(纸本)0769522270
Topologically adaptable snakes, or simply T-snakes, are a standard tool for automatically identifying multiple segments in an image. This work introduces a novel approach for controlling the topology of a T-snake. It focuses on the loops formed by the so-called projected curve which is obtained at every stage of the snake evolution. The idea is to make that curve the image of a piecewise linear mapping of an adequate class. Then, with the help of an additional structure-the Loop-Tree-it is possible to decide in O(1) time whether the region enclosed by each loop has already been explored by the snake. This makes it possible to construct an enhanced algorithm for evolving T-snakes whose performance is assessed by means of statistics and examples.
The image Foresting Transform (IFT) has been proposed for the design of image operators based on connectivity. The IFT reduces imageprocessing problems into a minimum-cost path forest problem in a graph derived from ...
详细信息
ISBN:
(纸本)0769522270
The image Foresting Transform (IFT) has been proposed for the design of image operators based on connectivity. The IFT reduces imageprocessing problems into a minimum-cost path forest problem in a graph derived from the image. It has been successfully used for image filtering, segmentation, and analysis. In this work, we propose a novel image operator which solves segmentation by pruning trees of the forest. First, an IFT is applied to create an optimum-path forest whose roots are pixels selected inside a desired object. In this forest, the background consists of a few subtrees rooted at pixels on the object's boundary. These boundary pixels are identified and their subtrees are eliminated, such that the remaining forest defines the object. The tree pruning is an effective alternative to situations where image segmentation methods based on competing seeds fail. We present an interactive implementation of the tree-pruning technique, show several examples and discuss some experiments toward fully automatic segmentation.
We present an algorithm for polygonizing closed implicit surfaces, which produces meshes adapted to the local curvature of the surface. Our method is similar to, but NOT based on, Marching Triangles, in that we start ...
详细信息
ISBN:
(纸本)0769522270
We present an algorithm for polygonizing closed implicit surfaces, which produces meshes adapted to the local curvature of the surface. Our method is similar to, but NOT based on, Marching Triangles, in that we start from a point on the surface and develop a mesh from that point using a surface-tracking approach. In a marked departure from previous approaches, our meshes approximate the surface through heuristics relying on curvature. Furthermore, our method works completely on-the-fly, resolving cracks as it proceeds, without the need for any post-remeshing step to correct failures. We have tested the algorithm with three different representations of implicit surfaces, Variational, analythical and MP U, using non-trivial data sets, yielding results that illustrate the flexibility and scalability of our technique. Performance comparisons with variants of Marching Cubes show that our approach is capable of good accuracy and meshing quality without sacrificing computing resources.
This paper presents a new approach for interactive editing of multiresolution meshes. Editing operations (e.g. scaling and rotation) are confined to mesh regions of interest, called sub-meshes. Also, intuitive deforma...
详细信息
ISBN:
(纸本)0769522270
This paper presents a new approach for interactive editing of multiresolution meshes. Editing operations (e.g. scaling and rotation) are confined to mesh regions of interest, called sub-meshes. Also, intuitive deformation operations (e.g. tapering and twisting) as required for animation systems can be used as well, allowing the user to have control on the local deformations of mesh objects. For that, each sub-mesh is defined interactively by picking up the cells of its frontier. Alternatively, a sub-mesh can be delimited by the shortest path of edges that approximates the intersection between a mesh and a given cutting plane. In order to speed up editing operations, the mesh is first simplified, the target sub-mesh is edited, and finally the whole mesh is refined back to its original resolution. This is particularly important for large meshes.
Inpainting digital models have been since the late 1990's a powerful image reconstruction tool for missing data. After the original work of Bertalmio, Sapiro, Caselles and Ballester [1] several different approache...
详细信息
ISBN:
(纸本)0769522270
Inpainting digital models have been since the late 1990's a powerful image reconstruction tool for missing data. After the original work of Bertalmio, Sapiro, Caselles and Ballester [1] several different approaches have been used to tackle the problem. Some are based on Partial Differential Equations to model a transport process and a diffusion process, others are based on the Eider elastica functional. This paper presents a model using the level lines continuation to perform the filling-in of the inpainting domain D. The model is proposed in a way as to satisfy the "Connectivity Principle". The image u(x,y) is represented by a family of level lines and the missing part Of the image is filled-in by the propagation of the available surrounding information, from outside to inside of the inpainting domain D along the level lines of the image. After defining the domain D the restoration process becomes automatic and the final result u(x, y, t(n)) is carried out by the evolutionary process starting with the initial degraded image u(x, y, 0). Examples on real and textured images show the performance of this proposed model.
Today's reticle inspection tools can provide a wealth of information about defects. We introduce here a system called DIVAS: Defect Inspection Viewing, Archiving, and Simulation that fully uses and efficiently man...
详细信息
ISBN:
(纸本)0819446750
Today's reticle inspection tools can provide a wealth of information about defects. We introduce here a system called DIVAS: Defect Inspection Viewing, Archiving, and Simulation that fully uses and efficiently manages this wealth of defect information. In this paper, we summarize the features of DIVAS and describe in more detail PRIMADONNA, one of its components. Current reticle defect specifications are based, primarily, on defect size. Shrinking design rules, increasing MEEF and use of Optical Enhancement Techniques cause size to be an inadequate criterion for disposition. Furthermore, visual disposition of defects is not automated, strictly reproducible, or directly tied to wafer lithography. To compensate for these inadequacies, reticle specifications are set conservatively adding direct and hidden costs to the manufacturing process. PRIMADONNA, utilizing PROLITH(TM) as the simulation engine, retrieves all defect and reference images saved from a KLA-Tencor SLF77 inspection tool and processes them through a series of increasingly rigorous simulation stages. These include pre-filtering, aerial image formation, and post filtration. Difference metrics are used to quantify a defect's wafer impact. We will report results comparing PRIMADONNA decisions to manual STM classifications for a significant volume of inspections. Correlation between PRIMADONNA results and AIMs(TM) metrology will be presented.
作者:
Schmanske, Brian M.Loew, Murray H.George Washington University
School of Engineering and Applied Science Institute for Medical Imaging and Image Analysis Department of Electrical and Computer Engineering 801 22nd Street NW WashingtonDC20052 United States
An efficient subband implementation of the channelized Hotelling observer is presented, which can be used to assess the image quality of images compressed with wavelet-based techniques. The channelized Hotelling model...
详细信息
Today video searching systems are required for interactive video communication service andcomputer network system. It is the most effective for visual communication. Then, we consider the method of extracting image a...
详细信息
Today video searching systems are required for interactive video communication service andcomputer network system. It is the most effective for visual communication. Then, we consider the method of extracting image and matching the feature tables in video searching system. In this paper, we pay attention to temporal characteristics in video retrieval methods. So we propose the temporal approach which grouping parameters of the correlation value are used in order to reduce matching time. As these characteristics, we used the luminance frequency. Next matching methods are verified from the viewpoints of the processing time and matching precision between query images and database images. Finally, our proposed method is evaluated from the viewpoint of probability model by simulation results, and it is shown that grouping methods are particularly useful.
暂无评论