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.
In the traditional visual cryptography schemes, only one piece of image was encoded during encryption. And each of the shares that are generated was shown as a disorganized image. Due to the capacity of encrypted information, these schemes have few applications and because of the disorganized image share, they are easily suspected by hacker. In order to solve these problems, an Extended Visual Cryptography...
Line detection in digital images is a fundamental aspect of many problems in computer vision. In the light of the problems, such as heavy computation and intensive memory occupation, existing in the Hough Transform, an improved fast line detection algorithm combining the time-frequency domain transform and the spatial domain transform is proposed. First, the wavelet lifting is used to extract low...
An obstacle detection algorithm based on U-V disparity map analysis is presented in this paper. We firstly introduce the obstacle detection mechanism using U-V disparity map generated from stereo match disparity map, and then an obstacle detection algorithm based on analysis of U-V disparity map characteristic is described. The combination of straight line fitting and the standard Hough Transform...
In this paper, our interpolation algorithm based on LAZ (locally adaptive zooming method) improves the cubic spline interpolation method. Its basic principles and implementation methods are discussed in detail. The simulation results of comparison with other traditional methods have demonstrated that this method emphasizes the visual effect of magnified image, especially for color ones.
Various image filtering strategies have been effective, but most algorithms are to fail in general and create artifacts or remove image fine structures. Hence we propose a novel image filter based on grey polynomial model(GPM) to reduce image noise. The basic conceptions of grey polynomial model are described. The new image filter adopts each noisy pixel's neighborhoods to rectify its intensity value...
In this paper, a new background modeling method using Gaussian mixture model based on Bayer color filter array is proposed. It improves the efficiency of obtaining the prospect moving objects in the color video. Besides, it is proposed a method that can track the multi-moving objects using the combination of Camshift and Kalman filter based on the prospect image. Take actual moving objects detection...
The object of this study is to develop a reliable and fast visual inspection system for surface mounted components after they have been placed in wet solder paste on a printed circuit board (PCB). In order to reach this goal, firstly, the features of the components under three colors (red, greed, blue) structure light source are analyzed. Then, a two-stages inspection process is presented. In the...
Recently, extensive research and application on contrast enhancement of radiographs based on multi-scale decomposition of the images have validated its higher performance than regular techniques. However, to some extent, conventional multi-scale methods suffered from the introduction of visible artifacts. In this work, we present an algorithm for nonlinear chest radiograph contrast enhancement algorithm...
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.