Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 67 papers published in subject: > since this site started. |
Results per page: | 67 Total, 7 Pages | << First < Previous 4 5 6 7 |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Implementation of JPEG2000 Le Call wavelet transform | |||
Dai wen bo | |||
Electrics, Communication and Autocontrol Technology 18 September 2006 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper presents an approach towards JPEG2000 recommended lifting-based Le Call 5/3 wavelet transform. The deign performs boundary extending while inputting datum, and only uses few shifters and adders, the architecture is efficient and height performance. The deign simulated on FPGA. | |||
TO cite this article:Dai wen bo. Implementation of JPEG2000 Le Call wavelet transform[OL].[18 September 2006] http://en.paper.edu.cn/en_releasepaper/content/8386 |
2. A New Hausdorff Distance Based Approach For Face Localization | |||
Xiaomin Liu,Yujin Zhang,Tan Hua-chun | |||
Electrics, Communication and Autocontrol Technology 26 December 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:An improved approach of face localization based on the Hausdorff Distance(HD) measure is proposed in this work. First, we modify the similarity measure in the template-based matching. The common form of HD only computes the average of the mismatch of each point in the point set A to the point set B. We improved it by considering the average and the standard deviation together. The new measure is more robust against the variance of poses, expressions and identities. Then we also apply the HD measure to compute the symmetry of the test image, which is an important characteristic of human faces. This symmetry measure is combined with the template-based matching during face localization process. The experimental results demonstrate that both improvements can enhance the performance of face localization. | |||
TO cite this article:Xiaomin Liu,Yujin Zhang,Tan Hua-chun. A New Hausdorff Distance Based Approach For Face Localization[OL].[26 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4661 |
3. Computing EigenFace From Edge Images for Face Recognition Based on Hausdorff Distance | |||
Huachun Tan,Yu-jin Zhang | |||
Electrics, Communication and Autocontrol Technology 20 December 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The different face regions have different degrees of importance for face recognition. In previous Hausdorff distance measures for face recognition, such as Spatially Eigen-Weighted Hausdorff distance (SEWHD), the weighting function is computed from grayscale images. However, Hausdorff distance is a measure for two binary point sets, not for grayscale point sets. A point which is important in grayscale domain does not necessarily mean it is important in edge domain. In this paper, a new weighting function of Hausdorff distance measure is proposed for face recognition. The weighting function is based on the eigenface of face edge images, not the eigenface of grayscale images in previous method. When comparing the edge images of the face model and that of a test face edge image in face recognition, the weighted Hausdorff distance can reflect the discriminative properties of face edge images effectively. Experimental results show the new method achieves higher recognition rate comparing with previous Hausdorff distance measures | |||
TO cite this article:Huachun Tan,Yu-jin Zhang. Computing EigenFace From Edge Images for Face Recognition Based on Hausdorff Distance[OL].[20 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4512 |
4. Expression-independent face recognition based on Higher-Order Singular Value Decomposition | |||
Huachun Tan,Yu-jin Zhang | |||
Electrics, Communication and Autocontrol Technology 19 December 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, a new method for extracting expression-independent face features based on HOSVD (Higher-Order Singular Value Decomposition) is proposed and used for face recognition. In the new method, it is assumed that a facial expression could be represented by the facial expressions in the training set. In addition, the expression with higher similarity to the expression of test person has higher probability to represent the expression of test person. Expression-similarity weighted face feature, which is the optimal estimation based on Bayesian estimation theory and the assumption, is used to estimate the face feature of the test person. As a result, the estimated face feature can reduce the influence of expression caused by insufficient training data and becomes less expression-dependent, and can be more robust to new expressions. The proposed method has been applied to Japanese Female Facial Expression (JAFFE) database. Expression-independent experimental results show the superiority of proposed method over the existing methods in terms of recognition rate and accumulative recognition rate. | |||
TO cite this article:Huachun Tan,Yu-jin Zhang. Expression-independent face recognition based on Higher-Order Singular Value Decomposition[OL].[19 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4478 |
5. Chaotic Digital Watermarking Algorithm Based on The Timestamp of Local Machine | |||
Liu Quan,Jiang Xuemei,Li Fangmin | |||
Electrics, Communication and Autocontrol Technology 30 November 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A kind of digital watermarking algorithm based on machine time is presented in this paper. Watermarking signal is generated according to chaotic sequence, and key control is determined by machine time of digital watermarking embedded algorithm. Experiments show that this algorithm has preferable robust. | |||
TO cite this article:Liu Quan,Jiang Xuemei,Li Fangmin. Chaotic Digital Watermarking Algorithm Based on The Timestamp of Local Machine[OL].[30 November 2005] http://en.paper.edu.cn/en_releasepaper/content/3919 |
6. A New Method for Contour Correspondence Based on the Internal Information in Intensity-Based Ultrasound Image Registration | |||
Jing Fang,Yang Xiao,Shao-hai Hu | |||
Electrics, Communication and Autocontrol Technology 28 June 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Comparing with the CT imaging, there are a lot of speckles in the ultrasound images. When we use the probe to detect the organism, we get a set of slices which are consecutive in the centroid. In the new method proposed in this paper, every contour in a slice is designated a value that represents its size and density, then the overall “Centroid” of the slice is found. For each contour, its corresponding contour on the adjacent slice is determined based on their designated value and their polar coordinate to the slice centroid. For the aim of slice registration, adjacent slices are first aligned roughly according to their centroid, furthermore, the optimal registration position nearby which minimize the efficacy function which reflects the registration suitability at a given position. | |||
TO cite this article:Jing Fang,Yang Xiao,Shao-hai Hu. A New Method for Contour Correspondence Based on the Internal Information in Intensity-Based Ultrasound Image Registration[OL].[28 June 2005] http://en.paper.edu.cn/en_releasepaper/content/2305 |
7. A COMPARISION OF TWO SIMILARITY MEASURES IN INTENSITY-BASED ULTRASOUND IMAGE REGISTRATION | |||
Shuang Gao ,Yang Xiao,Shao-hai Hu | |||
Electrics, Communication and Autocontrol Technology 28 June 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:We investigate two registration methods for ultrasound image relying on the intensity-based similarity measure. In the first method intensity information is given by feature points which have been extracted using Harris corner detector. The registration similarity measure is then defined as a cost-function—error cost function. In the latter method we use the same cost-function, but the uniqueness control and region correspondence is not uniform with the first method. Given this similarity measure, parametric ultrasound image registration is stated as a minimization issue. We even exploit polynomial technique to transform the whole image dataset and estimate sum of square error in first measure. The result indicates that the two methods are robust and of the order of our requirements, but the latter measure outperforms the first one. | |||
TO cite this article:Shuang Gao ,Yang Xiao,Shao-hai Hu. A COMPARISION OF TWO SIMILARITY MEASURES IN INTENSITY-BASED ULTRASOUND IMAGE REGISTRATION[OL].[28 June 2005] http://en.paper.edu.cn/en_releasepaper/content/2304 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
Results per page: | 67 Total, 7 Pages | << First < Previous 4 5 6 7 |
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated