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.
As the image size increases, it is difficult to perform the large size image processing on a single computer in a limited time. One of the most efficient solving methods is parallel computing. Most numerical approaches for image computing with nonlinear diffusion filtering by means of an unconditional stable semi-implicit schemes are implemented based on an additive operator splitting (AOS) scheme...
Due to the rapidly growth of multimedia communication, video image deblurring has become a hot issue in image processing. As the image size increases, it is difficult to perform the large size image deblurring computation on a single computer in a limited time. One of the most efficient solving methods is parallel computing. In this paper, we first introduce a variational equation for the blurred...
With the multi-core technology be widely used in PCs, multithreading method becomes the most efficient programming tool for improving the computation capacity on a single processor. Especially in image processing, most numerical approaches are based on the computing over the pixel matrices. As the image size increases, more time consuming is needed. In this paper, a parallel method to perform the...
As the image size increases, most numerical approaches for image registration based on the pixel matrices computation will cost a large executing time, then one of the most efficient solving methods is parallel computing. In this paper, we discuss two parallel implementation methods to perform the PDE-based image registration computing. One is the multithreading process with OpenMP on a dual core...
In this paper, the design for a dual core FFT processor based on CORDIC algorithm is presented. This design extracts the 2-base successions as the foundation, takes the FFT butterfly-shaped arithmetical unit as the object, uses the CORDIC algorithm superiority in the vector computation to simply the revolving factor calculation, and employs the assembly line technology to enhance the turnover rate...
In this paper, we propose a novel simple adaptive controller for the control of a new 3D chaotic system with uncertain parameters. With the study of the property of a passive system, the corresponding necessary condition under which the new uncertain chaotic 3D system can be equivalent to a passive system via smooth state feedback is proposed. It is found that the new system transformed by this new...
Image decomposition is an important inverse problem in image processing. PDE-based decomposition is employing the total variation energy to split an original image into the structural part and textural part. The result greatly relies on the weight parameter which balances these two parts, big or small may produce too much noise or over-smoothness. In this paper, we discuss an adaptive parameter computing...
Most numerical approaches for image registration with PDE method are based on the computing over the pixel matrices. As the image size increases, more time consuming is needed. Then, one of the most efficient solving methods is parallel computing. In this paper, we discuss the parallel deformable registration computing carried on the cluster. First, we present the diffusion PDE model to describe the...
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.