Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Physical Sciences and Mathematics
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh
Computer Science: Faculty Publications and Other Works
In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of "congestion" and "dilation" measures for a set of packet paths. We give, for any constant ϵ > 0, a randomized on-line algorithm for routing any set of Npackets in O((C lgϵ(Nd) + D lg(Nd))/lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into …
On Texture Image Analysis Using Fractal Geometry Based Features., Nirupam Sarkar Dr.
On Texture Image Analysis Using Fractal Geometry Based Features., Nirupam Sarkar Dr.
Doctoral Theses
Visual textureTexture is a property to characterize a region of a scene. A set of natural texture images is shown in Fig. 1.1. A specific texture may be generated due to certain organization of several objects in a region, or due to the reflectance pattern caused by color variation or unevenness of an object surface. Since texture provides a lot of information of a region, texture analysis and synthesis are important components of digital image processing.It is difficult to provide a formal definition of texture although we perceive and recognize texture rather easily. According to Sklansky [152) "A region in …
Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr.
Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr.
Doctoral Theses
Machine recognition [1, 2] of patterns can be viewed as a two-fold task, consisting of learning the invariant and common properties of a set of samples characterizing a class, and of deciding a new sample as a possible member of the class by noting that it has properties common to those of the set of samples. In other words, pattern recognition by computers can be described as a transformation from the measurenment space M to the feature space F and finally to the decision space D (1), i.e., M ⟶F⟶D.Here, the mapping 6 : F⟶D is the decision function and …
Connectionist Models For Certain Tasks Related To Object Recognition., Jayanta Basak Dr.
Connectionist Models For Certain Tasks Related To Object Recognition., Jayanta Basak Dr.
Doctoral Theses
Recognition of objects in an image, according to Suetens et al. [1), relers to the task of finding and labeling parts of a two-dimensional image of a scene that correspond to the real objects in the scene. Object recognition is necessary in a variety of domains like robot navigation, aerial imagery analysis, industrial inspection and so on. Normally, different strategies for object recognition (1-(5] involve establishing some model for each object, i.e., some general description of each object, and then labeling different parts of the scene according to the knowledge about the models.Object models can have two-dimensional (2D) or three-climensional …
On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr.
On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr.
Doctoral Theses
The problems of detection and use of reflectional symmetry in the images of planar shape contours are studied. Symmetry, in general, provides important shape representation cues, some of which we utilise here, to acquire viewpoint information and, towards model based shape matching. We concentrate on local reflectional symmetries of emoothly curved planar objecta, though the methoda are equally applicable to polygonal objects; even this could be extended to certain three-dimensional shapes and for other object relations such as rotational symmetry.Under the affine or perspective approximation to image projection, properties of geometrie invariance are used to find (reflectional) symmetric contour pairs. …
Tact Volume 4 Issue 1, Touro College Department Of Academic Computing
Tact Volume 4 Issue 1, Touro College Department Of Academic Computing
Yearbooks and Newsletters
"Touro Academic Computing Technologies: The Newsletter of Academic Computing at Touro College"
Some Contributions To Linear Complementarity Problem., G. S. R. Murthy Dr.
Some Contributions To Linear Complementarity Problem., G. S. R. Murthy Dr.
Doctoral Theses
This dissertation deals with a number of problems related to linear comple- mentarity problem (LCP). Given a real square matrix A of order n and a real n-vector q, the LCP is to find a nonnegative n-vector z such that Az + q 2 0 and zt(Az + 9) = 0. There is vast literature on LCP, evolved during the last four decades. LCP plays a crucial role in the study of mathematical program- ming from the view point of algorithms as well as applications. The inherent nature of the problem has led the researchers to introduce and study a …
Polygonal Approximation And Scale-Space Analysis Of Closed Digital Curves., Bimal Kumar Roy Dr.
Polygonal Approximation And Scale-Space Analysis Of Closed Digital Curves., Bimal Kumar Roy Dr.
Doctoral Theses
This thesis presents a series of algorithms for polygonal approximation of closed digital curves followed by scale-space analysis with its application to corner detection.Approximation of a closed curve by plece straight line segments is known as polygonal approximation. Any curve can be approximated by a polygon with any desired degree of accuracy.Polygonal approximation is useful in reducing the number of points required to represent a curve and to smooth data. Such representation facilitates extraction of numerical features for description and classification of curves. Basically there are two approaches to the problem. One is to subdivide the points into groups each …
Finding Connected Components On A Scan Line Array Processor, Ronald I. Greenberg
Finding Connected Components On A Scan Line Array Processor, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
This paper provides a new approach to labeling the connected components of an n x n image on a scan line array processor (comprised of n processing elements). Variations of this approach yield an algorithm guaranteed to complete in o(n lg n) time as well as algorithms likely to approach O(n) time for all or most images. The best previous solutions require using a more complicated architecture or require Omega(n lg n) time. We also show that on a restricted version of the architecture, any algorithm requires Omega(n lg n) time in the worst case.