中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
机构
采集方式
内容类型
发表日期
学科主题
筛选

浏览/检索结果: 共6条,第1-6条 帮助

条数/页: 排序方式:
FINE-STRUCTURED OBJECT SEGMENTATION VIA EDGE-GUIDED GRAPH CUT WITH INTERACTION SIMPLIFICATION 会议论文  OAI收割
Shanghai, China, 2016-3-20 ~ 2016-3-25
作者:  
Gong, Yongchao;  Xiang, Shiming;  Wang, Lingfeng;  Pan, Chunhong
  |  收藏  |  浏览/下载:22/0  |  提交时间:2017/05/09
Sea--Land Segmentation Via Hierarchical Region Merging and Edge Directed Graph Cut 会议论文  OAI收割
Phoenix, Arizona, USA, September 25-28, 2016
作者:  
Cheng, Dongcai;  Meng, Gaofeng;  Pan, Chunhong
  |  收藏  |  浏览/下载:27/0  |  提交时间:2017/12/06
Finite element model and analysis for micro-cutting of aluminum alloy 7050-T7451 (EI CONFERENCE) 会议论文  OAI收割
2012 International Conference on Machine Design and Manufacturing Engineering, ICMDME 2012, May 11, 2012 - May 12, 2012, Jeju Island, Korea, Republic of
作者:  
Zhou J.;  Wang F.;  Wang F.
收藏  |  浏览/下载:20/0  |  提交时间:2013/03/25
Image mosaic technique based on the information of edge (EI CONFERENCE) 会议论文  OAI收割
2012 3rd International Conference on Digital Manufacturing and Automation, ICDMA 2012, July 31, 2012 - August 2, 2012, Guilin, Guangxi, China
作者:  
Wang Y.-Q.
收藏  |  浏览/下载:35/0  |  提交时间:2013/03/25
Image mosaic is an important branch in the field of image processing. This paper designs and realizes an image mosaic technique based on the information of edge. The technology is suitable for engineering application. First of all  two images of the adjoining frames are processed by convolution operation  get the edge images. And then we cut edge image into pieces and compute their spatial frequency. According to the value of the spatial frequency select reasonable registration model group. We compute correlation strength and the value of movement offset which are the model group and the current frame edge image. We can complete image mosaic by them. We use video sequence which of the resolution is 1024 * 768 do the experiment. The results show that the method has good effect and strong adaptability. Algorithm is high efficiency which running time is 24 ms. It is suitable for real-time processing requirements of the application. This method is an effective mosaic technique which is suitable for engineering application. 2012 IEEE.  
On the spectral radius of graphs with cut edges 期刊论文  OAI收割
LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 卷号: 389, 页码: 139-145
作者:  
Liu, HQ;  Lu, M;  Tian, F
  |  收藏  |  浏览/下载:10/0  |  提交时间:2018/07/30
Vertices of degree k in a minimally k-edge-connected digraph 期刊论文  OAI收割
DISCRETE MATHEMATICS, 2000, 卷号: 218, 期号: 1-3, 页码: 293-298
作者:  
Yuan, XD;  Cai, MC
  |  收藏  |  浏览/下载:16/0  |  提交时间:2018/07/30