David Field's Feature References
Here are the results of a recent literature search on features, by
David Field from General Motors Research (aes4ur@daf.ma.gmr.com)
MSG From: SMTP --GMRCMSA To: DFIELD --GMRCMSA 11/27/94 23:21:55á
=========================================================================
ACC# : SAE-941672
TITLE : Feature extraction from non-linear geometric
models in design- for-manufacturing
AUTHOR : Sonthi, Ratnaker
Harinarayan, Kambainathan R.
Gadh, Rajit
ORG_SOURCE : University of Wisconsin-Madison
University of Wisconsin-Madison
University of Wisconsin-Madison
INDEX TERMS: Manufacturing processes
Computer aided design (CAD)
LANGUAGE : English
ABSTRACT : Automatic manufacturability analysis of injection
moldings, sheet metal castings, stampings,
forgings, etc., using knowledge- based heuristics
depends on shape features, which are abstractions
of the three dimensional (3D) geometric model of
the parts. Conventional CAD systems do not
explicitly contain shape feature information,
therefore such information needs to be extracted
from them. So far, extraction of shape features
has been restricted to models with simple
geometric shapes such as planar, cylindrical or
conical shapes. Extending shape feature extraction
to non-linear geometric models will allow Design
For Manufacturability (DFM) analysis of non-linear
models. This paper presents an approach to extract
features from non-linear geometric models. The
approach is based on abstract geometric entities
called C-loops. The formation of a C-loop depends
on a geometric entity called a silhouette. The C-
loops are derived from the silhouette boundaries
of an object. This paper presents an algorithm to
detect silhouettes on non- linear surfaces and
describes how the detected silhouettes can be used
for feature extraction.
MSG From: SMTP --GMRCMSA To: DFIELD --GMRCMSA 11/05/94 03:25:24a
=========================================================================
TI: HOLE EXTRACTION FOR SHEET METAL COMPONENTS
AU: LENTZ, D. H.
SOWERBY, R.
OS: MCMASTER UNIV,DETP MECH ENGN,1280 MAIN ST W/HAMILTON L85 4K7/ON/CANADA/
JL: COMPUTER-AIDED DESIGN
IS: VOL. 26, NO. 10, PP. 771-783 OCT 1994
***** AVAILABLE AT R&D *****
KW: 3D SOLID MODEL
RECOGNITION
CAD/CAM INTEGRATION
FEATURE EXTRACTION
HOLES
TI: REPRESENTATIONAL PRIMITIVES FOR GEOMETRIC TOLERANCING
AU: GUILFORD, J.
TURNER, J.
OS: RENSSELAER POLYTECH INST,INST DESIGN & MFG,CII 7015/TROY//NY/12180
JL: COMPUTER-AIDED DESIGN
IS: VOL. 25, NO. 9, PP. 577-586 SEP 1993
***** AVAILABLE AT GMR *****
KW: DIMENSIONS
FEATURES
GEOMETRIC TOLERANCES
TOLERANCE REPRESENTATION
SOLID MODELLING
ANSI-Y14.5 STANDARD
TI: SPATIAL REASONING FOR THE AUTOMATIC RECOGNITION OF MACHINABLE FEATURES
IN SOLID MODELS
AU: VANDENBRANDE, J. H.
REQUICHA, A. A. G.
OS: UNIGRAPH DIV EDS,10824 HOPE ST/CYPRESS//CA/90630
UNIV SO CALIF,DEPT COMP SCI/LOS ANGELES//CA/9008
UNIV SO CALIF,INST ROBOT & INTELLIGENT SYST/LOS
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 15, NO. 12, PP. 1269-1285 DEC 1993
***** AVAILABLE AT GMR *****
KW: FEATURE RECOGNITION
CAD CAM
SPATIAL REASONING
PROCESS PLANNING
SOLID MODELING
VOLUME DECOMPOSITION
TI: GEOMETRIC REASONING FOR MACHINING FEATURES USING CONVEX DECOMPOSITION
AU: WACO, D. L.
KIM, Y. S.
OS: CUMMINS ENGINE CO,DEPT CORP COMP AIDED DESIGN COMP AIDE & MFG/COLUMBUS//
IN/47201
UNIV ILLINOIS,DEPT GEN ENGN/URBANA//IL/61801
JL: COMPUTER-AIDED DESIGN
IS: VOL. 26, NO. 6, PP. 477-489 JUN 1994
***** AVAILABLE AT GMR *****
KW: MACHINING FEATURES
CONVEX DECOMPOSITION
GEOMETRIC REASONING
TI: VISIBILITY SCRIPTS FOR ACTIVE FEATURE-BASED INSPECTION
AU: TRUCCO, E.
DIPRIMA, M.
ROBERTO, V.
OS: HERIOT WATT UNIV,DEPT ELECT & COMP ENGN/EDINBURGH EH14 4AS/MIDLOTHIAN/
SCOTLAND/
UNIV UDINE,DEPT MATH & INFORMAT/I-33100 UDINE//ITALY/
JL: PATTERN RECOGNITION LETTERS
IS: VOL. 15, NO. 11, PP. 1151-1164 NOV 1994
KW: OBJECT RECOGNITION
MACHINE VISION
SENSOR PLANNING
VIEWER-CENTRED REPRESENTATIONS
ACTIVE INSPECTION
MSG From: SMTP --GMRCMSA To: DFIELD --GMRCMSA 01/05/95 14:19:42a
=========================================================================
AUTHOR : Jensen, Cecil Howard, 1925-
TITLE : Geometric dimensioning & tolerancing - for
engineering & manufacturing technology.
** CALL NUMBER: TS172 .J46
LOCATION__YEAR___CNO___ACCESSION/STATUS
ENG 1993 1 160104 On the shelf
CORP AUTHOR: American Society of Mechanical Engineers
TITLE : Dynamic mechanical systems, geometric modeling and
features, concurrent engineering.
SERIES : DE-V.69-1
PUBLISHER : New York : American Society of Mechanical
Engineers : 1994
RECID : 185301
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 02/07/95 07:26:58á
=========================================================================
TI: COMPUTATION OF SPATIAL DISPLACEMENTS FROM REDUNDANT GEOMETRIC FEATURES
AU: GE, Q. J.
RAVANI, B.
OS: SUNY STONY BROOK,DEPT MECH ENGN/STONY BROOK//NY/11794
JL: JOURNAL OF MECHANICAL DESIGN
IS: VOL. 116, NO. 4, PP. 1073-1080 DEC 1994
***** AVAILABLE AT R&D *****
TI: SYMMETRIC PHASE-ONLY MATCHED FILTERING OF FOURIER-MELLIN TRANSFORMS FOR
IMAGE REGISTRATION AND RECOGNITION
AU: CHEN, Q. S.
DEFRISE, M.
DECONINCK, F.
OS: MEM SLOAN KETTERING CANC CTR,DEPT MED PHYS/NEW YORK//NY/10021
FREE UNIV BRUSSELS,AKAD ZIEKENHUIS,NUGE,EXPTL MED IMAGING LAB/B-1090
BRUSSELS//BELGIUM/
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 16, NO. 12, PP. 1156-1168 DEC 1994
***** AVAILABLE AT R&D *****
KW: CIRCULAR HARMONIC EXPANSION
PATTERN-RECOGNITION
MOMENT INVARIANTS
ROTATED IMAGES
NOISE RATIO
IDENTIFICATION
ANATOMY
SIGNAL
SYSTEM
TL-201
TI: OPTIMAL EDGE DETECTION USING EXPANSION MATCHING AND RESTORATION
AU: RAO, K. R.
BENARIE, J.
OS: IIT,DEPT ELECT & COMP ENGN,COMP VIS & NEURAL NETWORK LAB/CHICAGO//IL/
60616
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 16, NO. 12, PP. 1169-1182 DEC 1994
***** AVAILABLE AT R&D *****
TI: USING GEOMETRIC DISTANCE FITS FOR 3-D OBJECT MODELING AND RECOGNITION
AU: SULLIVAN, S.
SANDFORD, L.
PONCE, J.
OS: UNIV ILLINOIS,BECKMAN INST/URBANA//IL/61801
UNIV ILLINOIS,DEPT COMP SCI/URBANA//IL/61801
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 16, NO. 12, PP. 1183-1196 DEC 1994
***** AVAILABLE AT R&D *****
KW: SILHOUETTES
VIEWS
TI: CONCURRENT ITERATIVE DESIGN AND THE INTEGRATION OF FINITE ELEMENT
ANALYSIS RESULTS
AU: SAHU, K.
GROSSE, I. R.
OS: UNIV MASSACHUSETTS,DEPT MECH ENGN/AMHERST//MA/01003
UNIV MASSACHUSETTS,DEPT MECH ENGN/AMHERST//MA/01003
JL: ENGINEERING WITH COMPUTERS
IS: VOL. 10, NO. 4, PP. 245-257 1994
***** AVAILABLE AT R&D *****
KW: DESIGN METHODOLOGY
ITERATIVE DESIGN
CONCURRENT DESIGN
=> FEATURES
FORM TEMPLATES
FINITE ELEMENT ANALYSIS
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 03/10/95 16:08:32á
=========================================================================
Original-From: paula@cat.rpi.edu (Paula Popson)
SOLID MODELING '95
Third Symposium on Solid Modeling and Applications
May 17-19, 1995
Red Lion Hotel - - - Salt Lake City, Utah
3:45pm - 4:45pm FEATURE MANIPULATION
An Algebraic Representation Structure for Interactive Manipulation of Form
Features
G. Brunetti, IMA C.N.R., Italy and IGD, Germany, T. De Martino, IMA C.N.R.,
Italy and IGD, Germany
B. Falcidieno, IMA, C.N.R., Italy, & S. Hassinger, IMA C.N.R., Italy and
IGD, Germany
Multiple-way Feature Conversion to Support Concurrent Engineering
Klaas Jan de Kraker, Maurice Dohmen, & Willem Bronsvoort
Delft University of Technology, The Netherlands
Feature Attributes and Their Role in Product Modeling
S. Subrahmanyam & W. Devries, Rensselaer Polytechnic, USA &
M. Pratt, National Institute of Standards and Technology, USA
5:00pm - 6:00pm FEATURE RECOGNITION
Viewer-Centred Feature Recognition
MG Sommerville, DER Clark, & JR Corney, Heriot-Watt University, UK
A Provably Correct Feature Extractor for Parts with Cylindrical and Planar
Surfaces
Sanjeev Trika & Rangasami Kashyap, Purdue University, USA
Manufacturing Feature Instances: Which Ones to Recognize?
Satyandra Gupta, William Regli, & Dana Nau, University of Maryland, USA
=========================================================================
Received: from research.att.com by CMSA.gmr.com (IBM VM SMTP V2R2) with TCP;
Thu, 16 Mar 95 16:00:47 EST
From: compgeom-owner@research.att.com
Received: by research.att.com; Thu Mar 16 12:07 EST 1995
Received: by YAP.CS.NYU.EDU (4.1/1.34)
id AA17304; Thu, 16 Mar 95 12:07:25 EST
Date: Thu, 16 Mar 95 12:07:25 EST
Original-From: yap@YAP.CS.NYU.EDU (Chee Yap)
Message-Id: <9503161707.AA17304@YAP.CS.NYU.EDU>
To: compgeom-announce@research.att.com
Routing Code: AHIPC2S(SMTP)
Subject: New Report from National Research Council
The following report
"Information Technology for Manufacturing:
a research agenda"
has just been published by the National Reearch Council,
Computer Science and Telecommunications Board, and
Manufacturing Studies Board.
You can obtain copies from
National Academy Press
2101 Constitution Avenue, NW
Box 285
Washington DC 20055
(800)624-6242
(202)334-3313 (D.C. area)
The report should be of interest to members of the
C.G. community interested in manufacturing applications.
Topics with C.G. contents include virtual factories (p.109),
tolerancing (p.75), feature-based design (p.74),
geometric reasoning (p.80), etc.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 04/21/95 08:32:11á
=========================================================================
TI: AN INDEX OF TOPOLOGICAL PRESERVATION FOR FEATURE EXTRACTION
AU: BEZDEK, J. C.
PAL, N. R.
OS: UNIV W FLORIDA,DEPT COMP SCI/PENSACOLA//FL/32514
INDIAN STAT INST,MACHINE INTELLIGENCE UNIT/CALCUTTA 700035/W BENGAL/
INDIA/
JL: PATTERN RECOGNITION
IS: VOL. 28, NO. 3, PP. 381-391 MAR 1995
***** AVAILABLE AT R&D *****
KW: FEATURE MAPS
POINTS
FEATURE EXTRACTION
PRINCIPAL COMPONENTS ANALYSIS
SAMMONS METHOD
SELF-ORGANIZING
FEATURE MAPS
TOPOLOGICAL PRESERVATION
TI: AUTOMATED ASSEMBLING OF IMAGES - IMAGE MONTAGE PREPARATION
AU: DANI, P.
CHAUDHURI, S.
OS: INDIAN INST TECHNOL,DEPT ELECT ENGN/BOMBAY 400076/MAHARASHTRA/INDIA/
INDIAN INST TECHNOL,DEPT ELECT ENGN/BOMBAY 400076/MAHARASHTRA/INDIA/
JL: PATTERN RECOGNITION
IS: VOL. 28, NO. 3, PP. 431-445 MAR 1995
***** AVAILABLE AT R&D *****
KW: REGISTRATION
MOSAIC PREPARATION
MULTIRESOLUTION PREPARATION
NORMALIZED CROSS-CORRELATION
ROTATIONAL AND TRANSLATIONAL SHIFT
FEATURE MATCHING
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 04/21/95 05:07:12á
=========================================================================
ACC# : SME-B2382101
TITLE : FEATURES-BASED DESIGN COUPLED WITH FEATURE
RECOGNITION
AUTHOR : GADH, RAJIT
ORG_SOURCE : UNIVERSITY OF WISCONSIN-MADISON
SOURCE : PROCEEDINGS OF THE 1995 NSF DESIGN AND
MANUFACTURING GRANTEES CONFERENCE BOOK 1995 FIRST
EDITION PP 101-102
INDEX_TERMS: CAD
CAM
MANUFACTURING SYTSTEMS
DESIGN
ABSTRACT : THE LONG-TERM GOAL OF THE CURRENT RESEARCH IS TO
DEVELOP A FUNDAMENTALLY NEW APPROACH TO COMPUTER-
AIDED GEOMETRIC DESIGN WHICH INTEGRATES A FEATURES-
BASED APPROACH WITH FEATURE ABSTRACTION FROM
BOUNDARY REPRESENTATION SURFACE OR SOLID MODELS.
THE FORMER ALLOWS DESIGNS TO BE CREATED RAPIDLY,
WHEREAS THE LATTER PROVIDES FLEXIBILITY. THE
FEATURES-BASED DESIGN APPROACH IN THE CURRENT
RESEARCH USES AN ABSTRACT GEOMETRIC ENTITY CALLED
A LOOP; FEATURES ARE DEFINED IN TERMS OF LOOPS.
ACC# : SME-B2382121
TITLE : FORM FEATURE RECOGNITION USING CONVEX
DECOMPOSITION: GEOMETRIC DOMAIN EXTENSION
AUTHOR : KIM, YONG SE
ORG_SOURCE : UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN
SOURCE : PROCEEDINGS OF THE 1995 NSF DESIGN AND
MANUFACTURING GRANTEES CONFERENCE BOOK 1995 FIRST
EDITION PP 121-122
INDEX_TERMS: PRODUCT ENGINEERING
ABSTRACT : THIS PAPER REPORTS A METHOD TO RECOGNIZE FORM
FEATURES INTRINSIC TO THE SHAPE OF A GIVEN SOLID
USING A CONVEX DECOMPOSITION CALLED ALTERNATING SUM
OF VOLUMES WITH PARTITIONING. THE OBJECTIVE OF THIS
RESEARCH IS TO PROVIDE A PRODUCT MODEL TO SUPPORT
VARIOUS PRODUCT ENGINEERING ACTIVITIES THROUGH A
CENTRAL FORM FEATURE DECOMPOSITION THAT POSSESSES
INTRINSIC ADVANTAGES APPLICABLE TO A WIDE RANGE OF
MANUFACTURING PROCESS DESIGN ACTIVITIES. RECENT
PROGRESS IN EXTENDING THE GEOMETRIC DOMAIN TO
SOLIDS HAVING CYLINDRICAL AND BLENDING FEATURES IS
DESCRIBED.
ACC# : SME-B2382129
TITLE : CHARACTERIZATION OF FUNCTIONAL AND GEOMETRICAL
VARIATIONS FOR FUNCTIONAL TOLERANCING
AUTHOR : MENQ, CHIA-HSIANG
CHEN, BAOSHENG
ORG_SOURCE : THE OHIO STATE UNIVERSITY
THE OHIO STATE UNIVERSITY
SOURCE : PROCEEDINGS OF THE 1995 NSF DESIGN AND
MANUFACTURING GRANTEES CONFERENCE BOOK 1995 FIRST
EDITION PP 129-130
INDEX_TERMS: VARIATIONS
ABSTRACT : THE OBJECTIVES OF THIS PROJECT ARE TO CHARACTERIZE
THE FUNCTIONAL VARIATIONS OF VARIOUS MECHANICAL
ELEMENTS AND SYSTEMS, TO INVESTIGATE THE LINK
BETWEEN THE POSSIBLE GEOMETRICAL VARIATIONS OF A
MANUFACTURED MECHANICAL PRODUCT AND THE RESULTING
FUNCTIONAL VARIATIONS, AND TO DEVELOP A FRAMEWORK
FOR FUNCTIONAL TOLERANCING BASED ON THE
CHARACTERISTICS OF THE REQUIRED FUNCTIONS. THE
PROPOSED FRAMEWORK FOR FUNCTIONAL TOLERANCING
INCLUDES FOUR INTER-RELATED MODULES: FEATURE
IDENTIFICATION, TRANSFORMATION, TOLERANCING, AND
SPECIFICATION MODULES.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 05/05/95 20:26:03á
=========================================================================
TI: PRELIMINARY SHAPE DEFINITION OF STRUCTURAL COMPONENTS USING A PROTOTYPE
KNOWLEDGE-BASED EXPERT SYSTEM
AU: RODRIGUEZ, J.
HART, P.
OS: BUCKNELL UNIV,DEPT ENGN MECH/LEWISBURG//PA/17837
RUTGERS STATE UNIV,DEPT ENGN MECH/PISCATAWAY//NJ/00000
JL: ENGINEERING WITH COMPUTERS
IS: VOL. 11, NO. 2, PP. 103-113 1995
***** AVAILABLE AT R&D *****
KW: SHAPE SYNTHESIS
KBES
TI: SHAPE OPTIMIZATION OF THREE-DIMENSIONAL PARTS BASED ON A CLOSED LOOP
BETWEEN STRUCTURE ANALYSIS AND GEOMETRIC MODELLING
AU: NOEL, F.
LEON, J. C.
TROMPETTE, P.
OS: LAB SOLS SOLIDES STRUCTURES,CNRS,URA 1511,BP 53X/F-38041 GRENOBLE 9//
FRANCE/
JL: ENGINEERING WITH COMPUTERS
IS: VOL. 11, NO. 2, PP. 114-121 1995
***** AVAILABLE AT R&D *****
KW: DESIGN PARAMETERS
DESIGN PROCESS
FREEFORM SURFACES
FINITE-ELEMENT METHOD
GEOMETRIC MODELLING
GEOMETRIC MODELLING-STRUCTURE ANALYSIS COUPLING
NURBS
OPTIMIZATION
PATCH BLENDING
SENSITIVITY ANALYSIS
SURFACE-MESH COUPLING
TECHNOLOGICAL CRITERION
TI: MULTIVARIATE CLASSIFICATION THROUGH ADAPTIVE DELAUNAY-BASED C-0 SPLINE
APPROXIMATION
AU: CUBANSKI, D.
CYGANSKI, D.
OS: ACUITY IMAGING INC/NASHUA//NH/03063
WORCESTER POLYTECH INST,DEPT ELECT & COMP ENGN/WORCESTER//MA/01609
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 17, NO. 4, PP. 403-417 APR 1995
***** AVAILABLE AT R&D *****
KW: NEURAL NETWORKS
ALGORITHM
PATTERN CLASSIFICATION
APPROXIMATION
NEURAL NETWORKS
NON-LINEAR OPTIMIZATION
SPLINES
EGG
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 05/26/95 12:08:56á
=========================================================================
INTERNAL REPORT NO: R&D-8345
AUTHOR : Ghosh, Ranajit (University of Kentucky)
Lin, Min (University of Kentucky)
Fei, Jian (University of Kentucky)
Jawahir, Ibrahim S. (University of Kentucky)
Khetan, Raghunath P.
Bandyopadhyay, Pulak
TITLE : A new feature-based chip-groove
classification system for chip breakability
assessment in finish turning.
DEPARTMENT_NAME : Engineering Mechanics
PUBDATE : MAY 1995
GEN_NOTES : For presentation: Production Engineering
Division, The American Society of
Mechanical Engineers, 1995 Winter Annual
Meeting. For publication: Transactions of
ASME Journal of Engineering for Industry.
CLASSIFICATION : GMNONCLASSIFIED
ABSTRACT : This paper describes a new feature-based
system for classifying commercially
available cutting tool and chip breaker
geometries used for finish turning.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 06/16/95 09:06:36á
=========================================================================
TI: IMAGE RELAXATION - RESTORATION AND FEATURE EXTRACTION
AU: SNYDER, W.
HAN, Y. S.
BILBRO, G.
OS: N CAROLINA STATE UNIV,DEPT ELECT & COMP ENGN/RALEIGH//NC/27695
BOWMAN GRAY SCH MED,DEPT RADIOL/WINSTON SALEM//NC/00000
UNIV N CAROLINA,DEPT COMP SCI/CHAPEL HILL//NC/00
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 17, NO. 6, PP. 620-624 JUN 1995
***** AVAILABLE AT R&D *****
KW: STOCHASTIC RELAXATION
GRADUATED NONCONVEXITY
ANISOTROPIC DIFFUSION
MEAN FIELD ANNEALING
IMAGE OPTIMIZATION
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 07/18/95 09:05:52á
=========================================================================
TI: SYSTEMATIC APPROACH TO ANALYSING THE MANUFACTURABILITY OF MACHINED PARTS
AU: GUPTA, S. K.
NAU, D. S.
OS: UNIV MARYLAND,INST SYST RES/COLLEGE PK//MD/20742
UNIV MARYLAND,DEPT MECH ENGN/COLLEGE PK//MD/2074
UNIV MARYLAND,INST SYST RES/COLLEGE PK//MD/20742
JL: COMPUTER-AIDED DESIGN
IS: VOL. 27, NO. 5, PP. 323-342 MAY 1995
***** AVAILABLE AT R&D *****
KW: RECOGNITION
FEATURES
DESIGN FOR MANUFACTURABILITY
COMPUTER-AIDED MANUFACTURABILITY ANALYSIS
FEATURE-BASED MODELS
TI: CONSTRAINT-BASED DESIGN OF PARTS
AU: FENG, C. X.
KUSIAK, A.
OS: UNIV IOWA,DEPT IND ENGN,INTELLIGENT SYST LAB/IOWA CITY//IA/52242
JL: COMPUTER-AIDED DESIGN
IS: VOL. 27, NO. 5, PP. 343-352 MAY 1995
***** AVAILABLE AT R&D *****
KW: FEATURES
REPRESENTATION SCHEMES
CONSTRAINT-BASED DESIGN
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 07/31/95 08:33:54á
=========================================================================
TI: BOUNDS ON SHAPE RECOGNITION PERFORMANCE
AU: LINDENBAUM, M.
OS: TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI/IL-32000 HAIFA//ISRAEL/
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 17, NO. 7, PP. 666-680 JUL 1995
***** AVAILABLE AT R&D *****
KW: MODEL-BASED RECOGNITION
OBJECT RECOGNITION
LOCALIZATION
RECOGNITION
LOCALIZATION
PROBABILISTIC MODELS
OBJECT SIMILARITY
PERFORMANCE EVALUATION
COMPUTER VISION
TI: A SPHERICAL REPRESENTATION FOR RECOGNITION OF FREE-FORM SURFACES
AU: HEBERT, M.
IKEUCHI, K.
DELINGETTE, H.
OS: CARNEGIE MELLON UNIV,INST ROBOT/PITTSBURGH//PA/15213
INRIA,EPIDAURE PROJECT/SOPHIA ANTIPOLIS//FRANCE/
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 17, NO. 7, PP. 681-690 JUL 1995
***** AVAILABLE AT R&D *****
KW: OBJECT RECOGNITION
RECONSTRUCTION
OBJECT RECOGNITION
DEFORMABLE SURFACES
RANGE DATA
POSE REGISTRATION
3D MODELING
SURFACE MODELS
FREE-FORM SURFACES
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 08/25/95 08:58:15á
=========================================================================
TI: ON CRITICAL POINT DETECTION OF DIGITAL SHAPES/
AU: ZHU, P. F.
CHIRLIAN, P. M.
OS: JAMES RIVER CORP/EASTON//PA/18042
UNIV NEW ORLEANS,DEPT ELECT ENGN/NEW ORLEANS//LA/70148
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 17, NO. 8, PP. 737-748 AUG 1995
***** AVAILABLE AT R&D *****
KW: DOMINANT POINTS
PLANAR CURVES
SCALES
FEATURE POINT DETECTION
SHAPE REPRESENTATION
SHAPE ANALYSIS
FEATURE EXTRACTION
DIGITIZED CONTOUR
NONLINEAR ALGORITHM
SHAPE RECOGNITION
TI: STRUCTURAL MATCHING IN COMPUTER VISION USING PROBABILISTIC RELAXATION
AU: CHRISTMAS, W. J.
KITTLER, J.
PETROU, M.
OS: UNIV SURREY,DEPT ELECTR & ELECT ENGN,VIS SPEECH& SIGNAL PROC GRP/
GUILDFORD GU2 5XH/SURREY/ENGLAND/
JL: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
IS: VOL. 17, NO. 8, PP. 749-764 AUG 1995
***** AVAILABLE AT R&D *****
KW: OBJECT RECOGNITION
3-D OBJECTS
REPRESENTATION
OPTIMIZATION
IMAGES
MATCHING
PROBABILISTIC RELAXATION
OBJECT RECOGNITION
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 08/31/95 04:17:40á
=========================================================================
3) Table of Contents: Const. Approx., Vol. 11, No. 3, 1995
299 D. Leviatan and V.Operstein
Shape-Preserving Approximation in L_p
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/17/95 07:33:27á
=========================================================================
TI: A PERSPECTIVE THEORY FOR MOTION AND SHAPE ESTIMATION IN MACHINE VISION
AU: GHOSH, B. K.
LOUCKS, E. P.
OS: WASHINGTON UNIV,DEPT SYST SCI & MATH,CAMPUS BOX1040,1 BROOKINGS DR/ST
LOUIS//MO/63130
JL: SIAM JOURNAL ON CONTROL AND OPTIMIZATION
IS: VOL. 33, NO. 5, PP. 1530-1559 SEP 1995
***** AVAILABLE AT R&D *****
KW: RIGID PLANAR PATCH
3-DIMENSIONAL MOTION
LINE CORRESPONDENCES
OPTICAL-FLOW
PARAMETERS
ALGORITHM
OBJECTS
SURFACE
PERSPECTIVE
VISION
PARAMETER IDENTIFICATION
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/20/95 08:45:44á
=========================================================================
TI: FEATURE SELECTION BASED ON THE APPROXIMATION OF CLASS DENSITIES BY
FINITE MIXTURES OF SPECIAL TYPE
AU: PUDIL, P.
NOVOVICOVA, J.
CHOAKJARERNWANIT, N.
OS: UNIV SURREY,DEPT ELECTR & ELECT ENGN,VIS SPEECH& SIGNAL PROC GRP/
GUILDFORD GU2 5XH/SURREY/ENGLAND/
ACAD SCI CZECH REPUBL,INST INFORMAT THEORY & AUTOMAT/CR-18208 PRAGUE 8//
CZECH REPUBLIC/
JL: PATTERN RECOGNITION
IS: VOL. 28, NO. 9, PP. 1389-1398 SEP 1995
***** AVAILABLE AT R&D *****
KW: MAXIMUM-LIKELIHOOD
NORMAL-DISTRIBUTIONS
EM ALGORITHM
FEATURE SELECTION
FEATURE ORDERING
MIXTURE DISTRIBUTION
MAXIMUM LIKELIHOOD
EM ALGORITHM
TI: COMPUTATION OF LEGENDRE AND ZERNIKE MOMENTS
AU: MUKUNDAN, R.
RAMAKRISHNAN, K. R.
OS: ISRO,SATELLITE CTR,CONTROL SYST GRP,AIRPORT RD/BANGALORE 560017/
KARNATAKA/INDIA/
INDIAN INST SCI,DEPT ELECT ENGN/BANGALORE 560012/KARNATAKA/INDIA/
JL: PATTERN RECOGNITION
IS: VOL. 28, NO. 9, PP. 1433-1442 SEP 1995
***** AVAILABLE AT R&D *****
KW: INVARIANT IMAGE RECOGNITION
MOMENT FUNCTIONS
LEGENDRE MOMENTS
ZERNIKE MOMENTS
CONTOUR INTEGRATION
IMAGE RECONSTRUCTION
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 11/09/95 11:13:32á
=========================================================================
TI: TRIANGULATION ON RECONFIGURABLE MESHES - A NATURAL DECOMPOSITION APPROACH
AU: LAI, T. H.
SHENG, M. J.
OS: OHIO STATE UNIV,DEPT COMP & INFORMAT SCI/COLUMBUS//OH/43210
JL: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
IS: VOL. 30, NO. 1, PP. 38-51 OCT 1995
***** AVAILABLE AT R&D *****
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 11/17/95 10:29:02á
=========================================================================
TI: TOWARDS FEATURE ATTACHMENT
AU: CHEN, X. P.
HOFFMANN, C. M.
OS: PURDUE UNIV,DEPT COMP SCI/W LAFAYETTE//IN/47907
JL: COMPUTER-AIDED DESIGN
IS: VOL. 27, NO. 9, PP. 695-702 SEP 1995
***** AVAILABLE AT R&D *****
KW: FEATURE SEMANTICS
BOUNDARY TRIMMING
BOOLEAN OPERATIONS
TI: INTEGRATING FEATURE-BASED SURFACE DESIGN WITH FREEFORM DEFORMATION
AU: CAVENDISH, J. C.
OS: GM CORP,CTR RES & DEV,DEPT MATH/WARREN//MI/48090
JL: COMPUTER-AIDED DESIGN
IS: VOL. 27, NO. 9, PP. 703-711 SEP 1995
***** AVAILABLE AT R&D *****
KW: FEATURE-BASED DESIGN
FREEFORM DEFORMATION
SINGLE-VALUED FUNCTIONS
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 11/29/95 09:06:19á
=========================================================================
TI: GENERATING TOPOLOGICAL STRUCTURES FOR SURFACE MODELS
AU: SHENG, X. J.
MELER, I. R.
OS: UNIV BREMEN,BREMEN INST IND TECHNOL & APPL WORKSCI,HOCHSCHULRING 20/D-
28359 BREMEN//GERMANY/
JL: IEEE COMPUTER GRAPHICS AND APPLICATIONS
IS: VOL. 15, NO. 6, PP. 35-41 NOV 1995
***** AVAILABLE AT R&D *****
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/08/95 08:00:07á
=========================================================================
MIDPLANE MESH GENERATOR EDITS CAD FILES AUTOMATICALLY
The tiresome task of editing CAD solid models for analysis often
absorbs days or weeks of a designer's time. Even commercial software
programs that do this job "automatically" take many hours, without a
high success rate. Moldflow Pty. Ltd. is beta testing a software
program, MF/Midplane, which generates a midplane mesh from CAD files in
minutes, instead of hours or days. MF/Midplane first examines the
curves and angles of a solid model to split the connected elements into
distinct surfaces. Users can easily tell surfaces apart because each
appears a different color on the computer screen. Then the software
matches elements on opposite surfaces, and moves them together to the
midplane. Finally, MF/Midplane stitches adjoining surfaces together
into a mesh with attributes like thickness, color, and surface number.
During alpha testing, MF/Midplane created an excellent midplane mesh
about 70% of the time. Another 15% of trials produced acceptable meshes
that required some manual editing. Using an FEA pre- and post-processor
improved the software's success rate. Bayer, Hewlett-Packard, General
Motors, and Motorola are among candidates that may beta test the UNIX
software. Once Moldflow perfects MF/Midplane, the company will release
it for Windows applications. Details: Mark S. Toussaint, Marketing
Manager, Moldflow Pty. Ltd., 2 Corporate Dr., Ste. 232, Shelton, CT
06484. Phone: 203-925-0552, ext. 229. Fax: 203-925-1175. Internet:
tous@moldflow.com. A950341 41295 Copyright 1995, Technical Insights,
Inc., Englewood, NJ 07631
ACC# : SME-B2382377
TITLE : DISCOVERY OF PART SHAPE FROM SURFACE MEASUREMENT
DATA
AUTHOR : WANG, YU
HULTING, FRED
FUSSELL, PAUL
ORG_SOURCE : UNIVERSITY OF MARYLAND, BALTIMORE COUNTY
ALCOA TECHNICAL CENTER
ALCOA TECHNICAL CENTER
SOURCE : PROCEEDINGS OF THE 1995 NSF DESIGN AND
MANUFACTURING GRANTEES CONFERENCE BOOK 1995 FIRST
EDITION PP 377-378
INDEX_TERMS: CAD
CAM
ABSTRACT : ALCOA ROUTINELY USES SURFACE MEASUREMENT DATA TO
ASSESS THE CONFORMANCE OF A PART TO A DIMENSIONAL
SPECIFICATION. GENERALLY, THESE DATA ARE GATHERED
WITH A COORDINATE MEASURING MACHINE (CMM).
REDUCING THE LARGE VOLUME OF DATA RESULTING FROM
THIS PROCESS TO A CLEAR EXPRESSION OF THE ACTUAL
PART SHAPE HAS PROVEN PROBLEMATIC. THIS WORK
DESCRIBES A LOCALIZATION METHOD TO SHOW THE
MEASURED PART'S VARIATION FROM A NOMINAL GEOMETRY--
FOR EXAMPLE, THE PART SHOULD BE STRAIGHT, BUT IT
ACTUALLY HAS A TWO DEGREE BEND IN THE X-Y PLANE.
ACC# : SME-MR950201
TITLE : SHADED IMAGE MACHINING (SIM): A COMPLEX CURVED
SURFACE REPRODUCTION TOOL
AUTHOR : RALPH, W.L.
ORG_SOURCE : CITY UNIVERSITY OF HONG KONG
SOURCE : SME TECHNICAL PAPERS 1995 12 PP
INDEX_TERMS: CAM
MACHINE VISION
RESEARCH AND DEVELOPMENT
ABSTRACT : A NEWLY DEVELOPED GEOMETRICAL SURFACE FEATURE
RECOVERY APPROACH, NAMELY SHADED IMAGE MACHINING (
SIM), IS PRESENTED IN THIS STUDY. IT USES
PHOTOMETRIC STEREO TECHNIQUES AND LIGHT
ILLUMINATION MODELS TO RECOVER THE GRADIENT OF EACH
REFLECTED POINT ON THE SURFACES FROM MULTIPLE
SHADED IMAGES. LINEAR REFLECTANCE MAPS ARE THE
TOOL TO ASSIST THE RECONSTRUCTION OF THE SURFACE
PROFILE. THE COORDINATES OF THE PROFILE ARE
DETERMINED BY SUCCESSIVE INTEGRATION OF THE
RECOVERED SURFACE GRADIENTS. THE RESULTS OF THIS
CASE STUDY DEMONSTRATED THAT THE SIM APPROACH CAN
REPRODUCE SURFACES AS COMPLEX AS THE HUMAN FIGURE.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 01/10/96 00:10:30á
=========================================================================
06960887 Genuine Article#: TJ255 Number of References: 38
Title: POLYHEDRAL PERTURBATIONS THAT PRESERVE TOPOLOGICAL FORM
Author(s): ANDERSSON LE; DORNEY SM; PETERS TJ (Reprint); STEWART NF
Corporate Source: UNIV CONNECTICUT,DEPT COMP SCI & ENGN/STORRS//CT/06269
(Reprint); UNIV CONNECTICUT,DEPT COMP SCI & ENGN/STORRS//CT/06269;
LINKOPING UNIV,DEPT MATH/S-58183 LINKOPING//SWEDEN/; UNIV MONTREAL,DEPT
IRO/MONTREAL/PQ H3C 3J7/CANADA/
Journal: COMPUTER AIDED GEOMETRIC DESIGN, 1995, V12, N8 (DEC), P785-799
ISSN: 0167-8396
Current Contents Journal Announcement: CC ENGI, V27, N03
Language: ENGLISH Document Type: ARTICLE
Abstract: The idea, that we are willing to accept variation in an object
but that we insist it should retain its original topological form, has
powerful intuitive appeal, and the concept appears in many applied
fields. Some of the most important of these are tolerancing and
metrology, solid modeling, engineering design, finite element analysis,
surface reconstruction, computer graphics, path planning in robotics,
fairing procedures, image analysis, and medical imaging. In this paper
we focus on the field of tolerancing and metrology. The requirement
that two objects or sets should have the same topological form requires
a precise definition. We specify ''same topological form'' to mean that
there exists a ''space homeomorphism'' from R(3) onto R(3) that carries
a nominal object S onto another design object. In general, establishing
the existence of such space homeomorphisms can be considerably more
difficult than demonstrating classical topological equivalence by a
homeomorphism. In the special case when the boundary of S is a
polyhedral two-sphere in R(3), one of the authors has previously given
a simple sufficient condition for the existence of a space
homeomorphism mapping S onto another design object. This paper presents
an analogous sufficient condition for the case when S is a finite
polyhedron in R(3). The result relies upon a triangulation of the
boundary and upon a dependent parameter that specifies the maximum size
of permissible perturbations of the vertices of the polyhedron.
Title: EXTRACTION OF 3D OBJECT FEATURES FROM CAD BOUNDARY REPRESENTATION
USING THE SUPER RELATION GRAPH METHOD
Author(s): KAO CY; KUMARA SRT; KASTURI R
Corporate Source: PENN STATE UNIV,DEPT IND & MFG ENGN/UNIVERSITY
PK//PA/16802 (Reprint); PENN STATE UNIV,DEPT COMP SCI &
ENGN/UNIVERSITYPK//PA/16802
Journal: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,
1995, V17, N12 (DEC), P1228-1233
ISSN: 0162-8828
Current Contents Journal Announcement: CC ENGI, V27, N03
Language: ENGLISH Document Type: LETTER
Abstract: This paper presents the super relation graph (SRG) method for
extracting prismatic features from the CBD boundary representation of a
machined part. Using the definition of super relations and the validity
of a feature volume, this method recognizes features with all three
types of interactions: face splitting, face merging, and edge
truncation.
Journal: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE
INTELLIGENCE, 1995, V17, N12 (DEC)
P. 1154-1166. SYMMETRY AS A CONTINUOUS FEATURE. ZABRODSKY H; PELEG
S; AVNIR D. HEBREW UNIV JERUSALEM,INST COMP SCI/IL-91904
JERUSALEM//ISRAEL/ (Reprint); HEBREW UNIV JERUSALEM,DEPT ORGAN
CHEM/IL-91904 JERUSALEM//ISRAEL/. ENGLISH. ARTICLE. 39
References. Abstract Available
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 02/20/96 22:40:43á
=========================================================================
Title: Feature correspondence and localization of 3D objects using range
images
Author: Kaveti, Satish; Teoh, Eam Khwang; Wang, Han
Corporate Source: Nanyang Technological Univ, Singapore, Singapore
Conference Title: Proceedings of the 1995 IEEE International Conference
on Systems, Man and Cybernetics. Part 4 (of 5)
Conference Location: Vancouver, BC, Can
Sponsor: IEEE
E.I. Conference No.: 44222
Source: Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics v 4 1995. IEEE, Piscataway, NJ, USA,95CB35767. p 3555-3560
Publication Year: 1995
CODEN: PICYE3 ISSN: 0884-3627
Language: English
Document Type: CA; (Conference Article) Treatment: G; (General Review)
Journal Announcement: 9603W4
Abstract: In this paper, we have described an approach for segmentation,
recognition and pose estimation of 3D objects using range images. The
surfaces are represented using second degree implicit polynomials from
which we obtain view-invariant feature attributes and orientation of the
patch. For recognition we use of invariant geometric constraints between
the different surface patches, which helps in reducing the search space. We
have also described an approach to obtain Euclidean invariants and
orientation of surfaces described using higher degree implicit polynomials.
(Author abstract) 6 Refs.
Title: Polyhedral object recognition by indexing
Author: Horaud, Radu; Sossa, Humberto
Corporate Source: LIFIA-IMAG, Grenoble, Fr
Source: Pattern Recognition v 28 n 12 Dec 1995. p 1855-1870
Publication Year: 1995
CODEN: PTNRA8 ISSN: 0031-3203
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical); X; (Experimental)
Journal Announcement: 9603W4
Abstract: In computer vision, the indexing problem is the problem of
recognizing a few objects in a large database of objects while avoiding the
help of the classical image-feature-to-object-feature matching paradigm. In
this paper we address the problem of recognizing three-dimensional (3-D)
polyhedral objects from 2-D images by indexing. Both the objects to be
recognized and the images are represented by weighted graphs. The indexing
problem is therefore the problem of determining whether a graph extracted
from the image is present or absent in a database of model graphs. We
introduce a novel method for performing this graph indexing process which
is based both on polynomial characterization of binary and weighted graphs
and on hashing. We describe in detail this polynomial characterization and
then we show how it can be used in the context of polyhedral object
recognition. Next we describe a practical recognition-by-indexing system
that includes the organization of the database, the representation of
polyhedral objects in terms of 2-D characteristic views, the representation
of this views in terms of weighted graphs and the associated image
processing. Finally, some experimental results allow the evaluation of the
system performance. (Author abstract) 36 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 02/28/96 23:30:22á
=========================================================================
Title: Generating solid models from two-dimensional representations
Author: Ghosh, S.K.; Li, Y.B.; Munns, A.K.; Wang, X.C.
Corporate Source: GKN Int Coll of Engineering, Siegburg, Ger
Source: Journal of Materials Processing Technology v 54 n 1-4 Oct 1995. p
211-217
Publication Year: 1995
CODEN: JMPTEF ISSN: 0924-0136
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); G;
(General Review); T; (Theoretical)
Journal Announcement: 9604W1
Abstract: The reconstruction of solids model automatically and
semi-automatically from two-dimensional representations has been an
interesting research topic for a long time. Various different methods have
addressed this problem. In this paper, the considerable progress in this
aspect is reviewed and common problems analyzed. Moreover, development in
this area is proposed to secure a comprehensive scheme for the process. 36
Refs.
Title: VOLUME DECOMPOSITION AND FEATURE RECOGNITION .1. OBJECTS
Author(s): SAKURAI H
Corporate Source: COLORADO STATE UNIV,DEPT MECH ENGN/FT COLLINS//CO/80523
(Reprint)
Journal: COMPUTER-AIDED DESIGN, 1995, V27, N11 (NOV), P833-843
ISSN: 0010-4485
Language: ENGLISH Document Type: ARTICLE (Abstract Available)
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 03/09/96 01:17:15a
=========================================================================
Title: Geometrical evaluation of a composite feature in coordinate
metrology (1st report) -basic concepts and formulation-
Author: Okamoto, Hideaki; Sasaki, Toyoharu; Tanaka, Fumiki; Kishinami,
Takeshi
Source: Seimitsu Kogaku Kaishi/Journal of the Japan Society for Precision
Engineering v 62 n 1 Jan 1996. p 125-129
Publication Year: 1996
CODEN: SKKAEI ISSN: 0912-0289
Language: Japanese
Document Type: JA; (Journal Article) Treatment: T; (Theoretical)
Journal Announcement: 9604W3
Abstract: In coordinate metrology, when a certain geometrical relation
between features is specified due to functional requirements, it is
sometimes necessary to evaluate them as a lump. Such evaluation method,
however, has not been well developed. In this paper, therefore, a lump of
features is defined as a composite feature and its concept is described. In
addition, an evaluation method of a composite feature has been proposed. It
is based on fitting in position and orientation between a composite feature
model and measured data sets, which are obtained by the measurement of a
part using coordinate measuring machines. Two-plane and two-cylinder
composite features have been given and formulated as concrete examples of a
composite feature. Computer experiments have also been performed in both
examples and validity of the method has been confirmed. Proposed method is
easy to be extended to any other cases. (Author abstract) 10 Refs.
Title: Fractional central moment method for movement-invariant object
classification
Author: Heywood, M.I.; Noakes, P.D.
Corporate Source: Brunel Univ, Surrey, Engl
Source: IEE Proceedings: Vision, Image and Signal Processing v 142 n 4
Aug 1995. p 213-219
Publication Year: 1995
CODEN: IVIPEK ISSN: 1350-245X
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9604W3
Abstract: Within the context of moment methods for movement-invariant
feature vectors the authors derive a new 'low-level' moment method capable
of retaining scale and translation properties demonstrated by the
alternative central moment low-level moment method. The new low-level
moment method, denoted fractional central moments (FCM), provides a path
for expressing the high-level moment method of pseudo-Zernike moments in
terms of low-level moments, thus defining a set of feature vectors
providing invariance to translation, scale and rotation of objects
contained within the image space. The FCM representation provides more
moment method terms per order than alternative low-level moment methods,
thus it is shown to demonstrate greater image encoding/descriptive
properties at a given maximum moment method order. The authors quantify
differences between central and fractional central moment methods using
discriminant analysis as applied to a specific data set proposed for the
purpose of investigations described in a sequel paper quantifying neural
network generalisation ability. (Author abstract) 24 Refs.
Title: 2D SHAPE SEGMENTATION - A NEW APPROACH
Author(s): WU KN; LEVINE MD (Reprint)
Corporate Source: MCGILL UNIV,CTR INTELLIGENT MACHINES,3840 UNIV
ST/MONTREAL/PQ H3A 2A7/CANADA/ (Reprint); MCGILL UNIV,CTR INTELLIGENT
MACHINES/MONTREAL/PQ H3A 2A7/CANADA/; MCGILL UNIV,DEPT ELECT
ENGN/MONTREAL/PQ H3A 2A7/CANADA/
Journal: PATTERN RECOGNITION LETTERS, 1996, V17, N2 (FEB 8), P133-140
ISSN: 0167-8655
Language: ENGLISH Document Type: ARTICLE (Abstract Available)
=========================================================================
Surface fitting using convex Powell-Sabin splines.
Willemans, Karin (Department of Computer Science, Katholieke Universiteit
Leuven, 3030 Leuven (Heverlee), Belgium)
Dierckx, Paul (Department of Computer Science, Katholieke Universiteit
Leuven, 3030 Leuven (Heverlee), Belgium)
Corporate Source Codes: B-KUL-C; B-KUL-C
Journal of Computational and Applied Mathematics, 1994, 56, no. 3,
263--282. ISSN: 0377-0427 CODEN: JCAMDI
The Powell-Sabin splines are defined in terms of $B$-splines in order to
use their local support property. The Bernstein-Bezier representation used
leads to an efficient calculation with this $B$-spline approach. In this
paper, convexity conditions for Powell-Sabin splines are derived. For a
given set of scattered data, a surface fitting algorithm using convex
splines on triangulations is presented. Numerical examples of surface
fitting are given.
Shape-preserving interpolation by bivariate $C\sp 1$ quadratic splines.
Workshop on Computational Geometry (Torino, 1992)
Chui, C. K. (Department of Mathematics, Texas A & M University, College
Station, Texas, 77843)
Chui, H. C. (Department of Electrical Engineering, Stanford University,
Stanford, California, 94305)
He, T. X. (Department of Mathematics, Illinois Wesleyan University,
Bloomington, Illinois, 61702)
(He, Tian Xiao)
1993,
World Sci. Publishing, River Edge, NJ,; 21--75,,
Summary: ``Computational schemes and optimization algorithms for
interpolating discrete gridded data by piecewise quadratic $C\sp 1$
surfaces that preserve the shape characteristics of the data are
introduced. For this purpose, the interpolation properties of the space
$S\sb 2\sp 1(\Delta\sp {(2)}\sb {MN})$ are studied, a fundamental
interpolatory basis is constructed, and various shape criteria are
formulated. Also, some energy functionals are presented for the
characterization of optimal interpolants satisfying the required
shape-preservation criteria. Combining the results of these studies, we
have a scheme for constructing shape-preserving surfaces that satisfy the
criteria and are optimal as governed by the energy functionals. Some
examples based on linear and quadratic programmings are also presented.''
************* Forwarding note from SMTP--AHIPC2S 03/28/96 22:06 **************
=========================================================================
Title: 3D shape reconstruction by using vanishing points
Author: Parodi, Pietro; Piccioli, Giulia
Corporate Source: Univ of Genova, Genova, Italy
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
18 n 2 Feb 1996. p 211-217
Publication Year: 1996
CODEN: ITPIDJ ISSN: 0162-8828
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9605W1
Abstract: This paper investigates the quantitative reconstruction of the
3D structure of a scene from a line drawing, by using the geometrical
constraints provided by the location of vanishing points. The additional
information on vanishing points allows the design of an algorithm which has
several advantages with respect to the usual approach based on a reduction
to Linear Programming (Sugihara, 1982). These advantages range from a lower
computational complexity to error tolerance and exact reconstruction of the
3D-geometry of the objects. These features make the algorithm a useful tool
for the quantitative analysis of real-world images, which is useful for
several tasks from scene understanding to automatic vehicle guidance.
(Author abstract) 29 Refs.
Title: Illumination-invariant recognition of 3D objects using local color
invariants
Author: Slater, David; Healey, Glenn
Corporate Source: Univ of California, Irvine, CA, USA
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
18 n 2 Feb 1996. p 206-210
Publication Year: 1996
CODEN: ITPIDJ ISSN: 0162-8828
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9605W1
Abstract: Traditional approaches to three dimensional object recognition
exploit the relationship between three dimensional object geometry and two
dimensional image geometry. The capability of object recognition systems
can be improved by also incorporating information about the color of object
surfaces. Using physical models for image formation, we derive invariants
of local color pixel distributions that are independent of viewpoint and
the configuration, intensity, and spectral content of the scene
illumination. These invariants capture information about the distribution
of spectral reflectance which is intrinsic to a surface and thereby provide
substantial discriminatory power for identifying a wide range of surfaces
including many textured surfaces. These invariants can be computed
efficiently from color image regions without requiring any form of
segmentation. We have implemented an object recognition system that indexes
into a database of models using the invariants and that uses associated
geometric information for hypothesis verification and pose estimation. The
approach to recognition is based on the computation of local invariants and
is therefore relatively insensitive to occlusion. We present several
examples demonstrating the system's ability to recognize model objects in
cluttered scenes independent of object configuration and scene
illumination. The discriminatory power of the invariants has been
demonstrated by the system's ability to process a large set of regions over
complex scenes without generating false hypotheses. (Author abstract) 17
Refs.
Title: Conic reconstruction and correspondence from two views
Author: Quan, Long
Corporate Source: LIFIA-CNRS-INRIA, Grenoble, Fr
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
18 n 2 Feb 1996. p 151-160
Publication Year: 1996
CODEN: ITPIDJ ISSN: 0162-8828
Language: English
Document Type: JA; (Journal Article) Treatment: T; (Theoretical); X;
(Experimental)
Journal Announcement: 9605W1
Abstract: Conics are widely accepted as one of the most fundamental image
features together with points and line segments. The problem of space
reconstruction and correspondence of two conics from two views is addressed
in this paper. It is shown that there are two independent polynomial
conditions on the corresponding pair of conics across two views, given the
relative orientation of the two views. These two correspondence conditions
are derived algebraically and one of them is shown to be fundamental in
establishing the correspondences of conics. A unified closed-form solution
is also developed for both projective reconstruction of conics in space
from two uncalibrated camera views and metric reconstruction from two
calibrated camera views. Experiments are conducted to demonstrate the
discriminality of the correspondence conditions and the accuracy and
stability of the reconstruction both for simulated and real images. (Author
abstract) 29 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 03/30/96 18:05:03á
=========================================================================
Title: A POTENTIAL-BASED APPROACH FOR SHAPE MATCHING AND RECOGNITION
Author(s): CHUANG JH
Corporate Source: NATL CHIAO TUNG UNIV,DEPT COMP & INFORMAT SCI/HSINCHU
30050//TAIWAN/ (Reprint)
Journal: PATTERN RECOGNITION, 1996, V29, N3 (MAR), P463-470
ISSN: 0031-3203
Language: ENGLISH Document Type: ARTICLE (Abstract Available)
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 04/02/96 02:20:39á
=========================================================================
Title: Probabilistic framework for grouping image features
Author: Castano, Rebecca L.; Hutchinson, Seth
Corporate Source: Univ of Illinois at Urbana-Champaign, Urbana, IL, USA
Conference Title: International Symposium on Computer Vision, ISCV'95,
Proceedings
Conference Location: Coral Gables, FL, USA
Sponsor: IEEE
E.I. Conference No.: 44401
Source: Proceedings of the IEEE International Conference on Computer
Vision 1995. IEEE, Piscataway, NJ, USA,95TB100006. p 611-616
Publication Year: 1995
CODEN: PICVES
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9605W2
Abstract: We present a framework for determining probability
distributions over the space of possible image feature groupings. Such a
framework allows higher level processes to reason over many plausible
perceptual groupings in an image, rather than committing to a specific
image segmentation in the early stages of processing. We first derive an
expression for the probability that a set of features should be grouped
together, conditioned on the observed image data associated with those
features. This probability measure formalizes the principle that features
in an image should be grouped together when they participate in a common
underlying geometric structure. We then present a representation scheme in
which only those groupings with high probability are explicitly
represented, while large sets of unlikely grouping hypotheses are
implicitly represented. We present experimental results for a variety of
real intensity images. (Author abstract) 13 Refs.
Title: Appropriate-scale local centers: a foundation for parts-based
recognition
Author: Burns, J Brian; Nishihara, H. Keith; Rosenschein, Stanley J.
Corporate Source: Teleos Research, Palo Alto, CA, USA
Conference Title: International Symposium on Computer Vision, ISCV'95,
Proceedings
Conference Location: Coral Gables, FL, USA
Sponsor: IEEE
E.I. Conference No.: 44401
Source: Proceedings of the IEEE International Conference on Computer
Vision 1995. IEEE, Piscataway, NJ, USA,95TB100006. p 317-322
Publication Year: 1995
CODEN: PICVES
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9605W2
Abstract: An image representation in terms of local centers is developed
and motivated in the context of natural object recognition. Local centers
are visually compact regions that have significant internal-external
contrast in some measurement. Existing computational models of the concept
are compared, and a particular model, the appropriate-scale ridge, is
developed. In this model, local centers are defined as smoothed image
extrema that are also extrema, with respect to scale, in the second spatial
derivatives. The usefulness of the model is analyzed via 1D scale-space
behavior and demonstrated on 2D natural images. The basic concept of a
local center is also extended to color and shading data. The stability of
the shading model is demonstrated on images of a moving face under varying
illumination and tested via a face detection task. (Author abstract) 12
Refs.
Title: 3D part segmentation: a new physics-based approach
Author: Wu, Kenong; Levine, Martin D.
Corporate Source: McGill Univ, Montreal, Que, Can
Conference Title: International Symposium on Computer Vision, ISCV'95,
Proceedings
Conference Location: Coral Gables, FL, USA
Sponsor: IEEE
E.I. Conference No.: 44401
Source: Proceedings of the IEEE International Conference on Computer
Vision 1995. IEEE, Piscataway, NJ, USA,95TB100006. p 311-316
Publication Year: 1995
CODEN: PICVES
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical); X;
(Experimental)
Journal Announcement: 9605W2
Abstract: We propose a novel approach to 3D part segmentation. From
physics it is known that on the surface of a charged conductor, charge
tends to accumulate at a sharp convexity and vanish at a sharp concavity.
Thus object part boundaries, which are usually denoted by a sharp surface
concavity, can be detected by locating surface points exhibiting local
charge minima. Beginning with multiview range data of a 3D object, we
simulate the electrical charge distribution over an object's surface which
has been tessellated by a triangular mesh. We detect the deep surface
concavities by tracing local charge density minima and then decompose the
object into parts at these points. (Author abstract) 25 Refs.
Title: Matching and recognition using deformable intensity surfaces
Author: Nastar, Chahab; Pentland, Alex
Corporate Source: MIT, Cambridge, MA, USA
Conference Title: International Symposium on Computer Vision, ISCV'95,
Proceedings
Conference Location: Coral Gables, FL, USA
Sponsor: IEEE
E.I. Conference No.: 44401
Source: Proceedings of the IEEE International Conference on Computer
Vision 1995. IEEE, Piscataway, NJ, USA,95TB100006. p 223-228
Publication Year: 1995
CODEN: PICVES
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9605W2
Abstract: We describe a novel approach for matching and recognition,
based on deformable intensity surfaces. In this approach, the intensity
surface of the image is modeled as a deformable thin plate, and its strain
energy while deforming to a new image is measured for recognition. Each
surface point has 3 degrees of freedom, thus capturing fine surface
changes. The method is validated for recognition and interactive search in
a large-scale face database. (Author abstract) 29 Refs.
Title: Matching deformed Delaunay triangulations
Author: Finch, Andrew M.; Hancock, Edwin R.
Corporate Source: Univ of York, York, Engl
Conference Title: International Symposium on Computer Vision, ISCV'95,
Proceedings
Conference Location: Coral Gables, FL, USA
Sponsor: IEEE
E.I. Conference No.: 44401
Source: Proceedings of the IEEE International Conference on Computer
Vision 1995. IEEE, Piscataway, NJ, USA,95TB100006. p 31-36
Publication Year: 1995
CODEN: PICVES
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9605W2
Abstract: This paper describes a Bayesian framework for matching graphs
whose structure can be described in terms of triangular faces. Relational
structures of this sort are ubiquitous in intermediate level computer
vision, being exemplified by Delaunay graphs which represent the Voronoi
tessellation of an image plane. Our matching process is realised in terms
of probabilistic relaxation. The novelty of our method stems from its use
of a support function specified in terms of face-units of the graphs under
match. In this way we draw on more expressive constraints than is possible
at the level of edge-units alone. In order to apply this new relaxation
process to the matching of realistic imagery requires of model of the
compatibility between faces of the data and model graphs. We present a
particularly simple compatibility model that is entirely devoid of free
parameters. It requires only knowledge of the numbers of nodes, edges and
faces in the model graph. The resulting matching scheme is evaluated on
radar images and compared with its edge-based counterpart. (Author
abstract) 10 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 04/11/96 23:00:37á
=========================================================================
Title: Representing 3-D objects in range images using geons
Author: Nguyen, Quang-Loc; Levine, Martin D.
Corporate Source: Bell-Northern Research, Ottawa, Ont, Can
Source: CVIU: Computer Vision and Image Understanding v 63 n 1 Jan 1996.
p 158-168
Publication Year: 1996
CODEN: CVIUF4
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9605W3
Abstract: We propose an approach for representing an object by its
constituent parts and their spatial connections based on a set of primitive
volumes called geons previously introduced by Biederman. We utilize the
edge-junction graph of an object range image as input then decompose this
graph into different subgraphs which correspond to the constituent parts of
the object. For each part, edge characteristics guide us to an inference
regarding the corresponding geon shape. Also, the spatial connections among
these parts can be deduced from the concave edges and T-junctions. Several
experimental results with a laser rangefinder are presented. (Author
abstract) 25 Refs.
Title: Analyzing nonconvex 2D and 3D patterns
Author: Borgefors, Gunilla; di Baja, Gabriella Sanniti
Corporate Source: Swedish Univ of Agricultural Sciences, Uppsala, Sweden
Source: CVIU: Computer Vision and Image Understanding v 63 n 1 Jan 1996.
p 145-157
Publication Year: 1996
CODEN: CVIUF4
Language: English
Document Type: JA; (Journal Article) Treatment: T; (Theoretical)
Journal Announcement: 9605W3
Abstract: A nonconvex pattern can be analyzed by describing its concavity
regions. These can be identified by computing the difference between the
convex hull of the pattern and the pattern itself. A suitable approximation
of the convex hull can be obtained by repeatedly filling local concavities
of the pattern. Parallel and sequential algorithms are proposed, to fill
concavities of 2D and 3D patterns. The resulting approximation of the
convex hull is a covering polygon or polyhedron, which is either convex or
nearly convex. Exact measures of worst remaining concavities and created
protrusions are given. The concavity regions are extracted and different
features are presented and computed. Hierarchical pattern descriptions are
also suggested, based on the use of concavity trees. (Author abstract) 23
Refs.
Title: Multiresolution surface modeling based on hierarchical
triangulation
Author: Soucy, Marc; Laurendeau, Denis
Corporate Source: Laval Univ, Ste-Fey, Que, Can
Source: CVIU: Computer Vision and Image Understanding v 63 n 1 Jan 1996.
p 1-14
Publication Year: 1996
CODEN: CVIUF4
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9605W3
Abstract: This paper describes a sequential multiresolution surface
modeling technique. The initial model consists in a surface triangulation
resulting from the integration of a set of range views. Thereafter, a
hierarchical triangulation algorithm iteratively removes vertices of the
triangulation, always minimizing the retriangulation error. The
equiangularity of the surface triangulation is optimized in 3-D space
throughout the optimization process. Besides compressing surface
information, the proposed technique preserves the topology of the
triangulation and surface orientation discontinuities. Experimental models
built from complex multipart objects with holes are presented. (Author
abstract) 20 Refs.
Title: Feature sequencing in the rapid design system using a genetic
algorithm
Author: Kamhawi, Hilmi N.; Leclair, Steven R.; Chen, C.L. Philip
Corporate Source: Wright Lab, Wright-Patterson Air Force Base, OH, USA
Source: Journal of Intelligent Manufacturing v 7 n 1 Feb 1996. p 55-67
Publication Year: 1996
CODEN: JIMNEM ISSN: 0956-5515
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9605W3
Abstract: This paper addresses the feature sequencing problem in the
Rapid Design System (RDS). The RDS is a feature-based design system that
integrates product design and process planning. An important issue in
feature-based process planning for machined parts is the order in which
material is removed to form the resultant part. The order, or sequence, is
partially dependent on the geometric relationships between features. The
sequence affects the safety, the time it takes to machine the part, and the
quality of the finished part. The sequence of material removal depends on
two types of relations between features: (1) intersections and (2)
interfeature associations. Both types of relations compound the search for
an 'optimal' sequence of material removal. Therefore, the research problem
has been the discovery and development of a genetic algorithm (GA) that
efficiently searches the solution space for all possible sequences and
identifies the best sequences in terms of safety, time and quality. (Author
abstract) 10 Refs.
Title: Structural model for shape recognition using neural nets
Author: Ventura, Jose A.; Chen, Jen-Ming
Corporate Source: Pennsylvania State Univ, University Park, PA, USA
Source: Journal of Intelligent Manufacturing v 7 n 1 Feb 1996. p 1-11
Publication Year: 1996
CODEN: JIMNEM ISSN: 0956-5515
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications); T;
(Theoretical)
Journal Announcement: 9605W3
Abstract: Shape representation and recognition is an important topic in
many applications of computer vision and artificial intelligence, including
character recognition, pattern recognition, machine monitoring, robot
manipulation and production part recognition. In this paper, a structural
model based on boundary information is proposed to describe the silhouette
of planar objects (especially machined parts). The structural model
describes objects by a set of primitives, each of which is represented by
three geometric features: its length, curvature, and relative orientation.
This representation scheme not only compresses the data, but also provides
a compact and meaningful form to facilitate further recognition operations.
Based on this model, the object recognition is accomplished by using a
multilayered feedforward neural network. The proposed model is
transformation invariant, which offers the necessary flexibility for
real-time implementation in automated manufacturing systems. In addition,
the numerical results for a set of ten reference shapes indicate that the
matching engine can achieve very high success rates using short recognition
times. (Author abstract) Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 04/13/96 19:07:43á
=========================================================================
Title: A NEW APPROACH TO IMAGE FEATURE DETECTION WITH APPLICATIONS
Author(s): MANJUNATH BS; SHEKHAR C; CHELLAPPA R
Corporate Source: UNIV CALIF SANTA BARBARA,DEPT ELECT & COMP ENGN/SANTA
BARBARA//CA/93106 (Reprint); UNIV MARYLAND,CTR AUTOMAT RES/COLLEGE
PK//MD/20742
Journal: PATTERN RECOGNITION, 1996, V29, N4 (APR), P627-640
Title: AN OBJECT-SPECIFIC IMAGE TEXTURE ANALYSIS OF H-RESOLUTION FOREST
IMAGERY
Author(s): HAY GJ; NIEMANN KO; MCLEAN GF
Corporate Source: UNIV VICTORIA,DEPT GEOG,POB 3050/VICTORIA/BC V8W
3P5/CANADA/ (Reprint); UNIV VICTORIA,DEPT MECH ENGN/VICTORIA/BC V8W
3P5/CANADA/
Journal: REMOTE SENSING OF ENVIRONMENT, 1996, V55, N2 (FEB), P108-122
Abstract: A new structural image-texture technique, termed the triangulated
primitive neighborhood method (TPN), is employed to investigate the
variable spatial characteristics of high-resolution forest objects, as
modeled by a Compact Airborne Spectrographic Imager data set. Based on
current psychophysical texture theory, this technique incorporates
location-specific primitives and a variable-sized and shaped moving
kernel to automatically provide object- and area-specific regularized
images. These object-rich, but variance-reduced images allow a
traditional classifier to be used on a complex high-resolution forest
data set with improved accuracy. The robustness of this technique is
evaluated by comparing the maximum likelihood classification accuracy
of nine forest classes generated from a combination of the grey level
cooccurrence matrix method, semivariance, and customized filters,
against those derived from the TPN method. By including into the
classification scheme an object-specific channel that models crown
density, the highest overall classification accuracy (78 %) from all
techniques is achieved with the TPN method.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 05/08/96 21:52:44á
=========================================================================
Title: Model for representing topological relationships between complex
geometric features in spatial databases
Author: Clementini, Eliseo; Di Felice, Paolino
Corporate Source: Universita di L'Aquila, Poggio di Roio, Italy
Source: Information Sciences v 90 n 1-4 Apr 1996. p 121-136
Publication Year: 1996
Abstract: Various models for the representation of topological
relationships have been developed. The aim of this paper is to show that
the set of relationships proposed in left bracket 7 right bracket (the
CBM), for describing topological relationships among two-dimensional simple
features, is applicable with few modifications to the case of complex
features (that is, areas made up of several components possibly containing
holes, lines with self-intersections, and/or more than two endpoints, and
so on). The CBM offers a small set of topological relationships with high
expressiveness which is proven to be mutually exclusive and complete, and
therefore suitable to be embedded in a spatial query language. (Author
abstract) 27 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 05/11/96 20:26:37á
=========================================================================
Title: ORTHOGONAL MOMENT FEATURES FOR USE WITH PARAMETRIC AND
NON-PARAMETRIC CLASSIFIERS
Author(s): BAILEY RR; SRINATH M
Corporate Source: NATL TAIWAN NORMAL UNIV/TAIPEI//TAIWAN/ (Reprint); SO
METHODIST UNIV/DALLAS//TX/75275
Journal: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE,
1996, V18, N4 (APR), P389-399
Title: INTEGRATION OF FUNCTIONAL AND FEATURE-BASED PRODUCT MODELLING - THE
IMS/GNOSIS EXPERIENCE
Author(s): RANTA M; MANTYLA M; UMEDA Y; TOMIYAMA T
Corporate Source: HELSINKI UNIV TECHNOL,LAB INFORMAT PROC SCI,PROD
MODELLING & REALIZAT GRP,12 INNOPOLI/SF-02150 ESPOO//FINLAND/ (Reprint)
; UNIV TOKYO,FAC ENGN,DEPT PRECIS MACHINERY ENGN,BUNKYO KU/TOKYO
113//JAPAN/
Journal: COMPUTER-AIDED DESIGN, 1996, V28, N5 (MAY), P371-381
Title: FEATURE BASED APPROACH FOR SET UP MINIMIZATION OF PROCESS DESIGN
FROM PRODUCT DESIGN
Author(s): CHU CCP; GADH R
Corporate Source: UNIV WISCONSIN,DEPT MECH ENGN/MADISON//WI/53706 (Reprint)
Journal: COMPUTER-AIDED DESIGN, 1996, V28, N5 (MAY), P321-332
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 05/21/96 20:27:48á
=========================================================================
Title: Geometric feature extraction using the chord transformation
Author: Selvage, John E.; Chenoweth, Darrel L.; Gold, V. Edward
Corporate Source: Univ of Louisville, Louisville, KY, USA
Conference Title: Proceedings of the 1996 IEEE Aerospace Applications
Conference. Part 4 (of 4)
Conference Location: Snowmass, CO, USA
Sponsor: IEEE
E.I. Conference No.: 44611
Source: IEEE Aerospace Applications Conference Proceedings v 4 1996.
IEEE, Los Alamitos, CA, USA,96CH35904. p 399-405
Publication Year: 1996
Abstract: Geometric feature extraction can play an important role in the
understanding of the content of an image. Methods such as the Hough
transform left bracket 1,2 right bracket are useful, but are subject to
restrictions imposed by scale and object orientation. This paper describes
the chord transform, not widely used to date, primarily due to the
computational requirements. The chord transform can be used to detect
geometric edge structural content within an image. Various adaptations of
the chord transform, its implementation, and some practical applications in
geometric feature extraction are discussed in this paper. (Author abstract)
6 Refs.
Title: Shape description by medial surface construction
Author: Sheehy, Damian J.; Armstrong, Cecil G.; Robinson, Desmond J.
Corporate Source: Hibbitt, Karlsson and Sorensen Inc, Pawtucket, RI, USA
Source: IEEE Transactions on Visualization and Computer Graphics v 2 n 1
Mar 1996. p 62-72
Publication Year: 1996
Abstract: The medial surface is a skeletal abstraction of a solid that
provides useful shape information, which compliments existing model
representation schemes. The medial surface and its associated topological
entities are defined, and an algorithm for computing the medial surface of
a large class of B-rep solids is then presented. The algorithm is based on
the domain Delaunay triangulation of a relatively sparse distribution of
points, which are generated on the boundary of the object. This strategy is
adaptive in that the boundary point set is refined to guarantee a correct
topological representation of the medial surface. (Author abstract) 16
Refs.
Title: Algorithm for the medial axis transform of 3D polyhedral solids
Author: Sherbrooke, Evan C.; Patrikalakis, Nicholas M.; Brisson, Erik
Corporate Source: New Technologies, Inc, Bedford, MA, USA
Source: IEEE Transactions on Visualization and Computer Graphics v 2 n 1
Mar 1996. p 44-61
Abstract: The medial axis transform (MAT) is a representation of an
object which has been shown to be useful in design, interrogation,
animation, finite element mesh generation, performance analysis,
manufacturing simulation, path planning, and tolerance specification. In
this paper, an algorithm for determining the MAT is developed for general
3D polyhedral solids of arbitrary genus without cavities, with nonconvex
vertices and edges. The algorithm is based on a classification scheme which
relates different pieces of the medial axis (MA) to one another even in the
presence of degenerate MA points. Vertices of the MA are connected to one
another by tracing along adjacent edges, and finally the faces of the axis
are found by traversing closed loops of vertices and edges. Representation
of the MA and associated radius function is addressed, and pseudocode for
the algorithm is given along with recommended optimizations. A connectivity
theorem is proven to show the completeness of the algorithm. Complexity
estimates and stability analysis for the algorithms are presented. Finally,
examples illustrate the computational properties of the algorithm for
convex and nonconvex 3D polyhedral solids with polyhedral holes. (Author
abstract) 52 Refs.
Title: Function representation for sweeping by a moving solid
Author: Sourin, Alexi I.; Pasko, Alexander A.
Corporate Source: Nanyang Technological Univ, Singapore, Singapore
Source: IEEE Transactions on Visualization and Computer Graphics v 2 n 1
Mar 1996. p 11-18
Abstract: This paper studies a function representation of point sets
swept by moving solids. The original solid-generator is defined by an
inequality f(x, y, z, t) greater than equivalent to O where x, y, z are
Cartesian coordinates and t is treated as the time. This definition allows
us to include solids which change their shapes in time. Constructive solids
can be used as generators also when described by R-functions. The
trajectory of the generator can be defined in parametric form as movement
of its local coordinate system. In the paper, we did it with superposition
of time-dependent affine transformations. To get the function
representation F(x, y, z) greater than equivalent to O of the swept solid,
we apply the concept of envelope used before basically for boundary
represented objects. We have reduced the problem of swept solid description
to global extremum search by t variable. The algorithm of procedural swept
solid modeling is discussed. The benefit of our model is that it is applied
not only for visualization but allows one to use the swept solid as an
argument for other operations. For example, the swept solid can be
intersected with other ones that are useful for the implementation of such
operations as cutting and drilling. Ordinary texture mapping and
hypertexturing can also be applied to it. The possibility of using a
functionally defined generator with the variable shape allows us to achieve
a complexity of the swept solids which was hardly possible before. (Author
abstract) 33 Refs.
Title: Feature-based geometric modelling and analysis of multibody
mechanical system behaviour
Author: Play, D.; Rigal, J.F.; Endrody, Tamas
Corporate Source: INSA de Lyon
Source: Periodica Polytechnica, Mechanical Engineering v 39 n 2 1995. p
131-150
Abstract: The aim of this paper is to present a modelling system and an
application to analyse the mechanical behaviour of a gear-box. Designing a
new type of gear-box, there is a real need for the concurrent engineering
activities of the designers of geometric modelling, mesh generation and
mechanical analysis. In this system own developed contact types of finite
elements (FEM) have been used. The new system contains some programs of the
earlier system ASSYM (CASM Lab.) for modelling the casing as the
superstructure of a gear-box and its bearings as FEM contact-macroelements.
In the proposed system the designers can use the modeller CAEDS (IBM Corp.)
for feature-based geometric modelling and for generating the global mesh
model of casing, the FEM analysis processor Mac/NASTRAN (MacNeal-Schwendler
Corp.) and the new version of the N SIM program (CASM Lab.) for modelling
the pairs of gears and the bearings, furthermore the New Grid (N.G.)
preprocessor (CASM Lab.). The N.G. can introduce the local mesh models of
macroelements to the global mesh of gear-box casing. (Author abstract) 9
Refs.
Title: Implementation and uniform management of modelling entities in a
massively feature-object oriented advanced CAD environment
Author: Horvath, Imre; Kulcsar, Peter; Gabor, Zsolt; Bagoly, Zoltan;
Horvath, Antal; Thernesz, Vilmos
Corporate Source: Technical Univ of Budapest, Budapest, Hung
Source: Periodica Polytechnica, Mechanical Engineering v 39 n 2 1995. p
81-113
Publication Year: 1995
Abstract: Today we are spectators of the transition process in computer
aided design from traditional geometry based on design systems to advanced
computer-based engineering systems. The key is the feature technology that
allows both integrating and managing modelling entities in a coherent way.
Feature technology is developing rapidly. New research topics and contexts
are emerging from time to time. This paper introduces concept, design and
technological feature-objects to support operational, structural and
morphological modelling of mechanical products. First, the feature-centred
approaches to conceptual design are summarized and evaluated. Then an
implementation of concept feature-objects and the methodology for using
them is presented. The strength of concept feature-objects is in their
morphology inclusive nature. They appear as parametrized three-dimensional
skeletons providing geometrical representations for the modelled
engineering conceptions. A concept feature-object models the physical
ports, contact surfaces related to ports, bones between ports, DOF of
ports, relevant physical parameters, scientific and empirical descriptions
of intentional transformations and environmental effects. Concept
feature-objects are related to design feature-objects that, in turn, are
constructed of a relevant set of technological feature-entities. Concept
feature-objects refer to the configurable and parametrized design feature
objects through an indexing mechanism. The conceptions have been tested
during the programming and further development of the authors' PRODES
system. (Author abstract) Refs.
Title: Geometric reasoning for intelligent manufacturing
Author: Requicha, Aristides A.G.
Source: Communications of the ACM v 39 n 2 Feb 1996. p 71-76
Publication Year: 1996
CODEN: CACMA2 ISSN: 0001-0782
Language: English
Document Type: JA; (Journal Article) Treatment: A; (Applications)
Journal Announcement: 9606W5
Abstract: This article argues that a blend of artificial intelligence
techniques and geometric computation can tackle the difficulties in
automated manufacturing of reasoning about the geometry of products. To
support this claim, discussed are two systems developed recently at USC's
Programmable Automation Laboratory. One recognizes machinable features in a
product's model and the other generates high-level process plans for
dimensional inspection. 15 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 06/07/96 22:54:36á
=========================================================================
Title: PARAMETRIC SHAPE RECOGNITION USING A PROBABILISTIC INVERSE THEORY
Author(s): ARBEL T; WHAITE P; FERRIE FP
Corporate Source: MCGILL UNIV,CTR INTELLIGENT MACHINES/MONTREAL/PQ/CANADA/
(Reprint)
Journal: PATTERN RECOGNITION LETTERS, 1996, V17, N5 (MAY 1), P491-501
Title: Umbilics and lines of curvature for shape interrogation
Author: Maekawa, T.; Wolter, F.-E.; Patrikalakis, N.M.
Corporate Source: Massachusetts Inst of Technology, Cambridge, MA, USA
Source: Computer Aided Geometric Design v 13 n 2 Mar 1996. p 133-161
Abstract: This paper describes a method to extract the generic features
of free-form parametric surfaces for shape interrogation. The umbilical
points, which are the singular points of the orthogonal net of lines of
curvature, have generic features and may act like fingerprints for shape
recognition. We investigate the generic features of the umbilics and
behavior of lines of curvature which pass through an umbilic on a
parametric free-form surface. Our method is based on a coordinate
transformation to set the parametric surface in Monge form and on a Taylor
expansion to compute the angles of the tangent lines to the lines of
curvatures at an umbilic. We also develop a novel and practical criterion
which assures the existence of local antenna of principal curvature
functions at umbilical points. Finally, numerical experiments illustrate
how the generic features of the umbilics can be applied for surface
recognition.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 06/14/96 21:51:06á
=========================================================================
Title: EXTRACTION OF PARAMETRIC DESCRIPTIONS OF CIRCULAR GCS FROM A PAIR OF
CONTOURS FOR 3-D SHAPE RECOGNITION
Author(s): CHUNG JM; NAGATA T
Corporate Source: KYUSHU UNIV,DEPT COMP SCI & COMMUN ENGN,HIGASHIKU,6-10-1
HAKOZAKI/FUKUOKA 812//JAPAN/ (Reprint)
Journal: PATTERN RECOGNITION, 1996, V29, N6 (JUN), P903-917
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 06/20/96 20:39:54á
=========================================================================
Title: VOLUME DECOMPOSITION AND FEATURE RECOGNITION .2. CURVED OBJECTS
Author(s): SAKURAI H; DAVE P
Corporate Source: COLORADO STATE UNIV,DEPT MECH ENGN/FT COLLINS//CO/80523
(Reprint)
Journal: COMPUTER-AIDED DESIGN, 1996, V28, N6-7 (JUN-JUL), P519-537
Title: ROBUST INTERVAL ALGORITHM FOR CURVE INTERSECTIONS
Author(s): HU CY; MAEKAWA T; SHERBROOKE EC; PATRIKALAKIS NM
Corporate Source: MIT,DEPT OCEAN ENGN,DESIGN LAB/CAMBRIDGE//MA/02139
(Reprint)
Journal: COMPUTER-AIDED DESIGN, 1996, V28, N6-7 (JUN-JUL), P495-506
Title: FEATURE DECOMPOSITION FROM SOLID MODELS FOR AUTOMATIC FLATTENING
Author(s): CHUANG SH; HUANG SF
Corporate Source: NATL CHUNGHSING UNIV,DEPT MECH ENGN/TAICHUNG 402//TAIWAN/
(Reprint)
Journal: COMPUTER-AIDED DESIGN, 1996, V28, N6-7 (JUN-JUL), P473-481
Title: A REPRESENTATION FORMALISM FOR FEATURE-BASED DESIGN
Author(s): KIM CS; OGRADY PJ
Corporate Source: SAMSUNG DATA SYST CO LTD,219-1 MIGUN DONG,SEODAEMUN
GU,IMKWANG BLDG,CPO BO/SEOUL//SOUTH KOREA/ (Reprint); UNIV IOWA,DEPT
IND ENGN/IOWA CITY//IA/52242
Journal: COMPUTER-AIDED DESIGN, 1996, V28, N6-7 (JUN-JUL), P451-460
Title: Extraction of form error features using the simulated annealing
method with Bezier templates
Author: Kase, Kiwamu; Suzuki, Hiromasa; Kimura, Fumihiko
Source: Seimitsu Kogaku Kaishi/Journal of the Japan Society for Precision
Engineering v 62 n 4 Apr 1996. p 522-525
Publication Year: 1996
CODEN: SKKAEI ISSN: 0912-0289
Language: Japanese
Document Type: JA!(Journal Article) Treatment: T!(Theoretical)
Journal Announcement: 9608W2
Abstract: Geometrical errors by manufacturing processes have been
evaluated by the maximum width of tolerance zones which envelop the actual
features. Details of error within such zones should however be investigated
when the designer studies relation between errors and functionality of a
product and compares and examines manufacturing methods to realize high
accuracy for machined surfaces. A new method is proposed for the evaluation
of form errors using a series of points such as measuring points on the
product surfaces. This evaluation consists of two parts: 1. Form error
features which consist of error models (Bezier Template) and error
conditions, 2. Segmentation by fitting of form error features using the
Simulated Annealing Method. Form error models are defined as a series of
quadric or cubic Bezier curves. A set of Bezier control points can be used
for classifying or characterizing typical geometrical errors. Segmentation
and fitting of these form error features are realized by the Simulated
Annealing Method, a statistical optimization method which can be used to
search for the global minimum solution of a combinatrial problem. Our
method allows the designer to estimate the effects of errors on
functionality by using fitting Form Error Features as a substitute. This
leads to functional tolerancing. (Author abstract) 6 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 07/23/96 22:40:22á
=========================================================================
Title: Constraint-based feature recognition: handling non-uniqueness in
feature interactions
Author: Yang, Ming-Hsuan; Marefat, Michael M.
Corporate Source: Univ of Arizona, Tucson, AZ, USA
Conference Title: Proceedings of the 1996 13th IEEE International
Conference on Robotics and Automation. Part 2 (of 4)
Conference Location: Minneapolis, MN, USA
Sponsor: IEEE
E.I. Conference No.: 44943
Source: Proceedings - IEEE International Conference on Robotics and
Automation v 2 1996. IEEE, Piscataway, NJ, USA,96CB35857. p 1505-1510
Abstract: The feature recognition problem is formulated as a geometric
constraint satisfaction problem (GCSP), in which variables are the faces in
the delta volume, the possible feature classifications determine values for
the variables, and the constraints are the geometric and topological
properties between the variables. A novel representation language is
proposed to encode more, and somewhat redundant, information about
geometric and topological properties in form features. The redundant
information adds more constraints amongst objects in feature interactions
and thus helps in feature recognition. Moreover, the language can be
extended to represent new features. (Author abstract) 10 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 07/30/96 10:07:23á
=========================================================================
Title: Generation of uniform expressions from CSG non-unique
representations
Author: Li, Y.B.; Delves, B.; Blount, G.N.; Ghosh, S.K.; Wang, X.C.
Corporate Source: Staffordshire Univ, Stafford, Engl
Conference Title: Proceedings of the 1993 International Conference on
Advances in Material & Processing Technologies, AMPT'93
Conference Location: Dublin, Irel
Source: Journal of Materials Processing Technology v 56 n 1-4 Jan 1996. p
706-717
Abstract: Non-uniqueness of the tree representations is a well-known
problem in feature extraction from the output of a CSG solid modelling
system. Three main causes of the problem are examined and the most commonly
occurred one is dealt with in this paper. Based on the achievement of
position relationships between orthogonal primitive objects, an approach
for solving the non-uniqueness stemming from multiple definitions for an
identical object is detailed. To demonstrate the methodology of the
approach, an object with the machining feature of a square slot is
illustrated. (Author abstract) 11 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 08/12/96 01:15:05á
=========================================================================
Title: SHAPE ANALYSIS USING HYBRID LEARNING
Author(s): BALA J; WECHSLER H
Corporate Source: GEORGE MASON UNIV,DEPT COMP SCI/FAIRFAX//VA/22030
(Reprint)
Journal: PATTERN RECOGNITION, 1996, V29, N8 (AUG), P1323-1333
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 08/21/96 19:58:33á
=========================================================================
Title: Metric-topological approach to shape representation and
recognition
Author: Verri, Alessandro; Uras, Claudio
Corporate Source: Universita di Genova, Genova, Italy
Source: Image and Vision Computing v 14 n 3 Apr 1996. p 189-207
Abstract: Visual shape can be represented by means of certain integer
valued functions of two real variables called size functions. This paper
presents the theory of size functions in detail and discusses several
useful properties of size functions, like stability to small shape changes
and invariance to transformations of increasing generality. Then, a scheme
for shape recognition based on size functions is described and tested on a
study case. It is concluded that size functions can be very useful for
shape representation and recognition. (Author abstract) 30 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 09/05/96 20:15:49á
=========================================================================
Title: Feature correspondence by interleaving shape and texture
computations
Author: Beymer, David
Corporate Source: Univ of California, Berkeley, CA, USA
Conference Title: Proceedings of the 1996 IEEE Computer Society
Conference on Computer Vision and Pattern Recognition
Source: Proceedings of the IEEE Computer Society Conference on Computer
Vision and Pattern Recognition 1996. IEEE, Los Alamitos, CA, USA, p 921-928
Abstract: The correspondence problem in computer vision is basically a
matching task between two or more sets of features. In this paper, we
introduce a vectorized image representation, which is a feature-based
representation where correspondence has been established with respect to a
reference image. The representation consists of two image measurements made
at the feature points: shape and texture. Feature geometry, or shape, is
represented using the (x,y) locations of features relative to the some
standard reference shape. Image grey levels, or texture, are represented by
mapping image grey levels onto the standard reference shape. Computing this
representation is essentially a correspondence task, and in this paper we
explore an automatic technique for 'vectorizing' face images. Our face
vectorizer alternates back and forth between computation steps for shape
and texture, and a key idea is to structure the two computations so that
each one uses the output of the other. In addition to describing the
vectorizer, an application to the problem of facial feature detection will
be presented. (Author abstract) 16 Refs.
Title: Indexing to 3D model aspects using 2D contour features
Author: Chen, Jin-Long; Stockman, George C.
Corporate Source: Michigan State Univ, East Lansing, MI, USA
Conference Title: Proceedings of the 1996 IEEE Computer Society
Conference on Computer Vision and Pattern Recognition
Source: Proceedings of the IEEE Computer Society Conference on Computer
Vision and Pattern Recognition 1996. IEEE, Los Alamitos, CA, USA, p 913-920
Abstract: We present a shape-based method of indexing to model aspects
from a single intensity image. Objects are assumed to be rigid. A model
aspect is represented by a 2 one half D edgemap and the parts of the object
silhouette. Part decomposition is derived from a codon representation of
the object silhouette. Invariant features extracted from each part are then
used to index into a hash table to generate model-aspect hypotheses.
Knowledge about parts is incorporated in voting schemes to order hypotheses
for efficient verification of candidate models. Verification of
model-aspect hypotheses is carried out by an alignment algorithm that is
robust to partial occlusion. Results of tests using 658 model aspects from
100 objects demonstrate that accurate recognition can be achieved with very
few verification attempts. (Author abstract)
Title: Connectionist networks for feature indexing and object recognition
Author: Olson, Clark F.
Corporate Source: Cornell Univ, Ithaca, NY, USA
Conference Title: Proceedings of the 1996 IEEE Computer Society
Conference on Computer Vision and Pattern Recognition p 907-912
Abstract: Feature indexing techniques are promising for object
recognition since they can quickly reduce the set of possible matches for a
set of image features. This work exploits another property of such
techniques. They have inherently parallel structure and connectionist
network formulations are easy to develop. Once indexing has been performed,
a voting scheme such as geometric hashing can be used to generate object
hypotheses in parallel. We describe a framework for the connectionist
implementation of such indexing and recognition techniques. With sufficient
processing elements, recognition can be performed in a small number of time
steps. The number of processing elements necessary to achieve peak
performance and the fan-in/fan-out required for the processing elements is
examined. These techniques have been simulated on a conventional
architecture with good results. (Author abstract) 17 Refs.
Title: On 3D shape similarity
Author: Shum, Heung-Yeung; Hebert, Martial; Ikeuchi, Katsushi
Corporate Source: Carnegie Mellon Univ, Pittsburgh, PA, USA
Source: Proceedings of the IEEE Computer Society Conference on Computer
Vision and Pattern Recognition 1996. IEEE, Los Alamitos, CA, USA, p 526-531
Abstract: This paper addresses the problem of 3D shape similarity between
closed surfaces. A curved or polyhedral 3D object of genus zero is
represented by a mesh that has nearly uniform distribution with known
connectivity among mesh nodes. A shape similarity metric is defined based
on the L//2 distance between the local curvature distributions over the
mesh representations of the two objects. For both convex and concave
objects, the shape metric can be computed in time O(n**2), where n is the
number of tessellations of the sphere or the number of meshes which
approximate the surface. Experiments show that our method produces good
shape similarity measurements. (Author abstract) 24 Refs.
Title: Taking advantage of image-based and geometry-based constraints to
recover 3-D surfaces
Author: Fua, P.; Leclerc, Y.G.
Corporate Source: SRI Int, Menlo Park, CA, USA
Source: CVIU: Computer Vision and Image Understanding v 64 n 1 Jul 1996.
p 111-127
Abstract: A unified framework for 3-D shape reconstruction allows us to
combine image-based and geometry-based information sources. The image
information is akin to stereo and shape-from-shading, while the geometric
information may be provided in the form of 3-D points, 3-D features, or 2-D
silhouettes. A formal integration framework is critical in recovering
complicated surfaces because the information from a single source is often
insufficient to provide a unique answer. Our approach to shape recovery is
to deform a generic object-centered 3-D representation of the surface so as
to minimize an objective function. This objective function is a weighted
sum of the contributions of the various information sources. We describe
these various terms individually, our weighting scheme, and our
optimization method. Finally, we present results on a number of difficult
images of real scenes for which a single source of information would have
proved insufficient. (Author abstract) 38 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 09/06/96 23:54:51á
=========================================================================
TITLE: GENERATING REDESIGN SUGGESTIONS TO REDUCE SETUP COST - A STEP
TOWARDS AUTOMATED REDESIGN
AUTHOR(S): DAS D; GUPTA SK; NAU DS
CORPORATE SOURCE: UNIV MARYLAND,DEPT MECH ENGN/COLLEGE PK//MD/20742
(Reprint); UNIV MARYLAND,SYST RES INST/COLLEGE PK//MD/20742; CARNEGIE
MELLON UNIV,INST ROBOT/PITTSBURGH//PA/15213
PUBLICATION: COMPUTER-AIDED DESIGN, 1996, V28, N10 (OCT), P763-782
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 09/14/96 00:36:18á
=========================================================================
Title: Modeler independent procedural interfaces for solid modeling
Author: Han, JungHyun; Requicha, Aristides A.G.
Corporate Source: Univ of Southern California, Los Angeles, CA, USA
Source: Proceedings of Computer Graphics International Conference, CGI
1996. IEEE, Los Alamitos, CA, USA,96TB100030. p 176-183
Abstract: This paper describes modeler independent application
programming interfaces called adaptors. A solid modeler is augmented with
an adaptor so as to provide a standard procedural interface to applications
and function as a geometric server. Adaptors give the applications
portability and free the application programmers from the details of
specific modelers. Adaptors have been developed at USC for two different
modelers, PADL-2 (a Constructive Solid Geometry system) and Parasolid (a
boundary modeler). The issues raised in adaptor development and their
solutions are discussed. Adaptors are routinely used at USC in a
distributed environment where a solid modeler augmented with an adaptor, an
application, and a renderer run as separate processes and communicate with
one another through local area networks. (Author abstract) 16 Refs.
Title: Unified approach to free-form and regular feature modeling
Author: Toenshoff, H.K.; Aurich, J.C.; Ehrmann, M.; D'Agostino, N.
Corporate Source: Universitaet Hannover, Hannover, Ger
Source: CIRP Annals - Manufacturing Technology v 45 n 1 1996. p 125-128
Abstract: Feature based design for objects with prismatic or conic
geometry - also called regular geometry - has proven to be a valuable tool
for the designer. Typical examples for design features are slots, pockets,
borings or chamfers. Recent research has addressed the use of freeform
features in the design of sculptured surfaces. Here, dedicated surface
modeling systems and specialized surface models have been used for geometry
representation resulting in a separation from existing feature modelers
which typically use a solid modeler as a geometry engine. This paper
presents a method for the integration of freeform and regular features
within one data structure. (Author abstract) 10 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/11/96 01:16:01á
=========================================================================
TITLE: A fast structure-adaptive evaluation of local features in images
AUTHOR(S): Palenichka RM (REPRINT) ; Zinterhof P
CORPORATE SOURCE: INST PHYS & MECH,NAUKOVA ST 5/LVOV//UKRAINE/ (REPRINT);
SALZBURG UNIV,/A-5020 SALZBURG//AUSTRIA/
PUBLICATION: PATTERN RECOGNITION, 1996, V29, N9 (SEP), P1495-1505
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/19/96 00:11:30á
=========================================================================
TITLE: Geometric reasoning for the extraction of form features
AUTHOR(S): Qamhiyah AZ; Venter RD; Benhabib B
CORPORATE SOURCE: UNIV TORONTO,DEPT MECH ENGN, COMP INTEGRATED MFG LAB, 5
KINGS COLL RD/TORONTO/ON M5S 3G8/CANADA/ (REPRINT); UNIV TORONTO,DEPT
MECH ENGN, COMP INTEGRATED MFG LAB/TORONTO/ON M5S 3G8/CANADA/
PUBLICATION: COMPUTER-AIDED DESIGN, 1996, V28, N11 (NOV), P887-903
TITLE: Cost evaluation in design with form features
AUTHOR(S): Feng CX; Kusiak A; Huang CC
CORPORATE SOURCE: UNIV IOWA,DEPT IND ENGN, INTELLIGENT SYST LAB/IOWA
CITY//IA/52242 (REPRINT); UNIV IOWA,DEPT IND ENGN, INTELLIGENT SYST
LAB/IOWA CITY//IA/52242; PENN STATE UNIV,HINTZ MFG TECHNOL
LAB/READING//PA/19610
PUBLICATION: COMPUTER-AIDED DESIGN, 1996, V28, N11 (NOV), P879-885
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/25/96 21:57:37á
=========================================================================
TITLE: Comparison between the morphological skeleton and morphological
shape decomposition
AUTHOR(S): Reinhardt JM; Higgins WE
CORPORATE SOURCE: UNIV IOWA,COLL MED, DEPT RADIOL, DIV PHYSIOL IMAGING/IOWA
CITY//IA/52242 (REPRINT); PENN STATE UNIV,DEPT ELECT ENGN/UNIVERSITY
PK//PA/16802
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1996, V18, N9 (SEP), P951-957
TITLE: Computing horizontal/vertical convex shape's moments on
reconfigurable meshes
AUTHOR(S): Chung KL
CORPORATE SOURCE: NATL TAIWAN INST TECHNOL,DEPT INFORMAT MANAGEMENT, SECT
4, KEELUNG RD/TAIPEI 10672//TAIWAN/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION, 1996, V29, N10 (OCT), P1713-1717
TITLE: Parts of planar shapes
AUTHOR(S): Abe K; Arcelli C; Hisajima T; Ibaraki T
CORPORATE SOURCE: SHIZUOKA UNIV,DEPT COMP SCI/HAMAMATSU/SHIZUOKA 432/JAPAN/
(REPRINT); CNR,IST CIBERNET/I-80072 ARCO//ITALY/
PUBLICATION: PATTERN RECOGNITION, 1996, V29, N10 (OCT), P1703-1711
Title: 3-D object recognition using a genetic algorithm
Author: Kawaguchi, Tsuyoshi; Baba, Takeharu
Corporate Source: Oita Univ, Oita, Jpn
Conference Title: Proceedings of the 1996 IEEE International Symposium on
Circuits and Systems, ISCAS. Part 3 (of 4)
Source: Circuits and Systems Connecting the World Proceedings - IEEE
International Symposium on Circuits and Systems v 3 1996. IEEE, Piscataway,
NJ, USA,96CB35876. p 321-324
Abstract: The multiple-view approach is the most typical approach for the
3-D object recognition. This approach models each 3-D object by a
collection of 2-D projections from various viewing angles. An advantage of
the multiple-view approach over other approaches for 3-D object recognition
is that it can be applied for the recognition of 3-D objects which have
relatively complex shape. However, if the target objects are complex in
shape, the size of the model database becomes large. And, as the result,
the approach requires long time for the recognition of such objects. In
this paper we present a 3-D object recognition algorithm based on the
multiple-view approach which can find a best matched model by only
searching a small percentage of the model database. The algorithm uses a
genetic strategy to select a best matched model from the database. (Author
abstract) 4 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/28/96 19:56:11á
=========================================================================
Title: Potential to exchange feature models with user defined feature
libraries
Author: Pedley, A.G.
Corporate Source: Straessle Informationssysteme AG, Glattbrugg, Switz
Conference Title: Proceedings of the 1996 12th International Conference
on Computer Aided Production Engineering
Conference Location: Cookeville, TN, USA Conference Date:
19960805-19960807
Source: Journal of Materials Processing Technology v 61 n 1-2 Aug 1996. p
78-84
Abstract: It is widely recognised that feature based modelling techniques
can lead to enhanced process integration and have direct impact on
Simultaneous Engineering activities. Powerful User Defined Feature
capabilities have been shown to be essential to the acceptance of Feature
Modelling Systems. However, the major stumbling block remains: currently no
standardised method for the exchange of User Defined Feature Models exists.
Any integration that has been implemented between differing systems is
bespoke and not user definable, hindering the impact of feature modelling
technologies. This paper considers the powerful User Defined Feature
functionality provided by FeatureM, the feature based solid modeller from
straessle. This functionality is compared to current approaches based on
EXPRESS for describing Feature Libraries. If a distinction is drawn between
the generation of the geometry of a feature and the way a system controls
the user interaction with that feature, a method is proposed that would
allow the exchange of feature models between systems. (Author abstract) 24
Refs.
Title: On-line shape recognition with incremental training using binary
synaptic weights algorithm
Author: Ulgen, Figen; Flavell, Andrew; Akamatsu, Norio
Corporate Source: Justsystem Corp, Tokushima-shi, Jpn
Source: Applied Intelligence v 6 n 3 July 1996. p 225-240
Abstract: Recognition of hand drawn shapes is beneficial in drawing
packages and automated sketch entry in handheld computers. A new approach
to on-line geometric shape recognition with incremental training function
is proposed. The approach utilizes a heuristic function to reduce noise and
a neural network for classification and on-line training. When the approach
is used to examine the shape as a whole, results are very successful, such
that the neural network correctly classified shapes that did not have any
resemblance to the shapes in the initial training set. 8 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 10/29/96 13:46:02á
=========================================================================
Title: Object recognition by dynamic link matching with multiple blob
formation
Author: Umeki, Hideo; Mizutani, Hiroyuki
Corporate Source: Toshiba Corp, Kawasaki, Jpn
Source: Proceedings of International Workshop on Neural Networks for
Identification, Control, Robotics, and Signal/Image Processing, NICROSP
1996. IEEE, Los Alamitos, CA, USA. p 237-245
Abstract: We present a one-to-many object matching system based on neural
dynamic link architecture. When an input image containing multiple objects
is given, if some of them are similar to a stored model, the system can
establish geometric transformation-invariant mappings between the model and
the corresponding object regions in the input image. This can be achieved
by extending the fast dynamic link matching (FDLM) algorithm to allow
multiple blob formation. Numerical simulations of neural layer dynamics
indicate that multiple blobs can be developed where the layer input is
sufficiently strong against the background level. To extract matched
regions from the input layer, we consider each neural layer as a graph and
introduce another neural system based on local edge mappings. This system
can roughly detect the matched regions with neighborhood-preserving
mappings without global cost functions. (Author abstract) 7 Refs.
Title: Incremental constraint modelling in a feature modelling system
Author: Laakko, Timo; Mantyla, Martti
Corporate Source: Helsinki Univ of Technology, Espoo, Finl
Conference Title: Proceedings of the 1996 17th Annual Conference and
Exhibition of the European Association for Computer Graphics,
EUROGRAPHICS'96
Source: Computer Graphics Forum v 15 n 3 Sep 1996. p 367-376
Abstract: The techniques of constraint propagation have recently been
successfully applied to feature-based design. Because of their speed,
constraint propagation methods allow incremental design and rapid local
modifications of the part. However, cyclic constraints cause serious
problems to current constraint propagation algorithms. Variational
geometric design systems can, in principle, manage these cases.
Unfortunately, this typically requires complete re-evaluation of the
underlying set of constraint equations, making the method unsuitable for
interactive use. The proposed system aims to localize the problem of
constraint solving and maintenance. The constraint graph of the part or
assembly is divided into several independent partial graphs, subsystems.
Afterwards, each subsystem is handled separately using a selected
constraint solving technique for the subsystem. (Author abstract) 32 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 11/06/96 18:19:29á
=========================================================================
Title: Geometric feature detection for reverse engineering using range
imaging
Author: Cai, Y.Y.; Nee, A.Y.C.; Loh, H.T.
Corporate Source: Natl Univ of Singapore, Singapore, Singapore
Source: Journal of Visual Communication and Image Representation v 7 n 3
Sep 1996. p 205-216
Abstract: The use of range imaging has been gaining popularity in reverse
engineering. One challenging task is the detection of future information
from range images. In this paper, an approach to detect geometric features
from range images using a fuzzy partitioning theory and geometric
invariants is developed. Based on the fuzzy C-shell clustering technique,
quadric features are partitioned into primitive clusters. Instead of
performing sequential model fittings, general quadric surfaces as object
shells are fitted concurrently. The geometric representations of prototypes
are generated during the above process of pattern classifications. The
integration of the partition with the invariant analysis makes it possible
to detect geometric features from depth maps for the development of reverse
engineering. (Author abstract) 18 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 11/15/96 16:04:32á
=========================================================================
TITLE: Scale-space properties of quadratic feature detectors
AUTHOR(S): Kube P; Perona P
CORPORATE SOURCE: UNIV CALIF SAN DIEGO,DEPT COMP SCI & ENGN/LA
JOLLA//CA/92093 (REPRINT); CALTECH,/PASADENA//CA/91125; UNIV
PADUA,DIPARTIMENTO ELETTR & INFORMAT/PADUA//ITALY/
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1996, V18, N10 (OCT), P987-999
TITLE: Representation of functions and features in detail design
AUTHOR(S): Feng CX; Huang CC; Kusiak A; Li PG
CORPORATE SOURCE: UNIV IOWA,DEPT IND ENGN, INTEGRATED SYST LAB/IOWA
CITY//IA/52242 (REPRINT); UNIV IOWA,DEPT IND ENGN, INTEGRATED SYST
LAB/IOWA CITY//IA/52242; PENN STATE UNIV,HINTZ MFG TECHNOL
LAB/READING//PA/19610; HUAZHONG UNIV SCI & TECHNOL,SCH MECH ENGN,
INTELLIGENT MFG LAB/WUHAN 430074/HUBEI/PEOPLES R CHINA/
PUBLICATION: COMPUTER-AIDED DESIGN, 1996, V28, N12 (DEC), P961-971
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/09/96 22:33:37á
=========================================================================
TITLE: Internal representation of two-dimensional shape
AUTHOR(S): Makioka S; Inui T; Yamashita H
CORPORATE SOURCE: OSAKA WOMENS UNIV,DEPT HUMAN SCI, DAISEN CHO/SAKAI/OSAKA
590/JAPAN/ (REPRINT); KYOTO UNIV,FAC LETTERS, DEPT PSYCHOL, SAKYO
KU/KYOTO 60601//JAPAN/
PUBLICATION: PERCEPTION, 1996, V25, N8, P949-966
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/11/96 16:24:45á
=========================================================================
TITLE: Euclidean shape and motion from multiple perspective views by affine
iterations
AUTHOR(S): Christy S; Horaud R
CORPORATE SOURCE: IMAG,GRAVIR, 655 AVE EUROPE/F-38330 MONBONNET//FRANCE/
(REPRINT); INRIA RHONE ALPES,/F-38330 MONBONNET//FRANCE/
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1996, V18, N11 (NOV), P1098-1104
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/11/96 17:45:41á
=========================================================================
Title: Identification of faces in a 2D line drawing projection of a
wireframe object
Author: Shpitalni, Moshe; Lipson, Hod
Corporate Source: Technion, Haifa, Isr
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
18 n 10 Oct 1996. p 1000-1012
Abstract: An important key to reconstructing a three-dimensional object
depicted by a two-dimensional line drawing projection is face
identification. Identification of edge circuits in a 2D projection
corresponding to actual faces of a 3D object becomes complex when the
projected object is in wireframe representation. This representation is
commonly encountered in drawings made during the conceptual design stage of
mechanical parts. When nonmanifold objects are considered, the situation
becomes even more complex. This paper discusses the principles underlying
face identification and presents an algorithm capable of performing this
identification. Face-edge-vertex relationships applicable to nonmanifold
objects are also proposed. Examples from a working implementation are
given. (Author abstract) 17 Refs.
Title: Perceptual grouping for generic recognition
Author: Havaldar, Parag; Medioni, Gerard; Stein, Fridtjof
Corporate Source: Univ of Southern California, Los Angeles, CA, USA
Source: International Journal of Computer Vision v 20 n 1-2 Oct 1996. p
59-80
Abstract: We address the problem of recognition of generic objects from a
single intensity image. This precludes the use of purely geometric methods
which assume that models are geometrically and precisely designed. Instead,
we propose to use descriptions in terms of features and their qualitative
geometric relationships. To succeed, it is clear that these features need
to be high level, rather than points or lines. We propose to detect groups
using perceptual organization criteria such as proximity, symmetry,
parallelism, and closure. The detection of these features is performed in
an efficient way using proximity indexing. Since many groups are created,
we also perform selection of relevant groups by organizing them into sets
of similar perceptual content. Finally we present an implementation of a
recognition system using these sets as primitives. It is an efficient
colored graph matching algorithm using the adjacency matrix representation
of a graph. Using indexing, we retrieve matching hypotheses, which are
verified against each other with respect to topological constraints. Groups
of consistent hypotheses represent detected model instances in a scene. The
complete system is illustrated on real images. We also discuss further
extensions. (Author abstract) 36 Refs.
Title: Volumetric descriptions from a single intensity image
Author: Zerroug, Mourad; Nevatia, Ramakant
Corporate Source: Univ of Southern California, Los Angeles, CA, USA
Source: International Journal of Computer Vision v 20 n 1-2 Oct 1996. p
11-42
Abstract: This paper proposes a promising methodology to address the real
images that produce imperfect contours for general cylinders. The
methodology is based on exploiting mathematical invariant properties of the
contours of generalized cylinders in a perceptual grouping approach. It is
shown that using this approach greatly helps addressing figured-ground
problem in a more rigorous way than previous perceptual grouping methods.
The proposed approach exploits the interplay between local and global
features by handling different levels of the feature hierarchy. 46 Refs.
Title: Unified approach to noise removal, image enhancement, and shape
recovery
Author: Malladi, Ravikanth; Sethian, James A.
Corporate Source: Univ of California, Berkeley, CA, USA
Source: IEEE Transactions on Image Processing v 5 n 11 Nov 1996. p
1554-1568
Abstract: We present a unified approach to noise removal, image
enhancement, and shape recovery in images. The underlying approach relies
on the level set formulation of curve and surface motion, which leads to a
class of PDE-based algorithms. Beginning with an image, the first stage of
this approach removes noise and enhances the image by evolving the image
under flow controlled by min/max curvature and by the mean curvature. This
stage is applicable to both salt-and-pepper grey-scale noise and full-image
continuous noise present in black and white images, grey-scale images,
texture images, and color images. The noise removal/enhancement schemes
applied in this stage contain only one enhancement parameter, which in most
cases is automatically chosen. The other key advantage of our approach is
that a stopping criteria is automatically picked from the image; continued
application of the scheme produces no further change. The second stage of
our approach is the shape recover of a desired object; we again exploit the
level set approach to evolve an initial curve/surface toward the desired
boundary, driven by an image-dependent speed function that automatically
stops at the desired boundary. (Author abstract) 44 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/12/96 16:51:56á
=========================================================================
Computing grasp functions.
Rao, Anil S.
Goldberg, Kenneth Y. (Department of Industrial Engineering and Operations
Research, University of California, Berkeley, California, 94720)
Computational Geometry. Theory and Applications, 1996, 6, no. 3,
145--168. ISSN: 0925-7721
Summary: ``The grasp function of a planar part, characterized by extrema
in the part's width function, can be used to analyze grasp mechanics. In
particular, it can predict the final orientation of the part when it is
grasped with a parallel-jaw gripper. This information allows us to derive a
sequence of grasp angles that will orient the part up to symmetry in the
grasp function. In previous papers the grasp function was assumed to be
given as input; in this paper we present a linear-time algorithm for
computing the grasp function of a part bounded by $n$ algebraic arcs given
in parametric form. We also show that the algorithm can be extended to
compute a related function that describes the outcome of first pushing and
then grasping the part.''
Title: Perceptual grouping for generic recognition
Author: Havaldar, Parag; Medioni, Gerard; Stein, Fridtjof
Corporate Source: Univ of Southern California, Los Angeles, CA, USA
Source: International Journal of Computer Vision v 20 n 1-2 Oct 1996. p
59-80
Abstract: We address the problem of recognition of generic objects from a
single intensity image. This precludes the use of purely geometric methods
which assume that models are geometrically and precisely designed. Instead,
we propose to use descriptions in terms of features and their qualitative
geometric relationships. To succeed, it is clear that these features need
to be high level, rather than points or lines. We propose to detect groups
using perceptual organization criteria such as proximity, symmetry,
parallelism, and closure. The detection of these features is performed in
an efficient way using proximity indexing. Since many groups are created,
we also perform selection of relevant groups by organizing them into sets
of similar perceptual content. Finally we present an implementation of a
recognition system using these sets as primitives. It is an efficient
colored graph matching algorithm using the adjacency matrix representation
of a graph. Using indexing, we retrieve matching hypotheses, which are
verified against each other with respect to topological constraints. Groups
of consistent hypotheses represent detected model instances in a scene. The
complete system is illustrated on real images. We also discuss further
extensions. (Author abstract) 36 Refs.
Title: Volumetric descriptions from a single intensity image
Author: Zerroug, Mourad; Nevatia, Ramakant
Corporate Source: Univ of Southern California, Los Angeles, CA, USA
Source: International Journal of Computer Vision v 20 n 1-2 Oct 1996. p
11-42
Publication Year: 1996
Abstract: This paper proposes a promising methodology to address the real
images that produce imperfect contours for general cylinders. The
methodology is based on exploiting mathematical invariant properties of the
contours of generalized cylinders in a perceptual grouping approach. It is
shown that using this approach greatly helps addressing figured-ground
problem in a more rigorous way than previous perceptual grouping methods.
The proposed approach exploits the interplay between local and global
features by handling different levels of the feature hierarchy. 46 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/19/96 18:07:30á
=========================================================================
TITLE: Surface triangulation for 3-D scene model construction from stereo
AUTHOR(S): Papadimitriou DV; Dennis TJ
CORPORATE SOURCE: UNIV ESSEX,DEPT ELECT SYST ENGN, WIVENHOE PK/COLCHESTER
CO4 3SQ/ESSEX/ENGLAND/ (REPRINT)
PUBLICATION TYPE: JOURNAL
PUBLICATION: IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, 1996, V143
, N5 (OCT), P310-314
ABSTRACT: The construction of an accurate 3-D scene model is a fundamental
aspect ofany model-based image coding scheme. This contribution
describes the generation of a triangular facet surface representation
from the data acquired by a calibrated binocular (stereo) camera
system.
TITLE: Objective assessment of wrinkle recovery by means of laser
triangulation
AUTHOR(S): Amirbayat J; Alagha MJ
CORPORATE SOURCE: UNIV MANCHESTER,INST SCI & TECHNOL, DEPT TEXT/MANCHESTER
M13 9PL/LANCS/ENGLAND/ (REPRINT)
PUBLICATION: JOURNAL OF THE TEXTILE INSTITUTE, 1996, V87, N2,1, P349-355
PUBLISHER: TEXTILE INST INTL HEADQUARTERS, 10 BLACKFRIARS ST, MANCHESTER,
ENGLAND M3 5DR
ABSTRACT: The paper describes the assessment of the wrinkle recovery of
fabrics according to the grades of the replica plates supplied by the
American Association of Textile Chemists and Colorists (AATCC), by
laser scanning the surface of the plates and extracting certain
geometrical features.
TITLE: A new approach to physical edge detection using the curvature at the
boundary contour points
AUTHOR(S): Zakaria S; Terada H; Salvador FR; Makino H
CORPORATE SOURCE: YAMANASHI UNIV,FAC ENGN, 4-3-11 TAKEDA/KOFU/YAMANASHI
400/JAPAN/ (REPRINT)
PUBLICATION TYPE: JOURNAL
PUBLICATION: INTERNATIONAL JOURNAL OF THE JAPAN SOCIETY FOR PRECISION
ENGINEERING, 1996, V30, N3 (SEP), P259-264
ABSTRACT: This work presents an approach to corners and physical edges
detection using information from a range sensor based on the
triangulation principle. The curvature at points of a digital curve was
investigated. A procedure for corners and edges detection that has low
sensitivity to noise has been designed. The detection procedure imbeds
mainly 2 steps. The first step is a line finder and tracker algorithm.
In the second step, curvatures at points of the digital curve computed
and corner-points sie localized.
The experimental evidence available in this work shows that corners
and physical edges can be reliably detected.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 12/18/96 15:41:35á
=========================================================================
Title: Solid ideas
Author: Pham, D.T.; Gault, R.S.
Corporate Source: Univ of Wales, Cardiff, Wales
Source: Manufacturing Engineer v 75 n 5 Oct 1996. p 239-243
Abstract: Rapid prototyping is fast becoming one of the essential
technologies that allows manufacturers to improve product quality and
reduce both time to market and the cost of new lines, as part of a
concurrent engineering strategy. RP technologies can be virtual
(soft/CAD-based) or physical (hard). Physical RP allows designers to build
tangible models of their designs quickly and cheaply. This encourages
experimentation, and flags errors in the fit or assembly of the part. This
article looks at the existing physical RP technologies. 11 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 01/03/97 23:39:59á
=========================================================================
Title: Statistical approach to hierarchical shape indexing
Author: Huet, Benoit; Hancock, Edwin
Corporate Source: Univ of York, York, UK
Conference Title: Proceedings of the 1996 IEE Colloquium on Intelligent
Image Databases
Source: IEE Colloquium (Digest) n 119 1996. IEE, Stevenage, Engl. p
7/1-7/5
Abstract: The first stages of work aimed at developing a hierarchical
framework for shape-indexing line-images is described, which is
coarse-grained histogram matching. Statistical pattern recognition methods
are employed to compute a probabilistic distance measure between model and
data histograms. Preliminary experimental results show that the
Bhattacharya, Matusita or Divergence distance measures offer finer
discriminating power than the L No.1 and the L No. 2 norms when used as an
index of geometric structure. 14 Refs.
Title: Automated laser scanning based on orthogonal cross sections
Author: Milroy, M.J.; Bradley, C.; Vickers, G.W.
Corporate Source: Univ of Victoria, Victoria, BC, Can
Source: Machine Vision and Applications v 9 n 3 1996. p 106-118
Abstract: To reversely engineer a clay model or industrial part, a laser
scanner is often used to acquire surface data points, which must be
processed to created a CAD model. Complete surface definition requires an
operator to obtain a number of scans from various viewpoints and
orientations. This introduces two difficulties to the reverse-engineering
process: (1) the data are difficult to visualize, as scan lines appear at
various angles, and (2) the surface is irregularly sampled, with large
regions sampled by several scans, and occasionally a small region is missed
completely (a result of the visualization problem). We have developed an
automated scanning system to overcome these problems. The system utilizes
an intermediate data model that consists of three orthogonal cross sections
and is built from the triangulated scan data. The resultant model is easily
visualized, which facilitates further interactive operation on the data.
The system has been successful in autonomously modeling several typical
industrial objects. (Author abstract) 18 Refs.
Title: Point set pattern matching in 3-D
Author: Boxer, Laurence
Corporate Source: Niagara Univ, Niagara University, NY, USA
Source: Pattern Recognition Letters v 17 n 12 Oct 25 1996. p 1293-1297
Abstract: We give an algorithm for matching finite points sets in
Euclidean 3-space, R**3. The algorithm runs in O(kn**5**/**2 left bracket
lambda //6(n)/n right bracket ** one quarter log n) time, where k is the
size of the pattern and n is the size of the sample set. Further, if the
pattern we seek to match is a collinear set, the running time of our
algorithm reduces to O(n**2 plus kn**3**/**2 left bracket lambda //6(n)/n
right bracket ** one quarter log n). These results improve upon the
O(kn**3) running time of the algorithm given in (De Rezende and Lee, 1995)
for the case d equals 3. (Author abstract) 8 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 01/10/97 16:42:23á
=========================================================================
TITLE: Automatic feature generation for handwritten digit recognition
AUTHOR(S): Gader PD; Khabou MA
CORPORATE SOURCE: UNIV MISSOURI,DEPT ELECT & COMP ENGN/COLUMBIA//MO/65211
(REPRINT)
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1996, V18, N12 (DEC), P1256-1261
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 01/22/97 16:32:31á
=========================================================================
Title: Hough transform - a new approach
Author: Diou, Alain; Voisin, Yvon; Santo, Carlos
Corporate Source: Lab G.E.R.E., Le Creusot, Fr
Source: IECON Proceedings (Industrial Electronics Conference) v 3 1996.
IEEE, Los Alamitos, CA, USA,96CH35830. p 1612-1617
Abstract: The Hough transform is presently witnessing an increasing
interest (over 200 references in 1995), due to its capacity of finding the
parameters of miscellaneous shapes in an image (or signal), for example
straight lines, circles, or more generally conics. We propose here an
analytic approach which permits to calculate the theoretical Hough
transform on standard images, in the case of the research of straight lines
and we show its practical application. (Author abstract) 16 Refs.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 01/25/97 14:36:47á
=========================================================================
TITLE: Feature-based machining of curved surfaces using the steepest
directed tree approach
AUTHOR(S): Maeng HY; Ly MH; Vickers GW
CORPORATE SOURCE: SEOUL NATL POLYTECH UNIV,/SEOUL//SOUTH KOREA/ (REPRINT)
PUBLICATION: JOURNAL OF MANUFACTURING SYSTEMS, 1996, V15, N6, P379-391
PUBLISHER: SOC MANUFACTURING ENGINEERS, ONE SME DRIVE, PO BOX 930,
DEARBORN, MI 48121-0930
CURRENT CONTENTS JOURNAL ANNOUNCEMENT: CC ENGI, V28, N05
ABSTRACT: A novel and efficient approach for defining and machining
curved-surface parts is presented. The intelligent cutter path planning
method, called the steepest directed tree method, replicates the
actions of an expert engraverby using cutter paths that are established
from the surface form.
The curved surface is defined by triangular facets, the density and
structure of which are determined by the intricacy and shape of the
surface. Appropriate decimation and subdivision algorithms are used
with swap optimization of facet edges to develop a uniform chordal
error surface model. Geometrical form definition and recognition of
topological features of the surfacetriangulation mesh are used to
generate cutter paths along successive and interconnected steepest
pathways, or steepest directed trees. Thus, geometrical surface
features and machining characteristics of the end-milling process are
used to develop optimum cutter paths. Planetary cutter locations are
adjusted to be moved along smoothly changing paths, and height values
areadjusted to avoid surface interference.
Two machined examples of intersecting and intricate surface parts
are presented that illustrate the benefits of the new approach. It is
shown that due to more consistent geometry matching between cutter and
surface (in comparison with the current CC-Cartesian method), surface
finish can be typically improved by a factor of 16.8:1 while reducing
cutting time by a factor of1.6:1.
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 02/05/97 10:18:45á
=========================================================================
Title: Object recognition using multiple view invariance based on complex
features
Author: Kuno, Yoshinori; Takae, Osamu; Takahashi, Takuya; Shirai,
Yoshiaki
Corporate Source: Osaka Univ, Osaka, Jpn
Conference Title: Proceedings of the 1996 3rd IEEE Workshop on
Applications of Computer Vision, WACV'96
Source: IEEE Workshop on Applications of Computer Vision - Proceedings
1996. IEEE, Los Alamitos, CA, USA,96TB100084. p 129-134
Abstract: Geometric invariants from multiple views provide useful
information for 3D object recognition. However, conventional object
recognition methods using invariants based on point features cannot achieve
efficient recognition because of large amount of combinations of point
features in invariant calculation. To avoid this problem, we propose to use
more complex features. We adopt arrow junctions and conics as complex
features because man-made objects have often trihedral polyhedra (eg.
parallelepiped) and circles and they make arrow junctions and conics in
images, respectively. The multiple view affine invariance theory can be
directly used for arrow junctions. For conics, we propose two types of
invariants. We have developed an object recognition method exploiting these
invariants. In addition to the recognition method with two input images, we
propose a recognition method that needs only a single input image by
substituting an image of a target object stored in the model library.
Experimental results using 240 pair of images for 24 objects confirm the
usefulness of the methods. (Author abstract) 9 Refs.
TITLE: Towards multiprocessor feature recognition
AUTHOR(S): Regli WC; Gupta SK; Nau DS
CORPORATE SOURCE: NIST,MFG SYST INTEGRAT DIV, BLDG 220, ROOM
A-127/GAITHERSBURG//MD/20899 (REPRINT); CARNEGIE MELLON UNIV,INST
ROBOT, RAPID MFG LAB/PITTSBURGH//PA/15213; UNIV MARYLAND,INST ADV COMP
STUDIES, DEPT COMP SCI/COLLEGE PK//MD/20742; UNIV MARYLAND,SYST RES
INST/COLLEGE PK//MD/20742
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N1 (JAN), P37-51
TITLE: Robust algorithms for face-based representations
AUTHOR(S): Higashi M; Torihara F; Takeuchi N; Sata T; Saitoh T; Hosaka M
CORPORATE SOURCE: TOYOTA TECHNOL INST,TEMPAKU KU, 2-12-1
HISAKATA/NAGOYA/AICHI 468/JAPAN/ (REPRINT); TOKYO DENKI UNIV,CHIYODA
KU/TOKYO 101//JAPAN/
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N2 (FEB), P135-146
TITLE: Polyhedral modelling with multiprecision integer arithmetic
AUTHOR(S): Fortune S
CORPORATE SOURCE: AT&T BELL LABS,600 MT AVE/MURRAY HILL//NJ/07974 (REPRINT)
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N2 (FEB), P123-133
MSG From: SMTP --AHIPC2S To: DFIELD --AHIPC2S 02/12/97 10:07:30á
=========================================================================
Title: Novel Hough transform for curve detection
Author: Wu, Paul S.; Li, Ming
Corporate Source: City Univ of Hong Kong, Kowloon, Hong Kong
Conference Title: Proceedings of the 1996 IEEE International Conference
on Systems, Man and Cybernetics. Part 4 (of 4)
Source: Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics v 4 1996. IEEE, Piscataway, NJ, USA,96CH35929. p 2722-2727
Abstract: A novel dynamic Hough transform is introduced as an
computationally efficient way of implementing the Hough transform for
detecting two dimensional curves with arbitrary shapes. Neither prior
knowledge nor analytical natural of the curve are necessary. This method
uses binary pyramid structure to alleviate computational complexity. Any
arbitrary edge line is approximated by an analytical function based on
rational Gaussian. The parameters of the function and the accumulated area
are determined adaptively by the set of accumulated points. The densities
of points in the accumulators are examined. The peak accumulation
determines the existence of an edge curve and the location of it. At the
end of the paper, experimental results of this method related to the palm
image is presented. (Author abstract) 16 Refs.
Title: 3-D shape recovery using a relaxation algorithm based on surface
feature consistency
Author: Zha, Hongbin; Muramatsu, Shoji; Nagata, Tadashi
Corporate Source: Kyushu Univ, Fukuoka, Jpn
Conference Title: Proceedings of the 1996 IEEE International Conference
on Systems, Man and Cybernetics. Part 4 (of 4)
Source: Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics v 4 1996. IEEE, Piscataway, NJ, USA,96CH35929. p 2469-2474
Abstract: 3-D high-level surface features are widely used for recognizing
complex curved objects. The features, however, are difficult to extract
accurately from raw range images because the images are usually noisy for
the required differential operations. This paper proposes a new 3-D shape
recovery method that obtains refined shape features by deriving an optimal
approximation to the true surfaces in a raw image. In principle, the method
is mainly based on a relaxation algorithm that reconstructs original shapes
by means of feature consistency constraints. The application of these
constraints makes the algorithm not only invariant with the object poses
but also very adaptive to complicated shape changes. Meanwhile, surface
discontinuities are preserved by utilizing a possibility function of
discontinuity (PFD) in controlling the constraint propagation to prevent
edge points from overslurred. (Author abstract) 12 Refs.
Title: Constructing a 3D object model from multiple visual features
Author: Zheng, Jiang Yu
Corporate Source: Kyushu Inst of Technology, Fukuoka, Jpn
Conference Title: Proceedings of the 1996 IEEE International Conference
on Systems, Man and Cybernetics. Part 4 (of 4)
Source: Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics v 4 1996. IEEE, Piscataway, NJ, USA,96CH35929. p 2457-2462
Abstract: This work aims at building 3D graphics models of objects using
multiple visual cues. Different materials and shapes may yield different
visual cues such as corner, pattern, highlight, and contour on objects.
These cues may have similar appearance in the images, extracted as edge,
peak and shading. To obtain a correct shape, different shape recovery
methods must be applied to those features separately. We rotate an object
and take a dense image sequence. In each Epipolar Plane Image of rotation
plane, we classify visual cues according to their image characteristics and
motion behavior, and integrate shapes from different algorithms. Features
are classified when they pass through a series of modules which first
identify distinct features and then reasoning ambiguous features in
reference to the identified ones. A carefully considered strategy is
proposed and experiments on real objects. (Author abstract) 14 Refs.
Title: Reconstruction of 3D delaunay surface models of complex objects
Author: Hilton, A.; Stoddart, A.J.; Illingworth, J.; Windeatt, T.
Corporate Source: Univ of Surrey, Guildford, Engl
Conference Title: Proceedings of the 1996 IEEE International Conference
on Systems, Man and Cybernetics. Part 4 (of 4)
Source: Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics v 4 1996. IEEE, Piscataway, NJ, USA,96CH35929. p 2445-2450
Abstract: A system is presented that enables reliable automated
reconstruction of complete 3D models of complex objects. Geometric fusion
is achieved by integration of multiple range images into single 3D implicit
surface representation. An approximate volumetric representation is
introduced to provide efficient implicit surface evaluation. The 'Marching
Triangles' implicit surface polygonization algorithm is used for model
reconstruction of a 3D Delaunay surface triangulation. Results are
demonstrated for the reconstruction of models of complex objects. 10 Refs.
Title: Active acquisition of 3D shape for moving objects
Author: Proesmans, Marc; Van Gool, Luc J.; Oosterlinck, Andre J.
Corporate Source: Katholieke Universiteit of Leuven, Leuven, Belgium
Source: IEEE International Conference on Image Processing v 3 1996. IEEE,
Los Alamitos, CA, USA,96CH35919. p 647-650
Abstract: An active 3D acquisition system is presented that projects a
simple pattern of squares on a scene and views it from a different angle.
This paper describes how the observed pattern can be extracted from the
image data. The underlying algorithm automatically detects the lines and
crossings of the projected pattern in the image. Experiments show that the
algorithm is robust and provides accurate three-dimensional (3D)
reconstructions. Its one-shot operation principle enables the system to
retrieve the shape of moving objects. (Author abstract)
Title: Information-based shape description with scale, translation and
rotation invariance
Author: Ghali, Ahmed; Daemi, M.F.
Corporate Source: Univ of Nottingham, Nottingham, Engl
Source: IEEE International Conference on Image Processing v 3 1996. IEEE,
Los Alamitos, CA, USA,96CH35919. p 611-614
Abstract: This paper proposes a technique based on Information Theory
principles for shape description of 2-D images. By its essence the
technique is invariant to rotation and translation. We will firstly
describe how the Translational Information content of an image may be
defined, identified, assessed and analysed. The effect of the size is then
assessed and quantified which permits us to propose a modified definition
of Translational Information content invariant to scale. In order to
demonstrate the feasibility of the developed techniques, a series of tests
were carried out on rectangular and triangular shapes. The results
illustrate the power of the Translational Information assessment techniques
in analysing and describing 2-D images. The use of these techniques in
shape description is also introduced. (Author abstract) 9 Refs.
Title: Model-based recognition of planar objects using geometric
invariants
Author: Sossa, Humberto; Palomino, Amparo
Corporate Source: Centro Nacional de Calculo-IPN, Mexico, Mex
Source: IEEE International Conference on Image Processing v 3 1996. IEEE,
Los Alamitos, CA, USA,96CH35919. p 603-606
Abstract: We address the problem of recognizing possibly occluded planar
objects from an arbitrary viewpoint. The primitives used either to obtain
models or to recognize the planar shapes are the so called metasegments.
These are groups of consecutive segments obtained from the corners of the
objects' contours. From these groups of segments is that a set of geometric
invariants: two new (the type and the subtype), and two well known (the
four and the five point dependent affine/projective invariants used in left
bracket 1 right bracket and left bracket 2 right bracket ) are first
calculated and then entered into a database. This provides the essential
mechanism of searching. These invariants (combined as a key) are then used
first to build the database of models and second to extract from the model
database those models possibly present in a test image. A voting and
thresholding mechanism is finally used to decide which objects are present
in the scene. The system's performance is tested with a set of polygonal
objects. (Author abstract) 7 Refs.
Title: Marching triangles: Range image fusion for complex object
modelling
Author: Hilton, A.; Stoddart, A.J.; Illingworth, J.; Windeatt, T.
Corporate Source: Univ of Surrey, Guildford, UK
Source: IEEE International Conference on Image Processing v 2 1996. IEEE,
Los Alamitos, CA, USA,96CH35919. p 381-384
Abstract: A new surface based approach to implicit surface polygonization
is introduced in this paper. This is applied to the reconstruction of 3D
surface models of complex objects from multiple range images. Geometric
fusion of multiple range images into an implicit surface representation was
presented to previous work. This paper introduces an efficient algorithm to
reconstruct a triangulated model of a manifold implicit surface. A local 3D
constraint is derived which defines the Delaunay surface triangulation of a
set of points on a manifold surface in 3D space. The `Marching Triangles'
algorithm uses the local 3D constraint to reconstruct a Delaunay
triangulation of an arbitrary topology manifold surface. Computational and
representational costs are both a factor of 3-5 lower than previous
volumetric approaches such as marching cubes. (Author abstract) 9 Refs.
=========================================================================
Fri Feb 14 20:17
=========================================================================
TITLE: Matching of 3D polygonal arcs
AUTHOR(S): Heisterkamp DR; Bhattacharya P
CORPORATE SOURCE: UNIV NEBRASKA,DEPT COMP SCI & ENGN/LINCOLN//NE/68588
(REPRINT)
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997, V19, N1 (JAN), P68-73
============================================================
Date: Thu, 27 Feb 1997 09:59:16
============================================================
Title: Feature extraction using fuzzy relations for objects of various
shapes
Author: Cho, Dong-uk; Bae, Younglae J.
Corporate Source: Seowon Univ, Chongju, South Korea
Source: Proceedings of the IEEE International Conference on Systems, Man
and Cybernetics v 1 1996. IEEE, Piscataway, NJ, USA,96CH35929. p 272-275
Publication Year: 1996
Abstract: A method to extract functional primitives using fuzzy relations
so as to effectively describe objects of various shapes and appearances is
proposed. Object surfaces in a range image are segmented into visual
surface regions. The geometric features between these regions are
represented as fuzzy functions, which are used to extract functional
primitives. This method can efficiently deal with such an object that has
various shapes or appearances, and increases the performance of image
analysis. (Author abstract) 11 Refs.
============================================================
Date: Thu, 13 Mar 1997 06:59:36
============================================================
Title: Structural approach to representation of curved objects
Author: Nishida, Hirobumi
Corporate Source: Ricoh Information and Communication R&D, Yokohama, Jpn
Source: Pattern Recognition v 30 n 1 Jan 1997. p 45-56
Abstract: Representation of complex, curved objects is still a
challenging and difficult problem. In this paper, we present a scheme for
multi-level, structural, qualitative representation of object surfaces. The
analysis begins with local, face-based descriptions of object surfaces
(surface primitive graphs), and global, high-level, structural, and
qualitative features are derived from these local descriptions. The final
descriptions (global feature graphs) are based on the quasi-convexity
(concavity) structures incorporating quantized directional features of
closed boundaries of cross-sections along several directions. The global
feature graphs have the following properties: (1) They provide a
characterization of global, structural, qualitative properties of the
object; (2) The graphs are composed of a few components (nodes and edges)
with rich features, and give compact descriptions of the objects; (3) The
global feature graph representations are robust and qualitative in that
they are not affected by geometrical, quantitative properties of the shape
such as curvatures, length, and position; (4) The representation has clear
and rigorous properties. Furthermore, we present some theoretical basis for
object recognition using the global features graphs. (Author abstract) 28
==================================
Date: Fri, 21 Mar 1997 14:57:04
==================================
TITLE: Feature selection: Evaluation, application, and small sample
performance
AUTHOR(S): Jain A; Zongker D
CORPORATE SOURCE: MICHIGAN STATE UNIV,DEPT COMP SCI/E LANSING//MI/48824
(REPRINT)
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997, V19, N2 (FEB), P153-158
======================================
Date: Wed, 26 Mar 1997 06:10:28 -0800
======================================
Title: Feature-based design using NURBS entities and Plex grammar
Author: Guan, Xiaogang; Theodoracatos, Vassilios E.
Corporate Source: Univ of Oklahoma, Norman, OK, USA
Source: 21st Annual Design Automation Conference American Society of
Mechanical Engineers, Design Engineering Division (Publication) DE v 82 n 1
1995.. p 33-40
Abstract: A new feature-based design synthesis methodology is described.
Features of various levels of complexity are created and classified
according to their attributes. Each feature is represented as a single
internal NURBS surface. A hierarchical structure of features with
corresponding parameters is maintained to enhance the design efficiency.
Plex grammar is used as a structure relationship descriptor to facilitate
product concept analysis and geometric synthesis. Two product design
examples are presented to illustrate the concept analysis and geometric
synthesis process. (Author abstract) 15 Refs.
====================================
Date: Wed, 2 Apr 1997 05:44:22 -0800
====================================
Title: Shape representation using a generalized potential field model
Author: Ahuja, Narendra; Chuang, Jen-Hui
Corporate Source: Univ of Illinois, Urbana, IL, USA
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
19 n 2 Feb 1997. p 169-176
Abstract: This paper is concerned with efficient derivation of the medial
axis transform of a two-dimensional polygonal region. Instead of using the
shortest distance to the region border, a potential field model is used for
computational efficiency. The region border is assumed to be charged and
the valleys of the resulting potential field are used to estimate the axes
for the medial axis transform. The potential valleys are found by following
force field, thus, avoiding two-dimensional search. The potential field is
computed in closed form using the equations of the border segments. The
simple Newtonian potential is shown to be inadequate for this purpose. A
higher order potential is defined which decays faster with distance than as
inverse of distance. It is shown that as the potential order becomes
arbitrarily large, the axes approach those computed using the shortest
distance to the border. Algorithms are given for the computation of axes,
which can run in linear parallel time for part of the axes having initial
guesses. Experimental results are presented for a number of examples.
(Author abstract) 24 Refs.
Title: Division-based analysis of symmetry and its application
Author: Fukushima, Shigehiro
Corporate Source: Kyushu Inst of Technology, Fukuoka, Jpn
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
19 n 2 Feb 1997. p 144-148
Abstract: A computational method, DAS, is proposed for symmetry analysis
of a planar figure closed by a simply connected curve. DAS determines both
the symmetric axis and the symmetric point pairs on the curve,
consistently, based on the duality of two geometric plane divisions, the
Delaunay triangulation and the Voronoi diagram. (Author abstract) 26 Refs.
===============================
Date: Mon, 7 Apr 1997 15:13:27
===============================
TITLE: Integration of feature based design and feature recognition
AUTHOR(S): Han JH; Requicha AAG
CORPORATE SOURCE: UNIV SO CALIF,DEPT COMP SCI/LOS ANGELES//CA/90089
(REPRINT); UNIV SO CALIF,DEPT COMP SCI/LOS ANGELES//CA/90089; UNIV SO
CALIF,INST ROBOT & INTELLIGENT SYST/LOS ANGELES//CA/90089
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N5 (MAY), P393-403
TITLE: Modelling turned components with non-axisymmetric features
AUTHOR(S): Guerra ARO; Hinduja S
CORPORATE SOURCE: UNIV MANCHESTER,INST SCI & TECHNOL, DEPT MECH
ENGN/MANCHESTER M60 1QD/LANCS/ENGLAND/ (REPRINT); UNIV MANCHESTER,INST
SCI & TECHNOL, DEPT MECH ENGN/MANCHESTER M60 1QD/LANCS/ENGLAND/
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N5 (MAY), P343-359
===============================
Date: Thu, 10 Apr 1997 22:17:48
===============================
TITLE: Procrustes shape analysis of planar point subsets
AUTHOR(S): Dryden IL; Faghihi MR; Taylor CC
CORPORATE SOURCE: UNIV LEEDS,DEPT STAT/LEEDS LS2 9JT/W YORKSHIRE/ENGLAND/
(REPRINT)
PUBLICATION: JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES
B-METHODOLOGICAL, 1997, V59, N2, P353-374
ABSTRACT: Consider a set of points in the plane randomly perturbed about a
mean configuration by Gaussian errors. In this paper a Procrustes
statistic based on the shapes of subsets of the points is studied, and
its approximate distribution is found for small variations. We derive
various properties of the distribution including the first two moments,
a central limit result and a scaled chi(2)-approximation. We
concentrate on the independent isotropic Gaussian error case, although
the results are valid for general covariance structures. We investigate
triangle subsets in detail and in particular the situation where the
population mean is regular (i.e. a Delaunay triangulation of the mean
of the process is comprised of equilateral triangles of the same size).
We examine the variance of the statistic for differently shaped regions
and provide an asymptotic result for general shaped regions. The
results are applied to an investigation of regularity in human muscle
fibre cross-sections.
Title: Shape representation using a generalized potential field model
Author: Ahuja, Narendra; Chuang, Jen-Hui
Corporate Source: Univ of Illinois, Urbana, IL, USA
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
19 n 2 Feb 1997. p 169-176
Abstract: This paper is concerned with efficient derivation of the medial
axis transform of a two-dimensional polygonal region. Instead of using the
shortest distance to the region border, a potential field model is used for
computational efficiency. The region border is assumed to be charged and
the valleys of the resulting potential field are used to estimate the axes
for the medial axis transform. The potential valleys are found by following
force field, thus, avoiding two-dimensional search. The potential field is
computed in closed form using the equations of the border segments. The
simple Newtonian potential is shown to be inadequate for this purpose. A
higher order potential is defined which decays faster with distance than as
inverse of distance. It is shown that as the potential order becomes
arbitrarily large, the axes approach those computed using the shortest
distance to the border. Algorithms are given for the computation of axes,
which can run in linear parallel time for part of the axes having initial
guesses. Experimental results are presented for a number of examples.
Title: Division-based analysis of symmetry and its application
Author: Fukushima, Shigehiro
Corporate Source: Kyushu Inst of Technology, Fukuoka, Jpn
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
19 n 2 Feb 1997. p 144-148
Abstract: A computational method, DAS, is proposed for symmetry analysis
of a planar figure closed by a simply connected curve. DAS determines both
the symmetric axis and the symmetric point pairs on the curve,
consistently, based on the duality of two geometric plane divisions, the
Delaunay triangulation and the Voronoi diagram. (Author abstract) 26 Refs.
===============================
Date: Fri, 16 May 1997 21:11:18
===============================
TITLE: Three-dimensional shape optimization with variational geometry
AUTHOR(S): Chen S; Tortorelli DA
CORPORATE SOURCE: UNIV ILLINOIS,DEPT MECH & IND ENGN, 1206 W GREEN
ST/URBANA//IL/61801 (REPRINT)
PUBLICATION: STRUCTURAL OPTIMIZATION, 1997, V13, N2-3 (APR), P81-94
ABSTRACT: The unification of computer aided design (CAD) and the finite
element method (FEM) has greatly enhanced the engineer's ability to
evaluate potential designs (Finnigan et al. 1989). However, analysis
alone is not the answer to design, and thus shape optimization methods
have become increasingly popular, particularly for structural problems
(Yang et al. 1992; Botkin 1992). However, for shape optimization
methods to be fully accepted by the engineering community they must
first be integrated with CAD systems. To date, the difficulty of
integrating CAD and shape optimization is the inability to relate the
finite element nodal coordinates to the CAD solid model dimensions.
Here, the critical link between these CAD and FEM data is developed
within an industry standard feature-based modelling environment. A
three-dimensional connecting rod model is optimized to exemplify the
method.
TITLE: Deformable prototypes for encoding shape categories in image
databases
AUTHOR(S): Sclaroff S
CORPORATE SOURCE: BOSTON UNIV,DEPT COMP SCI, 111 CUMMINGTON
ST/BOSTON//MA/02215 (REPRINT)
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N4 (APR), P627-641
TITLE: Manufacturing feature determination and extraction .1. Optimal
volume segmentation
AUTHOR(S): Dong J; Vijayan S
CORPORATE SOURCE: UNIV CONNECTICUT,DEPT MECH ENGN/STORRS//CT/06269
(REPRINT); STRUCT DYNAM RES CORP,/MILFORD//OH/45150
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N6 (JUN), P427-440
===============================
Date: Fri, 23 May 1997 15:35:17
===============================
Title: Triplet geometric representation: A novel scale, translation and
rotation invariant feature representation based on geometric constraints
for recognition of 2D object features
Author: Kumar, Rajeev; Rockett, Peter
Corporate Source: Univ of Sheffield, Sheffield, UK
Source: Image and Vision Computing v 15 n 3 Mar 1997. p 235-249
Abstract: We present a novel representation for scale, translation and
rotation independent recognition of 2D object features based on the
invariance properties of the included angles of a triangle which we exploit
to construct signature histograms of local shape. We describe the practical
implementation of this new technique together with its properties, and
present a statistical quantification of performance in the presence of:
fragmentation, additive noise and clutter. The scale-invariant properties
are assessed, the results of which imply a fundamental limit on
scale-invariant recognition from a single model. (Author abstract) 25 Refs.
===============================
Date: Wed, 28 May 1997 03:53:17
===============================
Title: Fast computation of three-dimensional geometric moments using a
discrete divergence theorem and a generalization to higher dimensions
Author: Yang, Luren; Albregtsen, Fritz; Taxt, Torfinn
Corporate Source: Univ of Oslo, Oslo, Norway
Source: Graphical Models and Image Processing v 59 n 2 Mar 1997. p 97-108
Abstract: The three-dimensional Cartesian geometric moments (for short
3-D moments) are important features for 3-D object recognition and shape
description. To calculate the moments of objects in a 3-D image by a
straightforward method requires a large number of computing operations.
Some authors have proposed fast algorithms to compute the 3-D moments.
However, the problem of computation has not been well solved since all
known methods require computations of order N**3, assuming that the object
is represented by an N multiplied by N multiplied by N voxel image. In this
paper, we present a discrete divergence theorem which can be used to
compute the sum of a function over an n-dimensional discrete region by a
summation over the discrete surface enclosing the region. As its
corollaries, we give a discrete Gauss's theorem for 3-D discrete objects
and a discrete Green's theorem for 2-D discrete objects. Using a fast
surface tracking algorithm and the discrete Gauss's theorem, we design a
new method to compute the geometric moments of 3-D binary objects as
observed in 3-D discrete images. This method reduces the computational
complexity significantly, requiring computation of O(N**2). This reduction
is demonstrated experimentally on two 3-D objects. We also generalize the
method to deal with high-dimensional images. Some 3-D moment invariants and
shape features are also discussed. (Author abstract) 42 Refs.
Title: Shape synthesizer
Author: Glassner, Andrew S.
Corporate Source: Microsoft Research, Redmond, WA, USA
Source: IEEE Computer Graphics and Applications v 17 n 3 May-Jun 1997. p
40-51
Abstract: A new shape synthesizer was developed to foster creative
three-dimensional (3D) modeling of shapes difficult to develop without a
computer. It is based on the principles of sound synthesis, mapping them
directly into 3D geometry. Shape synthesis represents a useful new addition
to repertoire of geometric modeling techniques. The shape synthesizer is
capable of creating interesting, complex, and novel shapes, and supports a
variety of means to explore new classes of shapes, ranging from purely
random to precise and controlled. 12 Refs.
===============================
Date: Thu, 12 Jun 1997 14:13:16
===============================
TITLE: Recognizing 2-1/2D shape features 2 using a neural network and
heuristics
AUTHOR(S): Nezis K; Vosniakos G
CORPORATE SOURCE: UNIV MANCHESTER,INST SCI & TECHNOL, DEPT MECH ENGN, MFG
DIV, POB 88/MANCHESTER M60 1QD/LANCS/ENGLAND/ (REPRINT); NATL TECH UNIV
ATHENS,DEPT MECH ENGN, MFG DIV/GR-10682 ATHENS//GREECE/
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N7 (JUL), P523-539
===============================
Date: Fri, 20 Jun 1997 16:57:48
===============================
TITLE: Affine curve moment invariants for shape recognition
AUTHOR(S): Zhao DM; Chen J
CORPORATE SOURCE: UNIV MICHIGAN,DEPT ELECT & COMP ENGN/DEARBORN//MI/48128
(REPRINT)
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N6 (JUN), P895-901
===============================
Date: Fri, 18 Jul 1997 20:08:15 -0700
===============================
Voronoi diagrams of polygons: a framework for shape representation.
Mayya, Niranjan (Computer and Information Sciences Department, University
of Florida, Gainesville, Florida, 32611)
Rajan, V. T. (Manufacturing Research Department, IBM Thomas J. Watson
Research Center, Yorktown Heights, New York, 10598)
Journal of Mathematical Imaging and Vision, 1996, 6, no. 4, 355--378.
Summary: ``This paper describes an efficient shape representation
framework for planar shapes using Voronoi skeletons. First, a new algorithm
for the construction of the Voronoi diagram of a polygon with holes is
described. The main features of this algorithm are its robustness in
handling the standard degenerate cases (collinearity of more than two
points; co-circularity of more than three points), and its ease of
implementation. It also features a robust numerical scheme to compute
non-linear parabolic edges that avoids having to solve equations of degree
greater than two. The algorithm has been fully implemented and tested on a
variety of test inputs. Second, the Voronoi diagram of a polygon is used to
derive accurate and robust skeletons for planar shapes. The shape
representation scheme using Voronoi skeletons possesses the important
properties of connectivity as well as Euclidean metrics. Redundant skeletal
edges are deleted in a pruning step which guarantees that connectivity of
the skeleton will be preserved. The resultant representation is stable with
respect to being invariant to perturbations along the boundary of the
shape. A number of examples of shapes with and without holes are presented
to demonstrate the features of this approach.''
===============================
Date: Thu, 24 Jul 1997 02:20:34
===============================
TITLE: Genetic optimisation of the image feature extraction process
AUTHOR(S): Mirmehdi M; Palmer PL; Kittler J
CORPORATE SOURCE: UNIV SURREY,CTR VIS SPEECH & SIGNAL PROC/GUILDFORD GU2
5XH/SURREY/ENGLAND/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N4 (APR), P355-365
==============================
Date: Thu, 7 Aug 1997 03:00:28
==============================
Title: Skeleton-based modeling operations on solids
Author: Storti, Duane W.; Turkiyyah, George M.; Ganter, Mark A.; Lim,
Chek T.; Stal, Derek M.
Corporate Source: Univ of Washington, Seattle, WA, USA
Source: Proceedings of the Symposium on Solid Modeling and Applications
1997. ACM, New York, NY, USA. p 141-154
Abstract: The skeleton is a lower-dimensional geometric abstraction that
is useful for performing a number of important geometric operations on
solid models. In this paper we develop skeleton-based algorithms that
demonstrate the utility of the skeleton in addressing: (1) level-of-detail
control, the generation of hierarchical representations that preserve
overall shape but blur local boundary features; (2) hexahedral mesh
generation, the decomposition of a 3D shape into a collection of block
elements suitable for finite element analysis; (3) shape interpolation and
morphing, the generation of an `intermediate' shape from two given 3D
shapes and the generation of a sequence of shapes that smoothly transform
one shape into another; and (4) shape synthesis, the generation of an
optimal shape from specifications of functional performance requirements
and constraints. Besides our goal of providing novel solutions to these
problems of significant practical importance, we seek to illustrate the
general usefulness of the skeleton as an intermediate geometric description
that should be more widely implemented in commercial CAD systems. (Author
abstract) 44 Refs.
Title: Kernel for geometric features
Author: Middleditch, Alan; Reade, Chris
Corporate Source: Brunel Univ, Uxbridge, UK
Source: Proceedings of the Symposium on Solid Modeling and Applications
1997. ACM, New York, NY, USA. p 131-140
Abstract: This paper provides a rationale for its abstract data
definitions of geometric features. These definitions are used as the basis
of a suite of functions to support feature modelling. It assumes that
implementations of the proposed functions will make use of a solid
modelling kernel that supports objects with a disjoint cellular structure
and persistent cell identifiers. It is intended that most of the functions
required for the manipulation of features can be provided by overloaded
kernel functions; new functions are necessary only to provide feature
specific operations. Unlike most features in the literature, the features
of this paper are not design features, manufacturing features or features
for any other specific application. They are geometric structures that
support such applications. Thus, the disjoint cellular structure of a
modern solid modelling kernel is enhanced to include a hierarchy of
geometrically overlapping features. A feature at any node in the hierarchy
is defined in terms of instances of multiple sub-features combined using
any object construction function of the kernel. Such instancing allows
multiple versions of any feature to be modified simultaneously via the
master. (Author abstract) 17 Refs.
Title: Maintaining multiple views in feature modeling
Author: de Kraker, Klaas Jan; Dohmen, Maurice; Bronsvoort, Willem F.
Corporate Source: Delft Univ of Technology, Delft, Neth
Source: Proceedings of the Symposium on Solid Modeling and Applications
1997. ACM, New York, NY, USA. p 123-130
Abstract: A new feature modeling concept and its implementation are
presented. In the multiple-view modeling concept, a set of open feature
views of a product is maintained. The implementation does not rely on the
existence of certain views, but instead is generic since generic view
specifications are used. Views are maintained using feature conversion
techniques, including constraint techniques. For adding a view to the set
of open views, an open view function has been developed. This function uses
the specified view properties, including its feature definitions. It
derives a meaningful feature interpretation for the opened view. Geometric
constraint solving is used to propagate feature parameter changes between
views, and a priority mechanism is used in case of conflicting constraints.
In case of a conflict, a new incremental version of the open view function
is invoked, which updates the feature model of the reopened view
efficiently. (Author abstract) 11 Refs.
Title: Modeling with self validation features
Author: Mandorli, Ferruccio; Cugini, Umberto; Otto, Harald E.; Kimura,
Fumihiko
Corporate Source: Univ of Parma, Parma, Italy
Source: Proceedings of the Symposium on Solid Modeling and Applications
1997. ACM, New York, NY, USA. p 88-96
Abstract: An approach to the problem of controlling feature semantics in
feature-based modeling is proposed by using self validation features, an
entity concept developed to implement feature specification replenished
with self validation capabilities. Together with this approach the
traditional feature definition is extended in order to include the set of
rules that allows for feature instances to control the consistency of their
shape in respect to functionality associated. In order to realize a tight
integration between feature semantics and shape representation an
interfacing mechanism, based on an entity monitor, has been studied. 22
Refs.
===============================
Date: Thu, 14 Aug 1997 14:13:57
===============================
TITLE: An analysis of local feature extraction in digital mammography
AUTHOR(S): Marchette DJ; Lorey RA; Priebe CE
CORPORATE SOURCE: USN,CTR SURFACE WARFARE, B10/DAHLGREN//VA/22448 (REPRINT)
; JOHNS HOPKINS UNIV,DEPT MATH SCI/BALTIMORE//MD/21218
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N9 (SEP), P1547-1554
TITLE: Determination of feature correspondences in stereo images using a
calibration polygon
AUTHOR(S): Chiu JM; Chen Z; Chuang JH; Chia TL
CORPORATE SOURCE: NATL CHIAO TUNG UNIV,INST COMP SCI & INFORMAT
ENGN/HSINCHU 30050//TAIWAN/ (REPRINT); NATL CHIAO TUNG UNIV,INST COMP
SCI & INFORMAT ENGN/HSINCHU 30050//TAIWAN/; NATL CHIAO TUNG UNIV,INST
COMP & INFORMAT SCI/HSINCHU 30050//TAIWAN/; CHUNG CHENG INST SCI &
TECHNOL,DEPT ELECT ENGN/TAYUAN//TAIWAN/
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N9 (SEP), P1387-1400
TITLE: Image-to-image registration by matching area features using Fourier
descriptors and neural networks
AUTHOR(S): Tseng YH; Tzen JJ; Tang KP; Lin SH
CORPORATE SOURCE: NATL CHENG KUNG UNIV,DEPT SURVEYING ENGN, 1 UNIV
RD/TAINAN 70101//TAIWAN/ (REPRINT)
PUBLICATION: PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, 1997, V63, N8
(AUG), P975-983
ABSTRACT: An automatic method of image-to-image registration, which may be
applied to register overlapped images of a scene from different views
and dates, is presented. The proposed approach is a feature-based
matching with constraints of orientation consistency and one-to-one
match. Area features of homogeneous regions in gray level are extracted
from images as matching entities. The boundaries of area features are
matched in the frequency domain, i.e., matching their Fourier
descriptors. The spatial meaning of the matching is transforming a
feature to fit the other optimally. After the matching process, this
scheme provides not only a quantitative evaluation of the remaining
lack of fitness as an objective index of shape similarity, but also the
solved transformation parameters to represent the relative orientation
between features. The evaluation of shape similarity is used as the key
information in recognizing conjugate features for overlapped images.
Furthermore, the consistency of relative orientation between matched
pairs is considered as the principal constraint to dissolve improperly
registered features. The registration procedure is implemented by
combining the factor of shape similarity as well as the constraints of
orientation consistency and one-to-one match into a cost function and
driving the cost function to reach its lowest value by using an
artificial neural network system. The lowest cost represents the
optimal solution of matching conjugate features. The planar
registration of images then can be solved by using marched conjugate
features. Two application examples, registering a stereo pair of aerial
images and mosaicking overlapped images for automatic aerial
triangulation, presented to show the success of this method.
===============================
Date: Thu, 21 Aug 1997 13:38:28
===============================
TITLE: Chinese Font Composition method based on algebraic system of
geometric shapes
AUTHOR(S): Pan ZG; Ma XH; Zhang MM; Shi JY
CORPORATE SOURCE: ZHEJIANG UNIV,STATE KEY LAB CAD & CG/HANGZHOU
310027//PEOPLES R CHINA/ (REPRINT)
PUBLICATION: COMPUTERS & GRAPHICS, 1997, V21, N3 (MAY-JUN), P321-328
Title: Feature tracking from an image sequence using geometric invariants
Author: Tsui, H.T.; Zhang, Z.Y.; Kong, S.H.
Corporate Source: Univ of Hong Kong, Shatin, Hong Kong
Source: Proceedings of the IEEE Computer Society Conference on Computer
Vision and Pattern Recognition 1997. IEEE, Los Alamitos, CA, USA,97CB36082.
p 244-249
Abstract: In this paper two new feature tracking algorithms are proposed.
In the first algorithm, a perspective camera model is used. Making use of
the projective invariant of Barrett, and assuming the image feature points
corresponding to 8 general points in space are tracked by a conventional
method in the image sequence, the other feature points in the sequence can
be tracked using a Hough technique. Correspondence between two reference
images as required by the original Barrett's invariant is not necessary. In
the second algorithm, an affine camera model is assumed and the image
feature points corresponding to 4 non-coplanar points in space are assumed
tracked in the image sequence using a conventional method. These image
points form the basis of affine coordinates in each image. After the
correspondence of a fifth point is established between the first two
images, the affine coordinates of all image points in the first images
existence can be computed. As far as we know, this is the only algorithm
which can transfer a point knowing only a single image. Experiments showed
that both algorithms gave highly accurate tracking results. (Author
abstract) 11 Refs.
===============================
Date: Wed, 27 Aug 1997 18:25:52
===============================
TITLE: Efficient shape representation by minimizing the set of centres of
maximal discs/spheres
AUTHOR(S): Borgefors G; Nystrom I
CORPORATE SOURCE: UPPSALA UNIV,CTR IMAGE ANAL, LAGERHYDDVAGEN 17/S-75237
UPPSALA//SWEDEN/ (REPRINT); UPPSALA UNIV,CTR IMAGE ANAL/S-75237
UPPSALA//SWEDEN/; SWEDISH UNIV AGR SCI,CTR IMAGE ANAL/S-75007
UPPSALA//SWEDEN/
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N5 (MAY), P465-471
===============================
Date: Fri, 29 Aug 1997 02:53:45
===============================
Title: Computing size functions from edge maps
Author: Uras, Claudio; Verri, Alessandro
Corporate Source: Universita di Genova, Genova, Italy
Source: International Journal of Computer Vision v 23 n 2 June 1997. p
169-183
Abstract: Size functions are integer valued functions of two real
variables which have been recently proposed for the representation and
recognition of shape. A main limitation of the theory of size functions
appeared to be the fragility of the produced representation with respect to
edge fragmentation. In this paper it is shown that size functions can
actually be defined without making assumptions on the topological structure
of the viewed shape. Consequently, size functions can be profitably used
even in the presence of fragmented edge maps. In order to demonstrate the
potential of size functions for computer vision, a system for shape
recognition is described and tested on two different domains. The very good
performances of the system indicate that size functions are extremely
effective for the analysis of shapes for which geometric models might be
difficult to obtain. (Author abstract) 17 Refs.
Title: Following cusps
Author: Cipolla, Roberto; Fletcher, Gordon; Giblin, Peter
Corporate Source: Univ of Cambridge, Cambridge, UK
Source: International Journal of Computer Vision v 23 n 2 June 1997. p
115-129
Abstract: It is known that the deformation of the apparent contours of a
surface under perspective projection and viewer motion enable the recovery
of the geometry of the surface, for example by utilizing the epipolar
parametrization. These methods break down with apparent contours that are
singular i.e., with cusps. In this paper we study this situation and show
how, nevertheless, the surface geometry (including the Gauss curvature and
mean curvature of the surface) can be recovered by following the cusps.
Indeed the formulae are much simpler in this case and require lower
spatio-temporal derivatives than in the general case of nonsingular
apparent contours. We also show that following cusps does not by itself
provide us with information on viewer motion. (Author abstract) 14 Refs.
===============================
Date: Thu, 11 Sep 1997 15:10:39
===============================
TITLE: Modeling with features
AUTHOR(S): Wyvill G; McRobie D; Gigante M
CORPORATE SOURCE: UNIV OTAGO,DEPT COMP SCI, POB 56/DUNEDIN//NEW ZEALAND/
(REPRINT); ROYAL MELBOURNE INST TECHNOL,ADV COMP GRAPH
CTR/MELBOURNE/VIC 3001/AUSTRALIA/
PUBLICATION: IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1997, V17, N5 (
SEP-OCT), P40-46
===============================
Date: Thu, 18 Sep 1997 13:15:06
===============================
Title: Feature recognition applications in mesh generation
Author: Tautges, Timothy J.; Liu, Shang-sheng; Lu, Yong; Kraftcheck,
Jason; Gadh, Rajit
Corporate Source: Sandia Natl Lab, Albuquerque, NM, USA
Source: Trends in Unstructured Mesh Generation American Society of
Mechanical Engineers, Applied Mechanics Division, AMD v 220 1997. ASME, New
York, NY, USA. p 117-121
Abstract: The use of feature recognition as part of an overall
decomposition-based hexahedral meshing approach is described in this paper.
Our meshing approach consists of feature recognition, using a c-loop or
hybrid c-loop method, and the use of cutting surfaces to decompose the
solid model. These steps are part of an iterative process, which proceeds
either until no more features can be recognized or until the model has been
completely decomposed into meshable sub-volumes. This method can greatly
reduce the time required to generate an all-hexahedral mesh, either through
the use of more efficient meshing algorithms on more of the geometry or by
reducing the amount of manual decomposition required to mesh a volume.
(Author abstract) 14 Refs.
===============================
Date: Thu, 25 Sep 1997 14:33:23
===============================
TITLE: Elimination of the adverse effects of small model features by the
local modification of automatically generated meshes
AUTHOR(S): Dey S; Shephard MS; Georges MK
CORPORATE SOURCE: RENSSELAER POLYTECH INST,SCI COMPUTAT RES CTR, BLDG
CII-RM 7017/TROY//NY/12180 (REPRINT); RENSSELAER POLYTECH INST,SCI
COMPUTAT RES CTR/TROY//NY/12180
PUBLICATION: ENGINEERING WITH COMPUTERS, 1997, V13, N3, P134-152
ABSTRACT: Issues related to the automated identification and elimination of
the adverse influence of small geometric model features on the quality
of automatically generated meshes, using local mesh modification
operators, are addressed. The definition of mesh validity with respect
to the geometric model is extended to include multiple mesh entity
classifications. Checks based on mesh topology are used to ensure no
dimensional reductions in the locally modified mesh. Example geometric
models of varied complexity containing small geometric features are
used to demonstrate the ability of presented procedures to improve mesh
quality in terms of aspect ratio and small angle metrics.
==============================
Date: Thu, 2 Oct 1997 01:44:55
==============================
Title: Determining the skeletal description of sparse shapes
Author: Singh, Rahul; Cherkassky, Vladimir; Papanikolopoulos, Nikolaos P.
Corporate Source: Univ of Minnesota, Minneapolis, MN, USA
Source: Proceedings of IEEE International Symposium on Computational
Intelligence in Robotics and Automation, CIRA 1997. IEEE, Piscataway, NJ,
USA,97TB100176. p 368-373
Abstract: A variety of techniques in machine vision involve
representation of objects by using their shape skeleton. Many algorithms
have been proposed to date for obtaining the skeletal shape of digital
images. The noise models predominantly used in these techniques are
restricted to boundary noise. In particular, instances of noise occurring
inside object regions and causing their non-contiguity are precluded. In
this paper we present a method to obtain the skeletal shape of binary
images in the presence of both boundary noise and noise occurring inside
object regions. We propose to obtain the skeletal shape of such images by a
modified version of the Kohonen self-organizing map, implemented in a batch
processing mode. The modifications allow the map to adapt to the input
shape distribution. At each iteration, a competitive Hebbian rule is used
to progressively compute the Delaunay triangulation of the shape.
Information from the triangulation augments the map topology to yield the
final skeletal shape. The batch mode implementation of the self-organizing
process, allows our approach to compare very favorably, in terms of
computational time, with the traditional flowthrough implementations.
Encouraging experimental performance has been obtained on a variety of
shapes under varying signal to noise ratios. (Author abstract) 13 Refs.
==============================
Date: Thu, 2 Oct 1997 14:17:14
==============================
TITLE: Virtual reality interfaces for feature-based computer-aided design
systems
AUTHOR(S): Trika SN; Banerjee P; Kashyap RL
CORPORATE SOURCE: INTEL CORP,2111 NE 25TH AVE/HILLSBORO//OR/97124 (REPRINT)
; UNIV ILLINOIS,DEPT MECH ENGN/CHICAGO//IL/60607; PURDUE UNIV,SCH ELECT
& COMP ENGN/W LAFAYETTE//IN/47906
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N8 (AUG), P565-574
ABSTRACT: A computer-aided design (CAD) system with a virtual reality (VR)
interface simplifies the design of complex mechanical parts. To add a
design feature (e.g., a hole, slot, or protrusion), the designer can
navigate in the part to the appropriate face of the part where he/she
wishes to attach the feature, and sketch directly on that face. Besides
convenience, this method of feature specification implicitly enforces
feature accessibility constraints, and also provides hints to the
process-planner regarding the order in which the features may be
manufactured. We detail the design of a VR-based prototype CAD system.
The system maintains the knowledge of part cavities and their
adjacencies, and a triangulated boundary-representation of an
approximating polyhedron. We present incremental provably correct
algorithms for updating this representation as the user edits the part.
We also show how this representation supports real-time displays,
navigation, and collision detection. The user-interface of the CAD
system relies on these capabilities to provide the above-mentioned
advantages. (C) 1997 Elsevier Science Ltd.
TITLE: Creation of concept shape designs via a virtual reality interface
AUTHOR(S): Dani TH; Gadh R
CORPORATE SOURCE: UNIV WISCONSIN,DEPT MECH ENGN, 1513 UNIV
AVE/MADISON//WI/53706 (REPRINT)
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N8 (AUG), P555-563
===============================
Date: Wed, 22 Oct 1997 07:17:42
===============================
Title: Study on evolutional shape modeling: Parameter tuning
Author: Watabe, Hirokazu
Corporate Source: Doshisha Univ, Kyoto, Jpn
Conference Title: Proceedings of the 1997 1st International Conference on
Knowledge-Based Intelligent Electronic Systems, KES. Part 1 (of 2)
Conference Location: Adelaide, Aust Conference Date: 19970521-19970523
Source: International Conference on Knowledge-Based Intelligent
Electronic Systems, Proceedings, KES v 1 1997. IEEE, Piscataway, NJ,
USA,97TH8250. p 313-319
Abstract: The technique of generating suitable shape model automatically
using GA and FFD have already been developed. The technique has proposed
using the control points of an FFD lattice as the chromosome representing
evolved shapes. In the FFD technique, the shape of an object is deformed by
altering the positions of the control points on the FFD lattice. The hybrid
evolutional shape modeling system of GA and FFD has brought a fruitful
result. However, since various parameters exist in GA and FFD,
specification of those parameters is not easy, and the actual condition is
depending on a human's intuition. Then, in this paper, in order to brush up
the ability of the system, various parameters are tuned up experimentally.
(Author abstract) 5 Refs.
===============================
Date: Thu, 30 Oct 1997 01:09:55
===============================
Title: Feature based 2D shape transformation
Author: Hui, K.C.; Li, Yadong
Corporate Source: Chinese Univ of Hong Kong, Shatin, Hong Kong
Conference Title: Proceedings of the 1997 International Conference on
Information Visualization, IV
Source: Proceedings of the Information Visualization Conference 1997.
IEEE, Piscataway, NJ, USA,97TB100165. p 337-342
Abstract: The transformation or blending of one 2D shape into another
usually operates on sets of discrete points approximating the objects. This
relies on a series of evenly distributed or properly positioned points on
the boundary of the objects. Characteristics of the objects are not well
considered. This paper presents a technique for transforming or blending
shapes represented as a series of curve segments. Transformation of the
shapes is attained by establishing correspondence between pairs of features
of the objects. Based on an estimation of the sharpness of a corner on the
boundary of a 2D contour, vertices are generated on sharp corners of the
shapes and hence dividing the boundary of the shapes into elements.
Correspondence between the elements of the shape is then established before
the correspondence between points on the elements is established. This
allows special features of the shapes to be retained in the blending
operation which is essential in product and industrial design. (Author
abstract) 12 Refs.
==============================
Date: Wed, 5 Nov 1997 02:21:11
==============================
Title: Guaranteeing the topology of an implicit surface polygonization
for interactive modeling
Author: Stander, Barton T.; Hart, John C.
Corporate Source: Washington State Univ, Pullman, WA, USA
Source: Proceedings of the ACM SIGGRAPH Conference on Computer Graphics
1997. ACM, New York, NY, USA. p 279-286
Abstract: Morse theory shows how the topology of an implicit surface is
affected by its function's critical points, whereas catastrophe theory
shows how these critical points behave as the function's parameters change.
Interval analysis finds the critical points, and they can also be tracked
efficiently during parameter changes. Changes in the function value at
these critical points cause changes in the topology. Techniques for
modifying the polygonization to accommodate such changes in topology are
given. These techniques are robust enough to guarantee the topology of an
implicit surface polygonization, and are efficient enough to maintain this
guarantee during interactive modeling. The impact of this work is a
topologically-guaranteed polygonization technique, and the ability to
directly and accurately manipulate polygonized implicit surfaces in real
time. (Author abstract) 36 Refs.
Title: Modelling spatial reasoning systems with shape algebras and formal
logic
Author: Chase, Scott C.
Corporate Source: Natl Inst of Standards and Technology, Gaithersburg,
MD, USA
Source: Artificial Intelligence for Engineering Design, Analysis and
Manufacturing: AIEDAM v 11 n 4 Sep 1997. p 273-285
Abstract: The combination of the paradigms of shape algebras and
predicate logic representations, used in a new method for describing
designs, is presented. First-order predicate logic provides a natural,
intuitive way of representing shapes and spatial relations in the
development of complete computer systems for reasoning about designs. Shape
algebraic formalisms have advantages over more traditional representations
of geometric objects. Here we illustrate the definition of a large set of
high-level design relations from a small set of simple structures and
spatial relations, with examples from the domains of geographic information
systems and architecture. (Author abstract) 41 Refs.
Title: Comparison of projective reconstruction methods for pairs of views
Author: Rothwell, Charlie; Faugeras, Olivier; Csurka, Gabriella
Corporate Source: INRIA, Sophia Antipolis, Fr
Source: Computer Vision and Image Understanding v 68 n 1 Oct 1997. p
37-58
Abstract: Recently, different approaches for uncalibrated stereo have
been suggested which permit projective reconstructions from multiple views.
These use weak calibration which is represented by the epipolar geometry,
and so we require no knowledge of the intrinsic or extrinsic camera
parameters. In this paper we consider projective reconstructions from pairs
of views and compare a number of the available methods. Projective stereo
algorithms can be categorized by the way in which the 3D coordinates are
computed. The first class is similar to traditional stereo algorithms in
that the 3D world geometry is made explicit; the initial phase of the
processing always involves the estimation of the camera matrices from which
the 3D coordinates are computed. We show how the camera matrices can be
computed either from point correspondences, or how they are constrained by
the fundamental matrices. The second class of algorithms are based on
implicit image measurements which are used to compute projective invariants
from image correspondences. The invariants are based on the Cayley algebra
and on cross ratios. In all cases, the invariants are functionally
dependent on the 3D coordinates. We report on the stabilities of the
different methods using a range of meaningful synthetic and real images.
>From these we can conclude which methods are most likely to be of use in
applications that are dependent on 3D uncalibrated reconstructions. (Author
abstract) 33 Refs.
==============================
Date: Thu, 6 Nov 1997 14:56:47
==============================
TITLE: COSMOS - A representation scheme for 3D free-form objects
AUTHOR(S): Dorai C; Jain AK
CORPORATE SOURCE: IBM CORP,TJ WATSON RES CTR, POB 704/YORKTOWN
HTS//NY/10598 (REPRINT); MICHIGAN STATE UNIV,DEPT COMP SCI/E
LANSING//MI/48824
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997, V19, N10 (OCT), P1115-1130
TITLE: Classification using adaptive wavelets for feature extraction
AUTHOR(S): Mallet Y; Coomans D; Kautsky J; DeVel O
CORPORATE SOURCE: JAMES COOK UNIV N QUEENSLAND,DEPT MATH &
STAT/TOWNSVILLE/QLD 4811/AUSTRALIA/ (REPRINT); UNIV ADELAIDE,DEPT MATH
& STAT/ADELAIDE/SA 5001/AUSTRALIA/; JAMES COOK UNIV N QUEENSLAND,DEPT
COMP SCI/TOWNSVILLE/QLD 4811/AUSTRALIA/
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997, V19, N10 (OCT), P1058-1066
Title: Machine interpretation of CAD data for manufacturing applications
Author: Ji, Qiang; Marefat, Michael M.
Corporate Source: Univ of Arizona, Tucson, AZ, USA
Source: ACM Computing Surveys v 29 n 3 Sep 1997. p 264-311
Abstract: Machine interpretation of the shape of a component from
computer aided design (CAD) databases is an important problem in
CAD/computer aided manufacturing (CAM), computer vision, and intelligent
manufacturing. The development of research on machine recognition of
features from CAD data, the advantages and potential problems, and some of
the directions of investigations may take are discussed. In addition, the
problem is addressed from the perspective of information input requirements
and the advantages and disadvantages of boundary representation,
constructive solid geometry, and 2D drawings with respect to machine
recognition of features are examined. Emphasis is placed on the mechanisms
for attacking problems associated with interacting features. Refs.
===============================
Date: Wed, 12 Nov 1997 16:26:54
===============================
TITLE: A genetic algorithm for affine invariant recognition of object
shapes from broken boundaries
AUTHOR(S): Tsang PWM
CORPORATE SOURCE: CITY UNIV HONG KONG,DEPT ELECT ENGN, TAT CHEE
AVE/KOWLOON//HONG KONG/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N7 (JUL), P631-639
==============================
Date: Mon, 1 Dec 1997 18:54:32
==============================
Title: Hierarchical Bayesian methods for recognition and extraction of
3-D shape features from CAD solid models
Author: Marefat, Michael M.; Ji, Qiang
Corporate Source: Univ of Arizona, Tucson, AZ, USA
Source: IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems
and Humans. v 27 n 6 Nov 1997. p 705-727
Abstract: This paper introduces a new uncertainty reasoning-based method
for identification and extraction of manufacturing features from solid
model description of objects. A major difficulty faced by previously
proposed methods for feature extraction has been the interaction between
features. In interacting situations, the representation for various
primitive features is nonunique making their recognition very difficult. We
develop an approach based on generating, propagating, and combining
geometric and topological evidences in a hierarchical belief network for
identifying and extracting features. The methodology combines and
propagates evidences to determine a set of correct virtual links to be
augmented to the cavity graph representing a depression of the object so
that the resulting supergraph can be partitioned to obtain the features of
the object. The hierarchical belief network is constructed based on the
hypotheses for the potential virtual links. The evidences which are
topological and geometric relationships at different abstraction levels
impact the belief network through their (amount of) support for different
hypotheses. The propagation of the impact of different evidences updates
the beliefs in the network in accordance with the Bayesian probability
rules. (Author abstract) 32 Refs.
==============================
Date: Thu, 4 Dec 1997 17:51:56
==============================
Title: Feature extraction approach to blind source separation
Author: Lin, Juan K.; Grier, David G.; Cowan, Jack D.
Corporate Source: Univ of Chicago, Chicago, IL, USA
Conference Title: Proceedings of the 1997 7th IEEE Workshop on Neural
Networks for Signal Processing, NNSP'97
Conference Location: Amelia Island, FL, USA Conference Date:
19970924-19970926
Sponsor: IEEE
E.I. Conference No.: 47302
Source: Neural Networks for Signal Processing - Proceedings of the IEEE
Workshop 1997. IEEE, Piscataway, NJ, USA. p 398-405
Publication Year: 1997
CODEN: 85QHAU
Language: English
Document Type: CA; (Conference Article) Treatment: T; (Theoretical)
Journal Announcement: 9801W2
Abstract: Local independent component analysis is formulated as a task
involving the extraction of local geometric structure in the joint
distribution. Because the geometrical structure of statistical independence
is not well captured by statistical descriptions such as moments and
cumulants, we use feature detection tools from image analysis to locate the
local independent component coordinate system. The resulting approach to
source separation can be implemented in real time using conventional image
analysis hardware. The generality of this approach is demonstrated by blind
source separation of multi-modal sources, and the pseudo-separation of
three sources from two mixtures. (Author abstract) 8 Refs.
Title: COSMOS - a representation scheme for 3D free-form objects
Author: Dorai, Chitra; Jain, Anil K.
Corporate Source: IBM T.J. Watson Research Cent, Yorktown Heights, NY,
USA
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
19 n 10 Oct 1997. p 1115-1130
Abstract: We address the problem of representing and recognizing 3D
free-form objects when 1) the object viewpoint is arbitrary, 2) the objects
may vary in shape and complexity, and 3) no restrictive assumptions are
made about the types of surfaces on the object. We assume that a range
image of a scene is available, containing a view of a rigid 3D object
without occlusion. We propose a new and general surface representation
scheme for recognizing objects with free-form (sculpted) surfaces. In this
scheme, an object is described concisely in terms of maximal surface
patches of constant shape index. The maximal patches that represent the
object are mapped onto the unit sphere via their orientations, and
aggregated via shape spectral functions. Properties such as surface area,
curvedness, and connectivity, which are required to capture local and
global information, are also built into the representation. The scheme
yields a meaningful and rich description useful for object recognition. A
novel concept, the shape spectrum of an object is also introduced within
the framework of COSMOS for object view grouping and matching. We
demonstrate the generality and the effectiveness of our scheme using real
range images of complex objects. (Author abstract) 38 Refs.
TITLE: Focused color intersection with efficient searching for object
extraction
AUTHOR(S): Vinod VV; Murase H
CORPORATE SOURCE: NIPPON TELEGRAPH & TEL PUBL CORP,BASIC RES
LABS/ATSUGI/KANAGAWA 24301/JAPAN/ (REPRINT); NIPPON TELEGRAPH & TEL
PUBL CORP,BASIC RES LABS/ATSUGI/KANAGAWA 24301/JAPAN/
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N10 (OCT), P1787-1797
TITLE: Face recognition using transform features and neural networks
AUTHOR(S): Ranganath S; Arun K
CORPORATE SOURCE: NATL UNIV SINGAPORE,DEPT ELECT ENGN, 10 KENT RIDGE
CRESCENT/SINGAPORE 119260//SINGAPORE/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N10 (OCT), P1615-1622
TITLE: Investigations on fuzzy thresholding based on fuzzy clustering
AUTHOR(S): Jawahar CV; Biswas PK; Ray AK
CORPORATE SOURCE: INDIAN INST TECHNOL,DEPT ELECT & ELECT COMMUN
ENGN/KHARAGPUR 721302/W BENGAL/INDIA/ (REPRINT); INDIAN INST
TECHNOL,DEPT ELECT & ELECT COMMUN ENGN/KHARAGPUR 721302/W BENGAL/INDIA/
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N10 (OCT), P1605-1613
TITLE: Fuzzy feature description of handwriting patterns
AUTHOR(S): Malaviya A; Peters L
CORPORATE SOURCE: GMD,GERMAN NATL RES CTR INFORMAT TECHNOL SCHLOSS
BIRL/D-53754 ST AUGUSTIN//GERMANY/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N10 (OCT), P1591-1604
TITLE: Feature analysis: Neural network and fuzzy set theoretic approaches
AUTHOR(S): De RK; Pal NR; Pal SK
CORPORATE SOURCE: INDIAN STAT INST,MACHINE INTELLIGENCE UNIT/CALCUTTA
700035/W BENGAL/INDIA/ (REPRINT); INDIAN STAT INST,MACHINE INTELLIGENCE
UNIT/CALCUTTA 700035/W BENGAL/INDIA/
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N10 (OCT), P1579-1590
===============================
Date: Thu, 18 Dec 1997 14:42:31
===============================
TITLE: Resolving feature interactions in 3D part editing
AUTHOR(S): Perng DB; Chang CF
CORPORATE SOURCE: NATL CHIAO TUNG UNIV,INST IND ENGN/HSINCHU 30010//TAIWAN/
(REPRINT); NATL CHIAO TUNG UNIV,INST IND ENGN/HSINCHU 30010//TAIWAN/
PUBLICATION: COMPUTER-AIDED DESIGN, 1997, V29, N10 (OCT), P687-699
===============================
Date: Thu, 29 Jan 1998 23:21:38
===============================
TITLE: The role of integral features for perceiving image discriminability
AUTHOR(S): FdezVidal XR; Garcia JA; FdezValdivia J; RodriguezSanchez R
CORPORATE SOURCE: UNIV GRANADA,DEPT COMP SCI & ARTIFICIAL
INTELLIGENCE/E-18071 GRANADA//SPAIN/ (REPRINT); UNIV GRANADA,DEPT
CIENCIAS COMPUTAC/E-18071 GRANADA//SPAIN/; UNIV GRANADA,IA, ETS INGN
INFORMAT/E-18071 GRANADA//SPAIN/; UNIV SANTIAGO DE COMPOSTELA,FAC FIS,
DEPT FIS APLICADA/SANTIAGO DE COMPOSTELA 15706//SPAIN/; UNIV
JAEN,ESCUELA POLITECN SUPER, DEPT INFORMAT/JAEN 23071//SPAIN/
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N8 (AUG), P733-740
===============================
Date: Wed, 11 Feb 1998 02:38:09
===============================
Title: Geometric shape recognition of freeform curves and surfaces
Author: Elber, Gershon; Kim, Myung-Soo
Corporate Source: Israel Inst of Technology, Haifa, Isr
Source: Graphical Models and Image Processing v 59 n 6 Nov 1997. p
417-433
Abstract: Recognizing the construction methods of (piecewise) polynomial
or rational curves and surfaces is of great importance, e.g., for
geometrical data exchange between two different modeling systems. We
formulate intrinsic conditions that are parameterization independent
whenever possible. These conditions can detect: (i) whether a curve segment
is a line, a circle, or a planar curve; (ii) whether a surface patch is a
plane, a sphere, a cylinder, or a cone; and (iii) whether a surface is
constructed as a surface of revolution/extrusion, a ruled/developable
surface, or a generalized cylinder. (Author abstract) 22 Refs.
===============================
Date: Thu, 19 Feb 1998 20:48:39
===============================
Title: Geometric reasoning for optimizing backward growing-based feature
recognition
Author: Joneja, Ajay
Corporate Source: Hong Kong Univ of Science & Technology, Hong Kong, Hong
Kong
Source: Computers & Industrial Engineering v 33 n 3-4 Dec 1997. p 489-492
Abstract: Feature recognition has been a weak link in most
implementations of integrated CAD/CAM systems for machining. A method
called Backward Growing was recently suggested as a simple, but effective
means to recognize machining features from the boundary representation
(brep) of a designed part. The method promises, through its simplicity, to
be applicable to many varieties of machined shapes. However, it has some
drawbacks which create difficulties in making intelligent decisions about
machining of shapes. In this work, we deal with two such difficulties, and
propose a methodology of solving them. We also present some of the work
done in implementing an enhanced version of backward growing as a
functional part of an open-architecture system for process planning called
OSCAP. (Author abstract) 10 Refs.
===============================
Date: Thu, 26 Feb 1998 16:03:39
===============================
TITLE: Solid reconstruction from orthographic opaque views using
incremental extrusion
AUTHOR(S): Shum SSP; Lau WS; Yuen MMF; Yu KM
CORPORATE SOURCE: HONG KONG POLYTECH UNIV,DEPT MFG ENGN/KOWLOON//PEOPLES R
CHINA/ (REPRINT); HONG KONG POLYTECH UNIV,DEPT MFG
ENGN/KOWLOON//PEOPLES R CHINA/; HONG KONG TECH COLL,/CHAI WAN//PEOPLES
R CHINA/; HONG KONG UNIV SCI & TECHNOL,DEPT MECH ENGN/CLEARWATER
BAY//PEOPLES R CHINA/
PUBLICATION: COMPUTERS & GRAPHICS, 1997, V21, N6 (NOV-DEC), P787-800
Title: Feature-based off-line programming of coordinate measuring
machines
Author: Hermann, Gyula
Corporate Source: Coll of Engineering and Automation, Kecskemet, Hung
Conference Title: Proceedings of the 1997 International Conference on
Intelligent Engineering Systems, INES
Source: IEEE International Conference on Intelligent Engineering Systems,
Proceedings, INES 1997. IEEE, Piscataway, NJ, USA,97TH8224. p 545-548
Abstract: The paper describes an off-line programming system for
coordinate measuring machines based on a novel approach. Input data to the
system is the geometric model produced by a CAD system. Using the picture
of the part, the user can select the surface elements to be inspected. He
or she has to provide the tolerance data as additional information. First
the workpiece setup is decided: the position and orientation, the
accessibility of the part is determined. Next the system automatically
generates an optimal distribution of the measuring points for the surfaces
to be inspected and the local probepath. Probe clusters are built together
on an interactive way using a set of building blocks. A time optimal
sequence of the inspection operations is computed using a heuristic
algorithms. At this stage all information needed for the CMM programme is
available and will be combined in a device independent DMIS format, which
in turn can be converted into equipment specific programmes. (Author
abstract) 10 Refs.
Title: Shape recognition using fractal geometry
Author: Neil, G.; Curtis, K.M.
Corporate Source: Univ of Nottingham, Nottingham, UK
Source: Pattern Recognition v 30 n 12 Dec 1997. p 1957-1969
Abstract: Within this paper fractal transformations are presented as a
powerful new shape recognition technique. The motivation behind using
fractal transformations is to develop a high speed shape recognition
technique which will be scale invariant. A review is given of the most
popular existing shape recognition techniques. There then follows a full
mathematical analysis of the new technique together with a proof of the
authors Fractal Invariance Theorem, the new theorem at the centre of the
recognition technique. Through the mathematical analysis it becomes
apparent that the fractal recognition technique possesses the remarkable
property that it is able to distinguish between similar objects. Details
are then given of the practical implementation of the technique together
with an algorithm for making the technique rotationally invariant. The
technique is then applied to a selection of real world objects and a
comparison made with the popular moment invariants technique. This shows
that the fractal technique is faster than the technique of moment
invariants, and also requires less initial information to be effective.
Finally conclusions are drawn and further work detailed. (Author abstract)
20 Refs.
==============================
Date: Sat, 7 Mar 1998 11:09:09
==============================
TITLE: Dividing attention between the color and the shape of objects
AUTHOR(S): Bonnel AM; Prinzmetal W
CORPORATE SOURCE: CNRS,CNRC, CTR RECH PSYCHOL COGNIT, 31 CHEMIN JOSEPH
AIGUIER/F-13402 MARSEILLE 09//FRANCE/ (REPRINT); UNIV CALIF
BERKELEY,/BERKELEY//CA/94720
PUBLICATION: PERCEPTION & PSYCHOPHYSICS, 1998, V60, N1 (JAN), P113-124
===============================
Date: Wed, 11 Mar 1998 03:33:11
===============================
Title: Morphological shape decomposition using shape characteristics
Author: Choi, Jong Ho; Ko, Duck Young; An, Young Hwa
Corporate Source: Kang-Nam Univ, KyungKi, South Korea
Conference Title: Proceedings of the 1996 IEEE Region 10 TENCON - Digital
Signal Processing Applications Conference. Part 1 (of 2)
Source: IEEE Region 10 Annual International Conference,
Proceedings/TENCON v 1 1996. IEEE, Piscataway, NJ, USA,96CH36007. p 215-220
Abstract: In this paper, the morphological shape decompositions using
shape directivity and shape function are proposed for the purpose of
pattern recognition and image compression. To consider the horizontal and
vertical directivity of shape, we use the ellipsoid and rectangle as
primitive elements in the method using shape directivity. In the method
using shape function, a structuring element that geometrical
characteristics is more similar to the shape function is preselected. And,
the shape is decomposed into the primitive elements of corresponding to the
structuring elements. Through the experiment to prove the efficiency of
proposed algorithms, we compared the proposed algorithms with conventional
algorithms in view of description error and coding efficiency. (Author
abstract) 9 Refs.
===============================
Date: Fri, 13 Mar 1998 13:51:39
===============================
TITLE: Feature recognition from CAD models
AUTHOR(S): Han JH; Requicha AAG
CORPORATE SOURCE: SUNG KYUN KWAN UNIV,SCH ELECT & COMP ENGN/SUWON
440746//SOUTH KOREA/ (REPRINT); UNIV SO CALIF,/LOS ANGELES//CA/90089
PUBLICATION: IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1998, V18, N2 (
MAR-APR), P80-94
===============================
Date: Wed, 18 Mar 1998 02:45:53
===============================
Title: Geometric approach to edge detection
Author: Bezdek, James C.; Chandrasekhar, Ramachandran; Attikiouzel,
Yianni
Corporate Source: Univ of West Florida, Pensacola, FL, USA
Source: IEEE Transactions on Fuzzy Systems v 6 n 1 Feb 1998. p 52-75
Abstract: This paper describes edge detection as a composition of four
steps: conditioning, feature extraction, blending, and scaling. We examine
the role of geometry in determining good features for edge detection and in
setting parameters for functions to blend the features. We find that: 1)
statistical features such as the range and standard deviation of window
intensities can be as effective as more traditional features such as
estimates of digital gradients; 2) blending functions that are roughly
concave near the origin of feature space can provide visually better edge
images than traditional choices such as the city-block and Euclidean norms;
3) geometric considerations can be used to specify the parameters of
generalized logistic functions and Takagi-Sugeno input-output systems that
yield a rich variety of edge images; and 4) understanding the geometry of
the feature extraction and blending functions is the key to using models
based on computational learning algorithms such as neural networks and
fuzzy systems for edge detection. Edge images derived from a digitized
mammogram are given to illustrate various facets of our approach. (Author
abstract) 33 Refs.
Title: Solid reconstruction from orthographic opaque views using
incremental extrusion
Author: Shum, Simon S.P.; Lau, W.S.; Yuen, Matthew M.F.; Yu, K.M.
Corporate Source: Hong Kong Polytechnic Univ, Kowloon, Hong Kong
Source: Computers & Graphics (Pergamon) v 21 n 6 Nov-Dec 1997. p 787-800
Abstract: The reconstruction of 3-D solids from 2-D projections is an
important research topic in reverse engineering. The reconstruction can be
grouped into two categories: single-view approach and multiple-view
approach. Each approach can be classified as wireframe, BRep or CSG.
However, not many CSG approaches have been reported in the literature. The
methods are also restricted to uniform-thickness objects or require user
interaction. The method proposed in this paper employs the CSG approach. A
3-D solid computer model is reconstructed from 2-D line drawings of six
orthographic opaque views, viz. top, front, left, right, bottom and rear
views. Firstly, the six views are grouped into three pairs. For each pair
of views, segmented areas from one of the two views (called g-view) is
incrementally extruded according to the information in the neighbouring
view (called d-view). Extrusion primitive solids are generated during the
incremental extrusion. All primitive solids are then unioned into an
extrusion solid. Finally, all extrusion solids are intersected to give a
unique 3-D solution object. (Author abstract) 34 Refs.
Title: Shape operator and its application to texture analysis
Author: Phongsuphap, Sukanya; Takamatsu, Ryo; Sato, Makoto
Corporate Source: Tokyo Inst of Technology, Yokohama, Jpn
Source: Kyokai Joho Imeji Zasshi/Journal of the Institute of Image
Information and Television Engineers v 51 n 10 Oct 1997. p 1730-1737
Abstract: Properly representing image structure is a major problem faced
in developing a computer vision system. This paper proposes a concise
descriptor called the shape operator for describing image structure. We
first consider an image function as a surface then establish the shape
operator by utilizing surface curvatures. The shape operator can give rich,
detailed descriptions in terms of topographical shapes and has invariance
properties which are required in computer vision systems. We show
usefulness of the shape operator with a texture classification application.
Experimental results indicate that the shape operator gives a
representation that is sufficiently detailed for characterizing texture
images. In particular, it can satisfactorily mitigate the adverse effects
of variations in lighting. (Author abstract) 12 Refs.
==============================
Date: Wed, 1 Apr 1998 02:59:49
==============================
Title: Feature recognition from CAD models
Author: Han, JungHyun; Requicha, Aristides A.G.
Corporate Source: Sung Kyun Kwan Univ, Suwon, South Korea
Source: IEEE Computer Graphics and Applications v 18 n 2 Mar-Apr 1998. p
80-94
Abstract: Integrated Incremental Feature Finder (IF**2) is a system for
generating machining feature models of mechanical parts that uses the
information available in the nominal solid model of a part, design
features, tolerances and attributes. It is very flexible because it can
function as a feature recognizer when only solid modeling data are
available, as a feature model converter when only design features are
given, or as some combination of the two for mixed-data input. IF**2 also
works incrementally to provide rapid feedback to designers. The algorithms
implemented in IF**2 help achieve the goal of computer aided
design/computer aided manufacturing integration. 17 Refs.
==============================
Date: Thu, 2 Apr 1998 16:54:05
==============================
TITLE: A fast surface-based procedure for object reconstruction from 3D
scattered points
AUTHOR(S): Oblonsek C; Guid N
CORPORATE SOURCE: UNIV MARIBOR,FAC ELECT ENGN & COMP SCI, SMETANOVA
17/SI-2000 MARIBOR//SLOVENIA/ (REPRINT)
PUBLICATION: COMPUTER VISION AND IMAGE UNDERSTANDING, 1998, V69, N2 (FEB)
, P185-195
ABSTRACT: In this paper, a new fast three-phase method for object
reconstruction from 3D scattered points is presented, The first phase
is founded on a novel fast triangulation algorithm, which generates a
base approximation of the object surface. By inserting bridges, the
triangulation algorithm also handles surfaces with genus greater than
zero and determines the genus of the reconstructed surface. From
results of the first phase, the object surface features, such as sharp
edges, silhouette polylines, and corners, are extracted in the next
phase. Sharp edges and corners are used as constraints for triangular
mesh fairing later in the final phase, where a new improved decimation
and a novel mesh refinement procedure are introduced, while silhouette
polylines can be applied for generation of a wire-frame model of the
reconstructed object. The overall object reconstruction procedure has a
tested linear time complexity. (C) 1998 Academic Press.
==============================
Date: Wed, 8 Apr 1998 02:39:26
==============================
Title: Die-cavity pocketing via cutting simulation
Author: Choi, Byoung K.; Kim, Bo H.
Corporate Source: Korea Advanced Inst of Science and Technology, Taejon,
South Korea
Source: Computer Aided Design v 29 n 12 Dec 1997. p 837-846
Abstract: For die-cavity pocketing, the cavity volume is sliced into a
number of cutting-layers by horizontal cutting-planes, and each layer is
pocket-machined using the contour-parallel offset method in which the
tool-paths are obtained by repeatedly offsetting the boundary-pocketing
curve. The major challenges in die-cavity pocketing include: 1) finding a
method for obtaining the boundary-pocketing curve, 2) generating evenly
spaced contour-parallel offset tool-paths, 3) detecting and removing
uncut-regions, and 4) estimating chip-loads for an adaptive feed control.
No systematic solution for these problems has been offered in the
literature, except the curve offsetting methods for computing
contour-parallel offset curves. Presented in the article is a
straightforward approach to die-cavity pocketing, in which all the four
challenges are handled successfully by using the existing
cutting-simulation methods. (Author abstract) 30 Refs.
===============================
Date: Thu, 16 Apr 1998 17:50:54
===============================
Matching convex shapes with respect to the symmetric difference.
Algorithms---ESA '96 (Barcelona)
Alt, Helmut (Institut fur Informatik, Fachbereich Mathematik, Freie
Universitat Berlin, D-14195 Berlin, Germany)
Fuchs, Ulrich (Institut fur Informatik, Fachbereich Mathematik, Freie
Universitat Berlin, D-14195 Berlin, Germany)
Rote, Gunter (Institut fur Mathematik, Technische Universitat Graz, 8010
Graz, Austria)
Weber, Gerald (Institut fur Informatik, Fachbereich Mathematik, Freie
Universitat Berlin, D-14195 Berlin, Germany)
1996,
Springer, Berlin,; 320--333,,
Series: Lecture Notes in Comput. Sci., 1136,
Summary: ``This paper deals with questions from convex geometry related
to shape matching. In particular, we consider the problem of matching
convex figures minimizing the area of the symmetric difference. The main
theorem of this paper states that if we just match the two centers of
gravity the resulting symmetric difference is within a factor of 11/3 from
the optimal one. This leads to efficient approximate matching algorithms
for convex figures.''
===============================
Date: Wed, 22 Apr 1998 02:42:42
===============================
Title: Optimal matching of three-dimensional features under geometrical
constraints
Author: Calafiore, G.C.; Bona, B.
Corporate Source: Politecnico di Torino, Torino, Italy
Source: Proceedings of the IEEE Conference on Decision and Control v 2
1997. IEEE, Piscataway, NJ, USA,97CH36124. p 1936-1941
Abstract: This paper addresses the problem of determination of the
displacement parameters (rigid rotation and translation) that bring an
object set of three-dimensional features to match a template set,
minimizing a measure of the mismatch error and satisfying an assigned set
of geometrical constraints. This problem is encountered in many
applications of computer vision, manufacturing processes (tolerance
inspection of machined parts) and robotics, and has been widely treated in
the literature in the unconstrained case. In this paper the solution of the
unconstrained problem (least-squares solution via Singular Value
Decomposition) is reviewed, and an original solution method for the
constrained problem is proposed, based on an efficient interior-point
convex optimization algorithm. An example of application to the target pose
determination of a robot end-effector for a precision positioning task is
presented to illustrate the use of the proposed methodology. (Author
abstract) 20 Refs.
Title: Differential and numerically invariant signature curves applied to
object recognition
Author: Calabi, Eugenio; Olver, Peter J.; Shakiban, Chehrzad; Tannenbaum,
Allen; Haker, Steven
Corporate Source: Univ of Pennsylvania, Philadelphia, PA, USA
Source: International Journal of Computer Vision v 26 n 2 Feb 1998. p
107-135
Abstract: We introduce a new paradigm, the differential invariant
signature curve or manifold, for the invariant recognition of visual
objects. A general theorem of E. Cartan implies that two curves are related
by a group transformation if and only if their signature curves are
identical. The important examples of the Euclidean and equi-affine groups
are discussed in detail. Secondly, we show how a new approach to the
numerical approximation of differential invariants, based on suitable
combination of joint invariants of the underlying group action, allows one
to numerically compute differential invariant signatures in a fully
group-invariant manner. Applications to a variety of fundamental issues in
vision, including detection of symmetries, visual tracking, and
reconstruction of occlusions, are discussed. (Author abstract) 60 Refs.
Title: Fitting measured points to a parametric surface
Author: Zhao, B.; Okubo, Sh.; Tang, H.; Wang, Y.
Source: Nippon Kikai Gakkai Ronbunshu, C Hen/Transactions of the Japan
Society of Mechanical Engineers, Part C v 63 n 616 Dec 1997. p 4378-4384
Language: English; Japanese
Abstract: During automobile body design, the designer's intentions are
initially represented in the form of a physical model, where feature lines
are first drawn on a clay model, and points are then digitized using CMM
(Coordinate Measurement Machine) and fitted to parametric curves and
surfaces. This provides the master mathematical model for car styling. In
this paper, using the variational principle, a general surface smoothing
scheme is proposed to fit the grid points, boundary points and scatter
points to the smoothness parametric surface. It has been a long-standing
research problem to smooth scatter data points to surface. Some methods had
been proposed to do it using radial functions, partial derivative equation,
integral equation or the triangular parametric surface form. However our
method is using the squared parametric surface form. A variety of curves
and surfaces with different smoothness can be obtained with the aid of
parameters such as approximation and smoothness weights, segment or patch
numbers and the distribution of approximation and smoothness weights. A car
body was finished to show the usefulness of this proposed method. (Author
abstract) 16 Refs.
==============================
Date: Fri, 1 May 1998 03:36:37
==============================
TITLE: Stereo matching as a nearest-neighbor problem
AUTHOR(S): Tomasi C; Manduchi R
CORPORATE SOURCE: STANFORD UNIV,DEPT COMP SCI/STANFORD//CA/94305 (REPRINT)
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1998, V20, N3 (MAR), P333-340
TITLE: Partitioning of feature space for pattern classification
AUTHOR(S): Mandal DP
CORPORATE SOURCE: INDIAN STAT INST,MACHINE INTELLIGENCE UNIT, 203 BT
RD/CALCUTTA 700035/W BENGAL/INDIA/ (REPRINT); UNIV OSAKA
PREFECTURE,DEPT IND ENGN/SAKAI/OSAKA 593/JAPAN/
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N12 (DEC), P1971-1990
TITLE: Shape recognition using fractal geometry
AUTHOR(S): Neil G; Curtis KM
CORPORATE SOURCE: UNIV NOTTINGHAM,DEPT ELECT & ELECT ENGN, UNIV
PK/NOTTINGHAM NG7 2RD//ENGLAND/ (REPRINT); UNIV NOTTINGHAM,DEPT ELECT &
ELECT ENGN/NOTTINGHAM NG7 2RD//ENGLAND/
PUBLICATION: PATTERN RECOGNITION, 1997, V30, N12 (DEC), P1957-1969
==============================
Date: Thu, 7 May 1998 18:54:20
==============================
TITLE: Statistical analysis of shape through triangulation of landmarks: A
study of sexual dimorphism in hominids
AUTHOR(S): Rao CR; Suryawanshi S
CORPORATE SOURCE: PENN STATE UNIV,DEPT STAT, 326 THOMAS
BLDG/ULHASNAGAR//PA/16802 (REPRINT); MERCK RES LABS,/RAHWAY//NJ/07065
PUBLICATION: PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED
STATES OF AMERICA, 1998, V95, N8 (APR 14), P4121-4125
ABSTRACT: Two objects with homologous landmarks are said to be of the same
shape if the configuration of landmarks of one object can be exactly
matched with that of the other by translation, rotation/reflection, and
scaling. In an earlier paper, the authors proposed statistical analysis
of shape by considering logarithmic differences of all possible
Euclidean distances between landmarks. Tests of significance for
differences in the shape of objects and methods of discrimination
between populations were developed with such data. In the present
paper, the corresponding statistical methodology is developed by
triangulation of the landmarks and by considering the angles as natural
measurements of shape. This method is applied to the study of sexual
dimorphism in hominids.
Title: Integral attachment using snap-fit features: A key to assembly
automation. Part 5 - a procedure to constrain parts fully and generate
alternative attachment concepts
Author: Genc, Suat; Messler, Robert W.; Gabriele, Gary A.
Corporate Source: Rensselaer Polytechnic Inst, Troy, NY, USA
Source: Assembly Automation v 18 n 1 1998. p 68-74
Abstract: This fifth part of a comprehensive six-part series of articles
presents a systematic procedure for formalizing the generation of
alternative concepts for a particular design employing integral snap-fit
attachments. With the procedure, the alternatives generated are
representative of the entire pertinent design space, since they include
alternative attachment interface geometries, assembly procedures,
attachment features, and constraint options for a particular application.
The procedure is easy to use, effective and efficient, and results in a
number of alternatives which are sufficient to represent the entire
pertinent design space, but not so large as to preclude selection of a best
concept using an optimization method. (Author abstract) 12 Refs.
===============================
Date: Wed, 20 May 1998 09:59:14
===============================
TITLE: Representation and interpretation of geometric tolerances for
polyhedral objects - I. Form tolerances
AUTHOR(S): Roy U; Li B
CORPORATE SOURCE: SYRACUSE UNIV,DEPT MECH AEROSP & MFG ENGN, KNOWLEDGE
BASED ENGN LAB/SYRACUSE//NY/13244 (REPRINT)
PUBLICATION: COMPUTER-AIDED DESIGN, 1998, V30, N2 (FEB), P151-161
Title: Recognition of plane projective symmetry
Author: Curwen, Rupert W.; Mundy, Joseph L.; Stewart, Charles
Corporate Source: General Electric Corporate Research and Development,
Niskayuna, NY, USA
Source: Midwest Symposium on Circuits and Systems v 2 1997. IEEE,
Piscataway, NJ, USA,97CB36010. p 896-900
Abstract: A novel approach to grouping symmetrical planar curves under a
projective transform is described. Symmetric curves are important as a
generic model for object recognition where an object class is defined by
the set of symmetries that any object in the class obeys. In this paper, a
new algorithm is presented for grouping curves based on their
correspondence under a plane projectivity. The correspondence between
curves is defined by a rational parameterization based on a pencil of lines
constructed from two distinguished points on the curves, such as inflection
points. A saliency measure is introduced which permits grouping results to
be ordered in terms of the degree of symmetry supported by each curve pair.
This saliency measure provides a basis for recognition in the case of
approximate symmetry. (Author abstract) 13 Refs.
Title: Stereo matching as a nearest-neighbor problem
Author: Tomasi, Carlo; Manduchi, Roberto
Corporate Source: Stanford Univ, Stanford, CA, USA
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence v
20 n 3 Mar 1998. p 333-340
Abstract: We propose a representation of images, called intrinsic curves,
that transforms stereo matching from a search problem into a
nearest-neighbor problem. Intrinsic curves are the paths that a set of
local image descriptors trace as an image scanline is traversed from left
to right. Intrinsic curves are ideally invariant with respect to disparity.
Stereo correspondence then becomes a trivial lookup problem in the ideal
case. We also show how to use intrinsic curves to match real images in the
presence of noise, brightness bias, contrast fluctuations, moderate
geometric distortion, image ambiguity, and occlusions. In this case,
matching becomes a nearest-neighbor problem, even for very large disparity
values. (Author abstract) 3 Refs.
===============================
Date: Wed, 27 May 1998 02:19:05
===============================
Title: Knowledge based approach to shape from shading
Author: Barnes, Nick; Liu, Zhi-Qiang
Corporate Source: Univ of Melbourne, Parkville, Aust
Source: Proceedings of the IEEE International Conference on Intelligent
Processing Systems, ICIPS v 2 1998. IEEE, Piscataway, NJ, USA,97TH8335. p
1390-1394
Abstract: In this paper, we study the problem of recovering the
approximate three-dimensional shape of an object when knowledge about the
object is available. The application of knowledge-based methods to image
processing tasks will help overcome problems which arise from processing
images using a pixel-based approach. We show that by applying domain
specific knowledge, we can fully automate the derivation of the approximate
shape of an object. Further, this approach can yield specific advantages
over existing approaches, both in terms of computation and processing
results. This is a powerful paradigm that will have applications in object
recognition, robotic navigation, and domain specific scene understanding.
(Author abstract) 16 Refs.
===============================
Date: Fri, 29 May 1998 11:12:08
===============================
TITLE: Multi-class classifier-independent feature analysis
AUTHOR(S): Holz HJ; Loew MH
CORPORATE SOURCE: GEORGE WASHINGTON UNIV,DEPT ELECT ENGN & COMP SCI, INST
MED IMAGING & IMAGE ANAL/WASHINGTON//DC/20052 (REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N11-13 (NOV), P
1219-1224
TITLE: Experiments with a featureless approach to pattern recognition
AUTHOR(S): Duin RPW; deRidder D; Tax DMJ
CORPORATE SOURCE: DELFT UNIV TECHNOL,FAC APPL PHYS, POB
5046/DELFT//NETHERLANDS/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N11-13 (NOV), P
1159-1166
TITLE: A framework for statistical 3-D object recognition
AUTHOR(S): Paulus D; Hornegger J; Niemann H
CORPORATE SOURCE: UNIV ERLANGEN NURNBERG,LEHRSTUHL MUSTERERKENNUNG INFORMAT
5, MARTENSSTR 3/D-91058 ERLANGEN//GERMANY/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N11-13 (NOV), P
1153-1157
===============================
Date: Wed, 17 Jun 1998 02:28:02
===============================
Title: Efficient volumetric method for building closed triangular meshes
from 3-D image and point data
Author: Roth, Gerhard; Wibowoo, Eko
Corporate Source: Natl Research Council of Canada, Ottawa, Ont, Can
Conference Location: Kelowna, Can Conference Date: 19970521-19970523
E.I. Conference No.: 48441
Source: Proceedings - Graphics Interface 1997. Can Inf Process Soc,
Toronto, Ont, Can. p 173-180
Abstract: We present a volumetric method that can efficiently create
triangular meshes from 3-D geometric data. This data can be presented in
the form of images, profiles or unordered points. The mesh model can be
created at different resolutions and can also be closed to make a true
volumetric model. (Author abstract) 27 Refs.
Title: Transfinite interpolation method of grid generation based on
multipoints
Author: Liou, Yuan Chang; Jeng, Yih Nen
Corporate Source: Kung Shan Inst of Technology and Commerce, Tainan,
Taiwan
Source: Journal of Scientific Computing v 13 n 1 Mar 1998. p 105-114
Abstract: In this work two algebraic grid generation methods based on the
Soni-linear and Soni-Hermite transfinite interpolation methods,
respectively, are developed. The necessary data of the transfinite
interpolation formulas, such as coordinates and grid angles, are determined
by more than one points along all the boundaries. The number of dependent
points increases and the influence factors associated to these points
decrease as the point of interesting moves away from a boundary. Several
test cases are examined to show the proposed methods' capability. (Author
abstract) 13 Refs.
Title: Restrictive Pade approximation and parabolic partial differential
equations
Author: Ismail, H.N.A.; Elbarbary, E.M.E.
Corporate Source: Benha Higher Inst of Technology, Benha, Egypt
Source: International Journal of Computer Mathematics v 66 n 3-4 1998. p
343-351
Abstract: In this paper, we use the restrictive Pade approximation to
approximate the exponential matrix exp(rA). The advantage is that it has
the exact value at certain r. We define a new accurate, fast implicit
method for the finite difference solution of a parabolic partial
differential equations. The stability region is discussed, the obtained
results are compared with the exact solution and some famous finite
difference methods. The numerical results are in satisfactory agreement
with the exact solution. (Author abstract) 7 Refs.
Title: On the numerical solution of transient probabilities of a
state-dependent multiserver queue
Author: Parthasarathy, P.R.; Lenin, R.B.
Corporate Source: Indian Inst of Technology, Madras, India
Source: International Journal of Computer Mathematics v 66 n 3-4 1998. p
241-255
Abstract: The transient system size probabilities for a multiserver
queueing model in which the arrival rate increases if there are fewer units
in the system and steadily decreases to zero for larger number of units is
obtained by writing the Laplace transform of these probabilities as a
CONTINUED FRACTION and finding the inversion through the properties of
tridiagonal matrices. The effectiveness of this procedure is illustrated
through tables and graphs for the above queueing model and its busy period.
(Author abstract) 7 Refs.
TITLE: Triangulations of cyclic polytopes and higher Bruhat orders
AUTHOR(S): Rambau J
CORPORATE SOURCE: KONRAD ZUSE ZENTRUM INFORMAT TECH,TAKUSTR 7/D-14195
BERLIN//GERMANY/ (REPRINT)
PUBLICATION: MATHEMATIKA, 1997, V44, N87,1 (JUN), P162-194
PUBLISHER: UNIV COLLEGE, DEPT MATHEMATICS, LONDON WC1E 6BT, ENGLAND
ISSN: 0025-5793
ABSTRACT: Recently Edelman and Reiner suggested two poset structures S-1(n,
d) and S-2(n, d) on the set of all triangulations of the cyclic
d-polytope C(n, d) with n vertices. Both posets are generalizations of
the well-studied Tamari lattice. While S-2(n, d) is bounded by
definition, the same is not obvious for S-1(n, d). In the paper by
Edelman and Reiner the bounds of S-2(n, d) were also confirmed for
S-1(n, d) whenever d less than or equal to 5, leaving the general case
as a conjecture.
In this paper their conjecture is answered in the affirmative for
all d, using several new functorial constructions. Moreover, a
structure theorem is presented, stating that the elements of S-1(n,
d+1) are in one-to-one correspondence to certain equivalence classes of
maximal chains of S-1(n, d). By similar methods it is proved that all
triangulations of cyclic polytopes are shellable. In order to clarify
the connection between S-1(n, d) and the higher Bruhat order B(n-2,
d-1) of Manin and Schechtman, we define an order-preserving map from
B(n-2, d-1) to S-1(n, d), thereby concretizing a result by Kapranov and
Voevodsky in the theory of ordered n-categories.
TITLE: On the fractional dimension of sets of continued fractions
AUTHOR(S): Luczak T
CORPORATE SOURCE: ADAM MICKIEWICZ UNIV POZNAN,DEPT MATH/POZNAN//POLAND/
(REPRINT)
PUBLICATION: MATHEMATIKA, 1997, V44, N87,1 (JUN), P50-53
PUBLISHER: UNIV COLLEGE, DEPT MATHEMATICS, LONDON WC1E 6BT, ENGLAND
ISSN: 0025-5793
TITLE: Voronoi diagrams of moving points
AUTHOR(S): Albers G; Guibas LJ; Mitchell JSB; Roos T
CORPORATE SOURCE: UNIV WURZBURG,DEPT COMP SCI/D-97070 WURZBURG//GERMANY/
(REPRINT); STANFORD UNIV,DEPT COMP SCI/STANFORD//CA/94305; SUNY STONY
BROOK,DEPT APPL MATH & STAT/STONY BROOK//NY/11794; ETH ZURICH,DEPT COMP
SCI/ZURICH//SWITZERLAND/
PUBLICATION: INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
, 1998, V8, N3 (JUN), P365-379
ABSTRACT: Consider a set of n points in d-dimensional Euclidean space, d
greater than or equal to 2, each of which is continuously moving along
a given individual trajectory. As the points move, their Voronoi
diagram changes continuously, but at certain critical instants in time,
topological events occur that cause a change in the Voronoi diagram. In
this paper, we present a method of maintaining the Voronoi diagram over
time, at a cost of O(log n) per event, while showing that the number of
topological events has an upper bound of O(n(d) lambda(s) (n)), where
lambda(s)(n) is the (nearly linear) maximum length of a
(n,s)-Davenport-Schinzel sequence, and s is a constant depending on the
motions of the point sites.
In addition, we show that if only k points are moving (while
leaving the other n-k points fixed), there is an upper bound of
O(kn(d-1)lambda(s) (n) + (n-k)(d) lambda(s) (k)) on the number of
topological events.
TITLE: Dog bites postman: Point location in the moving Voronoi diagram and
related problems
AUTHOR(S): Devillers O; Golin MJ
CORPORATE SOURCE: INRIA,BP 93/F-06902 SOPHIA ANTIPOLIS//FRANCE/ (REPRINT);
HONG KONG UNIV SCI & TECHNOL,/KOWLOON//HONG KONG/
PUBLICATION: INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
, 1998, V8, N3 (JUN), P321-342
ABSTRACT: In this paper, we discuss two variations of the two-dimensional
post-office problem that arise when the post-offices are n postmen
moving with constant velocities. The first variation addresses the
question: given a point q(0) and time t(0) who is the nearest postman
to q(0) at time t(0)? We present a randomized incremental data
structure that answers the query in expected O(log(2) n) time. The
second variation views a query point as a dog searching for a postman
to bite and finds the postman that a dog running with speed v(d) could
reach first. While it is quite straightforward to design a data
structure for the first problem, designing one for the second appears
more difficult. We show that if the dog is quicker than all of the
postmen then there is a nice correspondence between the problems. This
correspondence will permit us to use the data structure developed for
the first problem to solve the second one in O(log(2) n) time as well.
The proposed structure is semi-dynamic, that is the set of postmen
can be modified by inserting new postmen. A fully dynamic structure
that also supports deletions can be obtained, but in that case the
query time becomes O(log(3) n).
TITLE: Stick knots
AUTHOR(S): Furstenberg E; Li J; Schneider J
CORPORATE SOURCE: WILLIAMS COLL,DEPT MATH/WILLIAMSTOWN//MA/01267 (REPRINT)
PUBLICATION: CHAOS SOLITONS & FRACTALS, 1998, V9, N4-5 (APR-MAY), P561-568
ABSTRACT: In this paper, we will examine the limitations of the superbridge
index in providing lower bounds for the stick number of knots,
introduce a new invariant which may improve lower bounds on stick
number, and discuss how Conway's CONTINUED FRACTION NOTATION for knots
may be used to obtain new upper bounds for the stick number of certain
infinite classes of knots. (C) 1998 Elsevier Science Ltd. All rights
reserved.
TITLE: Robust and efficient Cartesian mesh generation for component-based
geometry
AUTHOR(S): Aftosmis MJ; Berger MJ; Melton JE
CORPORATE SOURCE: NASA,AMES RES CTR, CODE AAC, MAIL STOP T27B-2/MOFFETT
FIELD//CA/94035 (REPRINT); NYU,COURANT INST, DEPT COMPUTAT SCI/NEW
YORK//NY/10012
PUBLICATION: AIAA JOURNAL, 1998, V36, N6 (JUN), P952-960
ABSTRACT: This work documents a new method for rapid and robust Cartesian
mesh generation for component-based geometry. The new algorithm adopts
a novel strategy that first intersects the components to extract the
wetted surface before proceeding with volume mesh generation in a
second phase. The intersection scheme is based on a robust geometry
engine that uses adaptive precision arithmetic and automatically and
consistently handles geometric degeneracies with an algorithmic
tie-breaking routine. The intersection procedure has worst-case
computational complexity of O(N log N) and is demonstrated on test
cases with up to 121 overlapping and intersecting components, including
a variety of geometric degeneracies. The volume mesh generation takes
the intersected surface triangulation as input and generates the mesh
through cell division of an initially uniform coarse grid. In refining
hexagonal cells to resolve the geometry, the new approach preserves the
ability to directionally divide cells that are well aligned with local
geometry. The mesh generation scheme has linear asymptotic complexity
with memory requirements that total approximately 14-17 words/cell. The
mesh generation speed is approximately 10(6) cells/minute on a typical
engineering workstation.
TITLE: Construction of the constrained delaunay triangulation of a
polygonal domain
AUTHOR(S): Klein R; Roller D; Brunet P
CORPORATE SOURCE: UNIV TUBINGEN,GRIS, WILHELM SCHICKARD
INST/TUBINGEN//GERMANY/ (REPRINT)
PUBLICATION TYPE: BOOK
PUBLICATION: CAD SYSTEMS DEVELOPMENT, 1997, P313-326
PUBLISHER: SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, W-1000 BERLIN 33,
GERMANY
TITLE: Elimination of artificial grid distortion and hourglass-type motions
by means of Lagrangian subzonal masses and pressures
AUTHOR(S): Caramana EJ; Shashkov MJ
CORPORATE SOURCE: LOS ALAMOS NATL LAB,DIV THEORET, APPL THEORET & COMPUTAT
PHYS DIV/LOS ALAMOS//NM/87545 (REPRINT)
PUBLICATION: JOURNAL OF COMPUTATIONAL PHYSICS, 1998, V142, N2 (MAY 20), P
521-561
TITLE: On the reduction of the nearest-neighbor variation for more accurate
classification and error estimates
AUTHOR(S): Djouadi A
CORPORATE SOURCE: LUCENT TECHNOL,ROOM 3T-335B, 6200 E BROAD
ST/COLUMBUS//OH/43213 (REPRINT)
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1998, V20, N5 (MAY), P567-571
TITLE: Fast design of reduced-complexity nearest-neighbor classifiers using
triangular inequality
AUTHOR(S): Lee EW; Chae SI
CORPORATE SOURCE: SEOUL NATL UNIV,SCH ELECT ENGN, SAN 56-1/SEOUL
151742//SOUTH KOREA/ (REPRINT)
PUBLICATION: IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1998, V20, N5 (MAY), P562-566
TITLE: Nonnegative splines, in particular of degree five
AUTHOR(S): Oberle HJ; Opfer G
CORPORATE SOURCE: UNIV HAMBURG,INST APPL MATH, BUNDESSTR 55/D-20146
HAMBURG//GERMANY/ (REPRINT)
PUBLICATION: NUMERISCHE MATHEMATIK, 1998, V79, N3 (MAY), P427-450
TITLE: A tabu search method for geometric primitive extraction
AUTHOR(S): Ke QF; Jiang TZ; Ma SD
CORPORATE SOURCE: CHINESE ACAD SCI,INST AUTOMAT, NATL LAB PATTERN RECOGNIT,
POB 2728/BEIJING 100080//PEOPLES R CHINA/ (REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1997, V18, N14 (DEC), P1443-1451
===============================
Date: Thu, 25 Jun 1998 05:25:42
===============================
TITLE: Automatic identification of non-intersecting machining features from
2D CAD input
AUTHOR(S): Tyan LW; Devarajan V
CORPORATE SOURCE: UNIV TEXAS,AUTOMAT & ROBOT RES INST/ARLINGTON//TX/76019
(REPRINT); UNIV TEXAS,AUTOMAT & ROBOT RES INST/ARLINGTON//TX/76019
PUBLICATION: COMPUTER-AIDED DESIGN, 1998, V30, N5 (APR), P357-366
TITLE: On user-defined features
AUTHOR(S): Hoffmann CM; JoanArinyo R
CORPORATE SOURCE: PURDUE UNIV,DEPT COMP SCI/W LAFAYETTE//IN/47907 (REPRINT)
; UNIV POLITECN CATALUNYA,DEPT LLENGUATGES & SISTEMES INFORMAT/E-08028
BARCELONA//SPAIN/
PUBLICATION: COMPUTER-AIDED DESIGN, 1998, V30, N5 (APR), P321-332
===============================
Date: Sat, 27 Jun 1998 12:22:47
===============================
Title: Approach to form recognition based on non-linear projections,
search and optimization
Author: Brailovsky, Victor L.
Corporate Source: Tel Aviv Univ, Ramat Aviv, Isr
Source: Pattern Recognition Letters v 18 n 11-13 Nov 1997. p 1099-1107
Abstract: With the help of the family of non-linear projections and
fitness functions introduced here, and using a standard evolutionary
programming procedure, a broad class of parametric geometric primitives may
be discovered in an image. The generalization of the notion of Mahalanobis
distance proposed here permits this approach to be extended to
non-parametric primitives. The suggested approach is highly robust. (Author
abstract) 10 Refs.
Title: Feature-based approach for design of free-form objects
Author: Lu, Wei-Cherng; Huang, Jiung-Ming
Corporate Source: Natl Taiwan Univ of Science and Technology, Taipei,
Taiwan
Source: Journal of the Chinese Society of Mechanical Engineers,
Transactions of the Chinese Institute of Engineers, Series C/Chung-Kuo Chi
Hsueh Kung Ch'eng Hsuebo Pao v 19 n 2 Apr 1998. p 199-212
Language: English
Abstract: This paper presents a method to build a Hermite-based surface
model generated from an existing free-form object. Such a method provides
both C**2 continuity across adjacent patches in a surface region and G**1
continuity across adjacent surface regions. The model then serves as the
basis for new shape designs of the free-form object. Among objects of
complex-shaped features, human masks, shoes, gloves and artificial limbs
are instances of particular interest. The method not only determines
surface regions (the highest-level features) in an object and sub-features
(lower-level features) in each region, but also demonstrates how low-level
features be blended into high-level ones. By means of parameterized
features, new products are created according to the change of parameter
values. Variables and constraints of features are regarded as key elements
in defining design rules for a free-form design system. The coordinate
measuring machine (CMM) obtains 3D data points of an object while a
criterion selects the measuring path of fewest points so as to extract
surface features for a variational design. A range of shoe-last designs
exemplifies the practice of this proposed methodology. (Author abstract) 17
Refs.
Title: Plastics-oriented feature technology for the design on snap-fit
joints
Author: Giersbeck, Martin; Michaeli, Walter
Corporate Source: Inst for Plastics Processing (IKV), Aachen, Ger
Source: Special Areas Annual Technical Conference - ANTEC, Conference
Proceedings v 3 1998. Soc Plast Eng, Brookfield, CT, USA. p 3063-3067
Abstract: Design aids based on Feature Technology can improve the design
process for plastic parts considerably. IKV is developing a software
prototype for an automatic generation of snap-fit joints within a
3D-CAD-system. Parametric snap-fit geometries are provided in a library
data base. After a geometry has been selected the snap-fit joint is
dimensioned and added to the part being constructed. By using additional
information contained in a snap-fit feature the whole part can be checked
in view of design rules and production costs. (Author abstract) 9 Refs.
TITLE: Feature design on deformation of freeform surfaces using range
control
AUTHOR(S): Chuang SHF; Huang CL
CORPORATE SOURCE: NATL CHUNGHSING UNIV,DEPT MECH ENGN, 250 KUO KUANG
RD/TAICHUNG 402//TAIWAN/ (REPRINT)
PUBLICATION: ENGINEERING WITH COMPUTERS, 1998, V14, N2, P178-184
===============================
Date: Thu, 23 Jul 1998 15:20:43
===============================
TITLE: Stereo matching based on the self-organizing feature-mapping
algorithm
AUTHOR(S): Pajares G; Cruz JM; Aranda J
CORPORATE SOURCE: UNIV COMPLUTENSE,FAC CC FIS, DEPT INFORMAT &
AUTOMAT/E-28040 MADRID//SPAIN/ (REPRINT); UNIV NACL EDUC DISTANCIA,FAC
CC FIS, DEPT INFORMAT & AUTOMAT/MADRID 28040//SPAIN/
PUBLICATION: PATTERN RECOGNITION LETTERS, 1998, V19, N3-4 (MAR), P319-330
===============================
Date: Thu, 23 Jul 1998 15:20:43
===============================
Title: Practical algorithm for finding optimal triangulations
Author: Shoikhet, Kirill; Geiger, Dan
Corporate Source: Technion, Haifa, Isr
Source: Proceedings of the National Conference on Artificial Intelligence
1997. AAAI, Menlo Park, CA, USA. p 185-190
Abstract: An algorithm called QUICK TREE is developed for finding a
triangulation T of a given undirected graph G such that the size of T's
maximal clique is minimum and such that no other triangulation of G is a
subgraph of T. We have tested QUICKTREE on graphs of up to 100 nodes for
which the maximum clique in an optimal triangulation is of size 11. This is
the first algorithm that can optimally triangulate graphs of such size in a
reasonable time frame. This algorithm is useful for constraint satisfaction
problems and for Bayesian inference through the clique tree inference
algorithm. (Author abstract) 18 Refs.
Title: Waveform analysis of jitter in SRTS using continued fraction
Author: Murakami, Kurenai
Corporate Source: NEC Corp, Abiko, Jpn
Source: IEEE Transactions on Communications v 46 n 6 Jun 1998. p 819-825
Abstract: This paper presents a method to analyze jitter waveform in
synchronous residual time stamp (SRTS) using CONTINUED FRACTION. It is
shown first that the jitter waveform can be decomposed into triangular wave
components and that each component corresponds to a rational approximation
value of a parameter called residue. Next, quasi-simple continued fraction
expansion of the residue is defined to obtain rational approximation values
of the residue in a systematic manner. This method gives a series of
rational approximation values of the residue. It corresponds to the
decomposition of the SRTS jitter waveform into triangular wave components.
Many characteristics of the jitter waveform are derived by the quasi-simple
continued fraction expansion of the residue. Especially, the average
amplitude and period of each triangular wave component are given. (Author
abstract) 7 Refs.
Title: DeWall: A fast divide and conquer Delaunay Triangulation algorithm
in E**d
Author: Cignoni, P.; Montanil, C.; Scopigno, R.
Corporate Source: I.E.I - Consiglio Nazionale delle Ricerche, Pisa, Italy
Source: Computer Aided Design v 30 n 5 Apr 1998. p 333-341
Abstract: The paper deals with Delaunay Triangulations (DT) in E**d
space. This classic computational geometry problem is studied from the
point of view of the efficiency, extendibility to any dimensionality, and
ease of implementation. A new solution to DT is proposed, based on an
original interpretation of the well-known Divide and Conquer paradigm. One
of the main characteristics of this new algorithm is its generality: it can
be simply extended to triangulate point sets in any dimension. The
technique adopted is very efficient and presents a subquadratic behaviour
in real applications in E**3, although its computational complexity does
not improve the theoretical bounds reported in the literature. An
evaluation of the performance on a number of datasets is reported, together
with a comparison with other DT algorithms. (Author abstract) 19 Refs.
Title: On user-defined features
Author: Hoffmann, Christoph M.; Joan-Arinyo, Robert
Corporate Source: Purdue Univ, West Lafayette, IN, USA
Source: Computer Aided Design v 30 n 5 Apr 1998. p 321-332
Abstract: Feature-based design is becoming one of the fundamental design
paradigms of CAD systems. In this paradigm, the basic unit is a feature and
parts are constructed by a sequence of feature attachment operations. The
type and number of possible features involved depend upon product type, the
application reasoning process and the level of abstraction. Therefore to
provide CAD systems with a basic mechanism to define features that fit the
end-user needs seems more appropriate than trying to provide a large
repertoire of features covering every possible application. A procedural
mechanism is proposed for generating and deploying user-defined features in
a feature-based design paradigm. The usefulness of the mechanism relies on
two functional capabilities. First the shape and size of the user-defined
features are instantiated according to parameter values given by the
end-user. Second the end-user positions and orients the feature in the part
being designed by means of geometric gestures on geometric references.
(Author abstract) 38 Refs.
Title: Representation and management of feature information in a cellular
model
Author: Bidarra, Rafael; de Kraker, Klaas Jan; Bronsvoort, Willem F.
Source: Computer Aided Design v 30 n 4 Apr 1998. p 301-313
Abstract: Many limitations in current feature modelling systems are
inherited from the geometric representation they use for the product model.
Both a very rigid and a very extensive representation are unsuitable for
feature applications, at least if no convenient support is provided to
manage the data. This paper describes a cellular representation for feature
models that contains all the relevant information to effectively solve a
variety of current problems in feature modelling. Much benefit is gained
from a coherent integration between shapes of a feature model and cells in
the cellular model. Every feature shape has an explicit volumetric
representation in terms of cells. Specific subsets of its boundary are also
distinguished in terms of cell faces and edges. Feature interactions are
maintained in attributes of cells, cell faces and cell edges. Methods for
modifying and querying the cellular model are presented, and their
application is illustrated for feature validity maintenance, feature
interaction management, feature conversion between multiple views, and
feature visualization. (Author abstract) 16 Refs.
Title: Voronoi diagrams and offset curves of curvilinear polygons
Author: Held, Martin
Corporate Source: Universitat Salzburg, Salzburg, Austria
Source: Computer Aided Design v 30 n 4 Apr 1998. p 287-300
Abstract: This paper studies the practical generation of Voronoi diagrams
and offset curves of simply-connected planar areas bounded by straight
lines and circular arcs. We present and analyze a wavefront-propagation
algorithm for the generation of Voronoi diagrams and compare it
experimentally to a tuned version of Lee's divide-and-conquer algorithm.
Key performance parameters of these two algorithms are compared based on
machine-generated test data. We conclude that the wavefront-propagation
algorithm can be expected to outperform the divide-and-conquer algorithm
for all, but pathological test data. In particular, its practical running
time seems to grow only linearly. We also used our implementation in order
to gather statistics on the CPU-consumption of offsetting based on Voronoi
diagrams. All tests clearly showed the practical suitability of using
Voronoi diagrams for the offsetting of curvilinear polygons. The CPU-time
consumptions recorded also compare very favorably with other published
codes for computing Voronoi diagrams. (Author abstract) 32 Refs.
Title: Approximation order of bivariate spline interpolation for
arbitrary smoothness
Author: Davydov, O.V.; Nuernberger, G.; Zeilfelder, F.
Corporate Source: Dnepropetrovsk State Univ, Dnepropetrovsk, Ukraine
Source: Journal of Computational and Applied Mathematics v 90 n 2 Apr 17
1998. p 117-134
Abstract: By using the algorithm of Nuernberger and Riessinger (1995), we
construct Hermite interpolation sets for spaces of bivariate splines
S//q**r( Delta **1) of arbitrary smoothness defined on the uniform type
triangulations. It is shown that our Hermite interpolation method yields
optimal approximation order for q greater than equivalent to 3.5r plus 1.
In order to prove this, we use the concept of weak interpolation and
arguments of Birkhoff interpolation. (Author abstract) 25 Refs.
==============================
Date: Tue, 4 Aug 1998 19:57:35
==============================
TITLE: An optimum solution for scale-invariant object recognition based on
the multiresolution approximation
AUTHOR(S): Yoon SH; Kim JH; Alexander WE; Park SM; Sohn KH
CORPORATE SOURCE: N CAROLINA AGR & TECH STATE UNIV,DEPT ELECT
ENGN/GREENSBORO//NC/27411 (REPRINT); VILLANOVA UNIV,DEPT ELECT & COMP
ENGN/VILLANOVA//PA/19085; CHONNAM NATL UNIV,DEPT COMP
ENGN/KWANGJU//SOUTH KOREA/; N CAROLINA STATE UNIV,DEPT ELECT & COMP
ENGN/RALEIGH//NC/27695; YONSEI UNIV,DEPT RADIO SCI ENGN/SEOUL
120749//SOUTH KOREA/
PUBLICATION: PATTERN RECOGNITION, 1998, V31, N7 (JUL), P889-908
===============================
Date: Thu, 13 Aug 1998 07:08:31
===============================
TITLE: The Centroid method for compressing sets of similar images
AUTHOR(S): Karadimitriou K; Tyler JM
CORPORATE SOURCE: LOUISIANA STATE UNIV,DEPT COMP SCI/BATON ROUGE//LA/70803
(REPRINT)
PUBLICATION: PATTERN RECOGNITION LETTERS, 1998, V19, N7 (MAY), P585-593
TITLE: A connectionist method for pattern classification with diverse
features
AUTHOR(S): Chen K
CORPORATE SOURCE: OHIO STATE UNIV,DEPT COMP & INFORMAT
SCI/COLUMBUS//OH/43210 (REPRINT); OHIO STATE UNIV,CTR COGNIT
SCI/COLUMBUS//OH/43210; BEIJING UNIV,NATL LAB MACHINE PERCEPT/BEIJING
100871//PEOPLES R CHINA/; BEIJING UNIV,CTR INFORMAT SCI/BEIJING
100871//PEOPLES R CHINA/
PUBLICATION: PATTERN RECOGNITION LETTERS, 1998, V19, N7 (MAY), P545-558
TITLE: Multi-scale edge detection and feature binding: An integrated
approach
AUTHOR(S): Brown MA; Blackwell KT; Khalak HG; Barbour GS; Vogl TP
CORPORATE SOURCE: GEORGE MASON UNIV,/FAIRFAX//VA/22030 (REPRINT); ENVIRONM
RES INST MICHIGAN,/ARLINGTON//VA/22209
PUBLICATION: PATTERN RECOGNITION, 1998, V31, N10 (OCT), P1479-1490
===============================
Date: Fri, 14 Aug 1998 03:50:05
===============================
Title: Surface matching for object recognition in complex
three-dimensional scenes
Author: Johnson, A.E.; Hebert, M.
Corporate Source: Carnegie Mellon Univ, Pittsburgh, PA, USA
Source: Image and Vision Computing v 16 n 9-10 Jul 1998. p 635-651
Abstract: We present an approach to recognition of complex objects in
cluttered three-dimensional (3D) scenes that does not require feature
extraction or segmentation. Our object representation comprises descriptive
images associated with oriented points on the surface of an object. Using a
single point basis constructed from an oriented point, the position of
other points on the surface of the object can be described by two
parameters. The accumulation of these parameters for many points on the
surface of the object results in an image at each oriented point. These
images, localized descriptions of the global shape of the object, are
invariant to rigid transformations. Through correlation of images, point
correspondences between a model and scene data are established. Geometric
consistency is used to group the correspondences from which plausible rigid
transformations that align the model with the scene are calculated. The
transformations are then refined and verified using a modified iterative
closest point algorithm. The effectiveness of our representation comes from
its ability to combine the descriptive nature of global object properties
with the robustness to partial views and clutter of local shape
descriptions. The wide applicability of our algorithm is demonstrated with
results showing recognition of complex objects in cluttered scenes with
occlusion. (Author abstract) 20 Refs.
Title: Modeler-independent feature recognition in a distributed
environment
Author: Han, J.H.; Requicha, A.A.G.
Corporate Source: Sung Kyun Kwan Univ, Suwon, South Korea
Source: Computer Aided Design v 30 n 6 May 1998. p 453-463
Abstract: Solid modelers and other CAD/CAM subsystems are moving to
distributed heterogeneous computing environments, so as to support design
and manufacturing processes that are temporally and spatially distributed.
Communication and collaboration among the software components of such
distributed systems require protocols for accessing remote objects. This
paper discusses an approach that provides transparent access to diverse
solid modelers in a distributed environment. A solid modeler is augmented
with a software wrapper, called an adaptor, so as to provide a uniform
application programming interface (API). Applications interact with the
uniform API and need not concern themselves with the specifics of the
modeling systems used. API calls are implemented in a client-server
architecture, in which a modeler and its adaptor function as a geometry
server, and various applications communicate with the server through remote
procedure calls (RPCs). A few adaptors have been implemented at the
University of Southern California's Programmable Automation Laboratory, and
have been used routinely for several years. This paper discusses adaptor
design problems and our approach to their solutions. It illustrates the
application of our methods through an example that involves the incremental
recognition of machinable features in a distributed environment. This
environment includes a geometry server, a simple feature-based design
system, a state-of-the-art feature recognizer, and a graphics renderer, all
running as separate processes in different machines. To our knowledge, this
is the first documented effort in which a complex application such as
feature recognition is capable of running, unmodified, on top of modelers
based on constructive solid geometry or on boundary representations, which
are fundamentally different. (Author abstract) 30 Refs.
===============================
Date: Fri, 28 Aug 1998 09:24:20
===============================
Title: Iso-surface extraction in nD applied to tracking feature curves
across scale
Author: Fidrich, Marta
Corporate Source: Hungarian Acad of Sciences, Szeged, Hung
Source: Image and Vision Computing v 16 n 8 Jun 1998. p 545-555
Abstract: A method is presented to extract space curves, defined by
differential invariants, at increasing scales. The curves are considered as
the intersection of two iso-surfaces in 3D, so their moving paths or orbits
can be explicitly obtained in scale space as the intersection of two
iso-surfaces in 4D. This method is based on a novel algorithm to search for
iso-surfaces and their intersections in nD. The algorithm is a significant
extension of the 3D Marching Lines algorithm with new orientation and
implementation considerations. As a result of these considerations, the
reconstructed iso-surfaces and their intersections can be proved to have
good topological properties; moreover, the implementation is quite
straightforward. Specifically, a 4D extension has been implemented to
follow spatial curves efficiently via scale. The algorithm automatically
finds the connection order of singularities, so tracking remains reliable
even if scale is not densely sampled. As an example, the development of
parabolic and crest curves across scale is visualized. (Author abstract) 31
Refs.
==============================
Date: Wed, 9 Sep 1998 06:30:30
==============================
Title: Solid model abstraction using form features
Author: Belaziz, M.; Bouras, A.; Brun, J.M.
Corporate Source: Universite Claude Bernard-Lyon 1, Villeurbanne, Fr
Source: Proceedings of the IEEE Symposium on Information Visualization
1998. IEEE, Piscataway, NJ, USA,98TB100246. p 120-125
Abstract: Solid Model abstraction is an integral part of parallel and
process design. It is required for simulation and optimization of the
design and consists in retrieving a simplified model from the solid one,
with appropriate dimension reduction and details removal. Unfortunately,
current CAD systems do not provide the means for easy simplification of
forms. Ongoing research efforts on abstraction yield in some approaches.
These attempt to generate the abstract model using expert systems, medial
axis transform or medial surfaces. A feature based approach is presented
here. Analyst usually thinks about object in set of forms rather than
geometric and topologic entities. So, given an object and its description
in term of form features, the approach constructs a simplified model of
this object using morphological information of form features. The
abstraction process has two parts: simplification and idealization. The
simplification cleans out the initial model from any non pertinent feature.
The second one idealizes the resulting objects according to the analysis
goal. (Author abstract) 6 Refs.
Title: New feature selection method to extract functional structures from
multidimensional symbolic data
Author: Ono, Yujiro; Ichino, Manabu
Corporate Source: Tokyo Denki Univ, Saitama-ken, Jpn
Source: IEICE Transactions on Information and Systems v E81-D n 6 Jun
1998. p 556-564
Abstract: In this paper, we propose a feature selection method to extract
functional structures embedded in multidimensional data. In our approach,
we do not approximate functional structures directly. Instead, we focus on
the seemingly trivial property that functional structures are geometrically
thin in an informative subspace. Using this property, we can exclude
irrelevant features to describe functional structures. As a result, we can
use conventional identification methods, which use only informative
features, to accurately identify functional structures. In this paper, we
define Geometrical Thickness (GT) in the Cartesian System Model (CSM), a
mathematical model that can manipulate symbolic data. Additionally, we
define Total Geometrical Thickness (TGT) which expresses geometrical
structures in data. Using TGT, we investigate a new feature selection
method and show its capabilities by applying it to two sets of artificial
and one set of real data. (Author abstract) 10 Refs.
Title: Building 3D models from unregistered multiple range images
Author: Higuchi, Kazunori; Hebert, Martial; Ikeuchi, Katsushi
Corporate Source: Toyota Central Research & Development Lab, Inc, Aichi,
Jpn
Source: Systems and Computers in Japan v 29 n 6 Jun 15 1998. p 82-90
Abstract: This paper proposes a method of constructing 3D models from
multiple range data which have no information on position. This method can
combine data of an arbitrarily curved surface sampled from an arbitrary
direction, without preliminary knowledge of viewpoints and extraction of
features. The procedures are: an object is represented by discrete meshes;
a Gaussian curvature at each node of the mesh is calculated; the meshes are
mapped on a unit sphere; and matching of viewpoints is carried out by
comparing the unit sphere. The discrete meshes are repeatedly re-formed
until they are sufficiently close to the surface of the object. The
transformation matrix for range data is calculated based on the
correspondence of nodes of the discrete meshes obtained from the results of
matching of the unit sphere. This paper describes the matching algorithm,
and examples of applications of the algorithm to the construction of a
`complete model' from multiple range images. (Author abstract) 17 Refs.
===============================
Date: Thu, 17 Sep 1998 05:58:49
===============================
Title: Features of deformation grids: An approach via singularity theory
Author: Bookstein, Fred L.
Corporate Source: Univ of Michigan, Ann Arbor, MI, USA
Source: Proceedings of the Annual Symposium on Computational Geometry
1998. ACM, New York, NY, USA. p 214-221
Abstract: Biological shape differences often are represented as
diffeomorphisms of a Cartesian coordinate grid. Typically such maps are
encoded in a spatially distributed parameterization, such as a list of
paired point-locations. The problem addressed here is the extraction of
spatially discrete, localized features of such transformation grids. This
paper suggests that the features ultimately interesting to a biomedical
scientist, for instance the details that suggest underlying developmental
or pathological processes, can often be identified with variants of the
singularity (x, y) yields (x, x**2y plus y**3) that are visually evident in
extrapolations. This is a nongeneric singularity at which a pair of cusps
appears as a function of a parameter for `magnification'. I introduce
canonical coordinates for such singularities and show how they may be used
to make sense out of thin-plate splines depicting effects of two different
types of brain disease, schizophrenia and Fetal Alcohol Syndrome, on brain
form in the midsagittal plane (plane of symmetry). (Author abstract) 13
Refs.
Title: Improved algorithms for robust point pattern matching and
applications to image registration
Author: Mount, David M.; Netanyahu, Nathan S.; Le Moigne, Jacqueline
Corporate Source: Univ of Maryland, College Park, MD, USA
Source: Proceedings of the Annual Symposium on Computational Geometry
1998. ACM, New York, NY, USA. p 155-164
Abstract: Image registration is the process of determining the
transformation that most nearly maps one image to another. An approach
based on extracting a set of point features from each of the two images
that reduces the problem to a point pattern matching problem is considered.
An approximation algorithm called bounded alignment, for robust point
pattern matching, is presented. The algorithm operates within the framework
of the branch-and-bound, but employs point-to-point alignments to
accelerate the search. 29 Refs.
Title: Design and analysis of planar shape deformation
Author: Cheng, Siu-Wing; Edelsbrunner, Herbert; Fu, Ping; Lam, Ka-Po
Corporate Source: Hong Kong Univ of Science and Technology, Kowloon, Hong
Kong
Source: Proceedings of the Annual Symposium on Computational Geometry
1998. ACM, New York, NY, USA. p 29-38
Abstract: Shape deformation refers to the continuous change of one
geometric object to another. We develop a software tool for planning,
analyzing, and visualizing deformations between two shapes in R**2. The
deformation is generated automatically without any user intervention or
specification of feature correspondences. A unique property of the tool is
the explicit availability of the two-dimensional shape space, which can be
used for designing the deformation either automatically by following
constraints and objectives or manually by drawing deformation paths.
(Author abstract) 10 Refs.
===============================
Date: Fri, 18 Sep 1998 06:23:40
===============================
AUTHORS:
Gao, S;Shah, JJ
TITLE:
Automatic recognition of interacting machining features based on minimal
condition subgraph
SOURCE: *COMPUTER-AIDED DESIGN*, 30: (9) 727-739 AUG 1998
ABSTRACT:
This paper presents a methodology for efficiently recognizing both
isolated and interacting features in a uniform way. The conventional,
graph-based recognition method is combined with hint-based feature
recognition to recognize and extract alternative interpretations of
interacting features. First, ail isolated (non-intersecting) features are
recognized based on a Manufacturing Face Adjacency Graph. Interacting
features are then recognized based on the feature's minimal condition
subgraph (MCSG) that is used as a feature hint. Unlike previous hint-
based recognition methods, the MCSGs of all features are defined,
generated and completed in a uniform way, independent of the feature
type. Hints are defined by an Extended Attributed Adjacency graph,
generated by graph decomposition and completed by adding virtual links,
corresponding to entities lost by interactions. An efficient algorithm
for generating virtual links is developed. A new classification of
feature interactions is also presented. (C) 1998 Elsevier Science Ltd.
All rights reserved.
===============================
Date: Fri, 25 Sep 1998 06:30:04
===============================
AUTHORS:
Kenmochi, Y;Imiya, A;Ichikawa, A
TITLE:
Boundary extraction of discrete objects
SOURCE: *COMPUTER VISION AND IMAGE UNDERSTANDING*, 71: (3) 281-293 SEP
1998
ABSTRACT:
One of the aims in the field of computer vision is to acquire information
about the geometric and topological properties of objects in a three-
dimensional world. First, we measure the objects and then we convert the
measured data into geometric and topological properties of the objects.
As an intermediate between the measured data and the geometric and
topological properties, a representation of the objects for computers is
desired. In this paper, we propose a representation of objects and their
boundaries, which is based on combinatorial topology, and develop a
method of extracting boundaries of objects from measured data. It is
sufficient to extract boundaries, because they include information about
the shape of the objects; the internal structure of the objects is not
necessary far information about the shape. In addition, we prove that
boundaries are uniquely obtained using our algorithm. (C) 1998 Academic
Press.
AUTHORS:
Torr, PHS;Zisserman, A;Maybank, SJ
TITLE:
Robust detection of degenerate configurations while estimating the
fundamental matrix
SOURCE: *COMPUTER VISION AND IMAGE UNDERSTANDING*, 71: (3) 312-333 SEP
1998
ABSTRACT:
We present a new method for the detection of multiple solutions or
degeneracy when estimating the fundamental matrix, with specific emphasis
on robustness to data contamination (mismatches), The fundamental matrix
encapsulates all the information on camera motion and internal parameters
available from image feature correspondences between two views. It is
often used as a first step in structure from motion algorithms. If the
set of correspondences is degenerate, then this structure cannot be
accurately recovered and many solutions explain the data equally well. It
is essential that we are alerted to such eventualities. As current
feature matchers are very prone to mismatching the degeneracy detection
method must also be robust to outliers.
In this paper a definition of degeneracy is given and all two-view
nondegenerate and degenerate cases are catalogued in a logical way by
introducing the language of varieties from algebraic geometry. It is then
shown how each of the cases can be robustly determined from image
correspondences via a scoring function we develop, These ideas define a
methodology which allows the simultaneous detection of degeneracy and
outliers.
The method is called PLUNDER-DL and is a generalization of the robust
estimator RANSAC, The method is evaluated on many differing pairs of real
images, In particular it is demonstrated that proper modeling of
degeneracy in the presence of outliers enables the detection of
mismatches which would otherwise be missed. All processing including
point matching, degeneracy detection, and outlier detection is automatic.
(C) 1998 Academic Press.
AUTHORS:
Bretzner, L;Lindeberg, T
TITLE:
Feature tracking with automatic selection of spatial scales
SOURCE: *COMPUTER VISION AND IMAGE UNDERSTANDING*, 71: (3) 385-392 SEP
1998
ABSTRACT:
When observing a dynamic world, the size of image structures may vary
over time. This article emphasizes the need for including explicit
mechanisms for automatic scale selection in feature tracking algorithms
in order to: (i) adapt the local scale of processing to the local image
structure, and (ii) adapt to the size variations that may occur over
time. The problems of corner detection and blob detection are treated in
detail, and a combined framework for feature tracking is presented. The
integrated tracking algorithm overcomes some of the inherent limitations
of exposing fixed-scale tracking methods to image sequences in which the
size variations are large. It is also shown how the stability over time
of scale descriptors can be used as a part of a multi-cue similarity
measure for matching. Experiments on real-world sequences are presented
showing the performance of the algorithm when applied to (individual)
tracking of corners and blobs, (C) 1998 Academic Press.
===============================
Date: Thu, 22 Oct 1998 10:27:14
===============================
AUTHORS:
Hui, KC;Li, YD
TITLE:
A feature-based shape blending technique for industrial design
SOURCE: *COMPUTER-AIDED DESIGN*, 30: (10) 823-834 SEP 1 1998
ABSTRACT:
Blending or averaging of two-dimensional shapes usually operates on sets
of discrete points or polygons approximating the objects. This relies on
a series of evenly distributed or properly positioned points on the
boundary of the objects. Features or characteristics of the objects are
not well considered. This paper presents a simple but effective technique
for blending 2D shapes composed of curve segments. Features that are
essential for shape blending are extracted. Correspondence between
features of the objects are then established. The correspondence between
points on a pair of corresponding features are finally established for
the interpolation process. This allows characteristic features of the
objects to be retained in the blending operation which is essential in
industrial design. An experimental system was developed for blending 2D
contours with curved boundary. Test results showed that the proposed
approach produces results suitable for industrial design. (C) 1998
Elsevier Science Ltd. All rights reserved.
Last modified: Thu Oct 29 12:40:22 EST 1998