Efficient incremental computation of attributes based on locally countable patterns in component trees (2016)
- Authors:
- Autor USP: HASHIMOTO, RONALDO FUMIO - IME
- Unidade: IME
- DOI: 10.1109/icip.2016.7533058
- Subjects: PROCESSAMENTO DE IMAGENS; ALGORITMOS PARA IMAGENS; ANÁLISE DE ALGORITMOS
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Piscataway
- Date published: 2016
- Source:
- Título: Proceedings
- ISSN: 2381-8549
- Conference titles: IEEE International Conference on Image Processing - ICIP
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
SILVA, Dennis José da et al. Efficient incremental computation of attributes based on locally countable patterns in component trees. 2016, Anais.. Piscataway: IEEE, 2016. Disponível em: https://doi.org/10.1109/icip.2016.7533058. Acesso em: 11 fev. 2026. -
APA
Silva, D. J. da, Alves, W. A. L., Morimitsu, A., & Hashimoto, R. F. (2016). Efficient incremental computation of attributes based on locally countable patterns in component trees. In Proceedings. Piscataway: IEEE. doi:10.1109/icip.2016.7533058 -
NLM
Silva DJ da, Alves WAL, Morimitsu A, Hashimoto RF. Efficient incremental computation of attributes based on locally countable patterns in component trees [Internet]. Proceedings. 2016 ;[citado 2026 fev. 11 ] Available from: https://doi.org/10.1109/icip.2016.7533058 -
Vancouver
Silva DJ da, Alves WAL, Morimitsu A, Hashimoto RF. Efficient incremental computation of attributes based on locally countable patterns in component trees [Internet]. Proceedings. 2016 ;[citado 2026 fev. 11 ] Available from: https://doi.org/10.1109/icip.2016.7533058 - Pattern recognition based on straight line segments
- Growing seed genes from time series data and thresholded Boolean networks with perturbation
- Segmentation of retinal blood vessels based on ultimate elongation opening
- A Monte Carlo approach to measure the robustness of Boolean networks
- A new training algorithm for pattern recognition technique based on straight line segments
- An approach to growth delimitation of straight line segment classifiers based on a minimum bounding box
- Is cross-validation better than resubstitution for ranking genes?
- Inference of restricted stochastic Boolean GRN' s by Bayesian error and entropy based criteria
- Growing genetic regulatory networks from seed genes
- Circuitos e caminhos pares/impares em grafos e digrafos - algoritmo e complexidade computacional
Informações sobre o DOI: 10.1109/icip.2016.7533058 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
