中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
数学与系统科学研究院 [2]
长春光学精密机械与物... [1]
西安光学精密机械研究... [1]
采集方式
OAI收割 [4]
内容类型
期刊论文 [3]
会议论文 [1]
发表日期
2018 [1]
2016 [1]
2010 [1]
2007 [1]
学科主题
筛选
浏览/检索结果:
共4条,第1-4条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Dynamical stochastic resonance for nonuniform illumination image enhancement
期刊论文
OAI收割
IET Image Processing, 2018, 卷号: 12, 期号: 12, 页码: 2147-2152
作者:
Zhang, Yongbin
;
Liu, Hongjun
;
Huang, Nan
;
Wang, Zhaolu
  |  
收藏
  |  
浏览/下载:53/0
  |  
提交时间:2018/12/18
Image Enhancement
Image Fusion
Stochastic Processes
Iterative Methods
Differential Equations
Brightness
Dynamical Stochastic Resonance
Nonuniform Illumination Image Enhancement
Dark Tones
Low-contrast Image Enhancement
Nonlinear Iteration
Monostable Langevin Equation
Iteration Parameters
Intensity Distribution
Visibility Balance
Naturalness Balance
Illumination Compensation Component
Computational Time
No-reference Perceptual Quality Assessment
Lightness Order Error
Low-computational Complexity
A smoothing SQP framework for a class of composite minimization over polyhedron
期刊论文
OAI收割
MATHEMATICAL PROGRAMMING, 2016, 卷号: 158, 期号: 1-2, 页码: 467-500
作者:
Liu, Ya-Feng
;
Ma, Shiqian
;
Dai, Yu-Hong
;
Zhang, Shuzhong
  |  
收藏
  |  
浏览/下载:49/0
  |  
提交时间:2018/07/30
Composite L-q minimization
epsilon-KKT point
Nonsmooth nonconvex non-Lipschitzian optimization
Optimality condition
Smoothing approximation
Worst-case iteration complexity
A design of high-speed and low-consume parallel grouping RS code and simulation (EI CONFERENCE)
会议论文
OAI收割
2010 3rd International Conference on Advanced Computer Theory and Engineering, ICACTE 2010, August 20, 2010 - August 22, 2010, Chengdu, China
Chen C.
;
Jin G.
收藏
  |  
浏览/下载:25/0
  |  
提交时间:2013/03/25
RS code is a linear error correction codes with better error correction capability
is widely used in different kinds of occasions for communications or data storage. But for its high difficulty of coding and decoding algorithm and low throughput
optimization RS algorithm is always studied as one of the focus in the error-correction field. A new coding method
parallel coding and decoding data into groups in lower step finite field for avoiding complex matrix iteration and Chien search computation
is proposed in this paper. It is proved that the coding and decoding throughput of the parallel grouping RS coder is increased and the hardware complexity is reduced with changeless error-correction capability from the simulation results using ModelSim SE 6.0 and synthetic results using ISE 9.11. 2010 IEEE.
Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
期刊论文
OAI收割
APPLIED NUMERICAL MATHEMATICS, 2007, 卷号: 57, 期号: 9, 页码: 1033-1049
作者:
Zhao, Y. B.
  |  
收藏
  |  
浏览/下载:25/0
  |  
提交时间:2018/07/30
linear programming
interior-point algorithms
iteration complexity
neighborhoods