The Experts below are selected from a list of 3939 Experts worldwide ranked by ideXlab platform
Yugang Jiang - One of the best experts on this subject based on the ideXlab platform.
-
fast tracking of near duplicate keyframes in Broadcast Domain with transitivity propagation
ACM Multimedia, 2006Co-Authors: Chongwah Ngo, Wanlei Zhao, Yugang JiangAbstract:The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the Broadcast Domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective detection and fast tracking of NDK pairs based upon the matching of local keypoints in frames. In the detection phase, we propose a robust measure, namely pattern entropy (PE), to measure the coherency of symmetric keypoint matching across the space of two keyframes. This measure is shown to be effective in discovering the NDK identity of a frame. In the tracking phase, the NDK pairs and threads are rapidly propagated and linked with sitivity without the need of detection. This step ends up a significant boost in speed efficiency. We evaluate proposed approach against a month of the 2004 Broadcast videos. The experimental results indicate our approach outperforms other techniques in terms of recall and precision with a large margin. In addition, by considering the transitivity and the underlying distribution of NDK pairs along time span, a speed up of 3 to 5 times is achieved when keeping the performance close enough to the optimal one obtained by exhaustive evaluation.
-
ACM Multimedia - Fast tracking of near-duplicate keyframes in Broadcast Domain with transitivity propagation
Proceedings of the 14th annual ACM international conference on Multimedia - MULTIMEDIA '06, 2006Co-Authors: Chongwah Ngo, Wanlei Zhao, Yugang JiangAbstract:The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the Broadcast Domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective detection and fast tracking of NDK pairs based upon the matching of local keypoints in frames. In the detection phase, we propose a robust measure, namely pattern entropy (PE), to measure the coherency of symmetric keypoint matching across the space of two keyframes. This measure is shown to be effective in discovering the NDK identity of a frame. In the tracking phase, the NDK pairs and threads are rapidly propagated and linked with sitivity without the need of detection. This step ends up a significant boost in speed efficiency. We evaluate proposed approach against a month of the 2004 Broadcast videos. The experimental results indicate our approach outperforms other techniques in terms of recall and precision with a large margin. In addition, by considering the transitivity and the underlying distribution of NDK pairs along time span, a speed up of 3 to 5 times is achieved when keeping the performance close enough to the optimal one obtained by exhaustive evaluation.
-
CIVR - Keyframe retrieval by keypoints: can point-to-point matching help?
Lecture Notes in Computer Science, 2006Co-Authors: Wanlei Zhao, Yugang Jiang, Chongwah NgoAbstract:Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when point-to-point (P2P) constraint is imposed on the bag-of-words. We conduct investigation on two tasks: near-duplicate keyframe (NDK) retrieval, and high-level concept classification, covering parts of TRECVID 2003 and 2005 datasets. In P2P matching, we propose a one-to-one symmetric keypoint matching strategy to diminish the noise effect during keyframe comparison. In addition, a new multi-dimensional index structure is proposed to speed up the matching process with keypoint filtering. Through experiments, we demonstrate that P2P constraint can significantly boost the performance of NDK retrieval, while showing competitive accuracy in concept classification of Broadcast Domain.
Ashish Verma - One of the best experts on this subject based on the ideXlab platform.
-
audio visual large vocabulary continuous speech recognition in the Broadcast Domain
Multimedia Signal Processing, 1999Co-Authors: Sankar Basu, Chalapathy Neti, Nitendra Rajput, Andrew W, L V Subramaniam, Ashish VermaAbstract:Considers the problem of combining visual cues with audio signals for the purpose of improved automatic machine recognition of speech. Although significant progress has been made in the machine transcription of large-vocabulary continuous speech (LVCSR) over the last few years, the technology to date is most effective only under controlled conditions, such as low noise, speaker-dependent recognition, read speech (as opposed to conversational speech), etc. On the other hand, while augmenting the recognition of speech utterances with visual cues has attracted the attention of researchers over the last couple of years, most efforts in this Domain can be considered to be only preliminary in the sense that, unlike LVCSR efforts, tasks have been limited to small vocabularies (e.g. commands, digits) and often to speaker-dependent training or isolated word speech, where word boundaries are artificially well-defined.
-
MMSP - Audio-visual large vocabulary continuous speech recognition in the Broadcast Domain
1999 IEEE Third Workshop on Multimedia Signal Processing (Cat. No.99TH8451), 1999Co-Authors: Sankar Basu, Chalapathy Neti, Nitendra Rajput, L V Subramaniam, Andrew W. Senior, Ashish VermaAbstract:Considers the problem of combining visual cues with audio signals for the purpose of improved automatic machine recognition of speech. Although significant progress has been made in the machine transcription of large-vocabulary continuous speech (LVCSR) over the last few years, the technology to date is most effective only under controlled conditions, such as low noise, speaker-dependent recognition, read speech (as opposed to conversational speech), etc. On the other hand, while augmenting the recognition of speech utterances with visual cues has attracted the attention of researchers over the last couple of years, most efforts in this Domain can be considered to be only preliminary in the sense that, unlike LVCSR efforts, tasks have been limited to small vocabularies (e.g. commands, digits) and often to speaker-dependent training or isolated word speech, where word boundaries are artificially well-defined.
Danny Dolev - One of the best experts on this subject based on the ideXlab platform.
-
pcode an efficient and reliable collective communication protocol for unreliable Broadcast Domain
International Parallel Processing Symposium, 1995Co-Authors: Jehoshua Bruck, Danny Dolev, R Orni, Ray StrongAbstract:Existing programming environments for clusters are typically built on top of a point-to-point communication layer (send and receive) over local area networks (LANs) and, as a result, suffer from poor performance in the collective communication part. For example, a Broadcast that is implemented using a TCP/IP protocol (which is a point-to-point protocol) over a LAN is obviously an efficient as it is not utilizing the fact that the LAN is a Broadcast medium. We have observed that the main difference between a distributed computing paradigm and a message passing parallel computing paradigm is that, in a distributed environment the activity of every processor is independent while in a parallel environment the collection of the user-communication layers in the processors can be modeled as a single global program. We have formalized the requirements by defining the notion of a correct global program. This notion provides a precise specification, of the interface between the transport layer and the user-communication. Layer. We have developed PCODE, a new communication protocol that is driven by a global program, and proved its correctness. We have implemented the PCODE protocol on a collection of IBM RS/6000 workstations and on a collection of Silicon Graphics Indigo workstations, both communicating via UDP Broadcast. The experimental results we obtained indicate that the performance advantage of PCODE over the current point-to-point approach (TCP) can be as high as an order of magnitude on a cluster of 16 workstations. >
-
on distributed algorithms in a Broadcast Domain
International Colloquium on Automata Languages and Programming, 1993Co-Authors: Danny Dolev, Dalia MalkiAbstract:This paper studies the usage of Broadcast communication in distributed services. The approach taken is practical: all the algorithms are asynchronous, and tolerate realistic faults. We study four problems in a Broadcast Domain: clock synchronization, reliable and ordered Broadcast, membership, and file replication. The clock synchronization algorithm shows for the first time how to utilize Broadcast communication for synchronization. The master synchronizes any number of slaves while incurring a constant load. The approach taken in the file replication tool uses snooping in order to enhance the availability of file systems, at almost no cost.
-
ICALP - On Distributed Algorithms in a Broadcast Domain
Automata Languages and Programming, 1993Co-Authors: Danny Dolev, Dalia MalkiAbstract:This paper studies the usage of Broadcast communication in distributed services. The approach taken is practical: all the algorithms are asynchronous, and tolerate realistic faults. We study four problems in a Broadcast Domain: clock synchronization, reliable and ordered Broadcast, membership, and file replication. The clock synchronization algorithm shows for the first time how to utilize Broadcast communication for synchronization. The master synchronizes any number of slaves while incurring a constant load. The approach taken in the file replication tool uses snooping in order to enhance the availability of file systems, at almost no cost.
-
IPPS - PCODE: an efficient and reliable collective communication protocol for unreliable Broadcast Domain
Proceedings of 9th International Parallel Processing Symposium, 1Co-Authors: Jehoshua Bruck, Danny Dolev, R Orni, Ray StrongAbstract:Existing programming environments for clusters are typically built on top of a point-to-point communication layer (send and receive) over local area networks (LANs) and, as a result, suffer from poor performance in the collective communication part. For example, a Broadcast that is implemented using a TCP/IP protocol (which is a point-to-point protocol) over a LAN is obviously an efficient as it is not utilizing the fact that the LAN is a Broadcast medium. We have observed that the main difference between a distributed computing paradigm and a message passing parallel computing paradigm is that, in a distributed environment the activity of every processor is independent while in a parallel environment the collection of the user-communication layers in the processors can be modeled as a single global program. We have formalized the requirements by defining the notion of a correct global program. This notion provides a precise specification, of the interface between the transport layer and the user-communication. Layer. We have developed PCODE, a new communication protocol that is driven by a global program, and proved its correctness. We have implemented the PCODE protocol on a collection of IBM RS/6000 workstations and on a collection of Silicon Graphics Indigo workstations, both communicating via UDP Broadcast. The experimental results we obtained indicate that the performance advantage of PCODE over the current point-to-point approach (TCP) can be as high as an order of magnitude on a cluster of 16 workstations. >
Chongwah Ngo - One of the best experts on this subject based on the ideXlab platform.
-
fast tracking of near duplicate keyframes in Broadcast Domain with transitivity propagation
ACM Multimedia, 2006Co-Authors: Chongwah Ngo, Wanlei Zhao, Yugang JiangAbstract:The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the Broadcast Domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective detection and fast tracking of NDK pairs based upon the matching of local keypoints in frames. In the detection phase, we propose a robust measure, namely pattern entropy (PE), to measure the coherency of symmetric keypoint matching across the space of two keyframes. This measure is shown to be effective in discovering the NDK identity of a frame. In the tracking phase, the NDK pairs and threads are rapidly propagated and linked with sitivity without the need of detection. This step ends up a significant boost in speed efficiency. We evaluate proposed approach against a month of the 2004 Broadcast videos. The experimental results indicate our approach outperforms other techniques in terms of recall and precision with a large margin. In addition, by considering the transitivity and the underlying distribution of NDK pairs along time span, a speed up of 3 to 5 times is achieved when keeping the performance close enough to the optimal one obtained by exhaustive evaluation.
-
ACM Multimedia - Fast tracking of near-duplicate keyframes in Broadcast Domain with transitivity propagation
Proceedings of the 14th annual ACM international conference on Multimedia - MULTIMEDIA '06, 2006Co-Authors: Chongwah Ngo, Wanlei Zhao, Yugang JiangAbstract:The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the Broadcast Domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective detection and fast tracking of NDK pairs based upon the matching of local keypoints in frames. In the detection phase, we propose a robust measure, namely pattern entropy (PE), to measure the coherency of symmetric keypoint matching across the space of two keyframes. This measure is shown to be effective in discovering the NDK identity of a frame. In the tracking phase, the NDK pairs and threads are rapidly propagated and linked with sitivity without the need of detection. This step ends up a significant boost in speed efficiency. We evaluate proposed approach against a month of the 2004 Broadcast videos. The experimental results indicate our approach outperforms other techniques in terms of recall and precision with a large margin. In addition, by considering the transitivity and the underlying distribution of NDK pairs along time span, a speed up of 3 to 5 times is achieved when keeping the performance close enough to the optimal one obtained by exhaustive evaluation.
-
CIVR - Keyframe retrieval by keypoints: can point-to-point matching help?
Lecture Notes in Computer Science, 2006Co-Authors: Wanlei Zhao, Yugang Jiang, Chongwah NgoAbstract:Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when point-to-point (P2P) constraint is imposed on the bag-of-words. We conduct investigation on two tasks: near-duplicate keyframe (NDK) retrieval, and high-level concept classification, covering parts of TRECVID 2003 and 2005 datasets. In P2P matching, we propose a one-to-one symmetric keypoint matching strategy to diminish the noise effect during keyframe comparison. In addition, a new multi-dimensional index structure is proposed to speed up the matching process with keypoint filtering. Through experiments, we demonstrate that P2P constraint can significantly boost the performance of NDK retrieval, while showing competitive accuracy in concept classification of Broadcast Domain.
Sankar Basu - One of the best experts on this subject based on the ideXlab platform.
-
audio visual large vocabulary continuous speech recognition in the Broadcast Domain
Multimedia Signal Processing, 1999Co-Authors: Sankar Basu, Chalapathy Neti, Nitendra Rajput, Andrew W, L V Subramaniam, Ashish VermaAbstract:Considers the problem of combining visual cues with audio signals for the purpose of improved automatic machine recognition of speech. Although significant progress has been made in the machine transcription of large-vocabulary continuous speech (LVCSR) over the last few years, the technology to date is most effective only under controlled conditions, such as low noise, speaker-dependent recognition, read speech (as opposed to conversational speech), etc. On the other hand, while augmenting the recognition of speech utterances with visual cues has attracted the attention of researchers over the last couple of years, most efforts in this Domain can be considered to be only preliminary in the sense that, unlike LVCSR efforts, tasks have been limited to small vocabularies (e.g. commands, digits) and often to speaker-dependent training or isolated word speech, where word boundaries are artificially well-defined.
-
MMSP - Audio-visual large vocabulary continuous speech recognition in the Broadcast Domain
1999 IEEE Third Workshop on Multimedia Signal Processing (Cat. No.99TH8451), 1999Co-Authors: Sankar Basu, Chalapathy Neti, Nitendra Rajput, L V Subramaniam, Andrew W. Senior, Ashish VermaAbstract:Considers the problem of combining visual cues with audio signals for the purpose of improved automatic machine recognition of speech. Although significant progress has been made in the machine transcription of large-vocabulary continuous speech (LVCSR) over the last few years, the technology to date is most effective only under controlled conditions, such as low noise, speaker-dependent recognition, read speech (as opposed to conversational speech), etc. On the other hand, while augmenting the recognition of speech utterances with visual cues has attracted the attention of researchers over the last couple of years, most efforts in this Domain can be considered to be only preliminary in the sense that, unlike LVCSR efforts, tasks have been limited to small vocabularies (e.g. commands, digits) and often to speaker-dependent training or isolated word speech, where word boundaries are artificially well-defined.
