This paper presents a distributed parallel system for face *** face database in mis system is so huge(more man 1,000 thousand faces) that matching and recognition processes can not be carried out on only one *** clust...
详细信息
This paper presents a distributed parallel system for face *** face database in mis system is so huge(more man 1,000 thousand faces) that matching and recognition processes can not be carried out on only one *** cluster system must be used to improve the matching *** many current clusters existing have some problems and can not fit our system.A special distributed parallel system was developed to complete face query and *** concept of parallel virtual machine and a kind of linked table structure adopted in this system not only decreased lots of moving overhead of adding or deleting nodes in the array structure but also truly realized the infinite ***,key techniques such as distributed database,buffer and synchronization techniques in communication and multithreading in control flow were adopted to guarantee the normal *** results proved mat this parallel system can improve the matching speed for more than 4 ***,the greatest advantage of this system is not only increasing matching speed but breaking the upper limit of face data ***,the face data capability of this system can be extended to arbitrary figure as bigger as possible.
Character segmentation is an important step in License Plate Recognition (LPR) system. There are many difficulties in this step, such as the influence of image noise, plate frame, rivet, space mark, and so on. This pa...
详细信息
ISBN:
(纸本)0780378482
Character segmentation is an important step in License Plate Recognition (LPR) system. There are many difficulties in this step, such as the influence of image noise, plate frame, rivet, space mark, and so on. This paper presents a new algorithm for character segmentation, using Hough transformation and the prior knowledge in horizontal and vertical segmentation respectively. Furthermore, a new object enhancement technique is used for image preprocessing. The experiment results show a good performance of this new segmentation algorithm.
In most of the modern information retrieval (IR) systems, such as Okapi system, there are a variety of parameters to be turned which are data-dependent and sensitive. Manual parameter setting with fixed experimental v...
详细信息
ISBN:
(纸本)0780379527
In most of the modern information retrieval (IR) systems, such as Okapi system, there are a variety of parameters to be turned which are data-dependent and sensitive. Manual parameter setting with fixed experimental values is not always feasible and reliable in practical cases. Furthermore, the supervised learning approaches are not applicable for lacking of relevant information while retrieving. Therefore, an automatic unsupervised parameter learning mechanism is necessary and important. In this paper, a genetic algorithm (GA) based parameter optimization approach is proposed and experimented on Okapi system using large scale data sets of TREC11, TREC10 and TREC9 web track collections. It indicates that our algorithm is effective to adjust system parameters and improve the retrieval performance significantly.
The automatic recognition of human faces presents a significant challenge to the pattern recognition research community. Typically, human faces are very similar in structure with minor differences from person to perso...
详细信息
ISBN:
(纸本)0780378652
The automatic recognition of human faces presents a significant challenge to the pattern recognition research community. Typically, human faces are very similar in structure with minor differences from person to person. Furthermore, lighting condition changes, facial expressions, and pose variations further complicate the face recognition task as one of the difficult problems in pattern analysis. In this paper, we proposed a modified line segment hausdorff distance measure for face recognition. The distance measure is weighted according to a weight function derived from the spatial information of the human face. This distance measure, namely Spatially Weighted Line Hausdorff Distance (SWLHD), is further improved by limit the line pairs in a given neighborhood. Experiment showed encouraging result and the results also implicate that line segments could provide sufficient information for face recognition.
The pose problem is a difficult area of face recognition. Until now, we haven't had a good method to tackle the problem. In this paper, a simple fronto-parallel face recovery method is presented, the method is sim...
详细信息
ISBN:
(纸本)078037925X
The pose problem is a difficult area of face recognition. Until now, we haven't had a good method to tackle the problem. In this paper, a simple fronto-parallel face recovery method is presented, the method is simple and effective, it addresses the computationally expensive problem of current 3-D model pose recovery methods, experiments showed that the method can greatly enhance the recognition rate.
This paper presents a method of detecting faces based on cost-sensitive AdaBoost (CS-AdaBoost) algorithm. The two main differences between CS-AdaBoost algorithm and the naive AdaBoost are that (1) unequal initial weig...
详细信息
ISBN:
(纸本)0780379659
This paper presents a method of detecting faces based on cost-sensitive AdaBoost (CS-AdaBoost) algorithm. The two main differences between CS-AdaBoost algorithm and the naive AdaBoost are that (1) unequal initial weights are given to each training sample according to its misclassification cost, and (2) the weights are updated separately for positives and negatives at each boosting step. Due to these two variations, every stage of the face detector trained by CS-AdaBoost algorithm can more effectively focus on face samples than by the naive AdaBoost to achieve robust and high detection rate with modest false alarm rate, so that the final face detector can yield high detection rates, very low false positive rates, and robust performance. Experiments also demonstrate the effectiveness of our method.
This paper presents a novel method of detecting faces at any degree of rotation in the image plane based on cost-sensitive AdaBoost (CS-AdaBoost) algorithm. The method first employs a cascade of very simple classifier...
详细信息
ISBN:
(纸本)0780377508
This paper presents a novel method of detecting faces at any degree of rotation in the image plane based on cost-sensitive AdaBoost (CS-AdaBoost) algorithm. The method first employs a cascade of very simple classifiers trained by CS-AdaBoost to determine the possible orientation of each input window and then uses an upright face detector also trained by CS-AdaBoost to verify the derotated face candidate. The training procedures for both classifiers are also given in the paper. Experimental results show that the proposed method gives higher detection ratio and real-time detection speed compared to the conventional ones.
In order to use data information in the Internet, it is necessary to extract data from web pages. An HTT tree model representing HTML pages is presented. Based on the HTT model, a wrapper generation algorithm AGW is p...
详细信息
In order to use data information in the Internet, it is necessary to extract data from web pages. An HTT tree model representing HTML pages is presented. Based on the HTT model, a wrapper generation algorithm AGW is proposed. The AGW algorithm utilizes comparing and correcting technique to generate the wrapper with the native characteristic of the HTT tree structure. The AGW algorithm can not only generate the wrapper automatically, but also rebuild the data schema easily and reduce the complexity of the computing.
The RVLC which is EBCOT-based coding method has been utilized successfully recently in image compression as in JPEG 2000. In this paper we propose a new and efficient audio compression based on EBCOT and RVLC. Firstly...
详细信息
In recent years, there has been increased interest in using data mining techniques to extract temporal rules from temporal sequences. Local temporal rules, which only a subsequence exhibits, are actually very common i...
详细信息
暂无评论