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 presents an architecture for Sobel edge detection on Field Programmable Gate Array (FPGA) board, which is inexpensive in terms of computation. Hardware implementation of the Sobel edge detection algorithm is chosen because hardware presents a good scope of parallelism over software. On the other hand, Sobel edge detection can work with less deterioration in high level of noise. A compact...
This article proposes a novel method for Sine value computation and aims to design a fast FPGA based architecture for it. Unit Circle method for sine value calculation is a new one where a triangle is presumably located in the first quadrant of the circle of unit radius. Using the area calculation concept, the y coordinate of the third vertex of the triangle is approximated and this approximated value...
This study aims to design a fast FPGA based system for computation of the Square Root and Inverse Square Root values using modified Quake's algorithm. In this work, new seven magic numbers along with their ranges are introduced for faster computation of square root and inverse square root using Quake's algorithm and its respective FPGA based architecture have been proposed. The FPGA based system is...
In this paper, a novel Automatic Cartoon Movie Builder (ACMB) system has been proposed to generate a cartoon movie based on a given story collected from the user and this concept is new in the literature. It has useful applications in cinematography and especially in the world of animation. The system has two types of databases: (a) Movie Database (DB-M) consisting of cartoon movies (animations) collected...
Cotton yarn defect such as neps which are highly entangled fibres causes a serious problem in the textile industry. In this study, two types of cotton yarn neps, viz. seed coat and fibrous neps are classified by means of probabilistic neural network (PNN) using the features extracted from the images of neps. A k-fold cross validation technique has been applied to assess the performance of the PNN...
This paper proposes a novel approach to colorize a gray scale facial image with the selected reference face using patch matching technique. The colorization methodology has been applied on facial images due to their extensive use in various important fields like archaeology, entertainment, law enforcement etc. The experiment has been conducted with 150 male and female facial images collected from...
This paper proposes a novel methodology to find a facial image similar in complexion of a given query image from a facial image database. There are a lot of methodologies described in literature to find the distance between two images. But none of the existing methodologies has focused on the complexion based searching and that is why they don't give satisfactory result in this aspect. But the proposed...
The FAce SYnthesis (FASY) system described in this paper, presents a novel face construction approach based on textual description with the stored facial components extracted from different face databases. The system has two types of databases: (a) Full Face Database (DB-F) consisting of frontal face images collected from different face databases (b) Facial Component Database (DB-C) consisting of...
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.