Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Naima Kaabouch

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ronald A. Fevig

> Home > Persons > Naima Kaabouch

Publications

2014
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/ccsecis/GhoshKF14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ccsecis/GhoshKF14
Debabrata Ghosh, Naima Kaabouch, Ronald A. Fevig:
Robust Spatial-Domain Based Super-Resolution Mosaicing of CubeSat Video Frames: Algorithm and Evaluation. Comput. Inf. Sci. 7(2): 68-81 (2014)
2012
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/ei-iriacv/ParkGKFS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ei-iriacv/ParkGKFS12
Sangho Park, Debabrata Ghosh, Naima Kaabouch, Ronald A. Fevig, William Semke:
Hierarchical multi-level image mosaicing for autonomous navigation of UAV. Intelligent Robots and Computer Vision: Algorithms and Techniques 2012: 830116
[c10]
- view
  authority control:
- export record
  dblp key:
  - conf/itaero/ParkKFS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itaero/ParkKFS12
Sangho Park, Naima Kaabouch, Ronald A. Fevig, William Semke:
Scene Classification and Landmark Spotting in Multilayer Image Mosaic for UAVs in GPS-denied Situations. Infotech@Aerospace 2012

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.