The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes an offline approach to generating an optimal vacation routing plan to maximize the number of places to visit during the vacation duration. A traveling salesman problem algorithm results in a plan with the shortest path of travel given a number of stops. This solution is not suitable as a travel planner needs to take into account the operating hours and duration of stay at each...
Asian students with conservative behaviors tend to feel embarrassed and reluctant to ask questions in large classrooms. This paper proposed a mobile-compatible web-based question and answer application to address the aforementioned problem. This proposed web application is known as Quick Question (QQ). QQ is designed to allow students to post questions anonymously and rapidly during class hours. QQ...
This paper proposes a computer vision approach aimed at improving the operation of an elevator based on its spatial occupancy. Besides parameters such as weight and number of persons, we use floor space as an additional parameter to determine occupancy more accurately. Our approach combines the use of Horn-Schunck optical flow to monitor opening and closing of the elevator's door so that the floor...
In this paper, the effect of using multi-image and single-image super-resolution to reduce registration errors of low resolution images is evaluated. Two sets of low resolution images were captured using CMUCam4 to perform the evaluation. Moreover, a simplified method that make use of feature points extracted from resolution enhanced / upscaled images to improve the registration of low resolution...
This paper describes the pedagogy of how the 7-week course on computer fundamentals is introduced and taught to a class of 700 first year undergraduate students from the schools of business and computing. The computer fundamentals course itself covers theoretical topics such as the hardware and software of computers, information systems and programming basics as well as practical topics such as using...
This paper proposes a novel human detection and validation methodology to help the visually impaired navigate in indoor environments. We used two-stage multiscale cascade object detectors with Haar features, to detect upper body parts at different poses. The resulting detections are validated by scaling them down to their annotated size and performing a multiscale window search of possible face poses...
This paper proposes multigoal implementations of the Dijkstra's shortest path algorithm and the boundary iterative-deepening depth-first search (BIDDFS). The algorithms were modified to allow for the search of more than one goal in a single expansion pass. The aim of this is to reduce the operational redundancy and hence the time taken for calculating multiple start-goal node pairs. Simulations using...
The aim of this paper is to investigate the effects of rainfall on image stitching by measuring the performance of the Harris corner detector, Scale-Invariant Feature Transform (SIFT) detector, and the Speeded Up Robust Feature (SURF) detector. A set of images were captured by using two cameras during light rain and during heavy rain. The number of detected features points was used as the performance...
This paper proposed an energy efficient multi-view visual processing scheme for the visual sensor networks (VSNs). The aim of this scheme is to reduce the energy consumption by reducing the amount of data need to be transmitted over the network. This is achieved by using two approaches. First, an image compression based on the Set Partitioning in Hierarchical Trees (SPIHT) [1] algorithm is implemented...
In this paper we propose a single-pass strip-based watershed segmentation using multibank memory. This watershed segmentation is based on rainfall simulation and is targeted for low memory applications whereby only a small amount of memory is needed for processing at any one time. Using multiple memory banks for storage also ensures that clock cycles for memory accesses are kept to a minimum.
Connected component processing is a method used for segmenting an image into regions by means of grouping connected pixels of similar value. To do this, the current pixel value is compared to other connected pixel values, typically four or eight other values. Multiple read cycles would be required if these values are stored in a single bank memory. This paper presents an application of multiple-bank...
This paper presents a multiple memory bank approach to allow parallel access to the current and neighbourhood pixel values. The storage requirement of the multiple bank implementation is the same as a single bank implementation by using a graph-based memory bank addressing scheme. This scheme uses the pixel locations to determine bank and location within the bank. Using this scheme, the bank is determined...
This paper proposes a 3D watershed algorithm based on the 2D rainfall-simulation based watershed. It shares the same procedure of finding the steepest descending path, with the difference being the number of connectivity and the location of the neighbours. The aim of the 3D watershed is to segment out volumes from a 3D space. This kind of segmentation can be useful in areas such as medical imaging...
In this paper we describe a face detection method from grayscale images using a watershed based region segmentation with a neural network classifier. The algorithm segments the image into regions using a watershed algorithm. The regions are later merged and filtered leaving highly probable face region candidates. Using the dynamic supervised forward propagation network (DSFPN), the system then verifies...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.