41 results on '"Malik, Jitendra"'
Search Results
2. Multimodal Image Synthesis with Conditional Implicit Maximum Likelihood Estimation.
- Author
-
Li, Ke, Peng, Shichong, Zhang, Tianhao, and Malik, Jitendra
- Subjects
MAXIMUM likelihood statistics ,HIGH resolution imaging ,COMPUTER vision ,COMPUTER graphics - Abstract
Many tasks in computer vision and graphics fall within the framework of conditional image synthesis. In recent years, generative adversarial nets have delivered impressive advances in quality of synthesized images. However, it remains a challenge to generate both diverse and plausible images for the same input, due to the problem of mode collapse. In this paper, we develop a new generic multimodal conditional image synthesis method based on implicit maximum likelihood estimation and demonstrate improved multimodal image synthesis performance on two tasks, single image super-resolution and image synthesis from scene layouts. We make our implementation publicly available. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
3. Cognitive Mapping and Planning for Visual Navigation.
- Author
-
Gupta, Saurabh, Tolani, Varun, Davidson, James, Levine, Sergey, Sukthankar, Rahul, and Malik, Jitendra
- Subjects
ROBOTICS ,WORLD maps ,SPATIAL ability ,SPATIAL memory - Abstract
We introduce a neural architecture for navigation in novel environments. Our proposed architecture learns to map from first-person views and plans a sequence of actions towards goals in the environment. The Cognitive Mapper and Planner (CMP) is based on two key ideas: (a) a unified joint architecture for mapping and planning, such that the mapping is driven by the needs of the task, and (b) a spatial memory with the ability to plan given an incomplete set of observations about the world. CMP constructs a top-down belief map of the world and applies a differentiable neural net planner to produce the next action at each time step. The accumulated belief of the world enables the agent to track visited regions of the environment. We train and test CMP on navigation problems in simulation environments derived from scans of real world buildings. Our experiments demonstrate that CMP outperforms alternate learning-based architectures, as well as, classical mapping and path planning approaches in many cases. Furthermore, it naturally extends to semantically specified goals, such as "going to a chair". We also deploy CMP on physical robots in indoor environments, where it achieves reasonable performance, even though it is trained entirely in simulation. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
4. View Synthesis by Appearance Flow.
- Author
-
Zhou, Tinghui, Tulsiani, Shubham, Sun, Weilun, Malik, Jitendra, and Efros, Alexei A.
- Published
- 2016
- Full Text
- View/download PDF
5. Generic 3D Representation via Pose Estimation and Matching.
- Author
-
Zamir, Amir R., Wekel, Tilman, Agrawal, Pulkit, Wei, Colin, Malik, Jitendra, and Savarese, Silvio
- Published
- 2016
- Full Text
- View/download PDF
6. Amodal Instance Segmentation.
- Author
-
Li, Ke and Malik, Jitendra
- Published
- 2016
- Full Text
- View/download PDF
7. Depth Estimation for Glossy Surfaces with Light-Field Cameras.
- Author
-
Tao, Michael W., Wang, Ting-Chun, Malik, Jitendra, and Ramamoorthi, Ravi
- Published
- 2015
- Full Text
- View/download PDF
8. Detecting People in Cubist Art.
- Author
-
Ginosar, Shiry, Haas, Daniel, Brown, Timothy, and Malik, Jitendra
- Published
- 2015
- Full Text
- View/download PDF
9. Learning Rich Features from RGB-D Images for Object Detection and Segmentation.
- Author
-
Gupta, Saurabh, Girshick, Ross, Arbeláez, Pablo, and Malik, Jitendra
- Published
- 2014
- Full Text
- View/download PDF
10. Analyzing the Performance of Multilayer Neural Networks for Object Recognition.
- Author
-
Agrawal, Pulkit, Girshick, Ross, and Malik, Jitendra
- Published
- 2014
- Full Text
- View/download PDF
11. Simultaneous Detection and Segmentation.
- Author
-
Hariharan, Bharath, Arbeláez, Pablo, Girshick, Ross, and Malik, Jitendra
- Published
- 2014
- Full Text
- View/download PDF
12. Indoor Scene Understanding with RGB-D Images: Bottom-up Segmentation, Object Detection and Semantic Segmentation.
- Author
-
Gupta, Saurabh, Arbeláez, Pablo, Girshick, Ross, and Malik, Jitendra
- Subjects
IMAGE segmentation ,SEMANTICS ,ALGORITHMS ,PIXELS ,IMAGE analysis - Abstract
In this paper, we address the problems of contour detection, bottom-up grouping, object detection and semantic segmentation on RGB-D data. We focus on the challenging setting of cluttered indoor scenes, and evaluate our approach on the recently introduced NYU-Depth V2 (NYUD2) dataset (Silberman et al., ECCV, ). We propose algorithms for object boundary detection and hierarchical segmentation that generalize the $$gPb-ucm$$ approach of Arbelaez et al. (TPAMI, ) by making effective use of depth information. We show that our system can label each contour with its type (depth, normal or albedo). We also propose a generic method for long-range amodal completion of surfaces and show its effectiveness in grouping. We train RGB-D object detectors by analyzing and computing histogram of oriented gradients on the depth image and using them with deformable part models (Felzenszwalb et al., TPAMI, ). We observe that this simple strategy for training object detectors significantly outperforms more complicated models in the literature. We then turn to the problem of semantic segmentation for which we propose an approach that classifies superpixels into the dominant object categories in the NYUD2 dataset. We design generic and class-specific features to encode the appearance and geometry of objects. We also show that additional features computed from RGB-D object detectors and scene classifiers further improves semantic segmentation accuracy. In all of these tasks, we report significant improvements over the state-of-the-art. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
13. Multi-component Models for Object Detection.
- Author
-
Gu, Chunhui, Arbeláez, Pablo, Lin, Yuanqing, Yu, Kai, and Malik, Jitendra
- Published
- 2012
- Full Text
- View/download PDF
14. Discriminative Decorrelation for Clustering and Classification.
- Author
-
Hariharan, Bharath, Malik, Jitendra, and Ramanan, Deva
- Published
- 2012
- Full Text
- View/download PDF
15. Color Constancy, Intrinsic Images, and Shape Estimation.
- Author
-
Barron, Jonathan T. and Malik, Jitendra
- Published
- 2012
- Full Text
- View/download PDF
16. Automated Tuberculosis Diagnosis Using Fluorescence Images from a Mobile Microscope.
- Author
-
Chang, Jeannette, Arbeláez, Pablo, Switz, Neil, Reber, Clay, Tapley, Asa, Davis, J. Lucian, Cattamanchi, Adithya, Fletcher, Daniel, and Malik, Jitendra
- Published
- 2012
- Full Text
- View/download PDF
17. Multiple-View Object Recognition in Smart Camera Networks.
- Author
-
Yang, Allen Y., Maji, Subhransu, Christoudias, C. Mario, Darrell, Trevor, Malik, Jitendra, and Sastry, S. Shankar
- Abstract
We study object recognition in low-power, low-bandwidth smart camera networks. The ability to perform robust object recognition is crucial for applications such as visual surveillance to track and identify objects of interest, and overcome visual nuisances such as occlusion and pose variations between multiple camera views. To accommodate limited bandwidth between the cameras and the base-station computer, the method utilizes the available computational power on the smart sensors to locally extract SIFT-type image features to represent individual camera views. We show that between a network of cameras, high-dimensional SIFT histograms exhibit a joint sparse pattern corresponding to a set of shared features in 3-D. Such joint sparse patterns can be explicitly exploited to encode the distributed signal via random projections. At the network station, multiple decoding schemes are studied to simultaneously recover the multiple-view object features based on a distributed compressive sensing theory. The system has been implemented on the Berkeley CITRIC smart camera platform. The efficacy of the algorithm is validated through extensive simulation and experiment. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
18. Object Segmentation by Long Term Analysis of Point Trajectories.
- Author
-
Brox, Thomas and Malik, Jitendra
- Abstract
Unsupervised learning requires a grouping step that defines which data belong together. A natural way of grouping in images is the segmentation of objects or parts of objects. While pure bottom-up segmentation from static cues is well known to be ambiguous at the object level, the story changes as soon as objects move. In this paper, we present a method that uses long term point trajectories based on dense optical flow. Defining pair-wise distances between these trajectories allows to cluster them, which results in temporally consistent segmentations of moving objects in a video shot. In contrast to multi-body factorization, points and even whole objects may appear or disappear during the shot. We provide a benchmark dataset and an evaluation method for this so far uncovered setting. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
19. Detecting People Using Mutually Consistent Poselet Activations.
- Author
-
Bourdev, Lubomir, Maji, Subhransu, Brox, Thomas, and Malik, Jitendra
- Abstract
Bourdev and Malik (ICCV 09) introduced a new notion of parts, poselets, constructed to be tightly clustered both in the configuration space of keypoints, as well as in the appearance space of image patches. In this paper we develop a new algorithm for detecting people using poselets. Unlike that work which used 3D annotations of keypoints, we use only 2D annotations which are much easier for naive human annotators. The main algorithmic contribution is in how we use the pattern of poselet activations. Individual poselet activations are noisy, but considering the spatial context of each can provide vital disambiguating information, just as object detection can be improved by considering the detection scores of nearby objects in the scene. This can be done by training a two-layer feed-forward network with weights set using a max margin technique. The refined poselet activations are then clustered into mutually consistent hypotheses where consistency is based on empirically determined spatial keypoint distributions. Finally, bounding boxes are predicted for each person hypothesis and shape masks are aligned to edges in the image to provide a segmentation. To the best of our knowledge, the resulting system is the current best performer on the task of people detection and segmentation with an average precision of 47.8% and 40.5% respectively on PASCAL VOC 2009. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
20. Shape Matching and Object Recognition.
- Author
-
Ponce, Jean, Hebert, Martial, Schmid, Cordelia, Zisserman, Andrew, Berg, Alexander C., and Malik, Jitendra
- Abstract
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning transform, typically a regularized thin plate spline, resulting in a dense correspondence between the two shapes. Object recognition is handled in a nearest neighbor framework where the distance between exemplar and query is the matching cost between corresponding points. We show results on two datasets. One is the Caltech 101 dataset (Li, Fergus and Perona), a challenging dataset with large intraclass variation. Our approach yields a 45% correct classification rate in addition to localization. We also show results for localizing frontal and profile faces that are comparable to special purpose approaches tuned to faces. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
21. Matching with Shape Contexts.
- Author
-
Bellomo, Nicola, Krim, Hamid, Yezzi, Anthony, Belongie, Serge, Mori, Greg, and Malik, Jitendra
- Abstract
We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solving for correspondences between points on the two shapes, and (2) using the correspondences to estimate an aligning transform. In order to solve the correspondence problem, we attach a descriptor, the shape context, to each point. The shape context at a reference point captures the distribution of the remaining points relative to it, thus offering a globally discriminative characterization. Corresponding points on two similar shapes will have similar shape contexts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; regularized thin-plate splines provide a flexible class of transformation maps for this purpose. The dissimilarity between the two shapes is computed as a sum of matching errors between corresponding points, together with a term measuring the magnitude of the aligning transform. We treat recognition in a nearest neighbor classification framework as the problem of finding the stored prototype shape that is maximally similar to that in the image. We also demonstrate that shape contexts can be used to quickly prune a search for similar shapes. We present two algorithms for rapid shape retrieval: representative shape contexts, performing comparisons based on a small number of shape contexts, and shapemes, using vector quantization in the space of shape contexts to obtain prototypical shape pieces. Results are presented for silhouettes, handwritten digits and visual CAPTCHAs. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
22. Figure/Ground Assignment in Natural Images.
- Author
-
Leonardis, Aleš, Bischof, Horst, Pinz, Axel, Ren, Xiaofeng, Fowlkes, Charless C., and Malik, Jitendra
- Abstract
Figure/ground assignment is a key step in perceptual organization which assigns contours to one of the two abutting regions, providing information about occlusion and allowing high-level processing to focus on non-accidental shapes of figural regions. In this paper, we develop a computational model for figure/ground assignment in complex natural scenes. We utilize a large dataset of images annotated with human-marked segmentations and figure/ground labels for training and quantitative evaluation. We operationalize the concept of familiar configuration by constructing prototypical local shapes, i.e. shapemes, from image data. Shapemes automatically encode mid-level visual cues to figure/ground assignment such as convexity and parallelism. Based on the shapeme representation, we train a logistic classifier to locally predict figure/ground labels. We also consider a global model using a conditional random field (CRF) to enforce global figure/ground consistency at T-junctions. We use loopy belief propagation to perform approximate inference on this model and learn maximum likelihood parameters from ground-truth labels. We find that the local shapeme model achieves an accuracy of 64% in predicting the correct figural assignment. This compares favorably to previous studies using classical figure/ground cues [1]. We evaluate the global model using either a set of contours extracted from a low-level edge detector or the set of contours given by human segmentations. The global CRF model significantly improves the performance over the local model, most notably when using human-marked boundaries (78%). These promising experimental results show that this is a feasible approach to bottom-up figure/ground assignment in natural images. [ABSTRACT FROM AUTHOR]
- Published
- 2006
- Full Text
- View/download PDF
23. Spectral Partitioning with Indefinite Kernels Using the Nyström Extension.
- Author
-
Belongie, Serge, Fowlkes, Charless, Chung, Fan, and Malik, Jitendra
- Abstract
Fowlkes et al. [7] recently introduced an approximation to the Normalized Cut (NCut) grouping algorithm [18] based on random subsampling and the Nyström extension. As presented, their method is restricted to the case where W, the weighted adjacency matrix, is positive definite. Although many common measures of image similarity (i.e. kernels) are positive definite, a popular example being Gaussian-weighted distance, there are important cases that are not. In this work, we present a modification to Nyström-NCut that does not require W to be positive definite. The modification only affects the orthogonalization step, and in doing so it necessitates one additional O(m
3 ) operation, where m is the number of random samples used in the approximation. As such it is of interest to know which kernels are positive definite and which are indefinite. In addressing this issue, we further develop connections between NCut and related methods in the kernel machines literature. We provide a proof that the Gaussian-weighted chi-squared kernel is positive definite, which has thus far only been conjectured. We also explore the performance of the approximation algorithm on a variety of grouping cues including contour, color and texture. [ABSTRACT FROM AUTHOR]- Published
- 2002
- Full Text
- View/download PDF
24. Estimating Human Body Configurations Using Shape Context Matching.
- Author
-
Mori, Greg and Malik, Jitendra
- Abstract
The problem we consider in this paper is to take a single two-dimensional image containing a human body, locate the joint positions, and use these to estimate the body configuration and pose in three-dimensional space. The basic approach is to store a number of exemplar 2D views of the human body in a variety of different configurations and viewpoints with respect to the camera. On each of these stored views, the locations of the body joints (left elbow, right knee, etc.) are manually marked and labelled for future use. The test shape is then matched to each stored view, using the technique of shape context matching in conjunction with a kinematic chain-based deformation model. Assuming that there is a stored view sufficiently similar in configuration and pose, the correspondence process will succeed. The locations of the body joints are then transferred from the exemplar view to the test shape. Given the joint locations, the 3D body configuration and pose are then estimated. We can apply this technique to video by treating each frame independently - tracking just becomes repeated recognition! We present results on a variety of datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2002
- Full Text
- View/download PDF
25. A Probabilistic Multi-scale Model for Contour Completion Based on Image Statistics.
- Author
-
Ren, Xiaofeng and Malik, Jitendra
- Abstract
We derive a probabilistic multi-scale model for contour completion based on image statistics. The boundaries of human segmented images are used as ˵ground truth″. A probabilistic formulation of contours demands a prior model and a measurement model. From the image statistics of boundary contours, we derive both the prior model of contour shape and the local likelihood model of image measurements. We observe multi-scale phenomena in the data, and accordingly propose a higher-order Markov model over scales for the contour continuity prior. Various image cues derived from orientation energy are evaluated and incorporated into the measurement model. Based on these models, we have designed a multi-scale algorithm for contour completion, which exploits both contour continuity and texture. Experimental results are shown on a wide range of images. [ABSTRACT FROM AUTHOR]
- Published
- 2002
- Full Text
- View/download PDF
26. Finding boundaries in natural images: A new method using point descriptors and area completion.
- Author
-
Goos, Gerhard, Hartmanis, Juris, Leeuwen, Jan, Burkhardt, Hans, Neumann, Bernd, Belongie, Serge, and Malik, Jitendra
- Abstract
We develop an approach to image segmentation for natural scenes containing image texture. One general methodology which shows promise for solving this problem is to characterize textured regions via their responses to a set of filters. However, this approach brings with it many open questions, including how to combine texture and intensity information into a common descriptor and how to deal with the fact that filter responses inside textured regions are generally spatially inhomogeneous. Our goal in this paper is to introduce two new ideas which address these open questions and to demonstrate the application of these ideas to the segmentation of natural images. The first idea consists of a novel means of describing points in natural images and an associated distance function for comparing these descriptors. This distance function is aided in textured regions by the use of the second idea, a new process introduced here which we have termed area completion. Experimental segmentation results which incorporate our proposed approach into the Normalized Cut framework of Shi and Malik are provided for a variety of natural images. [ABSTRACT FROM AUTHOR]
- Published
- 1998
- Full Text
- View/download PDF
27. Contour continuity in region based image segmentation.
- Author
-
Goos, Gerhard, Hartmanis, Juris, Leeuwen, Jan, Burkhardt, Hans, Neumann, Bernd, Leung, Thomas, and Malik, Jitendra
- Abstract
Region-based image segmentation techniques make use of similarity in intensity, color and texture to determine the partitioning of an image. The powerful cue of contour continuity is not exploited at all. In this paper, we provide a way of incorporating curvilinear grouping into region-based image segmentation. Soft contour information is obtained through orientation energy. Weak contrast gaps and subjective contours are completed by contour propagation. The normalized cut approach proposed by Shi and Malik is used for the segmentation. Results on a large variety of images are shown. [ABSTRACT FROM AUTHOR]
- Published
- 1998
- Full Text
- View/download PDF
28. Self inducing relational distance and its application to image segmentation.
- Author
-
Goos, Gerhard, Hartmanis, Juris, Leeuwen, Jan, Burkhardt, Hans, Neumann, Bernd, Shi, Jianbo, and Malik, Jitendra
- Abstract
We propose a new feature distance which is derived from an optimal relational graph matching criterion. Instead of defining an arbitrary similarity measure for grouping, we will use the criterion of reducing instability in the relational graph to induce a similarity measure. This similarity measure not only improves the stability of the matching, but more importantly, also captures the relative importance of relational similarity in the feature space for the purpose of grouping. We will call this similarity measure the self-induced relational distance. We demonstrate the distance measure on a brightness-texture feature space and apply it to the segmentation of complex natural images. [ABSTRACT FROM AUTHOR]
- Published
- 1998
- Full Text
- View/download PDF
29. Learning Probabilistic Models for Contour Completion in Natural Images.
- Author
-
Ren, Xiaofeng, Fowlkes, Charless, and Malik, Jitendra
- Subjects
MACHINE learning ,PROBABILITY theory ,IMAGE processing ,IMAGING systems ,STATISTICS ,APPROXIMATION theory - Abstract
Using a large set of human segmented natural images, we study the statistics of region boundaries. We observe several power law distributions which likely arise from both multi-scale structure within individual objects and from arbitrary viewing distance. Accordingly, we develop a scale-invariant representation of images from the bottom up, using a piecewise linear approximation of contours and constrained Delaunay triangulation to complete gaps. We model curvilinear grouping on top of this graphical/geometric structure using a conditional random field to capture the statistics of continuity and different junction types. Quantitative evaluations on several large datasets show that our contour grouping algorithm consistently dominates and significantly improves on local edge detection. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
30. Learning to Locate Informative Features for Visual Identification.
- Author
-
Ferencz, Andras, Learned-Miller, Erik, and Malik, Jitendra
- Subjects
MACHINE learning ,PATTERN recognition systems ,ALGORITHMS ,ESTIMATION theory ,IMAGE processing ,MATHEMATICAL functions ,IMAGING systems - Abstract
Object identification is a specialized type of recognition in which the category (e.g. cars) is known and the goal is to recognize an object’s exact identity (e.g. Bob’s BMW). Two special challenges characterize object identification. First, inter-object variation is often small (many cars look alike) and may be dwarfed by illumination or pose changes. Second, there may be many different instances of the category but few or just one positive “training” examples per object instance. Because variation among object instances may be small, a solution must locate possibly subtle object-specific salient features, like a door handle, while avoiding distracting ones such as specular highlights. With just one training example per object instance, however, standard modeling and feature selection techniques cannot be used. We describe an on-line algorithm that takes one image from a known category and builds an efficient “same” versus “different” classification cascade by predicting the most discriminative features for that object instance. Our method not only estimates the saliency and scoring function for each candidate feature, but also models the dependency between features, building an ordered sequence of discriminative features specific to the given image. Learned stopping thresholds make the identifier very efficient. To make this possible, category-specific characteristics are learned automatically in an off-line training procedure from labeled image pairs of the category. Our method, using the same algorithm for both cars and faces, outperforms a wide variety of other methods. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
31. Twist Based Acquisition and Tracking of Animal and Human Kinematics.
- Author
-
Bregler, Christoph, Malik, Jitendra, and Pullen, Katherine
- Subjects
- *
BIOMECHANICS , *KINEMATICS , *DEGREES of freedom , *COMPUTER vision , *ARTIFICIAL intelligence , *IMAGE processing - Abstract
This paper demonstrates a new visual motion estimation technique that is able to recover high degree-of-freedom articulated human body configurations in complex video sequences. We introduce the use and integration of a mathematical technique, the product of exponential maps and twist motions, into a differential motion estimation. This results in solving simple linear systems, and enables us to recover robustly the kinematic degrees-of-freedom in noise and complex self occluded configurations. A new factorization technique lets us also recover the kinematic chain model itself. We are able to track several human walk cycles, several wallaby hop cycles, and two walk cycels of the famous movements of Eadweard Muybridge's motion studies from the last century. To the best of our knowledge, this is the first computer vision based system that is able to process such challenging footage. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
32. Representing and Recognizing the Visual Appearance of Materials using Three-dimensional Textons.
- Author
-
Leung, Thomas and Malik, Jitendra
- Abstract
We study the recognition of surfaces made from different materials such as concrete, rug, marble, or leather on the basis of their textural appearance. Such natural textures arise from spatial variation of two surface attributes: (1) reflectance and (2) surface normal. In this paper, we provide a unified model to address both these aspects of natural texture. The main idea is to construct a vocabulary of prototype tiny surface patches with associated local geometric and photometric properties. We call these 3D textons. Examples might be ridges, grooves, spots or stripes or combinations thereof. Associated with each texton is an appearance vector, which characterizes the local irradiance distribution, represented as a set of linear Gaussian derivative filter outputs, under different lighting and viewing conditions. Given a large collection of images of different materials, a clustering approach is used to acquire a small (on the order of 100) 3D texton vocabulary. Given a few (1 to 4) images of any material, it can be characterized using these textons. We demonstrate the application of this representation for recognition of the material viewed under novel lighting and viewing conditions. We also illustrate how the 3D texton model can be used to predict the appearance of materials under novel conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2001
- Full Text
- View/download PDF
33. Contour and Texture Analysis for Image Segmentation.
- Author
-
Malik, Jitendra, Belongie, Serge, Leung, Thomas, and Shi, Jianbo
- Abstract
This paper provides an algorithm for partitioning grayscale images into disjoint regions of coherent brightness and texture. Natural images contain both textured and untextured regions, so the cues of contour and texture differences are exploited simultaneously. Contours are treated in the intervening contour framework, while texture is analyzed using textons. Each of these cues has a domain of applicability, so to facilitate cue combination we introduce a gating operator based on the texturedness of the neighborhood at a pixel. Having obtained a local measure of how likely two nearby pixels are to belong to the same region, we use the spectral graph theoretic framework of normalized cuts to find partitions of the image into regions of coherent texture and brightness. Experimental results on a wide range of images are shown. [ABSTRACT FROM AUTHOR]
- Published
- 2001
- Full Text
- View/download PDF
34. Stereoscopic occlusion junctions.
- Author
-
Malik, Jitendra, Anderson, Barton L., and Charowhas, Chad E.
- Subjects
- *
EYE , *VISION - Abstract
Portions of surfaces in a binocularly viewed scene may be 'half occluded', that is, visible in only one eye. The human visual system uses zones of half occlusion to help segment the visual scene and infer figure-ground relationships at object boundaries. We developed a quantitative model of the depthdiscontinuity cue provided by half occlusion. Half occlusions are revealed by two-dimensional interocular displacements of binocularly viewed occlusion junctions, such as T junctions. We derived a formula relating this two-dimensional displacement, or 'pseudodisparity', to binocular disparities and orientations of occluding and occluded contours. In human psychophysical experiments, perceived depth and contour orientation quantitatively depended on pseudodisparity, as predicted by our model, implying that the visual system senses quantitative variations in interocular junction position to reconstruct occlusion geometry. [ABSTRACT FROM AUTHOR]
- Published
- 1999
- Full Text
- View/download PDF
35. Computing Local Surface Orientation and Shape from Texture for Curved Surfaces.
- Author
-
Malik, Jitendra and Rosenholtz, Ruth
- Abstract
Shape from texture is best analyzed in two stages, analogous to stereopsis and structure from motion: (a) Computing the ‘texture distortion’ from the image, and (b) Interpreting the ‘texture distortion’ to infer the orientation and shape of the surface in the scene. We model the texture distortion for a given point and direction on the image plane as an affine transformation and derive the relationship between the parameters of this transformation and the shape parameters. We have developed a technique for estimating affine transforms between nearby image patches which is based on solving a system of linear constraints derived from a differential analysis. One need not explicitly identify texels or make restrictive assumptions about the nature of the texture such as isotropy. We use non-linear minimization of a least squares error criterion to recover the surface orientation (slant and tilt) and shape (principal curvatures and directions) based on the estimated affine transforms in a number of different directions. A simple linear algorithm based on singular value decomposition of the linear parts of the affine transforms provides the initial guess for the minimization procedure. Experimental results on both planar and curved surfaces under perspective projection demonstrate good estimates for both orientation and shape. A sensitivity analysis yields predictions for both computer vision algorithms and human perception of shape from texture. [ABSTRACT FROM AUTHOR]
- Published
- 1997
- Full Text
- View/download PDF
36. Robust computation of optical flow in a multi-scale differential framework.
- Author
-
Weber, Joseph and Malik, Jitendra
- Abstract
We have developed a new algorithm for computing optical flow in a differential framework. The image sequence is first convolved with a set of linear, separable spatiotemporal filter kernels similar to those that have been used in other early vision problems such as texture and stereopsis. The brightness constancy constraint can then be applied to each of the resulting images, giving us, in general, an overdetermined system of equations for the optical flow at each pixel. There are three principal sources of error: (a) stochastic error due to sensor noise (b) systematic errors in the presence of large displacements and (c) errors due to failure of the brightness constancy model. Our analysis of these errors leads us to develop an algorithm based on a robust version of total least squares. Each optical flow vector computed has an associated reliability measure which can be used in subsequent processing. The performance of the algorithm on the data set used by Barron et al. (IJCV 1994) compares favorably with other techniques. In addition to being separable, the filters used are also causal, incorporating only past time frames. The algorithm is fully parallel and has been implemented on a multiple processor machine. [ABSTRACT FROM AUTHOR]
- Published
- 1995
- Full Text
- View/download PDF
37. Interpreting line drawings of curved objects.
- Author
-
Malik, Jitendra
- Abstract
In this paper, we study the problem of interpreting line drawings of scenes composed of opaque regular solid objects bounded by piecewise smooth surfaces with no markings or texture on them. It is assumed that the line drawing has been formed by orthographic projection of such a scene under general viewpoint, that the line drawing is error free, and that there are no lines due to shadows or specularities. Our definition implicitly excludes laminae, wires, and the apices of cones. A major component of the interpretation of line drawings is line labelling. By line labelling we mean (a) classification of each image curve as corresponding to either a depth or orientation discontinuity in the scene, and (b) further subclassification of each kind of discontinuity. For a depth discontinuity we determine whether it is a limb-a locus of points on the surface where the line of sight is tangent to the surface-or an occluding edge-a tangent plane discontinuity of the surface. For an orientation discontinuity, we determine whether it corresponds to a convex or concave edge. This paper presents the first mathematically rigorous scheme for labelling line drawings of the class of scenes described. Previous schemes for labelling line drawings of scenes containing curved objects were heuristic, incomplete, and lacked proper mathematical justification. By analyzing the projection of the neighborhoods of different kinds of points on a piecewise smooth surface, we are able to catalog all local labelling possibilities for the different types of junctions in a line drawing. An algorithm is developed which utilizes this catalog to determine all legal labellings of the line drawing. A local minimum complexity rule-at each vertex select those labellings which correspond to the minimum number of faces meeting at the vertex-is used in order to prune highly counter-intuitive interpretations. The labelling scheme was implemented and tested on a number of line drawings. The labellings obtained are few and by and large in accordance with human interpretations. [ABSTRACT FROM AUTHOR]
- Published
- 1987
- Full Text
- View/download PDF
38. Biochemical alterations after single oral dose of monocrotophos in Bubalus bubalis.
- Author
-
Sandhu, Harpal and Malik, Jitendra
- Subjects
MONOCROTOPHOS ,WATER buffalo ,CHOLINESTERASES ,AMINOTRANSFERASES ,BLOOD proteins ,CHOLINESTERASE inhibitors ,TOXICITY testing - Abstract
The article presents a study which aims to investigate the effects of a single oral dose of monocrotophos on the plasma cholinesterase (ChE), serum aminotransferases, and total plasma proteins of Bubalus bubalis. The study used 12 healthy buffalo calves that were purchased from the local market and were given the monocrotophos, Nuvacron, from Hindustan Ciba-Geigy Ltd. Results show that monocrotophos produced mild to moderate degree of toxic symptoms similar to anticholinesterase poisoning.
- Published
- 1988
- Full Text
- View/download PDF
39. Biotransformation and disposition of the coumaphos metabolite 3-chloro-4-methyl-(4-C)-7-hydroxycoumarin in rats.
- Author
-
Malik, Jitendra, Lay, Jan, Klein, Werner, and Korte, Friedhelm
- Abstract
The biotransformation and disposition of 3-chloro-4-methyl-(4-C)-7-hydroxycoumarin [(C) chlorferron] were investigated in rats after single oral administration. Following administration of (C) chlorferron at 0.5 and 20 mg/kg body weight to male rats, > 90% of the given dose was eliminated in the urine (77-84%) and faeces (7-15%) within 24 h. Low levels of (C) chlorferron derived residues were detected in different organs of rats 7 days after dosing. Administration of (C) chlorferron at 20 mg/kg allowed the isolation of three metabolites in the 24-h urine of male and female rats. Compounds tentatively identified were dechlorinated metabolites of chlorferron besides unchanged chlorferron. The majority of the metabolites were excreted in conjugated forms. The pattern of biotransformation of chlorferron was qualitatively similar in male and female rats. Comparative studies on the elimination and biodistribution of (C) chlorferron and its parent compound (C) coumaphos in male rats indicated rapid metabolism and faster elimination of chlorferron and its metabolites from the body than that of the parent compound. [ABSTRACT FROM AUTHOR]
- Published
- 1981
- Full Text
- View/download PDF
40. Effect on Bubalus bubalis thermoregulation by monocrotophos and antidotal therapy.
- Author
-
Sandhu, Harpal and Malik, Jitendra
- Subjects
BODY temperature regulation ,MONOCROTOPHOS ,PHYSIOLOGICAL effects of insecticides ,WATER buffalo ,HYPOTHERMIA ,T-test (Statistics) - Abstract
The article presents a study on thermoregulatory effect of monocrotophos and antidotal therapy on Bubalus bubalis. The study used the student t-test to analyse the data statistically and the significance was assessed at 0.01 and 0.05 levels. Result shows that monocrotophos developed significant fall in animals body temperature and the insecticide intoxication hypothermia was found to be time and dose dependent.
- Published
- 1989
- Full Text
- View/download PDF
41. Editorial.
- Author
-
Malik, Jitendra
- Published
- 2001
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.