Evgeny Kaminsky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Evgeny Kaminsky has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ofer Hadar
Communication Systems Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
5 shared publications - Dan Grois
Comcast, Beer-Sheva, Israel
2 shared publications Alex Ginzburg
Ben-Gurion University of the Negev
1 shared publication- Alex Ginzburg
Unit of Electro-Optics, Engineering, Ben-Gurion University of the Negev, Israel
1 shared publication - Mark Sh. Levin
Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
1 shared publication Ofer Hadar
Ben-Gurion University of the Negev
1 shared publication
Latest Publications
- 14 August 2010
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 5 (4) , 259-274
DCT-domain coder for digital video applications
- 14 August 2010
- Published by Springer Nature in Journal of Real-Time Image Processing
- Vol. 5 (4) , 259-274
DCT-domain coder for digital video applications
- 1 January 2009
- Published by Vilnius University Press in Informatica
- Vol. 20 (4) , 519-538
Combinatorial Systems Evolution: Example of Standard for Multimedia Information
Publisher: Vilnius University Institute of Data Science and Digital Technologies, Journal: Informatica, Title: Combinatorial Systems Evolution - Example of Standard for Multimedia Information, Authors: Mark Sh. Levin, Oleg Kruchkov, Ofer Hadar, Evgeny Kaminsky , The article addresses the issues of combinatorial evolution of standards in transmission of multimedia information including the following: (a) brief descriptions of basic combinatorial models as multicriteria ranking, knapsack-like problems, clustering, combinatorial synthesis, multistage design, (b) a description of standard series (MPEG) for video information processing and a structural (combinatorial) description of system changes for the standards, (c) a set of system change operations (including multi-attribute description of the operations and binary relations over the operations), (d) combinatorial models for the system changes, and (e) a multistage combinatorial scheme (heuristic) for the analysis of the system changes. Expert experience is used. Numerical examples illustrate the suggested problems, models, and procedures.
- 1 January 2009
- Published by Vilnius University Press in Informatica
- Vol. 20 (4) , 519-538
Combinatorial Systems Evolution: Example of Standard for Multimedia Information
Publisher: Vilnius University Institute of Data Science and Digital Technologies, Journal: Informatica, Title: Combinatorial Systems Evolution - Example of Standard for Multimedia Information, Authors: Mark Sh. Levin, Oleg Kruchkov, Ofer Hadar, Evgeny Kaminsky , The article addresses the issues of combinatorial evolution of standards in transmission of multimedia information including the following: (a) brief descriptions of basic combinatorial models as multicriteria ranking, knapsack-like problems, clustering, combinatorial synthesis, multistage design, (b) a description of standard series (MPEG) for video information processing and a structural (combinatorial) description of system changes for the standards, (c) a set of system change operations (including multi-attribute description of the operations and binary relations over the operations), (d) combinatorial models for the system changes, and (e) a multistage combinatorial scheme (heuristic) for the analysis of the system changes. Expert experience is used. Numerical examples illustrate the suggested problems, models, and procedures.
- 1 January 2008
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 19 (1) , 56-74
Dynamic computational complexity and bit allocation for optimizing H.264/AVC video compression
- 1 January 2008
- Published by Elsevier in Journal of Visual Communication and Image Representation
- Vol. 19 (1) , 56-74
Dynamic computational complexity and bit allocation for optimizing H.264/AVC video compression
- 5 October 2007
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 38 (1) , 119-146
Multiparameter method for analysis and selection of motion estimation algorithms for video compression
- 5 October 2007
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 38 (1) , 119-146
Multiparameter method for analysis and selection of motion estimation algorithms for video compression
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 110-114
DCT-Domain Coder for Digital Video Applications
Recent home networking services such as next generation game consoles, video-on-demand, HDTV, etc. require faster video encoders and transcoders that avoid over-complicated transformations. In most popular digital video coding standards such as MPEG-X or H.26x, discrete cosine transform (DCT), inverse DCT (IDCT) transform, and block matching algorithms are essential elements in the coding process. The transforms between the pixel and DCT domains, are taking place during the operations and being only intermediate calculations, which complicate the encoding process. Thus, it is advantageous to reduce the number of transform operations between the spatial and frequency domains in order to simplify the overall encoder structure. In this paper we propose a DCT domain video encoder for reducing processing time. This is achieved by excluding the intermediate DCT and IDCT transforms from the conventional hybrid encoder. This is achieved by calculating the motion estimation and motion compensation via a spatial relationship between the DCT coefficients of a specific block and its sub- blocks. Experimental results of this method were compared to those of the conventional hybrid video encoder in the sense of visual quality and computational complexity. The comparison shows that the computational complexity of the proposed encoder is lower by 12.5% in comparison to conventional hybrid video coder for the same visual quality.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 110-114
DCT-Domain Coder for Digital Video Applications
Recent home networking services such as next generation game consoles, video-on-demand, HDTV, etc. require faster video encoders and transcoders that avoid over-complicated transformations. In most popular digital video coding standards such as MPEG-X or H.26x, discrete cosine transform (DCT), inverse DCT (IDCT) transform, and block matching algorithms are essential elements in the coding process. The transforms between the pixel and DCT domains, are taking place during the operations and being only intermediate calculations, which complicate the encoding process. Thus, it is advantageous to reduce the number of transform operations between the spatial and frequency domains in order to simplify the overall encoder structure. In this paper we propose a DCT domain video encoder for reducing processing time. This is achieved by excluding the intermediate DCT and IDCT transforms from the conventional hybrid encoder. This is achieved by calculating the motion estimation and motion compensation via a spatial relationship between the DCT coefficients of a specific block and its sub- blocks. Experimental results of this method were compared to those of the conventional hybrid video encoder in the sense of visual quality and computational complexity. The comparison shows that the computational complexity of the proposed encoder is lower by 12.5% in comparison to conventional hybrid video coder for the same visual quality.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 167-171
Dynamic Computational Complexity and Bit Allocation for Optimizing H.264/AVC Video Compression
In this work we present a novel approach for optimizing H.264/AVC video compression by dynamically allocating computational complexity (such as a number of CPU clocks) and bits for encoding each coding element (basic unit) within a video sequence, according to its predicted MAD (mean absolute difference). Our approach is based on a computational complexity-rate-distortion (C-R-D) analysis, which adds a complexity dimension to the conventional rate-distortion (R-D) analysis. Both theoretically and experimentally, we prove that by implementing the proposed approach better results are achieved. In addition, we present a method and system for implementing the proposed approach, and for controlling computational complexity and bit allocation in real-time and off-line video coding. For allocating a corresponding group of coding modes and the quantization step-size, we develop computational complexity - complexity step - rate (C-I-R) and rate - quantization step-size - computational complexity (R-Q-C) models.
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 167-171
Dynamic Computational Complexity and Bit Allocation for Optimizing H.264/AVC Video Compression
In this work we present a novel approach for optimizing H.264/AVC video compression by dynamically allocating computational complexity (such as a number of CPU clocks) and bits for encoding each coding element (basic unit) within a video sequence, according to its predicted MAD (mean absolute difference). Our approach is based on a computational complexity-rate-distortion (C-R-D) analysis, which adds a complexity dimension to the conventional rate-distortion (R-D) analysis. Both theoretically and experimentally, we prove that by implementing the proposed approach better results are achieved. In addition, we present a method and system for implementing the proposed approach, and for controlling computational complexity and bit allocation in real-time and off-line video coding. For allocating a corresponding group of coding modes and the quantization step-size, we develop computational complexity - complexity step - rate (C-I-R) and rate - quantization step-size - computational complexity (R-Q-C) models.