Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Francis L. Merat

dblp:04/1887 · also Frank L. Merat · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 2 first-authorSystems, architecture and hardware · 7 · 2 first-authorComputer networks · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Robot manipulation · 50% Motion planning and robot control · 25% 3D vision · 13%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Embedded and real-time systems · 59% Hardware accelerators and domain-specific architectures · 41%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 100%

Topics — the 8 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › robot control
robotic workcell control
0.011997
Advances in agile manufacturing · ICRA 1997
Embedded and real-time systems
real-time control
0.011997
Advances in agile manufacturing · ICRA 1997
Robotics › Robot manipulation › assembly
mechanical assembly
0.012000
Design lessons for building agile manufacturing systems · IEEE Trans. Robotics Autom. 2000
Computer vision › 3D vision › object representation
3d object description
0.011987
Generation of object descriptions from range data using feature extraction by demands · ICRA 1987
Machine learning › Representation and self-supervised learning › representation learning
feature extraction
0.011987
Generation of object descriptions from range data using feature extraction by demands · ICRA 1987
Machine learning › Representation and self-supervised learning › hierarchical representation › hierarchical representation learning
hierarchical feature representation
0.011987
Generation of object descriptions from range data using feature extraction by demands · ICRA 1987
Computer vision › 3D vision
range image processing
0.011987
Generation of object descriptions from range data using feature extraction by demands · ICRA 1987
Geometric modeling and processing › computer-aided design
feature-based modeling
0.011994
3D Modelling and Indexing for CAD-Based Object Recoguition · ICRA 1994

Methods — techniques the papers use, named apart from their topics

simulation · 0.0object-oriented software design · 0.0hardware and software reuse · 0.0design tradeoffs · 0.0surface topology analysis · 0.0primitive-based CAD · 0.0graphical simulation · 0.0binary computer vision · 0.0range image matching · 0.0primitive indexing · 0.0hypothesis generation · 0.0hypothesis verification · 0.0feature extraction by demands · 0.0
YearPublicationVenuePosition
2010 Visual segmentation of lawn grass for a mobile robotic lawnmower
abstract
We investigate the existence of computationally inexpensive first and second order statistics that uniquely describe grass for application in an autonomous lawnmower. We then segment images based on these statistics to determine locations of driveable terrain in an image. Tight statistical clustering of illuminated grass versus artificial texture suggests that this method is sufficient for identifying driveable terrain for an autonomous lawnmower.
Alexander Clifford Schepelmann, Richard E. Hudson, Francis L. Merat, Roger D. Quinn
IROS3
2003 Defeating distributed denial-of-service attack with deterministic bit marking
abstract
Distributed denial-of-service (DDoS) attack is a serious threat in Internet. We propose a bit marking concept to identify and drop the DDoS attack packets. Bit marking is a variation of the packet marking technique that modifies packet headers at each router. However instead of storing the router information in the packets, bit marking alters one or more bits in the marking field. The bit marking process discussed in this paper is performed to all the packets and at all the routers along the path; hence it is called deterministic bit marking (DBM). DBM creates a common path signature for all the packets originating from the same location upon arriving at a destination. Since different source networks generate virtually unique path signatures, DBM makes it possible to isolate and discard DDoS attack traffic. From the Internet topology of autonomous systems we observe that the source networks are quite uniformly distributed over the path signature space. In our simulation over 99% of the attack traffic is blocked using DBM while up to 99% of the legitimate traffic passes. DBM can also be used for source traceback using reverse bit marking. DBM can be independently deployed for each ISP and the DBM-based networks can be protected from the attacks coming from nonDBM networks.
Yoohwan Kim, Ju-Yeon Jo, Francis L. Merat
GLOBECOM3
2003 High-speed router filter for blocking TCP flooding under DDoS attack
abstract
We present a hardware solution that can reliably block most of the malicious TCP traffic at the edge routers while passing the legitimate TCP traffic during a distributed denial-of-service (DDoS) attack on the Internet. By allocating bandwidths separately for TCP, the TCP portion of the bandwidth can be protected. In a simulation study, the filter successfully blocked 99.9% of the attack traffic while legitimate traffic showed nearly identical performance as in the non-attacked condition. This filtering is transparent to the hosts or routers and a filtering device can be easily attached to router ports.
Yoohwan Kim, Ju-Yeon Jo, H. Jonathan Chao, Francis L. Merat
IPCCC4
2000 Design lessons for building agile manufacturing systems
abstract
Summarizes results of a five-year, multi-disciplinary, university-industry collaborative effort investigating design issues in agile manufacturing. The focus of the project is specifically on light mechanical assembly, with the demand that new assembly tasks be implementable quickly, economically, and effectively. Key to achieving these goals is the ease of equipment and software reuse. Design choices for both hardware and software must strike a balance between the inflexibility of special-purpose designs and the impracticality of overly general designs. We review both our physical and software design choices and make recommendations for the design of agile manufacturing systems.
Wyatt S. Newman, Andy Podgurski, Roger D. Quinn, Francis L. Merat, Michael S. Branicky, Nicholas A. Barendt, Greg C. Causey, Erin L. Haaser, Yoohwan Kim, Jayendran Swaminathan, Virgilio B. Velasco Jr.
IEEE Trans. Robotics Autom.4
1997 A flexible software architecture for agile manufacturing
abstract
The flexibility required of an agile manufacturing system must be achieved largely through computer software. The system's control software must be adaptable to new products and to new system components without becoming unreliable or difficult to maintain. This requires designing the software specifically to facilitate future changes. As part of the Agile Manufacturing Project at Case Western Reserve University, we have developed a software architecture for control of an agile manufacturing workcell, and we have demonstrated its flexibility with rapid changeover and introduction of new products. In this paper, we describe the requirements for agile manufacturing software and how our software architecture addresses them.
Yoohwan Kim, Ju-Yeon Jo, Virgilio B. Velasco Jr., Nicholas A. Barendt, Andy Podgurski, Gultekin Özsoyoglu, Francis L. Merat
ICRA7
1997 Advances in agile manufacturing
abstract
An agile workcell has been developed for light mechanical assembly in collaboration with industrial sponsors. The workcell includes multiple Adept robots, a Bosch conveyor system, multiple flexible parts feeders at each robot's workstation, CCD cameras for parts feeding and hardware registration, and a dual VMEbus control system. Our flexible pairs feeder design uses multiple conveyors to singulate the parts and machine vision to locate them. Specialized hardware is encapsulated on modular grippers and modular worktables which can be quickly interchanged for assembly of different products. Object-oriented software (C++) running under VxWorks, a real-time operating system, is used for workcell control. An agile software architecture was developed for rapid introduction of new assemblies through code re-use. A simulation of the workcell was developed so that controller software could be written and tested off-line, enabling the rapid introduction of new products.
Francis L. Merat, Nicholas A. Barendt, Roger D. Quinn, Greg C. Causey, Wyatt S. Newman, Virgilio B. Velasco Jr., Andy Podgurski, Yoohwan Kim, Gultekin Özsoyoglu, Ju-Yeon Jo
ICRA1
1997 Manufacturing primitive-based object identification using recognition-by-components
abstract
It has been recognized that lead time and costs can be reduced by representing product designs in terms of manufacturing features such as surface finish, accuracy, or machining operations. Usually, a design environment supporting such representations is referred to as a primitive-based CAD system. This paper describes an object recognition system for range images which exploits the primitive-based CAD database information to reduce set up time and accelerate object identification. The heart of our work resides in modeling objects as collections of instantiated machining manufacturing primitives. This permits the implementation of a recognition-by-components approach using surface topology analysis. Thus, the main recognition task is broken down into the less stringent ones of primitive identification and instantiation, followed by the actual object model indexing. The result is faster recognition as well as automatic generation of object models from the CAD output databases.
Leda Villalobos, Francis L. Merat
ICRA2
1996 Design of an agile manufacturing workcell for light mechanical applications
abstract
This paper introduces a design for agile manufacturing workcells intended for light mechanical assembly of products made from similar components (i.e. parts families). We define agile manufacturing as the ability to accomplish rapid changeover from the assembly of one product to the assembly of another product. Rapid hardware changeover is made possible through the use of robots, flexible part feeders, modular grippers and modular assembly hardware. The flexible feeders rely on belt feeding and binary computer vision for Dose estimation. This has a distinct advantage over non-flexible feeding schemes such as bowl feeders which require considerable adjustment to changeover from one part to another. Rapid software changeover is being facilitated by the use of a real-time, object-oriented software environment, modular software, graphical simulations for off-line software development, and an innovative dual VMEbus controller architecture. These agile features permit new products to be introduced with minimal downtime and system reconfiguration.
Roger D. Quinn, Greg C. Causey, Francis L. Merat, David Sargent, Nicholas A. Barendt, Wyatt S. Newman, Virgilio B. Velasco Jr., Andy Podgurski, Ju-Yeon Jo, Leon Sterling, Yoohwan Kim
ICRA3
1995 Learning capability assessment and feature space optimization for higher-order neural networks
abstract
A technique for evaluating the learning capability and optimizing the feature space of a class of higher-order neural networks is presented. It is shown that supervised learning can be posed as an optimization problem in which inequality constraints are used to code the information contained in the training patterns and to specify the degree of accuracy expected from the neural network. The approach establishes: (a) whether the structure of the network can effectively learn the training patterns and, if it can, a connectivity which corresponds to satisfactorily learning; (b) those features which can be suppressed from the definition of the feature space without deteriorating performance; and (c) if the structure is not appropriate for learning the training patterns, the minimum set of patterns which cannot be learned. The technique is tested with two examples and results are discussed.
Leda Villalobos, Francis L. Merat
IEEE Trans. Neural Networks2
1994 3D Modelling and Indexing for CAD-Based Object Recoguition
abstract
A 3D object recognition system for parts designed with a form feature CAD is presented. Objects are modelled as organized compositions of instantiated form primitives. Because of this, the burden of part recognition is shifted from matching the scene to the part database to matching the scene to the primitive database, which is usually a significantly smaller database. In this paper we briefly review our approach to primitive and object representation, the architecture of the system, hypotheses generation, and primitive indexing. Results obtained wish both synthetic and actual range images are presented.>
Leda Villalobos, Francis L. Merat
ICRA2
1987 Generation of object descriptions from range data using feature extraction by demands
abstract
A new method, called feature extraction by demands (FED), for generating an object description concurrently at different feature levels will be described. An object is described in terms of features which include points, surface patches, edges, corners, and surfaces. These features form a feature space which is the base used to decompose the feature extraction process into different levels. FED provides a method to generate partial descriptions about objects from partially processed range data at different feature levels. The partial descriptions become a feed-back to guide the feature extraction process to extract more detailed information from interesting areas which can then be used to refine the object description. Regions which are not perceived to contain useful infomation will be ignored in further processing. As a more complete object description is generated, FED converges from bottom-up image processing to top-down hypotheses verification to generate complete hierarchical object descriptions.
Francis L. Merat, Hsianglung Wu
ICRA1
1987 Introduction to robotics: Mechanics and control
Francis L. Merat
IEEE J. Robotics Autom.1