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 35 papers published in subject: > since this site started. |
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. EMD-SIFT based Deep Space Image Matching Method | |||
Yin Mengzheng,Wu Xuechen,Li Xiaoyu,Feng Hongqi,Wang Qiang | |||
Electrics, Communication and Autocontrol Technology 24 May 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The paper puts forward a kind of scale invariant feature matching method for asteroid image sequences. In which we apply EMD (Empirical Mode Decomposition) to extract the features from image sequences, SIFT (scale invariant feature transform) to match the extracted features, and affine transform to stretch and rotate the images. We can achieve a global view of the scanned asteroid surface. Experiment results demonstrate the excellent performance of the EMD-SIFT based method in mosaicking the asteroid image sequences. | |||
TO cite this article:Yin Mengzheng,Wu Xuechen,Li Xiaoyu, et al. EMD-SIFT based Deep Space Image Matching Method[OL].[24 May 2013] http://en.paper.edu.cn/en_releasepaper/content/4544596 |
2. A Differential Approach for Computationally Efficient Recovery of Radiometric Response Function | |||
GU Zhenghui | |||
Electrics, Communication and Autocontrol Technology 28 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In high dynamic range imaging, it is important to estimate the radiometric response function of a camera that relates image pixel values to scene radiance. Among numerous existing approaches, Debevec and Malik's algorithm has been widely used to determine the response function from multiple differently exposed photographs. However, with this algorithm, the computational complexity goes up when the number of exposures decreases. The problem becomes serious in the case of two exposures. In this paper, we present a differential approach that can significantly reduce the complexity of their algorithm at small numbers of exposures. Experimental results illustrate the performance of the proposed method. | |||
TO cite this article:GU Zhenghui. A Differential Approach for Computationally Efficient Recovery of Radiometric Response Function[OL].[28 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4516884 |
3. Jacobi-type Joint Diagonalization for Complex Symmetric Matrices | |||
WANG Ke,Gong Xiaofeng | |||
Electrics, Communication and Autocontrol Technology 14 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we propose two joint diagonalization algorithms of Jacobi-type for a set of complex and symmetric matrices. Many existing algorithms aim at the complex-valued JD problem, but few works have been done for symmetric one, which emerges in the pseudo-covariance matrix of improper complex signals or sometimes in tensor decomposition problem. The proposed methods resort to Jacobi rotation matrices based on LU or LQ decompositions. The diagonalizer matrix could be appropriately parameterized by a sequence of simple elementary triangular or unitary matrices, which depend on only one or two parameters. As such, the high-dimensional minimization problems could be replaced by a sequence of simple lower-dimensional ones in an iterative manner. Compared with another method, numerical simulations demonstrate the performance of the proposed methods. | |||
TO cite this article:WANG Ke,Gong Xiaofeng. Jacobi-type Joint Diagonalization for Complex Symmetric Matrices[OL].[14 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4512246 |
4. A correlative two-step approach to hallucinating faces | |||
Huanxi Liu | |||
Electrics, Communication and Autocontrol Technology 07 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Face hallucination is to synthesize high-resolution face image from the input low-resolution one. Although many two-step learning-based face hallucination approaches have been developed, they suffer from the expensive computational cost due to the separate calculation of the global and local models. To overcome this problem, we propose a correlative two-step learning-based face hallucination approach which bridges the gap between the global model and the local model. In the global phase, we build a global face hallucination framework by combining the steerable pyramid decomposition and the reconstruction. In the residue compensation phase, based on the combination weights and constituent samples obtained in the global phase, a residue face image is synthesized by the neighbor reconstruction algorithm to compensate the hallucinated global face image with detailed facial features. The ultimate hallucinated face image is the composition of the global face image and the residue face image. Compared with existing approaches, in the global phase, our global face image is more similar to the original high-resolution face image. Moreover, in the residue compensation phase, we use the combination weights and constituent samples obtained in the global phase to compute the residue face image, by which the computational complexity can be greatly reduced without compromising the quality of facial details. The experimental results and comparisons demonstrate that our approach can not only synthesize distinct high-resolution face images efficiently, but also has high computational efficiency. | |||
TO cite this article:Huanxi Liu. A correlative two-step approach to hallucinating faces[OL].[ 7 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4512944 |
5. FPGA-based fully pipelined and high-quality image rotation | |||
Gongchao Tang,Luxin Yan | |||
Electrics, Communication and Autocontrol Technology 06 January 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper focuses on the low latency and the fully pipelined implementation of image rotation with memory reduction on FPGA's board. The method we used is based on three-pass algorithm and cubic convolution interpolation. The difficulty of the work is the construction of the fully pipeline as it is hard to get the positional relationship of pixels without storing them after shearing. In this article, mechanisms on judging the row offset and column offset is presented to select pixels in the same row or same column for interpolation in template, which solves the bottleneck of pipeline. Finally, the results of rotation, summary of the memory consumption in FPGA, and the comparison with existing method are presented. | |||
TO cite this article:Gongchao Tang,Luxin Yan. FPGA-based fully pipelined and high-quality image rotation[OL].[ 6 January 2013] http://en.paper.edu.cn/en_releasepaper/content/4501017 |
6. Joint bit allocation and rate control for multi-view video plus depth based 3D video coding | |||
Shao Feng | |||
Electrics, Communication and Autocontrol Technology 11 March 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In three-dimensional (3D) video coding, the distortions in texture videos and depth maps can all affect the quality of the synthesized virtual view. Therefore, under the total bitrate constraint, effective bit allocation between texture and depth is very important for 3D video coding. In this paper, a joint bit allocation and rate control method for multi-view video plus depth (MVD) based 3D video coding is proposed. We firstly derive a view synthesis distortion model to characterize the effects of coding distortions of texture videos and depth maps on the synthesized virtual view. Based on this model, we derive a rate-distortion model to characterize the relationship between the bitrate and the view synthesis distortion, and the optimal bitrate ratio between texture and depth is established by solving optimization problem. Then, rate control algorithm is performed on view level, texture/depth level and frame level. Experimental results show that compared with other method, the proposed bit allocation method can obtain higher performance of view synthesis. Moreover, the proposed rate control method can accurately control the bitrate to satisfy the total bitrate constraint. | |||
TO cite this article:Shao Feng. Joint bit allocation and rate control for multi-view video plus depth based 3D video coding[OL].[11 March 2012] http://en.paper.edu.cn/en_releasepaper/content/4471143 |
7. Failure Detection and Validation of Multifunctional Self-validating Sensor Using WRVM Predictor | |||
SHEN Zhengguang,SONG Kai,WANG Qi | |||
Electrics, Communication and Autocontrol Technology 19 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A novel multifunctional self-validating sensor functional model is proposed for evaluation, improvement, and forecast of measurement value reliability. This paper presents a detailed introduction of main content--self-validating function, especially the quantitative health evaluation and remaining using life forecasting. As a fundamental self-validating function, a novel strategy based on relevance vector machine (RVM) coupled with wavelet analysis is proposed for failure detection, isolation, and recovery (FDIR) of multifunctional self-validating sensor. It centers on the working principle and on-line updating algorithm of WRVM predictor. The proposed WRVM predictor can also distinguish the fault free signal with sudden change from the failure signal and it is updated online for pursuit of signal change. A multifunctional self-validating sensor experimental system is designed to evaluate the performance of novel strategy. Results demonstrate that the proposed methodology provides a good solution to the FDIR of multifunctional self-validating sensor. | |||
TO cite this article:SHEN Zhengguang,SONG Kai,WANG Qi. Failure Detection and Validation of Multifunctional Self-validating Sensor Using WRVM Predictor[OL].[19 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4463224 |
8. Resolution-Scalable Motion Vector Coding Based on Inter-Resolution Prediction | |||
Li Xiangwei,Lan Xuguang,Zhu ling,Xue Jianru,Zheng Nanning | |||
Electrics, Communication and Autocontrol Technology 05 January 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Resolution scalability is an important feature in next generation video coding and appropriate scalable motion information coding technique can improve its overall coding efficiency. This paper presents an efficient resolution-scalable motion vector coding algorithm using inter-resolution based motion vector prediction and scalable multi-resolution motion vector embedded coding technique. The conducted experiments demonstrate significant benefits of the proposed scalable motion vector coding scheme to improve the compression performance of resolution scalability video coding, especially at low resolution. | |||
TO cite this article:Li Xiangwei,Lan Xuguang,Zhu ling, et al. Resolution-Scalable Motion Vector Coding Based on Inter-Resolution Prediction[OL].[ 5 January 2012] http://en.paper.edu.cn/en_releasepaper/content/4458049 |
9. A Novel Watermark Strategy For Quantum Images | |||
Wei-Wei Zhang,Fei Gao,Bin Liu,Heng-Yue Jia,Qiao-Yan Wen,Hui Chen | |||
Electrics, Communication and Autocontrol Technology 29 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:With the development of quantum computer andquantum network, the security of quantum data becomes moreand more important. Quantum watermarking is the techniquewhich embeds the invisible quantum signal such as the owner’sidentification into quantum multimedia data (such as audio,video and image) for copyright protection. In this paper, a novelwatermark strategy for quantum images is proposed based onflexible representation for quantum images (FRQI). Comparedwith the former strategy (only one based on quantum images)which can only be used to verify the identity of the true ownerof a carrier image, the proposed method can also be used to findout who is the real owner. And it is impossible for anyone exceptthe copyrighter to clear off or extract the watermark images. | |||
TO cite this article:Wei-Wei Zhang,Fei Gao,Bin Liu, et al. A Novel Watermark Strategy For Quantum Images[OL].[29 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4458478 |
10. Fast Trademark Recognition Based on Shape Context and Hierarchical Clustering | |||
WU Qian,ZHANG Honggang,CHAI Lunshao | |||
Electrics, Communication and Autocontrol Technology 19 December 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Trademark recognition has been played a very important part in our daily life, which can be applied to various fields such as advertisement, logistics transportation network, E-commerce and so on. In this paper, a fast trademark recognition method based on shape context is proposed to detect and classify the trademarks in images. However, the difficulties lie in that when the sample set becomes larger, along with the calculation of the feature points matching increases, the computational efficiency greatly reduced. The method proposed in this paper attempts to cluster the feature vectors in training procedure so that the search scope of K nearest neighbors in KNN algorithm could be narrowed. The experimental results show that the modified algorithm has faster computing speed on the basis of maintaining the previous performance, and do well in trademark recognition. | |||
TO cite this article:WU Qian,ZHANG Honggang,CHAI Lunshao. Fast Trademark Recognition Based on Shape Context and Hierarchical Clustering[OL].[19 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4456540 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated