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 this paper, we introduced the application of mobile device on video data acquisition and intelligent content-wise analysis. Specially, aiming at the solution of the deepening video application on intelligent transportation and public security, the video structured description technique on android platform was utilized to execute the scene description task and implement the recognition task such...
Ordinary Lucy-Richardson (LR) restoration algorithms are used to restore high SNR degraded images including astronomical images and achieve good results. The algorithms are very sensitive to noises and use the assumption—noises observe the Possion distribution. However, there are always Gaussian noises in natural images. In this paper, we propose a regularization LR-algorithm based on the Gaussian...
The current video segmentation methods are mostly based on and limited by image vision analysis. In fact, additional information could be inserted into the video for constructing an effective index. This paper proposed a video segmentation method based on spatial geographic information from the perspective of GIS application, which contributed to video location. The experimental result indicated that...
A conventional camera always captures blurred images of scene information away from the focal plane. Deblurring those blurred images is a very important and challenging job in many fields including optics, astronomy, computer vision and computer graphics. Since the defocus kernel plays a key role in the image degradation and the image recovery, many people have bent themselves to the study on the...
We propose a branch-and-reduce algorithm to solve the Minimum Hitting Set Problem in this paper and use a recently developed technique called measure and conquer to perform analysis on the algorithm. By applying such technique and quasiconvex programming when optimizing the analysis results, we prove that our algorithm can solve the Minimum Hitting Set Problem in O(1.23801n) and polynomial space.
The change-making problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, inmost real money systems, the greedy algorithm yields optimal solutions. In this paper, we study what type of coin systems that guarantee the optimality of the greedy algorithm. We provide new proofs for a sufficient...
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.