Dr. Feig is an IEEE Life Fellow and has a Ph.D. in Mathematics. He was Manager of Signal Processing and Coding at IBM's Watson Research Center; CTO and CMO at Kintera, an early cloud company; Senior Director of Services Architecture at Motorola; and Associate CIO for Vision and Strategy at Social Security Administration. He is inventor on 33 US patents and author on over 100 research publications. He has researched and written on mathematical algorithms, complexity theory, signal processing, coding for communication, MRI, radar, digital image and video technology, web services and cloud computing.
A new international standard for videoconferencing uses overlapped block motion compensation (OBM... more A new international standard for videoconferencing uses overlapped block motion compensation (OBMC) in the advanced prediction mode for improved motion compensation accuracy. Optimal motion estimates for OBMC may be computed by a computationally expensive iterative algorithm. A recent paper has suggested a computationally inexpensive two pass algorithm to compute motion estimates for OBMC. In the first pass, exhaustive search block matching is used to compute motion. This motion is then used for OBMC. Using a combination of the average OBMC error over and the variance of the error over a block and its neighbors, blocks are ordered. In the second pass, motion of the significant blocks form the ordering are optimized. In this paper, we investigate two fast search block motion estimation algorithms in the place of the exhaustive search algorithm. The algorithms are the three step search and gradient search block motion estimation algorithm. Simulations results with a head and shoulders video sequence reveals that the gradient search algorithm performs close to exhaustive search algorithm while the three step algorithm has lower performance.
While block motion compensation has been the preferred method for reducing inter-frame dependenci... more While block motion compensation has been the preferred method for reducing inter-frame dependencies in most standards for video coding (H.261, MPEG), a new proposal for very low bit rate video coding (H.263) has included overlapped block motion compensation (OBMC) as an optional mode of operation. In this paper, we present fast algorithms for motion estimation when compensating with OBMC. Standard block matching motion vectors are not optimal for OBMC. Our algorithms estimate which block motion vectors yield the most improvements upon optimizing motion, orders the blocks and optimizes motion vectors based on the ordering. The estimation is based on readily available information about block matching, viz., prediction errors over blocks. As simulation results will demonstrate, the algorithms result in near optimal performances at low computational costs. An additional advantage of the algorithms is that they may be terminated after a few motion vectors have been optimized and still result in high performance gains. This is of advantage in situations where the available computational power at the encoder varies (as in a videophony situation where the frame rate adapts depending on scene activity or available band-width) and it becomes desirable that the motion vectors chosen for optimization result in the highest gains possible.
Carl K. Chang, Iowa State University, USA Ephraim Feig, Motorola, USA Hemant Jain, University of ... more Carl K. Chang, Iowa State University, USA Ephraim Feig, Motorola, USA Hemant Jain, University of Wisconsin–Milwaukee , USA Frank Leymann, University of Stuttgart, Germany Calton Pu, Georgia Tech, USA Jeffrey Tsai, University of Illinois at Chicago, USA Zhiwei Xu, Institute of ...
Blockchains have recently generated explosive interest from both academia and industry, with many... more Blockchains have recently generated explosive interest from both academia and industry, with many proposed applications. But descriptions of many these proposals are more visionary projections than realizable proposals, and even basic definitions are often missing. We define "blockchain" and "blockchain network", and then discuss two very different, well known classes of blockchain networks: cryptocurrencies and Git repositories. We identify common primitive elements of both and use them to construct a framework for explicitly articulating what characterizes blockchain networks. The framework consists of a set of questions that every blockchain initiative should address at the very outset. It is intended to help one decide whether or not blockchain is an appropriate approach to a particular application, and if it is, to assist in its initial design stage.
The 2012 IEEE 5th International Conference on Cloud Computing (CLOUD 2012) is co-located with the... more The 2012 IEEE 5th International Conference on Cloud Computing (CLOUD 2012) is co-located with the 8th IEEE 2012 World Congress on Services (SERVICES 2012), the 2012 IEEE 19th International Conference on Web Services (ICWS 2012), the 2012 IEEE 9th International Conference on Services Computing (SCC 2012), the 2012 IEEE 1st International Conference on Mobile Services (MS 2012), and the IEEE 2012 1st International Conference on Services Economics (SE 2012). It was formally promoted by the IEEE ...
Page 1. Organizing Committee SERVICES 2008 General Chairs: Liang-Jie (LJ) Zhang, IBM TJ Watson Re... more Page 1. Organizing Committee SERVICES 2008 General Chairs: Liang-Jie (LJ) Zhang, IBM TJ Watson Research Center, USA Paul Hofmann, SAP Research, USA SCC 2008 General Chairs: Wil van der Aalst, Eindhoven University of Technology, The Netherlands Calton Pu, Georgia Tech, USA Program Committee Chairs: Elisa Bertino, Purdue University, USA Ephraim Feig, Motorola, USA Program Committee Vice-Chair: Patrick CK Hung, University of Ontario Institute of Technology (UOIT), Canada Industry Track Chairs: ...
A new international standard for videoconferencing uses overlapped block motion compensation (OBM... more A new international standard for videoconferencing uses overlapped block motion compensation (OBMC) in the advanced prediction mode for improved motion compensation accuracy. Optimal motion estimates for OBMC may be computed by a computationally expensive iterative algorithm. A recent paper has suggested a computationally inexpensive two pass algorithm to compute motion estimates for OBMC. In the first pass, exhaustive search block matching is used to compute motion. This motion is then used for OBMC. Using a combination of the average OBMC error over and the variance of the error over a block and its neighbors, blocks are ordered. In the second pass, motion of the significant blocks form the ordering are optimized. In this paper, we investigate two fast search block motion estimation algorithms in the place of the exhaustive search algorithm. The algorithms are the three step search and gradient search block motion estimation algorithm. Simulations results with a head and shoulders video sequence reveals that the gradient search algorithm performs close to exhaustive search algorithm while the three step algorithm has lower performance.
While block motion compensation has been the preferred method for reducing inter-frame dependenci... more While block motion compensation has been the preferred method for reducing inter-frame dependencies in most standards for video coding (H.261, MPEG), a new proposal for very low bit rate video coding (H.263) has included overlapped block motion compensation (OBMC) as an optional mode of operation. In this paper, we present fast algorithms for motion estimation when compensating with OBMC. Standard block matching motion vectors are not optimal for OBMC. Our algorithms estimate which block motion vectors yield the most improvements upon optimizing motion, orders the blocks and optimizes motion vectors based on the ordering. The estimation is based on readily available information about block matching, viz., prediction errors over blocks. As simulation results will demonstrate, the algorithms result in near optimal performances at low computational costs. An additional advantage of the algorithms is that they may be terminated after a few motion vectors have been optimized and still result in high performance gains. This is of advantage in situations where the available computational power at the encoder varies (as in a videophony situation where the frame rate adapts depending on scene activity or available band-width) and it becomes desirable that the motion vectors chosen for optimization result in the highest gains possible.
Carl K. Chang, Iowa State University, USA Ephraim Feig, Motorola, USA Hemant Jain, University of ... more Carl K. Chang, Iowa State University, USA Ephraim Feig, Motorola, USA Hemant Jain, University of Wisconsin–Milwaukee , USA Frank Leymann, University of Stuttgart, Germany Calton Pu, Georgia Tech, USA Jeffrey Tsai, University of Illinois at Chicago, USA Zhiwei Xu, Institute of ...
Blockchains have recently generated explosive interest from both academia and industry, with many... more Blockchains have recently generated explosive interest from both academia and industry, with many proposed applications. But descriptions of many these proposals are more visionary projections than realizable proposals, and even basic definitions are often missing. We define "blockchain" and "blockchain network", and then discuss two very different, well known classes of blockchain networks: cryptocurrencies and Git repositories. We identify common primitive elements of both and use them to construct a framework for explicitly articulating what characterizes blockchain networks. The framework consists of a set of questions that every blockchain initiative should address at the very outset. It is intended to help one decide whether or not blockchain is an appropriate approach to a particular application, and if it is, to assist in its initial design stage.
The 2012 IEEE 5th International Conference on Cloud Computing (CLOUD 2012) is co-located with the... more The 2012 IEEE 5th International Conference on Cloud Computing (CLOUD 2012) is co-located with the 8th IEEE 2012 World Congress on Services (SERVICES 2012), the 2012 IEEE 19th International Conference on Web Services (ICWS 2012), the 2012 IEEE 9th International Conference on Services Computing (SCC 2012), the 2012 IEEE 1st International Conference on Mobile Services (MS 2012), and the IEEE 2012 1st International Conference on Services Economics (SE 2012). It was formally promoted by the IEEE ...
Page 1. Organizing Committee SERVICES 2008 General Chairs: Liang-Jie (LJ) Zhang, IBM TJ Watson Re... more Page 1. Organizing Committee SERVICES 2008 General Chairs: Liang-Jie (LJ) Zhang, IBM TJ Watson Research Center, USA Paul Hofmann, SAP Research, USA SCC 2008 General Chairs: Wil van der Aalst, Eindhoven University of Technology, The Netherlands Calton Pu, Georgia Tech, USA Program Committee Chairs: Elisa Bertino, Purdue University, USA Ephraim Feig, Motorola, USA Program Committee Vice-Chair: Patrick CK Hung, University of Ontario Institute of Technology (UOIT), Canada Industry Track Chairs: ...
Uploads
Papers by Ephraim Feig