Proof: Let R1 and R2 denote the instances of a region R in I1 and I2. In order to detect the entire region R, at least one descriptor d1 ∈ R1 has to randomly sample its correct match d2 ∈ R2 (following which the entire region will be ‘grown’ due to the propagation phase of the Region Growing Algorithm described in Section 4). So, the probability of detecting a region is equal to the probability...

Presenting a set of similar or diverse ideas during the idea generation process leads ideators to come-up with more creative and diverse ideas. However, to better assess the similarity between the ideas, we designed two matching systems, namely I-Match and OntoIdea. In the context of the idea generation process, each idea is represented by a set of instances from DBpedia describing the main con...

Merging virtual object with human video sequence is an important technique for many applications such as special effects in movies and augmented reality. In a traditional method, the operator manually fit 3D body model onto the human video sequence, and generate virtual objects at the current 3D body pose. However, the manual fitting is a time consuming task, and the automatic registration is r...

Camera based systems have been a preferred choice in many motion tracking applications due to the ease of installation and the ability to work in unprepared environments. The concept of these systems is based on extracting image information (colour and shape properties) to detect the object location. However, the resolution of the image and the camera field-ofview (FOV) are two main factors tha...

Mutilation in the facial region may significantly affect the self-image and personality of individuals. Prosthetic rehabilitation of facial defects could increase the quality of life, thereby encouraging the patients to build up their self-confidence to return to normal social life. Acceptable cosmetic results are often obtained through facial prosthesis. Recovery after the loss of an eye requi...

Please read: I will try to post here a few solutions (or answers). The new solutions will be added to this same file. They might come with no explanation, just the “answer”. If yours do not match mine, you can try to figure out again. (Also, read the disclaimer below!) You can come to office hours if you want explanations for the unexplained answers. Be careful that just because our “answers” w...

In this paper, we present an efficient IP packet forwarding methodology and architecture. This is achieved by partitioning the lookup table into the smaller ones for each output port and allowing a forwarding engine to process them in parallel. This effectively reduces the complexity of finding “the longest prefix match” problem to “the first prefix match” problem.