No description available.

No description available.

Euclidean distance transformation is a fundamental technique in image understanding and computer vision. Some important characteristics in image analysis such as skeleton and object boundary are based upon the distance transformation computation. In this thesis, we compare our method of computing Euclidean distance transformations with the method of Chamfer distance transformation. Our method is faster and more accurate than the Chamfer method. The boundary detection is an interesting and challenging task in computer vision. We integrate distance transform, watershed transform and active contour model to achieve boundary detection. Our method can successfully separate the touching objects, so as to facilitate the subsequent image processing for obtaining the geometric, and texture characteristics of objects. These features are useful for further medical images applications.

My master's thesis deals with the different techniques used in fingerprints processing for identifying fingerprints. Using the software tool Visual C++ and functions of OpenCV library I programmed a separate application, that is able to select from a database of fingerprints the most consistent with a comparative fingerprint images, even when they are mutually shifted in the direction of axes X and Y. The next step in my program is to gather the edges of the fingerprint image. Those obtained using Canny edge detector. Furthermore, getting the contours of the image edges. To determine, whether the contours are the same, just compare some characteristic points of contours. Next I use a histogram function to determine the number of points for approximation of contours and evaluating compliance fingerprints. Since the processing of the input fingerprint image (or rather the approximation of the contour points) remains in the picture as black (background) and red (the approximation of the contour points), this means, that zero and the last element of the histogram represent the number of black and red points. Comparison is in percentage and is obtained by subtracting the approximated points of contours image from the original fingerprint image of approximated contour points of matched fingerprints. It determined, what percentage of red points have disappeared, so as to match two fingerprint images. If on the resulting figure is not left neither a red point, that corresponds to 100% of the fingerprints Compliance.

<p> This thesis is a feasibility study of the application of a point-to-point numerical control (N/C) machine for contour cutting work. It comprises three basic parts which are divided into ten chapters. </p> <p> The first part deals with the primary objectives of this project and the N/C machine's hardware and software descriptions. </p> <p> The second part introduces the utilization of computer-aided programming and presents an original translation program necessary for this particular work. </p> <p> The last part gives several examples and describes the outcomes of the study; and is concluded with some objective discussions. </p> / Thesis / Master of Engineering (MEngr)

No description available.

Statistics of met-ocean conditions including wind, current and wave at the location between west and central Gulf of Mexico (GOM) are derived based on about three year of field measurements. Two-parameter Weibull distribution has been employed to fit wind speed at 10m over sea level and current speed in various depth. The joint probability contour was derived based on First-Order Reliability Method. In addition, the joint distribution of wind speed and direction was visualized by wind-rose diagram. The results provided in this study may provide essential information to the probability distribution of met-ocean condition in the particular location and can be used as a reference in the future designs.

For a vertex x of G, the eccentricity e (x) is the distance between x and a vertex farthest from x. Then x is a contour vertex if there is no neighbor of x with its eccentricity greater than e (x). The x-y path of length d (x,y) is called a x-y geodesic. The geodetic interval I [x,y] of a graph G is the set of vertices of all x-y geodesics in G. For S ⊆ V , the geodetic closure I [S] of S is the union of all geodetic intervals I [x,y] over all pairs x,y ∈S. A vertex set S is a geodetic set for G if I [S] = V (G). In this thesis, we study the contour sets of product graphs and discuss these sets are geodetic sets for some conditions.

Thesis (Ph. D.)--University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 535-571). Available also in a digital version from Dissertation Abstracts.

Thesis (Ph. D.)--University of Wisconsin, 1964. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 78-81).