Our goal is to recover a complete 3D model from a depth image of an object. Existing approaches rely on user interaction or apply to a limited class of objects, such as chairs. We aim to fully automatically reconstruct a 3D model from any category. We take an exemplar-based approach: retrieve similar objects in a database of 3D models using view-based… (More)
Interconnects for clusters and bladed systems must deliver efficient throughput, low latency, low delay variations and minimal frame drops. The primary technical issues hindering Ethernet adoption for cluster and blade system interconnects are the current methods Ethernet switches use for dealing with congestion, which can happen frequently under cluster… (More)
We analyze a decentralized random-walk based algorithm for data collection at the sink in a multi-hop sensor network. Our algorithm, Metropolis-Collect, which involves data packets being passed to random neighbors in the network according to a simple metropolis random-walk mechanism, requires no configuration and incurs no routing overhead. To analyze this… (More)
Belgaum during the year 2006-07. It is certified that all corrections/ suggestions indicated for Internal Assessment have been incorporated in the report deposited in the departmental library. The project work has been approved as it satisfies the academic requirements in respect of the Project Work prescribed for the Bachelor of Engineering degree.
A grand goal of computer vision is to build systems that learn visual representations over time that can be applied to many tasks. In this paper, we investigate a vision-language embedding as a core representation and show that it leads to better cross-task transfer than standard multi-task learning. In particular, the task of visual recognition is aligned… (More)
We propose an approach for 3D reconstruction and segmentation of a single object placed on a flat surface from an input video. Our approach is to perform dense depth map estimation for multiple views using a proposed objective function that preserves detail. The resulting depth maps are then fused using a proposed implicit surface function that is robust to… (More)
Background ● Action-value function using parameters θ ● Policy was generated from the Q(s,a) ● We will focus on parameterizing the policy directly: