Submitted by Automa??o e Estat?stica (sst@bczm.ufrn.br) on 2017-03-14T21:32:46Z
No. of bitstreams: 1
PetrucioRicardoTavaresDeMedeiros_DISSERT.pdf: 5937912 bytes, checksum: c98c0e639d8348140e2635081d9744f4 (MD5) / Approved for entry into archive by Arlan Eloi Leite Silva (eloihistoriador@yahoo.com.br) on 2017-03-15T22:29:35Z (GMT) No. of bitstreams: 1
PetrucioRicardoTavaresDeMedeiros_DISSERT.pdf: 5937912 bytes, checksum: c98c0e639d8348140e2635081d9744f4 (MD5) / Made available in DSpace on 2017-03-15T22:29:35Z (GMT). No. of bitstreams: 1
PetrucioRicardoTavaresDeMedeiros_DISSERT.pdf: 5937912 bytes, checksum: c98c0e639d8348140e2635081d9744f4 (MD5)
Previous issue date: 2016-07-20 / Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior (CAPES) / O foveamento ? uma t?cnica de vis?o computacional capaz de promover a redu??o da
informa??o visual atrav?s de uma transforma??o da imagem, em dom?nio espacial, para o
dom?nio de multirresolu??o. Entretanto, esta t?cnica se limita a uma ?nica f?vea com mobilidade
dependente do contexto. Neste trabalho s?o propostas a defini??o e a constru??o
de um modelo multifoveado denominado MMMF (multifoveamento em multirresolu??o
com f?veas m?veis) baseado em um modelo anterior denominado MMF (multirresolu??o
com f?vea m?vel). Em um contexto de m?ltiplas f?veas, a aplica??o de v?rias estruturas
MMF, uma para cada f?vea, resulta em um consider?vel aumento de processamento,
uma vez que h? interse??es entre regi?es de estruturas distintas, as quais s?o processadas
m?ltiplas vezes. Dadas as estruturas de f?veas MMF, propomos um algoritmo para obter
regi?es disjuntas que devem ser processadas, evitando regi?es redundantes e, portanto,
reduzindo o tempo de processamento. Experimentos s?o propostos para validar o modelo
e verificar a sua aplicabilidade no contexto de vis?o computacional. Resultados demonstram
o ganho em termos de tempo de processamento do modelo proposto em rela??o ao
uso de m?ltiplas f?veas do modelo MMF. / Foveation is a computer vision technique for visual information reduction obtained
by applying an image transformation in the spatial domain to the multiresolution domain.
However, this technique is limited to a single fovea context-dependent mobility.
This work proposes the definition and the construction of a multifoveated model called
MMMF (Multiresolution Multifoveation using Mobile Foveae) based on an earlier model
called MMF (Multiresolution with Moving Fovea). In the context of multiple foveae, the
application of various MMF structures, one for each fovea, results in an increase in processing
time, since there are intersections between regions of different structures, which
are processed multiple times. Given MMF structures, an algorithm in order to get disjoint
regions which are to be processed is proposed, avoiding redundant regions and thereby
reducing the processing time. Experiments are proposed to validate the model and to verify
its applicability in the computer vision context. Results show the gain in processing
time of the proposed model compared to the use of multiple MMF structures.
| Identifer | oai:union.ndltd.org:IBICT/oai:repositorio.ufrn.br:123456789/22258 |
| Date | 20 July 2016 |
| Creators | Medeiros, Petr?cio Ricardo Tavares de |
| Contributors | 05155222443, http://lattes.cnpq.br/5849107545126304, Souza, Anderson Abner de Santana, 03711245498, http://lattes.cnpq.br/2563070123322776, Carvalho, Bruno Motta de, 79228860472, http://lattes.cnpq.br/0330924133337698, Oliveira, Roberto Teodoro Gurgel de, 05539963474, http://lattes.cnpq.br/1630345401925661, Gon?alves, Luiz Marcos Garcia, Gomes, Rafael Beserra |
| Publisher | PROGRAMA DE P?S-GRADUA??O EM ENGENHARIA EL?TRICA E DE COMPUTA??O, UFRN, Brasil |
| Source Sets | IBICT Brazilian ETDs |
| Language | Portuguese |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, info:eu-repo/semantics/masterThesis |
| Source | reponame:Repositório Institucional da UFRN, instname:Universidade Federal do Rio Grande do Norte, instacron:UFRN |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0022 seconds