Intersection-Free and Topologically Faithful Slicing of Implicit Solid

2013 ◽  
Vol 13 (2) ◽  
Author(s):  
Pu Huang ◽  
Charlie C. L. Wang ◽  
Yong Chen
Keyword(s):  
Rapid Prototyping ◽  
Geometric Error ◽  
Binary Image ◽  
Shape Error ◽  
Contour Extraction ◽  
Line Segments ◽  
Binary Images ◽  
Efficient Approach ◽  
Implicit Solid ◽  
The Given

We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours by a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded. Therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated B-rep of given solids, the memory cost our approach is low—only the binary image and the finest contours on one particular slicing plane need to be stored in-core. Our method is general and can be applied to any implicit representations of solids.

Self-Intersection Free and Topologically Faithful Slicing of Implicit Solid

2011 ◽  
Author(s):  
Pu Huang ◽  
Charlie C. L. Wang ◽  
Yong Chen
Keyword(s):  
Rapid Prototyping ◽  
Geometric Error ◽  
Shape Error ◽  
Contour Extraction ◽  
Line Segments ◽  
Binary Images ◽  
Efficient Approach ◽  
Implicit Solid ◽  
The Given ◽  
Memory Efficient

We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours through a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded; therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated B-rep of given solids, our approach is memory efficient — only the binary image and the finest contours on one particular slicing plane need to be stored in-core. Our method is general and can be applied to any implicit representations of solids.

scholarly journals A Novel Traffic Tracking System Based on division of Video into Frames and Processing

2013 ◽  
pp. 255-259
Author(s):  
Prabhakar Telagarapu ◽  
B. Jagdishwar Rao ◽  
J. Venkata Suman ◽  
K. Chiranjeevi
Keyword(s):  
Tracking System ◽  
Relative Size ◽  
Morphological Processing ◽  
Binary Image ◽  
Video Frame ◽  
Gray Scale ◽  
Binary Images ◽  
Morphological Image Processing ◽  
Car Detection ◽  
Analysis Technique

The objective of this paper is to visualize and analyze video.Videos are sequence of image frames. In this work, algorithm will be developed to analyze a frame and the same will be applied to all frames in a video. It is expected see unwanted objects in video frame, which can be removed by converting colour frames into a gray scale and implement thresh holding algorithm on an image. Threshold can be set depending on the object to be detected. Gray scale image will be converted to binary during thresh holding process. To reduce noise, to improve the robustness of the system, and to reduce the error rate in detection and tracking process, morphological image processing method for binary images is used. Morphological processing will be applied on binary image to remove small unwanted objects that are presented in a frame. A developed blob analysis technique for extracted binary image facilitates pedestrian and car detection. Processing blob’s information of relative size and location leads to distinguishing between pedestrian and car. The threshold, morphological and blobs process is applied to all frames in a video and finally original video with tagged cars will be displayed.

A Hybrid Lossless-Lossy Binary Image Compression Scheme

2013 ◽  
Vol 3 (4) ◽  
pp. 37-50
Author(s):  
Saif alZahir ◽  
Syed M. Naqvi
Keyword(s):  
Image Compression ◽  
Mathematical Models ◽  
Regression Models ◽  
Input Image ◽  
Binary Image ◽  
Large Set ◽  
Image Simulation ◽  
Compression Scheme ◽  
Binary Images ◽  
Visual Distortion

In this paper, the authors present a binary image compression scheme that can be used either for lossless or lossy compression requirements. This scheme contains five new contributions. The lossless component of the scheme partitions the input image into a number of non-overlapping rectangles using a new line-by-line method. The upper-left and the lower-right vertices of each rectangle are identified and the coordinates of which are efficiently encoded using three methods of representation and compression. The lossy component, on the other hand, provides higher compression through two techniques. 1) It reduces the number of rectangles from the input image using our mathematical regression models. These mathematical models guarantees image quality so that rectangular reduction should not produce visual distortion in the image. The mathematical models have been obtained through subjective tests and regression analysis on a large set of binary images. 2) Further compression gain is achieved through discarding isolated pixels and 1-pixel rectangles from the image. Simulation results show that the proposed schemes provide significant improvements over previously published work for both the lossy and the lossless components.

GRAPH-BASED THINNING FOR BINARY IMAGES

1993 ◽  
Vol 07 (05) ◽  
pp. 1009-1030 ◽  
Author(s):  
SATOSHI SUZUKI ◽  
NAONORI UEDA ◽  
JACK SKLANSKY
Keyword(s):  
Input Image ◽  
Binary Image ◽  
Feature Points ◽  
Shape Distortion ◽  
Binary Images ◽  
Ideal Line ◽  
Geographical Maps ◽  
Line Patterns

A thinning method for binary images is proposed which converts digital binary images into line patterns. The proposed method suppresses shape distortion as well as false feature points, thereby producing more natural line patterns than existing methods. In addition, this method guarantees that the produced line patterns are one pixel in width everywhere. In this method, an input binary image is transformed into a graph in which 1-pixels correspond to nodes and neighboring nodes are connected by edges. Next, nodes unnecessary for preserving the topology of the input image and the edges connecting them are deleted symmetrically. Then, edges that do not contribute to the preservation of the topology of the input image are deleted. The advantages of this graph-based thinning method are confirmed by applying it to ideal line patterns and geographical maps.

BINARY IMAGE WATERMARKING THROUGH BLURRING AND BIASED BINARIZATION

2005 ◽  
Vol 05 (01) ◽  
pp. 67-87 ◽  
Author(s):  
HAIPING LU ◽  
YUN Q. SHI ◽  
ALEX C. KOT ◽  
LIHUI CHEN
Keyword(s):  
Discrete Cosine Transform ◽  
Digital Watermarking ◽  
Image Watermarking ◽  
Binary Image ◽  
Experimental Results ◽  
Cosine Transform ◽  
Binary Images ◽  
Blurred Image ◽  
Binarization Threshold

Digital watermarking has been proposed for the protection of digital medias. This paper presents two watermarking algorithms for binary images. Both algorithms involve a blurring preprocessing and a biased binarization. After the blurring, the first algorithm embeds a watermark by modifying the DC components of the Discrete Cosine Transform (DCT), followed by a biased binarization, and the second one embeds a watermark by directly biasing the binarization threshold of the blurred image, controlled by a loop. Experimental results show the imperceptibility and robustness aspects of both algorithms.

APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS

1993 ◽  
Vol 03 (04) ◽  
pp. 383-415 ◽  
Author(s):  
LEONIDAS J. GUIBAS ◽  
JOHN E. HERSHBERGER ◽  
JOSEPH S.B. MITCHELL ◽  
JACK SCOTT SNOEYINK
Keyword(s):  
Greedy Algorithms ◽  
Np Hard ◽  
Basic Approach ◽  
Line Segments ◽  
Minimum Number ◽  
Polygonal Chains ◽  
The Given ◽  
Plane Polygon

We study several variations on one basic approach to the task of simplifying a plane polygon or subdivision: Fatten the given object and construct an approximation inside the fattened region. We investigate fattening by convolving the segments or vertices with disks and attempt to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms. We give some variants that have linear or O(n log n) algorithms approximating polygonal chains of n segments. We also show that approximating subdivisions and approximating with chains with. no self-intersections are NP-hard.

Forming Type Rapid Prototyping Development - Error Compensation with Shape Measurement -

2008 ◽  
Vol 2 (6) ◽  
pp. 462-467 ◽  
Author(s):  
Hidetake Tanaka ◽  
◽  
Naoki Asakawa ◽  
Masatoshi Hirao ◽  
Keyword(s):  
Rapid Prototyping ◽  
Sheet Metal Forming ◽  
Metal Forming ◽  
Error Compensation ◽  
Industrial Robot ◽  
Shape Measurement ◽  
Shape Error ◽  
Range Finder ◽  
Tool Positioning ◽  
Computer Aided

This study deals with the automation of metal hammering using an industrial robot and trial development of rapid prototyping of sheet metal forming. Computer-aided manufacturing (CAM) takes into account feedback considering tool positioning by using a range finder to improve depth and shape error at workpiece corners. Experimental results confirmed that our proposal reduces shape error through tool positioning optimization.

Character Detection and String Identification on a Signboard in Scene Image Based on Criterions of Segmented Images

2011 ◽  
Vol 103 ◽  
pp. 658-666
Author(s):  
Hideaki Kawano ◽  
Hideaki Orii ◽  
Hiroshi Maeda
Keyword(s):  
Image Segmentation ◽  
Binary Image ◽  
Color Information ◽  
Binary Images ◽  
Input Interface ◽  
Scene Image ◽  
Segmented Images

In this paper, a method which specifies the signboard region and extracts the charactersinside the signboard is proposed.We usually take notes not to forget what we should leave to memory.But it is often that the task is too troublesome. Our aim is the development of a new input-interface soas to input texts froma picture.Most of signboards are composed of almostmonochromatic region. Onthe basis of this observation, image segmentation using color information is applied, and then we getsome binary images by applying threshold for each segmented region. Each binary image is enclosedby the smallest circumscribed square. The signboard region is specified according to distribution andarea of the white pixels inside the square. As a result of experiment, we confirmed the effectivenessof the proposed method.

The Research on Pan-Genes of an Object Boundary

2011 ◽  
Vol 65 ◽  
pp. 530-535
Author(s):  
Jun Ying Tian ◽  
Jian Hai Han ◽  
Hong Lin Chen
Keyword(s):  
Binary Image ◽  
Object Boundary ◽  
Chain Code ◽  
Line Segments ◽  
Basic Properties ◽  
Internal Relations ◽  
A Chain ◽  
Regional Boundary

The aim of this paper is to give some researches and instructions of relations between the special shapes of an object boundary and their 8-adjacency chain code strings, characteristics of these chain code strings, internal relations among these chain code strings. These characteristics can be used to identify the region of an object boundary, when necessary, to generate this regional boundary. But this is irrelevant to various operations on image. This function of a chain code string is similar to the roles of genes in biology, is called pan-genes. An object boundary on binary image is considered by many tiny line segments connected with each other. The research on characteristics of chain code strings of line segments is an important segment of recognition and generation of an object boundary. This paper gives characteristics of chain code strings of pan-genes corresponding line segments, relations among these chain code strings, chain code string organization forms of chain code string units of line segments (these units are abbreviated with UL), the effective ways and methods on recognition and generation of line segments. Thus, this paper studies the chain code features of corners and circles. This paper gives a variety forms and features of ULs, shows the effects and methods on recognition and generation of an object boundary, gets basic properties of chain code strings about corners and circles.

Sign in / Sign up

Export Citation Format

Share Document