The Experts below are selected from a list of 16617 Experts worldwide ranked by ideXlab platform
J Foote - One of the best experts on this subject based on the ideXlab platform.
-
summarizing video using a shot importance measure and a frame Packing Algorithm
International Conference on Acoustics Speech and Signal Processing, 1999Co-Authors: S Uchihashi, J FooteAbstract:This paper presents methods of generating compact pictorial summarizations of video. By calculating a measure of shot importance video can be summarized by de-emphasizing or discarding less important information, such as repeated or common scenes. In contrast to other approaches that present keyframes for each shot, this measure allows summarization by presenting only the most important shots. Selected keyframes can also be resized depending on their relative importance. We present an efficient Packing Algorithm that constructs a pictorial representation from differently-sized keyframes. This results in a compact and visually pleasing summary reminiscent of a comic book.
-
ICASSP - Summarizing video using a shot importance measure and a frame-Packing Algorithm
1999 IEEE International Conference on Acoustics Speech and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999Co-Authors: S Uchihashi, J FooteAbstract:This paper presents methods of generating compact pictorial summarizations of video. By calculating a measure of shot importance video can be summarized by de-emphasizing or discarding less important information, such as repeated or common scenes. In contrast to other approaches that present keyframes for each shot, this measure allows summarization by presenting only the most important shots. Selected keyframes can also be resized depending on their relative importance. We present an efficient Packing Algorithm that constructs a pictorial representation from differently-sized keyframes. This results in a compact and visually pleasing summary reminiscent of a comic book.
Rajkumar Buyya - One of the best experts on this subject based on the ideXlab platform.
-
on incorporating an on line strip Packing Algorithm into elastic grid reservation based systems
International Conference on Parallel and Distributed Systems, 2007Co-Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar BuyyaAbstract:In grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip Packing Algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our Algorithm with a real workload trace and show that the proposed Algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
-
ICPADS - On incorporating an on-line strip Packing Algorithm into elastic Grid reservation-based systems
2007 International Conference on Parallel and Distributed Systems, 2007Co-Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar BuyyaAbstract:In grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip Packing Algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our Algorithm with a real workload trace and show that the proposed Algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
S Uchihashi - One of the best experts on this subject based on the ideXlab platform.
-
summarizing video using a shot importance measure and a frame Packing Algorithm
International Conference on Acoustics Speech and Signal Processing, 1999Co-Authors: S Uchihashi, J FooteAbstract:This paper presents methods of generating compact pictorial summarizations of video. By calculating a measure of shot importance video can be summarized by de-emphasizing or discarding less important information, such as repeated or common scenes. In contrast to other approaches that present keyframes for each shot, this measure allows summarization by presenting only the most important shots. Selected keyframes can also be resized depending on their relative importance. We present an efficient Packing Algorithm that constructs a pictorial representation from differently-sized keyframes. This results in a compact and visually pleasing summary reminiscent of a comic book.
-
ICASSP - Summarizing video using a shot importance measure and a frame-Packing Algorithm
1999 IEEE International Conference on Acoustics Speech and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999Co-Authors: S Uchihashi, J FooteAbstract:This paper presents methods of generating compact pictorial summarizations of video. By calculating a measure of shot importance video can be summarized by de-emphasizing or discarding less important information, such as repeated or common scenes. In contrast to other approaches that present keyframes for each shot, this measure allows summarization by presenting only the most important shots. Selected keyframes can also be resized depending on their relative importance. We present an efficient Packing Algorithm that constructs a pictorial representation from differently-sized keyframes. This results in a compact and visually pleasing summary reminiscent of a comic book.
Anthony Sulistio - One of the best experts on this subject based on the ideXlab platform.
-
on incorporating an on line strip Packing Algorithm into elastic grid reservation based systems
International Conference on Parallel and Distributed Systems, 2007Co-Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar BuyyaAbstract:In grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip Packing Algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our Algorithm with a real workload trace and show that the proposed Algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
-
ICPADS - On incorporating an on-line strip Packing Algorithm into elastic Grid reservation-based systems
2007 International Conference on Parallel and Distributed Systems, 2007Co-Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar BuyyaAbstract:In grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip Packing Algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our Algorithm with a real workload trace and show that the proposed Algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
Kyong Hoon Kim - One of the best experts on this subject based on the ideXlab platform.
-
on incorporating an on line strip Packing Algorithm into elastic grid reservation based systems
International Conference on Parallel and Distributed Systems, 2007Co-Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar BuyyaAbstract:In grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip Packing Algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our Algorithm with a real workload trace and show that the proposed Algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
-
ICPADS - On incorporating an on-line strip Packing Algorithm into elastic Grid reservation-based systems
2007 International Conference on Parallel and Distributed Systems, 2007Co-Authors: Anthony Sulistio, Kyong Hoon Kim, Rajkumar BuyyaAbstract:In grid systems, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. In this paper, we introduce an elastic reservation model, where users can query about a resource availability on a given time interval. They can also provide a reservation duration time and/or number of compute nodes needed as soft constraints to the query. Next, we provide an adapted version of an on-line strip Packing Algorithm, that takes into a consideration of resource utilization when processing reservation requests. We evaluate our Algorithm with a real workload trace and show that the proposed Algorithm manages a higher resource utilization and number of acceptance compared to an ad-hoc rigid approach.
