Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Portland State University

Dissertations and Theses

Image processing -- Digital techniques

Electrical and Computer Engineering

Articles 1 - 6 of 6

Full-Text Articles in Engineering

A Simplified Approach To Reduce Blocking And Ringing Artifacts In Transform-Coded Images, Jianping Hu Feb 1997

A Simplified Approach To Reduce Blocking And Ringing Artifacts In Transform-Coded Images, Jianping Hu

Dissertations and Theses

Presently Block-based Discrete Cosine Transform (BDCT) image coding techniques are widely used in image and video compression applications such as JPEG and MPEG. At a moderate bit rate, BDCT is usually a quite satisfactory solution to most of practical coding applications. However, for high rate compression it produces noticeable blocking and ringing artifacts in the decompressed image. It has been an active research area for a decade for reducing these artifacts. In this thesis, a novel post-processing algorithm is proposed to remove the blocking and ringing artifacts at low bit rate. It is non-iterative and uses both spatial and transform …


Low To Medium Level Image Processing For A Mobile Robot, Cecilia H. Espinosa Jan 1991

Low To Medium Level Image Processing For A Mobile Robot, Cecilia H. Espinosa

Dissertations and Theses

The use of visual perception in autonomous mobile systems was approached with caution by mobile robot developers because of the high computational cost and huge memory requirements of most image processing operations. When used, the image processing is implemented on multiprocessors or complex and expensive systems, thereby requiring the robot to be wired or radio controlled from the computer system base.


Invariant Pattern Recognition Algorithm Using The Hough Transform, Duwang Li Jan 1989

Invariant Pattern Recognition Algorithm Using The Hough Transform, Duwang Li

Dissertations and Theses

A new algorithm is proposed which uses the Hough Transform to recognize two dimensional objects independent of their orientations, sizes and locations. The binary image of an object is represented by a set of straight lines. Features of the straight lines, namely the lengths and the angles of their normals, their lengths and the end point positions are extracted using the Hough Transform. A data structure for the extracted lines is constructed so that it is efficient to match the features of the lines of one object to those of another object, and determine if one object is a rotated …


Parallel Approximate String Matching Applied To Occluded Object Recognition, David Smith Jan 1987

Parallel Approximate String Matching Applied To Occluded Object Recognition, David Smith

Dissertations and Theses

This thesis develops an algorithm for approximate string matching and applies it to the problem of partially occluded object recognition. The algorithm measures the similarity of differing strings by scanning for matching substrings between strings. The length and number of matching substrings determines the amount of similarity. A classification algorithm is developed using the approximate string matching algorithm for the identification and classification of objects. A previously developed method of shape description is used for object representation.


Quadtree-Based Processing Of Digital Images, Ramin Naderi Jan 1986

Quadtree-Based Processing Of Digital Images, Ramin Naderi

Dissertations and Theses

Image representation plays an important role in image processing applications, which usually. contain a huge amount of data. An image is a two-dimensional array of points, and each point contains information (eg: color). A 1024 by 1024 pixel image occupies 1 mega byte of space in the main memory. In actual circumstances 2 to 3 mega bytes of space are needed to facilitate the various image processing tasks. Large amounts of secondary memory are also required to hold various data sets.

In this thesis, two different operations on the quadtree are presented.

There are, in general, two types of data …


Two New Parallel Processors For Real Time Classification Of 3-D Moving Objects And Quad Tree Generation, Farjam Majd Jan 1985

Two New Parallel Processors For Real Time Classification Of 3-D Moving Objects And Quad Tree Generation, Farjam Majd

Dissertations and Theses

Two related image processing problems are addressed in this thesis. First, the problem of identification of 3-D objects in real time is explored. An algorithm to solve this problem and a hardware system for parallel implementation of this algorithm are proposed. The classification scheme is based on the "Invariant Numerical Shape Modeling" (INSM) algorithm originally developed for 2-D pattern recognition such as alphanumeric characters. This algorithm is then extended to 3-D and is used for general 3-D object identification. The hardware system is an SIMD parallel processor, designed in bit slice fashion for expandability. It consists of a library of …