| _ | point | _ |
| 2-D Curve Matching Using High Curvature | point | s: Application To Stereo Vision |
| 2-D Images Of 3-D Oriented | point | s |
| 2-D Images Of 3-D Oriented | point | s |
| 3-D Camera Calibration Using Vanishing | point | Concept |
| 3-D Pose From 3 | point | s Using Weak Perspective |
| 3d Shape Reconstruction By Using Vanishing | point | s |
| 3d Structure Reconstruction From | point | Correspondences Between Two Perspective Projections |
| 3d Visual Information From Vanishing | point | s |
| A) Flexible Feature Matching For Automatic Face And Facial Feature | point | ( |
| A-Shapes Of A Finite | point | Set |
| Absolute Orientation From Uncertain | point | Data: A Unified Approach |
| Accurate Line Parameters From An Optimising Hough Transform For Vanishing | point | Detection |
| Active Intrinsic Calibration Using Vanishing | point | s |
| Active Intrinsic Calibration Using Vanishing | point | s |
| Active Navigation: Tracking An Environmental | point | Considered Beneficial |
| Adaptive Dominant | point | Detection Algorithm For Digital Curves, An |
| Adaptive | point | Estimation In Signal-Dependent Noise |
| Affine | point | Matching |
| Affine Shape Representation From Motion Through Reference | point | s |
| Algorithm For Camera Calibration Using A Three-Dimensional Reference | point | , An |
| Algorithm For Detection Of Dominant | point | s And Polygonal Approximation Of Digitzed Curves, An |
| Algorithm For Polygonal Approximation Based On Iterative | point | Elimination, An |
| Algorithms For Vertical And Orthogonal L<1> Linear Approximation Of | point | s |
| All | point | s Addressable Raster Display Memory |
| Ambiguity In Reconstruction From Images Of Six | point | s |
| Analysis And Solutions Of The Three | point | Perspective Pose Estimation Problem |
| Analysis Of Video Image Sequences Using | point | And Line Correspondences |
| Analytic Solution For The Perspective 4- | point | Problem, An |
| Analytic Solution For The Perspective 4- | point | Problem, An |
| Ann-Driven Edge | point | Selection Criterion |
| Another Look At The Dominant | point | Detection Of Digital Curves |
| Application Of Isiid: Arcs, Fillets, And Tangent | point | s Restoration In Digitized Line, An |
| Approximate Minimum Weight Matching On | point | s In K-Dimensional Space |
| Approximation Of A Set Of | point | s By A Grid |
| Automatic Feature | point | Extraction And Tracking In Image Sequences For Arbitrary Camera Motion |
| Automatic Feature | point | Extraction And Tracking In Image Sequences For Unknown Camera Motion |
| Bayesian Method For Triangulation And Its Application To Finding Corresponding | point | s, A |
| Beginning A Transition From A Local To A More Global | point | Of View In Model-Based Vehicle Tracking |
| Bipartite Graph Matching For | point | s On A Line Or A Circle |
| Boolean Characterization Of Three-Dimensional Simple | point | s, A |
| Boundaries Through Scattered | point | s Of Unknown Density |
| Boundary Simplification Using A Multiscale Dominant- | point | Detection Algorithm |
| C1 Quadtree Interpolation Over Arbitrary | point | Sets |
| Camera Calibration Using 4 | point | -Targets, A |
| Characterization Of Some Drilled Pit Images From Contour And Ridge | point | s Detection |
| Circular Separability Of Planar | point | Sets |
| Classification Of Partially Occluded Objects Using 3- | point | Matching And Distance Transformation |
| Combinatorial And Experimental Results For Randomized | point | Matching Algorithms |
| Combining | point | Distribution Models With Shape Models Based On Finite Element Analysis |
| Comment On ``Analysis Of Video Image Sequences Using | point | And Line Correspondences'', A |
| Comparing And Evaluating Interest | point | s |
| Comparison Of Several Estimates Of Edge | point | In Noisy Digital Data Across A Step Edge, A |
| Comparison Of Splitting Methods For The Identification Of Corner- | point | s, A |
| Complete Scene Structure From Four | point | Correspondences |
| Computing Egomotion And Detecting Independent Motion From Image Motion Using Collinear | point | s |
| Computing Egomotion And Shape From Image Motion Using Collinear | point | s |
| Computing Stereopsis Using Feature | point | Contour Matching |
| Computing The Hausdorff Set Distance In Linear Time For Any L | point | Distance |
| Computing The Largest Empty Convex Subset Of A Set Of | point | s |
| Computing The Minimum Hausdorff Distance Between Two | point | Sets On A Line Under Translation |
| Computing The Shape Of A | point | Set In Digital Images |
| Configurations That Defeat The 8- | point | Algorithm |
| Consensus By Decomposition: A Paradigm For Fast High Breakdown | point | Robust Estimation |
| Consistency In | point | -In-Polygon Tests |
| Constrained Phase Congruency: Simultaneous Detection Of Interest | point | s And Of Their Orientational Scales |
| Constrained Phase Congruency: Simultaneous Detection Of Interest | point | s And Of Their Scales |
| Contribution To The Determination Of Vanishing | point | s Using Hough Transform |
| Control | point | Matching Algorithm, A |
| Control | point | Transforms For Shape Representation And Measurement |
| Control- | point | -Based Sweeping Technique, A |
| Controlling Growing Snakes By Using Key- | point | s |
| Converging Approaches To Extracting Structure From Motion: Psychophysical And Computational Investigations Of Recovering Connectivity From Moving | point | -Light Displays |
| Corner | point | Detection Using Nest Moving Average |
| Creating Multisided Rational Bezier Surfaces Using Base | point | s |
| Critical | point | Detection In Fluid Flow Images Using Dynamical System Properties |
| Curvature-Based Approach To | point | Correspondence Recovery In Conformal Nonrigid Motion |
| Data Parallel Implementation Of An Edge | point | Chaining: Towards A New Principle Of Edge Linking, A |
| Decomposing A Set Of | point | s Into Chains, With Applications To Permutation And Circle Graphs |
| Delaunay Triangulation And The Convex Hull Of N | point | s In Expected Linear Time |
| Depth-Order | point | Classification Techniques For Csg Display Algorithms |
| Description Of The Color Image By Using Stable View | point | s |
| Detecting Relative Motion In Moving | point | Patterns |
| Detecting The Dominant | point | s By The Curvature-Based Polygonal Approximation |
| Detection Of 3-D Simple | point | s For Topology Preserving Transformations With Application To Thinning |
| Detection Of Convex And Concave Discontinuous | point | s In A Plane Curve |
| Detection Of Dominant | point | s On An Object Boundary: A Discontinuity Approach |
| Detection Of Dominant | point | s On Digital Curves By Scale-Space Filtering, The |
| Detection Of Interest | point | s Using Symmetry |
| Detection Of Rotationally Symmetric Shape Orientation By Fold-Invariant Shape-Specific | point | s |
| Detection Of Significant | point | s And Polygonal Approximation Of Digitized Curves |
| Determination Of Camera Location From 2-D To 3-D Line And | point | Correspondences |
| Determination Of Camera Location From 2d To 3d Line And | point | Correspondences |
| Determination Of Critical | point | s On Planar Shapes Using An Adaptive Line Of Sight Method |
| Determination Of Motion Parameters And Estimation Of | point | Correspondences In Small Nonrigid Deformations |
| Determination Of Singular | point | s In 2d Deformable Flow Fields |
| Determination Of The | point | Of Fixation In A Head-Fixed Coordinate System |
| Determining Correspondences And Rigid Motion Of 3-D | point | Sets With Missing Data |
| Determining Location And Orientation Of A Labelled Cylinder Using | point | -Pair Estimation Algorithm |
| Determining Perceptually Significant | point | s On Noisy Boundary Curves |
| Determining Vanishing | point | And Camera Parameter: New Approaches |
| Determining Vanishing | point | s From Perspective Images |
| Differential Algorithm For The Determination Of Shape From Shading Using A | point | Light Source |
| Digital Plane And Grid | point | Segments |
| Digital Signal Processing, Association And Tracking Of | point | Source, Small And Cluster Targets (Orlando, Fl, March 27-29 |
| Discrimination Of Facial Regions Based On Dynamic Grids Of | point | Representations |
| Distance Measures For | point | Sets And Their Computation |
| Distributions Of Distances And Triangles In A | point | Set And Algorithms For Computing The Largest Common Point Sets |
| Distributions Of Distances And Triangles In A | point | Set And Algorithms For Computing The Largest Common Point Sets |
| Duality Of Multi- | point | And Multi-Frame Geometry: Fundamental Shape Matrices And Tensors |
| Dynamic Feature | point | Tracking In An Image Sequence |
| Dynamic Scene Analysis And The 8- | point | Algorithm |
| Dynamical Sets Of | point | s |
| Early Image Representation Using Regions Defined By Maximum Gradient Paths Betwen Singular | point | s |
| Effect Of Stable | point | s On The Convergence Of Markov Random Fields, The |
| Efficient Algorithm For Smoothing, Linearization And Detection Of Structural Feature | point | s Of Binary Image Contours, An |
| Efficient Evaluation Of 1-D And 2-D Polynomials At Equispaced | point | s |
| Efficient | point | In Polyhedron Algorithm, An |
| Efficient Three- | point | Arc Algorithm, An |
| Eigen- | point | s |
| Eight- | point | Discrete Hartley Transform As An Edge Operator And Its Interpretation In The Frequency Domain |
| Ellipse Fitting By Accumulating Five- | point | Fits |
| Encoding Of Closed Boundaries Using Transition | point | s |
| Error Analysis For Surface Orientation From Vanishing | point | s, An |
| Error Analysis In Stereo Determination Of 3-D | point | Positions |
| Establishing Motion-Based Feature | point | Correspondence |
| Estimating Non-Rigid Motion From | point | And Line Correspondences |
| Estimating Three-Dimensional Motion Parameters Of A Rigid Planar Patch, Iii: Finite | point | Correspondences And The Three-View Problem |
| Euclidean Reconstruction From Image Sequences With Varying And Unknown Focal Length And Principal | point | |
| Exact And Approximate Computational Geometry Solutions Of An Unrestricted | point | Set Stereo Matching Problem |
| Exact And Approximate Solutions Of The Perspective Three- | point | Problem |
| Existence And Uniqueness For Shape From Shading Around Critical | point | s: Theory And An Algorithm |
| Extending The | point | Distribution Model Using Polar Coordinates |
| Extensions To The Fuzzy | pointed | Set With Applications To Image Processing |
| Extracting Geometric Shapes From A Set Of | point | s |
| Extracting Projective Structure From Single Perspective Views Of 3d | point | Sets |
| Extracting Structure From An Affine View Of A 3d | point | Set With One Or Two Bilateral Symmetries |
| Extraction Of Characteristic | point | s For The Description Of A 3-D Object |
| Extraction Of Vanishing | point | s From Images Of Indoor And Outdoor Scenes |
| Extremal | point | s: Definition And Application To 3d Image Registration |
| Face K-D Trees For Bounded Error | point | Locationoperations And Surface Simplification |
| Fast Affine | point | Matching: An Output-Sensitive Method |
| Fast Algorithm For Computing The Shape Of A Set Of Digital | point | s |
| Fast Algorithm For | point | Pattern Matching: Invariant To Translations, Rotations And Scale Changes |
| Fast And Robust | point | Tracking Algorithm, A |
| Fast Characterization Of 3d Simple | point | s |
| Fast Horizon Computation At All | point | s Of A Terrain With Visibility And Shading Applications |
| Fast Method For Estimating The Uncertainty In The Location Of Image | point | s In 3d Recognition, A |
| Fast Surface-Based Procedure For Object Reconstruction From 3d Scattered | point | s, A |
| Fast, High Breakdown | point | Robust Estimator For Computer Vision Applications, A |
| Faster | point | Set Pattern Matching In 3d |
| Feature | point | Correspondence In The Presence Of Occlusion |
| Feature | point | Matching In Image Sequences |
| Feature | point | Matching Using Temporal Smoothness In Velocity |
| Feature | point | Tracking In Time-Varying Images |
| Feature-Based O(N[2]) Approach To | point | Pattern Matching, A |
| Features For Recognition Of Projectively Deformed | point | Sets, The |
| Finding 3-D | point | Correspondences In Motion Estimation |
| Finding Antipodal | point | Grasps On Irregularly Shaped Objects |
| Finding Boundaries In Natural Images: A New Method Using | point | Descriptors And Area Completion |
| Finding Corresponding | point | s Based On Bayesian Triangulation |
| Finding Extreme | point | s In Three Dimensions And Solving The Post-Office Problem In The Plane |
| Finding Feasible Paths For A Two- | point | Body |
| Finding | point | Correspondences And Determining Motion Of A Rigid Object From Two Weak Perspective Views |
| Finding | point | Correspondences And Determining Motion Of A Rigid Object From Two Weak Perspective Views |
| Finding | point | Correspondences In Motion Sequences Preserving Affine Structure |
| Finding | point | Correspondences Using Simulated Annealing |
| Finding The Convex Hull Of A Sorted | point | Set In Parallel |
| Finding Trajectories Of Feature | point | s In A Monocular Image Sequence |
| Finding Trajectories Of Feature | point | s In A Monocular Image Sequence |
| Fitting A Set Of | point | s By A Circle |
| Fitting Polygonal Functions To A Set Of | point | s In The Plane |
| Fitting Straight Lines To | point | Patterns |
| Flexible Colour | point | Distribution Models |
| Formulation And Error Analysis For A Generalized Image | point | Correspondence Algorithm |
| Fourier Analysis Based Algorithm For Fixed | point | s Detection In Displacement Vector Fields, A |
| Framework For Recovering Affine Transforms Using | point | s, Lines, Or Image Brightness, A |
| Framework For Uncertainty And Validation Of 3-D Registration Methods Based On | point | s And Frames, A |
| Freedom Descriptions: A Way To Find Figures That Approximate Given | point | s |
| General Method For Partial | point | Set Matching, A |
| Geometric Algebra: A Framework For Computing | point | And Line Correspondences And Projective Structure Using $N$ Uncalibrated Cameras |
| Getting Around The Aperture Problem Using | point | And Line Correspondences |
| Globally-Equiangular Triangulations Of Co-Circular | point | s In O(N Log N) Time |
| Graph Matching Approach To 3-D | point | Correspondences, A |
| Guided Image Matching Approach Using Hausdorff Distance With Interesting | point | s Detection, A |
| How To Look At An Uncertain | point | |
| Hypothesis Testing For Coarse Region Estimation And Stable | point | Determination Applied To Markovian Texture Segmentation |
| Image Analysis On Massively Parallel Computers: An Architectural | point | Of View |
| Image Compression By Selecting Control | point | s Using Distance Function On Curved Space |
| Image Registration By Control | point | s Pairing Using The Invariant Properties Of Line Segments |
| Image Registration Without Explicit | point | Correspondence |
| Improved Algorithms For Robust | point | Pattern Matching And Applications To Image Registration |
| In Defence Of The 8- | point | Algorithm |
| In Defense Of The Eight- | point | Model |
| Incorporating Vanishing | point | Geometry Into A Building Extraction System |
| Inference Of Surface From Sparse 3-D | point | s |
| Inferring 3d Structure From Three | point | s In Rigid Motion |
| Infinite Control | point | s-A Method For Representing Surfaces Of Revolution Using Boundary Data |
| Interactive Design Of Smooth Objects With Probabilistic | point | Constraints |
| Interest | point | s, Disparities And Correspondence |
| Invariants Of 6 | point | s From 3 Uncalibrated Images |
| Invariants Of Six | point | s And Projective Reconstruction From Three Uncalibrated Images |
| Inverse Perspective Transform From Zero-Curvature Curve | point | s Application To The Location Of Some Generalized Cylinders |
| Inverse Perspective Transform Using Zero-Curvature Contour | point | s: Application To The Localization Of Some Generalized Cylinders From A Single View |
| Isthmus Critical | point | s For Solving Jigsaw Puzzles In Computer Vision |
| Iterative | point | Matching For Registration Of Free-Form Curves And Surfaces |
| Iterative Pose Estimation Using Coplanar Feature | point | s |
| Iterative Pose Estimation Using Coplanar | point | s |
| Labeled | point | Pattern Matching By Delaunay Triangulation And Maximal Cliques |
| Labeled | point | Pattern Matching By Fuzzy Relaxation |
| Lattice | point | s, Wiley |
| Least Squares Estimation Of Transformation Parameters Between Two | point | Patterns |
| Least Squares Fitting Of Two 3-D | point | Sets |
| Lens Distortion Calibration Using | point | Correspondences |
| Linear Algorithm For Computing The Visibility Polygon From A | point | , A |
| Linear Algorithm For | point | And Line-Based Structure From Motion, A |
| Linear Complexity Procedure For Labelling Line Drawings Of Polyhedral Scenes Using Vanishing | point | s, A |
| Linear Method For Reconstruction From Lines And | point | s, A |
| Linear N Lambda 4- | point | Pose Determination |
| Linear Time Algorithm For Triangulating A | point | -Visible Polygon, A |
| Linear-Time Algorithm For Linear L<1> Approximation Of | point | s, A |
| Lines And | point | s In Three Views And The Trifocal Tensor |
| Lines And | point | s In Three Views-A Unified Approach |
| Local Feature Detector Using 3- | point | Matching And Dynamic Programming |
| Locating Objects From Their | point | Features Using An Optimized Hough-Like Accumulation Technique |
| Locating Perceptually Salient | point | s On Planar Curves |
| Locating Polyhedral Objects From Edge | point | Data |
| Locating Polyhedral Objects From Edge | point | Data |
| M-Dimensional Grid | point | Space, The |
| Maintaining Stereo Calibration By Tracking Image | point | s |
| Matching And Motion Estimation Of Three-Dimensional | point | And Line Sets Using Eigenstructure Without Correspondences |
| Matching Feature | point | s In Image Sequences Through A Region-Based Method |
| Matching | point | Features With Ordered Geometric, Rigidity, And Disparity Constraints |
| Mathematical Properties Of The 2d Motion Field: From Singular | point | s To Motion Parameters |
| Maximal Matching Of 3-D | point | s For Multiple-Object Motion Estimation |
| Maximal Matching Of Two Three-Dimensional | point | Sets |
| Measuring Body | point | s On Automobile Drivers Using Multiple Cameras |
| Method For Encoding Region Boundaries Based On Transition | point | s, A |
| Method Of Obtaining The Relative Positions Of Four | point | s From Three Perspective Projections, A |
| Minimax Geometric Fitting Of Two Corresponding Sets Of | point | s |
| Minimum Feature | point | Set Representing A Convex Polyhedral Object, The |
| Mirror And | point | Symmetry Under Perspective Skewing |
| Model Based Estimation Of | point | Correspondences Between Boundaries Undergoing Nonrigid Motion |
| Model-Based Nonrigid Motion Recovery From Sequences Of Range Images Without | point | Correspondences |
| Model-Based Shape From Contour And | point | Patterns |
| Modelling Grey Level Surfaces Using Three-Dimensional | point | Distribution Models |
| Models For Neighbor Dependency In Planar | point | Pattens |
| Monocular Pose Of A Rigid Body Using | point | Landmarks |
| Morphological Algorithms For Computing Non-Planar | point | Neighborhoods On Cellular Automata |
| Morphological | point | Thinning Algorithm, A |
| Morphological Scale-Space Using Generalized Zero-Crossings As Feature | point | s |
| Morphological Techniques In The Iterative Closest | point | Algorithm |
| Motion Analysis And Modeling Of Epicardial Surfaces From | point | And Line Correspondences |
| Motion Analysis Via Interframe | point | Correspondence |
| Motion And Structure From Motion From | point | And Line Matches |
| Motion And Structure From | point | Correspondences With Error Estimation: Planar Surfaces |
| Motion And Structure From | point | Correspondences: A Robust Algorithm For Planar Case With Error Estimation |
| Motion And Structure Of Four | point | s From One Motion Of A Stereo Rig With Unknown Extrinsic Parameters |
| Motion And Structure Of Four | point | s From One Motion Of A Stereo Rig With Unknown Extrinsic Parameters |
| Motion Characterization Of Unrigid Objects By Detecting And Tracking Feature | point | s |
| Motion Estimation From 3-D | point | Sets With And Without Correspondences |
| Motion Estimation From | point | s Without Correspondences From Orthographic Projections |
| Motion From | point | Matches Using Affine Epipolar Geometry |
| Motion From | point | Matches: Multiplicity Of Solutions |
| Motion From | point | Matches: Multiplicity Of Solutions |
| Motion Of | point | s And Lines In The Uncalibrated Case |
| Mpeg4 Face Modeling Using Fiducial | point | s |
| Multi-Scale Analysis Of Discrete | point | Sets |
| Multi-Step Procedures For The Localization Of 2d And 3d | point | Landmarks And Automatic Roi Size Selection |
| Multiple | point | Boundary Smoothing Algorithm, A |
| Near | point | Light Sources For Shape From Shading |
| Neural Network-Based Algorithm To Detect Dominant | point | s From The Chain-Code Of A Contour, A |
| New Algorithm For Calculating An Invariant Of 3d | point | Sets From A Single View |
| New Algorithms For 2d And 3d | point | Matching: Pose Estimation And Correspondence |
| New Approach For Aggregating Edge | point | s Into Line Segments, A |
| New Approach For Feature | point | Classification, Aggregation, And Description, A |
| New Approach To | point | Pattern Matching, A |
| New Characterization Of Three-Dimensional Simple | point | s, A |
| New Definition Of Neighborhood Of A | point | In Multi-Dimensional Space, A |
| New Feature | point | s Based On Geometric Invariants For 3d Image Registration |
| New Method For Processing | point | s, Lines And Regions Uniformly, A |
| New Method For Vanishing | point | Detection |
| New | point | -Location Algorithm And Its Practical Efficiency -Comparison With Existing Algorithms, A |
| New Safe- | point | Thinning Algorithm Based On The Mid-Crack Code Tracing, A |
| New Topological Classification Of | point | s In 3d Images, A |
| Non-Linear Generalization Of | point | Distribution Models Using Polynomial Regression |
| Non-Linear | point | Distribution Modelling Using A Multi-Layer Perceptron |
| Non-Parametric Dominant | point | Detection |
| Non-Partitionable | point | Sets |
| Nonuniqueness Results For X-Ray Problems With | point | Sources |
| Note On ``Thinning Of 3-D Images Using The Safe | point | Thinning Algorithm (Spta)'', A |
| Novel Surface Registration Using The Grid Closest | point | (Gcp) Transform |
| O(Log N) Time Parallel Algorithm For Triangulating A Set Of | point | s In The Plane, An |
| O(N Log N) Minimal Spanning Tree Algorithm For N | point | s In The Plane, An |
| Object Identification And Orientation Estimation From | point | Set Tensors |
| Object Identification From Multiple Images Based On | point | Matching Under A General Transformation |
| Object Pose From 2-D To 3-D | point | And Line Correspondences |
| Object Recognition Using Oriented Model | point | s |
| Object Recognition Using Oriented Model | point | s |
| Object Tracking Using Affine Structure For | point | Correspondences |
| On 3d Differential Operators For Detecting | point | Landmarks |
| On Approximation Behavior And Implementation Of The Greedy Triangulation For Convex Planar | point | Sets |
| On Combining | point | s And Lines In An Image Sequence To Recover 3d Structure And Motion |
| On Critical | point | Detection Of Digital Shapes |
| On Detecting Dominant | point | s |
| On Determining The On-Line Minimax Linear Fit To A Discrete | point | Set In The Plane |
| On Geometric Algorithms That Use The Furthest- | point | Voronoi Diagram |
| On Identification Of Singular | point | s Using Photometric Invariants For Global Shape From Shading Problem |
| On | point | Location And Motion Planning Among Simplices |
| On Symmetric Forms Of Discrete Sets Of | point | s And Digital Curves |
| On Terrain Model Acquisition By A | point | Robot Amidst Polyhedral Obstacles |
| On The Accuracy Of | point | Curvature Estimators In A Discrete Environment |
| On The Correspondence For Wide Angular Separation Of Non-Coplanar | point | s |
| On The Detection Of Dominant | point | s On Digital Curves |
| On The Geodesic Voronoi Diagram Of | point | Sites In A Simple Polygon |
| On The Geometry And Algebra Of The | point | And Line Correspondences Between $N$ Images |
| On The Order Of Examining Data- | point | s In Ssd Template Matching |
| On The Partitionability Of | point | Sets In Space |
| On The Selection Of Candidates For | point | And Line Correspondences |
| On The Shape Of A Set Of | point | s |
| Optimal Affine-Invariant | point | Matching |
| Optimal Algorithms For Finding The Symmetries Of A Planar | point | Set |
| Optimal Camera Placement To Obtain Accurate 3d | point | Positions |
| Optimal Computing Of Structure From Motion Using | point | Correspondences In Two Frames |
| Optimal Parallel Algorithm For Triangulating A Set Of | point | s In The Plane, An |
| Optimal Parallel Algorithms For Polygon And | point | -Set Problems |
| Optimal | point | Location In A Monotone Subdivision |
| Outline Of A Set Of | point | s |
| Parallax Geometry Of Pairs Of | point | s For 3d Scene Analysis |
| Parallel Algorithm For Detecting Dominant | point | s On Multiple Digital Curves, A |
| Parallel Algorithms For Testing If A | point | Is Inside A Closed Curve |
| Parameterized | point | Pattern Matching And Its Application To Recognition Of Object Families |
| Partitioning | point | Sets In Arbitrary Dimensions |
| Path-Planning Strategies For A | point | Mobile Automaton Moving Amidst Unknown Obstacles Of Arbitrary Shape |
| Pattern Analysis For | point | -Of-Sale Automation |
| Performance Characterization In Image Analysis: Thinning, A Case In | point | |
| Performance Evaluation And Analysis Of Vanishing | point | Detection Techniques |
| Perspective Invariant Description Of Planar | point | Set And Their Application In Matching |
| Perspective View Of Three | point | s, The |
| Photometric Invariant And Shape Constraints At Parabolic | point | s, A |
| Photometric Invariant And Shape Constraints At Parabolic | point | s, A |
| Picture Skeletons Based On Eccentricities Of | point | s Of Minimum Spanning Trees |
| Piecewise Linear Approximation Method Preserving Visual Feature | point | s Of Original Figures, A |
| Planar | point | Location Using Persistent Search Trees |
| point | Configuration Invariants Under Simultaneous Projective And Permutation Transformations |
| point | Correlation: A Reduced-Cost Template Matching Technique |
| point | Correspondence And Motion Detection In Long Image Sequences |
| point | Correspondence In Unstructured Nonrigid Motion |
| point | Correspondence Recovery In Non-Rigid Motion |
| point | Data Analysis |
| point | Landmarks For Registration Of Ct And Mr Images |
| point | Matching In A Time Sequence Of Stereo Image Pairs And Its Parallel Implementation On A Multiprocessor |
| point | Matching Using Asymmetric Neural Networks |
| point | Pattern Matching Algorithm Invariant To Geometrical Transformation And Distortion |
| point | Pattern Matching Using Centroid Bounding |
| point | Pattern Matching Using Convex Hull Edges |
| point | Pattern Representation Using Imprecise, Incomplete, Nonmetric Information |
| point | Reconstruction From Noisy Images |
| point | Retrieval For Polygons |
| point | Set Pattern Matching In 3-D |
| point | Set Pattern Matching In D Dimensions |
| point | Signatures: A New Representation For 3d Object Recognition |
| point | Symmetry Of Convex Digital Regions |
| point | Target Detection In Spatially Varying Clutter |
| point | /Line Correspondence Under 2d Projective Transformation |
| Polygonal Rooms Not Illuminable From Every | point | |
| Polygonizations Of | point | Sets In The Plane |
| Pose Estimation From Corresponding | point | Data |
| Pose Estimation From Corresponding | point | Data |
| Proximity Problems For | point | s On A Rectilinear Plane With Rectangular Obstacles |
| Pyramidal Stereovision Algorithm Based On Contour Chain | point | s, A |
| Qualitative Spatial Reasoning From The Observer'S | point | Of View-Towards A Generalization Of Symbolic Projection |
| Quenching | point | s In Distance Labeled Pictures |
| Quick | point | -In-Polyhedron Test, A |
| Randomized Algorithm For Closest- | point | Queries, A |
| Range-Data-Based Object Surface Segmentation Via Edges And Critical | point | s |
| Recognition And Recovery Of The Three-Dimensional Orientation Of Planar | point | Patterns |
| Recognition Of 2d Object Contours Using Starting- | point | -Independent Wavelet Coefficient Matching |
| Recognition Of Planar | point | Configurations Using The Density Of Affine Shape |
| Recognizing Objects By Matching Oriented | point | s |
| Recognizing Objects By Matching Oriented | point | s |
| Reconstructing Shape From Shading Images Under | point | Light Source Illumination |
| Reconstructing Shape From Shading With A | point | Light Source At The Projection Center: Shape Reconstruction From An Endoscope Image |
| Reconstructing Surfaces From Unstructured 3d | point | s |
| Reconstruction Of A Scene From Two Projections -- Configurations That Defeat The 8- | point | Algorithm, The |
| Recovering Scene Structures From Scattered Surface | point | s |
| Recovery Of Global Nonrigid Motion--A Model Based Approach Without | point | Correspondences |
| Recursive Decomposition Of Free-Space From Boundary | point | s |
| Registration Method For Rigid Objects Without | point | Matching, A |
| Registration Of 3d Multi-Modality Medical Images Using Surfaces And | point | Landmarks |
| Registration Of Multiple | point | Sets |
| Relative Sensitivity Of A Family Of Closest- | point | Graphs In Computer Vision Applications |
| Relaxation For | point | -Pattern Matching: What It Really Computes |
| Reliable Polygonal Approximations Of Imaged Real Objects Through Dominant | point | Detection |
| Repeatedly Smoothing, Discrete Scale-Space Evolution And Dominant | point | Detection |
| Representation And Tracking Of | point | Structures Using Stereovision |
| Review And Analysis Of Solutions Of The Three | point | Perspective Pose Estimation Problem |
| Ridge | point | s In Euclidean Distance Maps |
| Rigid Body Constrained Noisy | point | Pattern Matching |
| Rigidity Checking Of 3d | point | Correspondences Under Perspective Projection |
| Rigidity Checking Of 3d | point | Correspondences Under Perspective Projection |
| Road Following Using Vanishing | point | s |
| Road Following Using Vanishing | point | s |
| Robust Matching Process: A Dominant | point | Approach |
| Role Of Key- | point | s In Finding Contours, The |
| S. Li), S. Tsuji, And M. Imai, Determining Camera Rotation From Vanishing | point | s Of Lines On Horizontal Planes |
| Sampling | point | Setting On Cubic Splines For Computer Animation |
| Scale-Independent Dominant | point | Detection Algorithm, A |
| Scale-Invariant Image Filtering With | point | And Line Symmetry |
| Segmenting Unstructured 3d | point | s Into Surfaces |
| Selective Internal Operations In The Recognition Of Locally And Globally | point | -Inverted Patterns |
| Self-Calibration Of A Moving Camera From | point | Correspondences And Fundamental Matrices |
| Self-Consistency: A Novel Approach To Characterizing The Accuracy And Reliability Of | point | Correspondence Algorithms |
| Semi-Analytic Method For Estimating Stereo Camera Geometry From Matched | point | s |
| Semi-Analytic Method Of Determining Stereo Camera Geometry From Matched | point | s In A Pair Of Images: Coincident Meridional Planes, Exact Or Noisy Data, A |
| Separating | point | Sets By Circles, And The Recognition Of Digital Disks |
| Sequential Algorithm For Motion Estimation From | point | Correspondences With Intermittent Occlusions, A |
| Shading Models For | point | And Linear Sources |
| Shape Alignment|Optimal Initial | point | And Pose Estimation |
| Shape And 3-D Motion From Contour Without | point | To Point Correspondences: General Principles |
| Shape And 3-D Motion From Contour Without | point | To Point Correspondences: General Principles |
| Shape Of An Arbitrary Finite | point | Set In Ir2 |
| Shape Recognition Scheme Based On Relative Distances Of Feature | point | s From The Centroid, A |
| Shape Reconstruction From An Endoscopic Image By Shape From Shading Technique From A | point | Light Source At The Projection Center |
| Similarity And Affine Distance Between 2d | point | Sets |
| Similarity And Affine Invariant Distances Between 2d | point | Sets |
| Simple | point | s, Topological Numbers And Geodesic Neighborhoods In Cubic Grids |
| Simultaneous Fitting Of Several Planes To | point | Sets Using Neural Networks |
| Simultaneous Rotation And Translation Fitting Of Two 3-D | point | Sets |
| Smooth Surface Reconstruction From Scattered Data | point | s |
| Solution For The Registration Of Multiple 3d | point | Sets Using Unit Quaternions, A |
| Some General Grouping Principles: Line Perception From | point | s As An Example |
| Spatial | point | Processes And Clustering Tendency In Exploratory Data Analysis |
| Stabilising The Camera-To-Fixation- | point | Distance In Active Vision |
| Stability Of Corner | point | s In Scale Space: The Effects Of Small Nonrigid Deformations |
| Statistical Analysis Of Focal-Length Calibration Using Vanishing | point | s |
| Statistical Properties, Fixed | point | s, And Decomposition With Wmmr Filters |
| Steering A Robot With Vanishing | point | s |
| Steiner Minimal Trees On Sets Of Four | point | s |
| Structure And Motion From | point | s, Lines And Conics With Affine Cameras |
| Superficial And Deep Structure In Linear Diffusion Scale Space: Isophotes, Critical | point | s And Separations |
| Surface Approximation Of A Cloud Of 3d | point | s |
| Surface Reconstruction From Unorganized | point | s |
| Theorem To Determine The Spatial Containment Of A | point | In A Planar Polyhedron, A |
| Thinning Of 3-D Images Using The Safe | point | Thinning Algorithm (Spta) |
| Three Dimensional Object Recognition Using Oriented Model | point | s |
| Tight Package Wrapping For Planar | point | Sets, A |
| Toward Structure From Motion For Linear Features Through Reference | point | s |
| Towards A Hierarchical Contour Description Via Dominant | point | Detection |
| Tracking 3d Coplanar | point | s In The Invariant Perspective Coordinates Plane |
| Tracking A Dynamic Set Of Feature | point | s |
| Tracking And Detection Of Moving | point | Targets In Noise Image Sequences By Local Maximum Likelihood |
| Tracking Feature | point | s In Time-Varying Images Using An Opportunistic Selection Approach |
| Tracking Feature | point | s: A New Algorithm |
| Tracking | point | s And Line Segments In Image Sequences |
| Triangles With Vertices On Lattice | point | s |
| Triangulating | point | Sets In Space |
| Triangulating Simplicial | point | Sets In Space |
| Turning | point | Preserving Planar Interpolation |
| Two-Dimensional Critical | point | Configuration Graphs |
| Two-Dimensional Object Recognition By Matching Local Properties Of Contour | point | s |
| Unconstrained Automatic Image Matching Using Multiresolutional Critical- | point | Filters |
| Unified Factorization Algorithm For | point | s, Line Segments And Planes With Uncertainty Models, A |
| Unique Solution Of Projective Invariants Of Six | point | s From Four Uncalibrated Images, The |
| Uniquely Representing | point | Patterns With Minimal Information |
| Uniqueness Of Solutions To Structure And Motion From Combinations Of | point | And Line Correspondences |
| Uniqueness Of Solutions To Three Perspective Views Of Four | point | s |
| Use Of Maximum Curvature | point | s For The Recognition Of Partially Occluded Objects, The |
| Use Your Hand As A 3d Mouse, Or, Relative Orientation From Extended Sequences Of Sparse | point | And Line Correspondences Using The Affine Trifocal Tensor |
| Using Collinear | point | s To Compute Egomotion And Detect Nonrigidity |
| Using Motion From Orthographic Projections To Prove 3-D | point | Matches |
| Using Motion From Orthographic Views To Verify 3-D | point | Matches |
| Using Neural Networks To Detect Dominant | point | s In Chain-Coded Contours |
| Using Simple Decomposition For Smoothing And Feature | point | Detection Of Noisy Digital Curves |
| Using Vanishing | point | s For Camera Calibration |
| Validation Of 3-D Registration Methods Based On | point | s And Frames |
| Vanishing | point | Calculation As A Statistical Inference On The Unit Sphere |
| Vanishing | point | Detection |
| Vanishing | point | Detection By A Voting Scheme |
| Vanishing | point | Detection By Line Clustering |
| Vanishing | point | Matching |
| Vehicle-Type Motion Estimation By The Fusion Of Image | point | And Line Features |
| View Variation Of | point | Set And Line Segment Features |
| View Variation Of | point | -Set And Line-Segment Features |
| Visibility With A Moving | point | Of View |
| Visual Motion Estimation From | point | Features: Unified View |
| Voronoi Tessellation Of | point | s With Integer Coordinates: Time-Efficient Implementation And Online Edge-List Generation |
| What'S In A Set Of | point | s |
487 for point
| _ | polygon | _ |
| Algebra Of | polygon | s Through The Notion Of Negative Shapes, An |
| Algorithm For Computing The Union, Intersection Or Difference Of Two | polygon | s, An |
| Algorithm For Covering | polygon | s With Rectangles, An |
| Algorithm For Determining An Opaque Minimal Forest Of A Convex | polygon | , An |
| Algorithm To Determine The Directional Relationship Between Arbitrarily-Shaped | polygon | s In The Plane, An |
| Algorithm To Find | polygon | Similarity, An |
| Algorithms For Minimum Length Partitions Of | polygon | s |
| Algorithms For Parallel | polygon | Rendering, Springer |
| All-Geodesic-Furthest Neighbors Problem For Simple | polygon | s, The |
| Bounds For Partitioning Rectilinear | polygon | s |
| Clipping To The Boundary Of A Circular-Arc | polygon | |
| Collison Detection Of A Moving | polygon | In The Presence Of Polygonal Obstacles In The Plane |
| Compliant Motion In A Simple | polygon | |
| Computational Complexity Of Restricted | polygon | Decompositions |
| Computing A Convex Skull Of An Orthogonal | polygon | |
| Computing Deviations From Convexity In | polygon | s |
| Computing | polygon | Fill-Lines |
| Computing Some Distance Functions Between | polygon | s |
| Computing The Convex Hull Of A Simple | polygon | |
| Computing The Extreme Distances Between Two Convex | polygon | s |
| Computing The Link Center Of A Simple | polygon | |
| Computing The Link Center Of A Simple | polygon | |
| Computing The Relative Neighbour Decomposition Of A Simple | polygon | |
| Computing The Visibility | polygon | From An Edge |
| Connected Components Labelling Using Murray | polygon | s |
| Consistency In Point-In- | polygon | Tests |
| Contour Codes Of Isothetic | polygon | s |
| Contour Problem For Rectlinear | polygon | s, The |
| Convex Decomposition Of Simple | polygon | s |
| Convex Hull Algorithm For Planar Simple | polygon | s, A |
| Convex | polygon | Is Determined By Its Hough Transform, A |
| Corrections To Lee'S Visibility | polygon | Algorithm |
| Covering A Simple Orthogonal | polygon | With A Minimum Number Of Orthogonally Convex Polygons |
| Covering A Simple Orthogonal | polygon | With A Minimum Number Of Orthogonally Convex Polygons |
| Covering Orthogonal | polygon | s With Star Polygons: The Perfect Graph Approach |
| Covering Orthogonal | polygon | s With Star Polygons: The Perfect Graph Approach |
| Covering The Plane With Convex | polygon | s |
| Decomposing A | polygon | Into Simpler Components |
| Determination Of Feature Correspondences In Stereo Images Using A Calibration | polygon | |
| Determination Of Optimal | polygon | From Digital Curve Using L18 Norm |
| Determining The Shape Of A Convex N-Sided | polygon | By Using 2n+K Tactile Probes |
| Display Of Visible Edges Of A Set Of Convex | polygon | s |
| Drawing | polygon | s Given Angle Sequences |
| Efficient Algorithm For Finding The Csg Representation Of A Simple | polygon | , An |
| Efficient Algorithm For Finding The Csg Representation Of A Simple | polygon | , An |
| Efficient Algorithm For | polygon | Overlay For Dense Map Image Data Sets |
| Efficient Algorithms For Scan-Converting 3d | polygon | s |
| Efficient Algorithms For Shortest Distance Queries On Special Classes Of | polygon | s |
| Efficient Computation Of A Reflection Symmetry Measure For Convex | polygon | s Based On Minkowski Addition |
| Efficient | polygon | -Filling Algorithms For Raster Displays |
| Equilateral | polygon | Approximation Of Closed Contours |
| Evolutions Of Planar | polygon | s |
| Fast Computation Of The Modality Of | polygon | s |
| Fast Heuristics For Minimum Length Rectangular Partitions Of | polygon | s |
| Fast Las Vegas Algorithm For Triangulating A Simple | polygon | , A |
| Fast Triangulation Of The Plane With Respect To Simple | polygon | s |
| Finding A Closest Visible Vertex Pair Between Two | polygon | s |
| Finding Extremal | polygon | s |
| Finding Minimal Convex Nested | polygon | s |
| Finding The Convex Hull Of A Simple | polygon | |
| Finding The Convex Hull Of A Simple | polygon | In Linear Time |
| Finding The Minimum Visible Vertex Distance Between Two Nonintersecting Simple | polygon | s |
| Finding The Smallest Triangles Containing A Given Convex | polygon | |
| Finding The Smallest Triangles Containing A Given Convex | polygon | |
| Finding The Visibility Graph Of A Simple | polygon | In Time Proportional To Its Size |
| General Approach To Moment Calculation For | polygon | s And Line Segments, A |
| Generating A Smooth Voxel-Based Model From An Irregular | polygon | Mesh |
| Generation Of Convex | polygon | s With Individual Angular Constraints |
| Geometric Reasoning For Extraction Of Manufacturing Features In Iso-Oriented | polygon | s |
| Guard Placement In Rectilinear | polygon | s |
| Hardware-Assisted | polygon | Antialiasing |
| Hierarchical Representation Of 2-D Shapes Using Convex | polygon | s: A Morphological Approach |
| Human Perception Of Affine Equivalent | polygon | s |
| Hybrid Ray Tracer For Rendering | polygon | And Volume Data, A |
| Isothetic | polygon | Representation For Contours |
| Jordan Sorting Via Convex Hulls Of Certain Non-Simple | polygon | s |
| Linear Algorithm For Computing The Visibility | polygon | From A Point, A |
| Linear Quadtrees From Vector Representations Of | polygon | s |
| Linear Time Algorithm For Computing The Convex Hull Of An Ordered Crossing | polygon | , A |
| Linear Time Algorithm For Computing The Visibility | polygon | From An Edge, A |
| Linear Time Algorithm For Minimum Link Paths Inside A Simple | polygon | , A |
| Linear Time Algorithm For Triangulating A Point-Visible | polygon | , A |
| Linear Time Algorithms For Visibility And Shortest Path Problems Inside Simple | polygon | s |
| Linear-Time Algorithm For Solving The Strong Hidden-Line Problem In A Simple | polygon | , A |
| Linear-Time Algorithm For Triangulating Simple | polygon | s, A |
| Linear-Time Algorithms For Visibility And Shortest Path Problems Inside Triangulated Simple | polygon | s |
| Matching | polygon | Fragments |
| Method For Representing Shape Based On An Equivalence Relation On | polygon | s, A |
| Method For Working Out The Moments Of A | polygon | , A |
| Minimally Covering A Horizontally Convex Orthogonal | polygon | |
| Minimising The Search Space For | polygon | Detection Using The Generalised Hough Transform |
| Minimizing Turns For Discrete Movement In The Interior Of A | polygon | |
| Minimum Area Circumscribing | polygon | s |
| Minimum Dissection Of A Rectangular | polygon | With Arbitrary Holes Into Rectangles |
| Minimum Vertex Distance Between Separable Convex | polygon | s |
| Minkowski Decomposition Of Convex | polygon | s Into Their Asymmetric And Symmetric Parts |
| Mnemonic For Areas Of | polygon | s, A |
| Morphological Decomposition Of 2-D Binary Shapes Into Conditionally Maximal Convex | polygon | s |
| Morphological Decomposition Of 2-D Binary Shapes Into Conditionally Maximal Convex | polygon | s |
| Moving A | polygon | Around The Corner In A Corridor |
| Multiscale Contour Segmentation And Approximation: An Algorithm Based On The Geometry Of Regular Inscribed | polygon | s |
| Near-Quadratic Algorithm For Planning The Motion Of A | polygon | In A Polygonal Environment, A |
| New Linear Algorithm For Triangulating Monotone | polygon | s, A |
| New Linear Convex Hull Algorithm For Simple | polygon | s, A |
| New O(Nlogn) Algorithm For Computing The Intersection Of Convex | polygon | s, A |
| Nonobtuse Triangulation Of | polygon | s |
| Note On Multi- | polygon | Area Filling, A |
| Note On The Paper ``The Visual Potential: One Convex | polygon | '', A |
| O(N) Algorithm To Find A Near-Optimum Partition Of A Convex | polygon | , An |
| O(Nloglogn)-Time Algorithm For Triangulating A Simple | polygon | , An |
| On Approximation Behavior Of The Greedy Triangulation For Convex | polygon | s |
| On Decomposing | polygon | s Into Uniformly Monotone Parts |
| On Detecting The Orientation Of | polygon | s And Polyhedra |
| On Partitioning | polygon | s |
| On Projective Invariant Smoothing And Evolutions Of Planar Curves And | polygon | s |
| On Recognizing Unions Of Two Convex | polygon | s And Related Problems |
| On Some Union And Intersection Problems For | polygon | s With Fixed Orientations |
| On The Area Of Overlap Of Translated | polygon | s |
| On The Form Factor Between Two | polygon | s |
| On The Geodesic Voronoi Diagram Of Point Sites In A Simple | polygon | |
| On The Hough Transform Of A | polygon | |
| On The Intersection Of Two Planar | polygon | s |
| On The Time Complexity For Circumscribing A Convex | polygon | |
| On The Uniqueness Of The Representation Of A Convex | polygon | By Its Hough Transform |
| On The X-Y Convex Hull Of A Set Of X-Y | polygon | s |
| Optimal Algorithm For Computing The Minimum Vertex Distance Between Two Crossing Convex | polygon | s, An |
| Optimal Algorithm For Computing The Minimum Vertex Distance Between Two Crossing Convex | polygon | s, An |
| Optimal Algorithm For Finding All Visible Edges In A Simple | polygon | , An |
| Optimal Algorithm For Finding The Edge Visibility | polygon | Under Limited Visibility, An |
| Optimal Algorithms For The Intersection And The Minimum Distance Problems Between Planar | polygon | s |
| Optimal Matching Of Convex | polygon | s |
| Optimal Matching Of General | polygon | s Based On The Minimum Zone Error |
| Optimal Matching Of Nonconvex | polygon | s |
| Optimal Parallel Algorithms For | polygon | And Point-Set Problems |
| Optimal Parallel Hypercube Algorithms For | polygon | Problems |
| Optimal Shortest Path Queries In A Simple | polygon | |
| Optimization Algorithm For Shape Analysis Of Regular | polygon | s, An |
| Optimization Models For Shape Matching Of Nonconvex | polygon | s |
| Optimum Grip Of A | polygon | |
| Orientational Approximation Of Convex | polygon | s With Rectangles |
| Parallel Algorithm For Computing | polygon | Set Operations, A |
| Parallel Algorithm For | polygon | Rasterization, A |
| Parallel Algorithm For The Visibility Of A Simple | polygon | Using Scan Operators, A |
| Parallel Algorithms For Shortest Path Problems In | polygon | s |
| Parallel Algorithms For Some Functions Of Two Convex | polygon | s |
| Parallel | polygon | Scan Conversion Algorithms: Performance Evaluation On A Shared Bus Architecture |
| Parallel Triangulation Of A | polygon | In Two Calls To The Trapezoidal Map |
| Partitioning And Separating Sets Of Orthogonal | polygon | s |
| Perpendicular | polygon | s |
| Placing The Largest Similar Copy Of A Convex | polygon | Among Polygonal Obstacles |
| Pmac: A | polygon | Matching Chip |
| Point Retrieval For | polygon | s |
| polygon | Containment Under Translation |
| polygon | Properties Calculated From The Vertex Neighborhoods |
| polygon | Rendering On A Dual-Paradigm Parallel Processor |
| polygon | Triangulation In O(N Log Log N) Time With Simple Data Structures |
| polygon | Triangulation: Efficiency And Minimality |
| polygon | -Based Post-Process Motion Blur |
| polygon | s In Three Dimensions |
| Polynomial Solution For Potato-Peeling And Other | polygon | Inclusion And Enclosure Problems, A |
| Probing Convex | polygon | s With X-Rays |
| Randomized | polygon | Search For Planar Motion Detection |
| Raster To | polygon | Conversion Of Images |
| Reachable Grasps On A | polygon | : The Convex Rope Algorithm |
| Recognizing | polygon | s, Or How To Spy |
| Recognizing S-Star | polygon | s |
| Reconstructing A Convex | polygon | From Binary Perspective Projections |
| Reconstruction Of | polygon | s From Projections |
| Reduced Parameter Spaces For | polygon | Detection Using The Generalized Hough Transform |
| Searching For Empty Convex | polygon | s |
| Separability Of Unimodal | polygon | s |
| Separating Two Simple | polygon | s By A Sequence Of Translations |
| Shape Matching Using | polygon | Approximation And Dynamic Alignment |
| Shortest Path Between Two Simple | polygon | s |
| Shortest Path Solves Edge-To-Edge Visibility In A | polygon | |
| Simple Linear Hidden-Line Algorithm For Star-Shaped | polygon | s, A |
| Simple On-Line Algorithms For Convex | polygon | s |
| Simultaneous Containment Of Several | polygon | s |
| Single Linear Algorithm For Intersecting Convex | polygon | s, A |
| Solution Of | polygon | Containment, Spatial Planning, And Other Related Problems Using Minkowski Operations, A |
| Storing A Collection Of | polygon | s Using Quadtrees |
| Strongly Normal Sets Of Convex | polygon | s Or Polyhedra |
| Systolic Algorithms For Computing The Visibility | polygon | And Triangulation Of A Polygonal Region |
| Tactile Recognition By Probing: Identifying A | polygon | On A Plane |
| Task Driven Perceptual Organization For Extraction Of Rooftop | polygon | s |
| Texture Segmentation Using Voronoi | polygon | s |
| Texture Segmentation Using Voronoi | polygon | s |
| Time- And Space-Optimal Algorithm For Boolean Mask Operations For Orthogonal | polygon | s, A |
| Translation Separability Of Sets Of | polygon | s |
| Triangulating Simple | polygon | s And Equivalent Problems |
| Turtlegons: Generating Simple | polygon | s From Sequences Of Angles |
| Unifying Approach For A Class Of Problems In The Computational Geometry Of | polygon | s, A |
| Using | polygon | s To Recognize And Locate Partially Occluded Objects |
| Vertex-Based Features For Recognition Of Projectively Deformed | polygon | s |
| Vertex-Edge Visibility Graph Of A | polygon | , The |
| Visibility Between Two Edges Of A Simple | polygon | |
| Visibility Of Disjoint | polygon | s |
| Visibility- | polygon | Search And Euclidean Shortest Paths |
| Visual Potential: One Convex | polygon | , The |
| Voronoi Diagrams Of | polygon | s: A Framework For Shape Representation |
| Voronoi Diagrams Of | polygon | s: A Framework For Shape Representation |
| Worst-Case Optimal Algorithms For Constructing Visibility | polygon | s With Holes |
| X-Rays Of | polygon | s |
| Zippered | polygon | Meshes From Range Images |
204 for polygon
| _ | polygonal | _ |
| Algorithm For Detection Of Dominant Points And | polygonal | Approximation Of Digitzed Curves, An |
| Algorithm For | polygonal | Approximation Based On Iterative Point Elimination, An |
| Algorithm For | polygonal | Approximation Of A Digital Object, An |
| Algorithm For | polygonal | Approximation Of Digitized Curves, An |
| Algorithms For Recognizing Planar | polygonal | Configurations Using Perspective Images |
| Application Of The C-Varieties Clustering Algorithm To | polygonal | Curve Fitting, An |
| Approximating | polygonal | Curves In Two And Three Dimensions |
| Automatic Mesh Generation Using The Symmetric Axis Transformation Of | polygonal | Domains |
| Automatic Motion Planning System For A Convex | polygonal | Mobile Robot In 2-D Polygonal Space, An |
| Automatic Motion Planning System For A Convex | polygonal | Mobile Robot In 2-D Polygonal Space, An |
| Beam Tracing | polygonal | Objects |
| Binary Image Segmentation Of Aggregates Based On | polygonal | Approximation And Classification Of Concavities |
| Characterizing The Hierarchical Hough Transform Through A | polygonal | Approximation Algorithm |
| Clamping Of | polygonal | Objects |
| Collison Detection Of A Moving Polygon In The Presence Of | polygonal | Obstacles In The Plane |
| Computation Of The Tangent Graph Of | polygonal | Obstacles By Moving-Line Processing |
| Computational-Geometric Methods For | polygonal | Approximations Of A Curve |
| Computing Multi-Colored | polygonal | Masks In Pipeline Architectures And Its Application To Automated Visual Inspection |
| Construction Of A | polygonal | Model Using The Fisher-Ratio Criterion |
| Control Of | polygonal | Mesh Resolution For 3-D Computer Vision |
| Curve Fitting Based On | polygonal | Approximation |
| Decomposing | polygonal | Regions Into Convex Quadrilaterals |
| Decomposition Of Convex | polygonal | Morphological Structuring Elements Into Neighborhood Subsets |
| Detecting The Dominant Points By The Curvature-Based | polygonal | Approximation |
| Detection Of Significant Points And | polygonal | Approximation Of Digitized Curves |
| Dynamic C-Oriented | polygonal | Intersection Searching |
| Efficient Algorithm For Euclidean Shortest Paths Among | polygonal | Obstacles In The Plane, An |
| Efficient Algorithm For Planning Collision-Free Translational Motion Of A Convex | polygonal | Object In 2-Dimensional Space Amidst Polygonal Obstacles, An |
| Efficient Algorithm For Planning Collision-Free Translational Motion Of A Convex | polygonal | Object In 2-Dimensional Space Amidst Polygonal Obstacles, An |
| Efficient Algorithms For Euclidean Shortest Path And Visibility Problems With | polygonal | Obstacles |
| Efficient And Simple Motion Planning Algorithm For A Ladder Amidst | polygonal | Barriers, An |
| Efficient And Simple Motion Planning Algorithm For A Ladder Moving In Two-Dimensional Space Amidst | polygonal | Barriers, An |
| Efficient Motion-Planning Algorithm For A Convex | polygonal | Object In Two-Dimensional Polygonal Space, An |
| Efficient Motion-Planning Algorithm For A Convex | polygonal | Object In Two-Dimensional Polygonal Space, An |
| Efficient | polygonal | Decomposition Of Segmented Images |
| Efficiently Computable Metric For Comparing | polygonal | Shapes, An |
| Exploration Of | polygonal | Environments Using Range Data |
| Fast | polygonal | Approximation Method For Real-Time Shape Recognition, A |
| Fast Sequential Method For | polygonal | Approximation Of Digitized Curves, A |
| Finding The Shortest Path Of A Disc Among | polygonal | Obstacles Using A Radius-Independent Graph |
| Fitting | polygonal | Functions To A Set Of Points In The Plane |
| Integer Analysis Of Two-Dimensional | polygonal | Objects |
| L<1> Shortest Paths Among | polygonal | Obstacles In The Plane |
| Lavakusha, A.K. Pujari, And P.G. Reddy, | polygonal | Representation By Edge K-D Trees, Prl 11 |
| Legendre Descriptors For Classification Of | polygonal | Closed Curves |
| Linear Algorithm For Eliminating Hidden Lines From A | polygonal | Cylinder, A |
| Matching And Fusing 3d- | polygonal | Approximations For Model-Generation |
| Matching General | polygonal | Arcs |
| Matching Of 3d | polygonal | Arcs |
| Matching | polygonal | Arcs By Using A Subgroup Of The Unit Quaternions |
| Matching Sets Of 3d Line Segments With Application To | polygonal | Arc Matching |
| Minimal | polygonal | Separation |
| Minimum Decompositions Of | polygonal | Objects |
| Model-Based Recognition And Location Of Local Patterns In | polygonal | Contours Via Hypothesis Accumulation |
| Multi-Processor System For | polygonal | Object Recognition By Means Of Fuzzy Algorithms |
| Near-Quadratic Algorithm For Planning The Motion Of A Polygon In A | polygonal | Environment, A |
| New Approach To | polygonal | Approximation, A |
| New Efficient Motion-Planning Algorithm For A Rod In | polygonal | Space, A |
| New Efficient Motion-Planning Algorithm For A Rod In Two-Dimensional | polygonal | Space, A |
| New Method For Computing | polygonal | Masks In Image Processing Pipeline Architectures, A |
| New Method For | polygonal | Approximation Using Genetic Algorithms, A |
| New | polygonal | Approximation Schemes For Object Shape Representation |
| New Split-And-Merge Technique For | polygonal | Approximation Of Chain Coded Curves, A |
| Non-Parametric Sequential Method For | polygonal | Approximation Of Digital Curves, A |
| Note On The Conversion Of | polygonal | To Cellular Maps, A |
| O(N) Algorithm For | polygonal | Approximation, An |
| On Applications Of Multi-Colored | polygonal | Masks And Their Computation In Image Processing Pipeline Architectures |
| On Approximating | polygonal | Curves In Two And Three Dimensions |
| On Automatic Threshold Selection For | polygonal | Approximations Of Digital Curves |
| On Computing Three-Finger Force-Closure Grasps Of | polygonal | Objects |
| On Fast Planning Of Suboptimal Paths Amidst | polygonal | Obstacles In The Plane |
| On | polygonal | Chain Approximation |
| On The Number Of Critical Free Contacts Of A Convex | polygonal | Object Moving In Two-Dimensional Polygonal Space |
| On The Number Of Critical Free Contacts Of A Convex | polygonal | Object Moving In Two-Dimensional Polygonal Space |
| On The Union Of Jordan Regions And Collision-Free Translational Motion Amidst | polygonal | Obstacles |
| On The ``Piano Movers'' Problem .1. The Case Of A Two-Dimensional Rigid | polygonal | Body Moving Amidst Polygonal Barriers |
| On The ``Piano Movers'' Problem .1. The Case Of A Two-Dimensional Rigid | polygonal | Body Moving Amidst Polygonal Barriers |
| Optimal | polygonal | Approximation Of Digital Curves |
| Optimal | polygonal | Approximation Of Digital Curves |
| Optimal | polygonal | Approximation Of Digital Curves |
| Optimal | polygonal | Boundary Encoding Scheme In The Rate Distortion Sense, An |
| Optimum | polygonal | Approximation Of Digitized Curves |
| Parallel Orientation Of | polygonal | Parts |
| Partitioning A | polygonal | Region Into Trapezoids |
| Path Planning Using A Tangent Graph For Mobile Robots Among | polygonal | And Curved Abstacles |
| Piecewise-Linear Interpolation Between | polygonal | Slices |
| Placing The Largest Similar Copy Of A Convex Polygon Among | polygonal | Obstacles |
| Planar Three-Line Junction Perspective Problem With Application To The Recognition Of | polygonal | Patterns, The |
| polygonal | Approach To Hidden-Line And Hidden-Surface Elimination, A |
| polygonal | Approximation By Boundary Reduction |
| polygonal | Approximation Of 2-D Shapes Through Boundary Merging |
| polygonal | Approximation Of Digital Curves Based On The Principles Of Perceptual Organization |
| polygonal | Approximation Using A Competitive Hopfield Neural Network |
| polygonal | Approximations Of A Curve-Formulations And Algorithms |
| polygonal | Entropy: A Convexity Measure |
| polygonal | Mesh And Quad-Tree Display Algorithms For Nonconvex Crystal Structures |
| polygonal | Object Recognition |
| polygonal | Representation: A Maximum Likelihood Approach |
| polygonal | Ribbons In Two And Three Dimensions |
| polygonal | Rooms Not Illuminable From Every Point |
| polygonal | Shape Recognition Using String-Matching Techniques |
| Re-Tiling | polygonal | Surfaces |
| Reconstructing Line Drawings From Wings: The | polygonal | Case |
| Rectilinear Shortest Paths Through | polygonal | Obstacles In O(Nlog2n) Time |
| Regularized | polygonal | Approximation For Analysis And Interpretation Of Planar Contour Figures |
| Reliable | polygonal | Approximations Of Imaged Real Objects Through Dominant Point Detection |
| Robot Navigation In Unknown Generalized | polygonal | Terrain Using Vision Sensors |
| Robot Navigation In Unknown Terrains Of Convex | polygonal | Obstacles, Using Learned Visibility Graphs |
| Searching For A Mobile Intruder In A | polygonal | Region |
| Sect: An Effective Coding Technique For | polygonal | Geographic Data |
| Shape From Diameter: Recognizing | polygonal | Parts With A Parallel-Jaw Gripper |
| Shape Recognition With A Neural Classifier Based On A Fast | polygonal | Approximation Technique |
| Shortest Paths In The Plane With Convex | polygonal | Obstacles |
| Shortest Paths In The Plane With | polygonal | Obstacles |
| Shortest | polygonal | Paths In Space |
| Simple Algorithm For Detection Of Significant Vertices For | polygonal | Approximation Of Chain-Coded Curves, A |
| Simplification Of Objects Rendered By | polygonal | Approximations |
| Smooth Appearance For | polygonal | Surface |
| Surface Modeling Method By | polygonal | Primitives For Visualizing Three-Dimensional Volume Data |
| Surface Segmentation And Modeling Of 3-D | polygonal | Objects From Stereoscopic Image Pairs |
| Systolic Algorithms For Computing The Visibility Polygon And Triangulation Of A | polygonal | Region |
| Techniques For Assessing | polygonal | Approximations Of Curves |
| Two-Dimensional Robot Navigation Among Unknown Stationary | polygonal | Obstacles |
| Viewpoint Independent Representation And Recognition Of | polygonal | Faces In 3-D |
| Visible Surface Calculation For Complex Unstructured | polygonal | Scenes |
125 for polygonal
| _ | pose | _ |
| 2d Into 3d Hough Space Mapping For Planar Object | pose | Estimation |
| 2d-3d | pose | Estimation |
| 3-D Model Alignment Without Computing | pose | |
| 3-D Object | pose | Estimation Based On Iterative Image Matching: Shading And Edge Data Fusion |
| 3-D Object | pose | Estimation By Shading And Edge Data Fusion--Simulating Virtual Manipulation On Mental Images |
| 3-D | pose | Estimation By An Improved Kohonen-Net |
| 3-D | pose | From 3 Points Using Weak Perspective |
| 3d Head | pose | Computation From 2d Images: Templates Versus Features |
| 3d Object | pose | From Clustering With Multiple Views |
| 3d | pose | Estimation And Shape Coding Of Moving Objects Based On Statistical Morphological Skeleton |
| 3d | pose | Estimation By Directly Matching Polyhedral Models To Gray Value Gradients |
| 3d | pose | Estimation By Fitting Image Gradients Directly To Polyhedral Models |
| 3d | pose | Estimation From An $N$-Degree Planar Curved Feature In Two Perspective Views |
| 3d- | pose | Estimation From A Quadratic-Curved Feature In Two Perspective Views |
| Abstraction-Based Approach To 3-D | pose | Determination From Range Images, An |
| Acquisition Of A Large | pose | -Mosaic Dataset |
| Active Face Tracking And | pose | Estimation In An Interactive Room |
| Analysis And Solutions Of The Three Point Perspective | pose | Estimation Problem |
| Analytic Solution For The | pose | Determination Of Human Faces From A Monocular Image, An |
| Application Of | pose | Determination Techniques To Model Extension And Refinement |
| Approach To 3d | pose | Determination, An |
| Assessing Feature Importance For Verification And | pose | Refinement |
| Automatic Model Construction And | pose | Estimation From Photographs Using Triangular Splines |
| Automatic Model Construction, | pose | Estimation, And Object Recognition From Photographs Using Triangular Splines |
| Calibrated Imagery For Quantitative Evaluation Of Iu Classification, | pose | -Estimation, And Stereo Algorithms |
| Calibration Of A Hand/Eye Matrix And A Connection Matrix Using Relative | pose | Measurements |
| Chromaticity Space For Specularity-, Illumination Color-And Illumination | pose | -Invariant 3-D Object Recognition, A |
| Closed-Form Algorithms For Object | pose | And Scale Recovery In Constrained Scenes |
| Comparative Study Of The Robustness Of Two | pose | Estimation Techniques, A |
| Complex Egi: A New Representation For 3-D | pose | Determination, The |
| Conics-Based Stereo, Motion Estimation, And | pose | Determination |
| Constrained | pose | Refinement Of Parametric Objects |
| Curvature Based Descriptor Invariant To | pose | And Albedo Derived From Photometric Data, A |
| Dense Surface Patches From Thousands Of | pose | Images |
| Detection And | pose | Estimation Of Human Face With Synthesized Image Models |
| Determination Of Face Position And | pose | With A Learned Representation Based On Labelled Graphs |
| Determining 3-D Object | pose | Using The Complex Extended Gaussian Image |
| Determining | pose | Of 3d Objects With Curved Surfaces |
| Determining The 3-D | pose | Of A Flexible Object By Stereo Matching Of Curvature Representations |
| Efficient Iterative | pose | Estimation Algorithm, An |
| Efficient | pose | Clustering Using A Randomized Algorithm |
| Eigen Space Approach For A | pose | Detection With Range Images |
| Eigenfeatures For Planar | pose | Measurement Of Partially Occluded Objects |
| Estimating Face- | pose | Consistency Based On Synthetic View Space |
| Estimating | pose | Of Human Face Based On Symmetry Plane Using Range And Intensity Images |
| Estimating | pose | Uncertainty For Surface Registration |
| Estimation Of | pose | And Illuminant Direction For Face Processing |
| Face | pose | Discrimination Using Support Vector Machines (Svm) |
| Face Recognition Under Varying | pose | |
| Face Recognition Under Varying | pose | |
| Finding The | pose | Of An Object Of Revolution |
| Full-Projective Improvement For Lowe'S | pose | -Estimation Algorithm, A |
| Fully Projective Formulation To Improve The Accuracy Of Lowe'S | pose | -Estimation Algorithm, A |
| Invariant Descriptors For 3-D Object Recognition And | pose | |
| Invariant Representation, Matching And | pose | Estimation Of 3d Space Curves Under Similarity Transformations |
| Invariants And | pose | Determination |
| Iterative | pose | Estimation Using Coplanar Feature Points |
| Iterative | pose | Estimation Using Coplanar Points |
| Iterative Solution For Object | pose | Parameters Using Image Moments, An |
| J. 3D SHAPE (J.1) Models: [1403-1452] (J. |
| J.2. Views; | pose | |
| K.4. Acquisition, | pose | Estimation, etc. |
| Linear N Lambda 4-Point | pose | Determination |
| Matching And | pose | Refinement With Camera Pose Estimates |
| Matching And | pose | Refinement With Camera Pose Estimates |
| Method For Tracking The | pose | Of Known 3-D Objects Based On An Active Contour Model, A |
| Model Based | pose | Estimation Of Articulated And Constrained Objects |
| Model-Based Object | pose | In 25 Lines Of Code |
| Model-Based Object | pose | In 25 Lines Of Code |
| Model-Based Object | pose | In 25 Lines Of Code |
| Model-Based | pose | Estimation Using Genetic Algorithm |
| Modelled Object | pose | Estimation And Tracking By A Multi-Cameras System |
| Monocular | pose | Determination From Lines: Critical Sets And Maximum Number Of Solutions |
| Monocular | pose | Of A Rigid Body Using Point Landmarks |
| New Algorithms For 2d And 3d Point Matching: | pose | Estimation And Correspondence |
| New Complex Basis For Implicit Polynomial Curves And Its Simple Exploitation For | pose | Estimation And Invariant Recognition, A |
| New Efficient And Direct Solution For | pose | Estimation Using Quadrangular Targets: Algorithms And Evaluation, A |
| Nonlinear Least Squares Optimisation Of Unit Quaternion Functions For | pose | Estimation From Corresponding Features |
| Novel Atr Classifier Exploiting | pose | Information, A |
| Object Location By Parallel | pose | Clustering |
| Object | pose | Estimation In Underwater Acoustic Images |
| Object | pose | From 2-D To 3-D Point And Line Correspondences |
| Object | pose | : Links Between Paraperspective And Perspective |
| Object | pose | : The Link Between Weak Perspective, Paraperspective, And Full Perspective |
| Object Recognition And Localization Via | pose | Clustering |
| Object Recognition And | pose | Estimation With A Fast And Versatile 3d Robot Sensor |
| On Using Cad Models To Compute The | pose | Of Curved 3d Objects |
| On Using Cad Models To Compute The | pose | Of Curved 3d Objects |
| Optical Linear Feature Detection Based On Model | pose | |
| Optimal Estimation Of Object | pose | From A Single Perspective View |
| Parallel Calculation Of 3-D | pose | Of A Known Object In A Single View |
| Physics-Based Object | pose | And Shape Estimation From Multiple Views |
| Planning Sequences Of Views For 3-D Object Recognition And | pose | Determination |
| pose | Clustering On Constraints For Object Recognition |
| pose | Determination And Recognition Of Vehicles In Traffic Scenes |
| pose | Determination From Line-To-Plane Correspondences: Existence Condition And Closed-Form Solutions |
| pose | Determination From Line-To-Plane Correspondences: Existence Condition And Closed-Form Solutions |
| pose | Determination Of A Cylinder Using Reprojection Transformation |
| pose | Determination Of A Three-Dimensional Object Using Triangle Pairs |
| pose | Determination Of Parameterized Object Models From A Monocular Image |
| pose | Estimation And Recognition Of Ground Vehicles In Aerial Reconnaissance Imagery |
| pose | Estimation By Fusing Noisy Data Of Different Dimensions |
| pose | Estimation For Sar Automatic Target Recognition |
| pose | Estimation From Corresponding Point Data |
| pose | Estimation From Corresponding Point Data |
| pose | Estimation Of Human Face Using Synthesized Model Images |
| pose | Estimation Of Jointed Structures |
| pose | Estimation Of Multi-Part Curved Objects |
| pose | Estimation Of Multi-Part Curved Objects |
| pose | Refinement Of Active Models Using Forces In 3d |
| pose | Refinement Using A Parameter Hierarchy |
| pose | Refinement: Application To Model Extension And Sensitivity To Camera Parameters |
| pose | Verification As An Optimal Assignment Problem |
| pose | View Stability Analysis For Camera Look Angle(S) Computation |
| Posterior Marginal | pose | Estimation |
| Preprocessing Of Face Images: Detection Of Features And | pose | Normalization |
| Projective | pose | Estimation Of Linear And Quadratic Primitives In Monocular Computer Vision |
| Qualitative Approach To Quantitative Recovery Of Shgc'S Shape And | pose | From Shading And Contour, A |
| Real-Time Face | pose | Estimation |
| Recognition And | pose | Estimation Of Unoccluded Three-Dimensional Objects From A Two-Dimensional Perspective View By Banks Of Neural Networks |
| Recognition Strategy Generation For | pose | Estimation Of Multiple 3-Dimensional Objects |
| Recognition, | pose | And Tracking Of Modelled Polyhedral Objects By Multi-Ocular Vision |
| Recovering And Tracking | pose | Of Curved 3d Objects From 2-D Images |
| Relative Motion And | pose | From Arbitrary Plane Curves |
| Review And Analysis Of Solutions Of The Three Point Perspective | pose | Estimation Problem |
| Right Straight Homogeneous Cylinders With Symmetrical Cross-Sections: Recovery Of | pose | And Shape From Image Contours |
| Robot | pose | Estimation In Unknown Environments By Matching 2d Range Scans |
| Robust 3-D - 3-D | pose | Estimation |
| Robust 3d-3d | pose | Estimation |
| Robust Algorithm For 3d Head | pose | Estimation, A |
| Robust Line-Based | pose | Enumeration From A Single Image |
| Robust Methods For Estimating | pose | And A Sensitivity Analysis |
| Sensitivity Analysis For Matching And | pose | Computation Using Dihedral Junctions |
| Sensitivity Of The | pose | Refinement Problem To Accurate Estimation Of Camera Parameters |
| Separability Of | pose | And Expression In Facial Tracking And Animation |
| Shape Alignment|Optimal Initial Point And | pose | Estimation |
| Simultaneous Determination Of Camera | pose | And Intrinsic Parameters By Visual Servoing |
| Single View Recognition And | pose | Estimation Of 3d Objects Using Sets Of Prototypical Views And Spatially Tolerant Contour Representations |
| Statistically-Based Newton Method For | pose | Refinement, A |
| Stereopsis And Image Registration From Extended Range Features In The Absence Of Camera | pose | Information |
| Three-Dimensional | pose | Computations For Multiple Views |
| Time And Space Efficient | pose | Clustering |
| Triangle-Based | pose | Determination Of 3-D Objects |
| Uncertainty In Object | pose | Determination With Three Light-Stripe Range Measurements |
| Uncertainty In | pose | Estimation: A Bayesian Approach |
| Uniqueness Of 3d | pose | Under Weak Perspective: A Geometrical Proof |
| Use Of Geometrical Constraints And Clustering To Determine 3d Object | pose | |
| Using Chromaticity Distributions And Eigenspace Analysis For | pose | -, Illumination-, And Specularity-Invariant Recognition Of 3d Objects |
| Varying Focal Length Self-Calibration And | pose | Estimation From Two Images |
| Viewpoint Variation In The Noise Sensitivity Of | pose | Estimation |
| Volumetric/Iconic Frequency Domain Representation For Objects With Application For | pose | Invariant Face Recognition, A |
| Weak Lambertian Assumption For Determining Cylindrical Shape And | pose | From Shading And Contour |
152 for pose